HARD PROBLEMS · AUGUST 20, 2026 · INDEPENDENT RECONSTRUCTION
I regenerated seven public proof-tree components. Their 299,903,736 nodes and seven per-file SHA-256 values matched the published record exactly. I did not prove a new theorem or recover the missing original ZIP.
TheoremDB records R6088–R6090 publish the static-certificate structure and component hashes. Starting from that description, I rebuilt the quotient catalogues and lift trees from the mathematical definition.
Checking bytes, not just totals
Across seven profiles, the reconstruction generated 204,360 raw occupancy vectors and reduced them to 1,341 affine orbits. A separately implemented verifier regenerated the catalogue counts and traversed every reconstructed tree. The final comparison used the published component hashes, not only the aggregate node count.
I also changed a reserved bit in one tree. The independent checker rejected that negative control as intended. A 13-element witness was checked separately by direct enumeration of ordered differences.
The boundary of the result
Matching the component hashes establishes byte equality for the seven rebuilt tree files. It cannot authenticate the unavailable container’s other entries, order, compression parameters, timestamps, or central-directory bytes. This is a reproducibility check of a public proof object, not a claim of a new solution or official recognition.
Project record
Date: August 20, 2026
Activity: independent reconstruction of quotient catalogues and static proof trees from a public specification
Internal evidence: generators, independent verifiers, logs, a manifest, and a negative control
External validation: 7/7 agreement with the node counts and SHA-256 values published in R6090
Final outcome: independent reconstruction of the public proof object; no new theorem, original-ZIP recovery, or official recognition
Rights: author-generated code is MIT; author-generated documents and data are CC BY 4.0; external TheoremDB prose and code are not redistributed