Reproduced bounded computational finding

FPRD-T149

The sampled raw digit and carry blocks were maximally diverse at tested scales

Exact statement

Across the states Tk(196)T^k(196), 0≤k<4,0000\le k<4{,}000, every within-state decimal digit block through length 44 and every incoming-carry block through length 1212 occurs. The pinned replay gives carry-in density 0.4993661031130.499366103113, mirrored-digit mutual information 0.5635914756330.563591475633 bits, and mirrored carry-in mutual information 0.0000137957140.000013795714 bits.

StatusExact finite window and estimators independently replayed
External reviewNo documented external or specialist review of this FPRD result is recorded.

Context

Raw block diversity was used to test whether a low-complexity substitution hierarchy was visible in the sampled orbit.

Proof or evidence

The published certificate pins a 4,000-state window, excludes row-crossing subwords, uses least-significant-first incoming carries, and is reproduced exactly by integer and digit-list implementations.

Verification notes

The source's carry density 0.5009 came from an unspecified later window and was not silently treated as reproduced. The public claim now uses the independently pinned window's 0.499366103113 value; the qualitative saturation and mutual-information observations agree.

Limitations

  • Maximum observed p(k) for finitely many k is compatible with later structure.
  • Random-like summary statistics do not prove anti-concentration on one deterministic infinite orbit.

Open work

Add explicit control sequences under the same estimators before making comparative complexity claims.