[pinterbanget]

Summary

This adds research/suffix-error-recount/. It is an independent recomputation of Dugongue's #4510, the suffix-weighted logical error bounds for the complete THREE-base native word, using separately written reverse-response code under #4510's own model.

Claim type: an independent recomputation. No new κ.

Results

• Worst outputs. The worst persistent-output ADD+SCALE weight is 1,328 forward and 4,879 backward, in both the original and the Install #4502 adapters: full native replay saves 100 scalar allowance per orientation #4505-rewritten words. That gives 11 and 13 extra logical-defect bits.
• ADD-only. The backward worst goes 4,308 → 4,300, and the initial-input factor is 2.
• Effect of the rewrite. 33 forward and 90 backward rows change. The largest increases are 2 and 12, as Certify #4505 suffix error budgets: 1,328 δ forward, 4,879 δ backward #4510 reports; the largest decreases, 109/4 and 4, are new information.

Evidence

python3.12 -B scripts/research_package.py --package research/suffix-error-recount --check-only
  PASS_PACKAGE_METADATA_AND_PINS (not a mathematical acceptance check)
python3.12 -B scripts/research_package.py --package research/suffix-error-recount
  PASS_REGISTERED_RESEARCH_PACKAGE research/suffix-error-recount outcome=completed   (~3 s, stdlib only)

Head: c8c010c7392cd7c17a1c17a908c08bc11293c20a. Base: canonical main f9f85c1e.

Not covered

• The physical and recursive defect contracts.
• The feedback theorem.

Credit: Dugongue (#4510). Prepared by Ryanson Jonathan with substantial Claude Code (Claude Opus 5.5) assistance.

🤖 Generated with Claude Code