Research · Papers · The SHA-256 record and exact synthesis · ML-037
A conditional arithmetic total of 17,841 for JSC-11
q = A(z)B(z), 15,921 + 2*960 = 17,841
Published 2026-08-29
For everyone
Plain summary
ML-037 outlines a proposed fix for the JSC-11 case. The design links two steps: the first creates a new intermediate value, written q = A(z)B(z), and the second reads it. If this construction can be built and verified, its arithmetic total is 15,921 + 2*960 = 17,841. Reading this fresh value moves the design outside the flat coordinate class that ML-031 ruled out; without the read, it falls back into that closed class. The entry lacks the adapter for SHA-256, the distinguishing condition, the fibre proof, replay, recount, and Lean proof artifacts. A later receipt adds a strict-canonical mechanism and a toy escape example, but the SHA-256 instance remains UNKNOWN. The register records no prior-art comparison or novelty claim.
Result
In the JSC-11 CSL-2 setting, the register records a conjectured synthesis route where a creator row computes
q = A(z)B(z)
and a consumer row reads the fresh value q. This read evades the flat class closed by ML-031; omitting it collapses the system back into that dead class. The associated conditional arithmetic is
15,921 + 2*960 = 17,841.
The arithmetic total is recorded, but the entry lacks the degree-three cubic adapter, SHA separator, fibre proof across fixed-input slices, replay, recount, and Lean verification artifacts. Although a subsequent receipt adds a strict-canonical mechanism and a named H₂-escape toy, the SHA fresh-q instance remains UNKNOWN. The 17,841 figure remains strictly conditional.
Setting and definitions
JSC-11 and CSL-2 designate the repair setting in the register. The creator row evaluates q = A(z)B(z), where A, B, and z remain unelaborated. The consumer row reads this fresh q.
The flat class comprises systems affine solely in the 41 existing coordinates; ML-031 established that this class contains no valid witness. A cubic adapter is the degree-three implementation layer required for the proposed repair. A fibre proof is the verification argument across the relevant fixed-input slices.
Method
The record rests on two verification reports. An initial verification report documents the creator-consumer structure, the distinction from ML-031, the 15,921 + 2*960 = 17,841 arithmetic, and the missing implementation and proof artifacts.
A later verification report adds a strict-canonical mechanism and a named H₂-escape toy, while keeping the SHA fresh-q instance at UNKNOWN. It preserves the 17,841 total and explicitly bars substituting 19,761. Neither report provides replay checks, recounts, or Lean verification for the target SHA instance.
Discussion
ML-037 stands as a CONJECTURE in exact synthesis methods. Its primary value is structural: reading a fresh intermediate value bypasses the flat-class impossibility result of ML-031. However, the proposal does not supply the cubic adapter or establish that the adapter separates valid from invalid SHA instances.
MF-061 provides supporting mechanism evidence via a strict-canonical construction and an H₂-escape toy, but leaves the SHA instance unresolved. The conditional count remains fixed at 17,841, with receipt instructions explicitly rejecting 19,761. The curation ledger records no corrections, novelty claims, or prior-art comparisons.
For everyone — the takeaway
What this means
ML-037 proposes a specific cost estimate for fixing JSC-11. Generating and reading a fresh intermediate value lets the circuit pass information that the older flat layout could not handle. The math is simple: 15,921 base operations plus two 960-unit steps give 17,841. The missing files are the concrete pieces needed to prove the concept on SHA-256: the adapter, the distinguishing condition, the mathematical proofs, and the machine-checked certificates. A toy model shows the mechanism works at small scale, but the full SHA-256 target remains unverified.
Register references
- ML-037
- CONT lens_l3b_verification_report.md
- CONT lens_r2a_catalyst_verification_report.md
- Named register entry: MF-061
- Prior art: the register does not record a prior-art work.
Every artifact named above is bundled in, or hashed by, this paper's evidence pack below.
Evidence pack
Everything needed to check this entry against its receipts: the register text, a manifest with a SHA-256 hash for every named receipt, and 2 of 2 receipt files bundled (9 KB). Anything not bundled is still hashed in the manifest and lives in the compute-box working trees.
Changelog
Last reviewed 2026-08-29
- 2026-08-29Published on this site.