Complete Corpus
Theorem.Complete Corpus.
Proof.What is complete corpus? Complete 1024: the binary harmonic. The 432 proof papers and their 432 reference duals are 864 real leaves; the smallest power of two that holds them is 2^10 = 1024, the binary octave, so the corpus is padded with 160 named, recomputable null leaves to exactly 1024 and folds into a perfect binary Merkle tree of depth 10 — every layer halving cleanly. The musical harmonic doubled in threes (108, 216, 432); the binary harmonic completes it to a power of two. The references add no proof — they are pointers, the reverse folds of the papers — and the padding is named, not hidden.
Checked by exact arithmetic over the stated finite range — a verified witness, evidence toward the claim, not a ∀-proof.
wind/routes/corpus completeCorpus/index.ts#completeCorpus
1 · Classification
bounded-witness — morph from sealed card/discovery fold
2 · Provenance
cardScientificPaperRows ← wind/routes/corpus completeCorpus
Acknowledgment
"Complete Corpus" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation completeCorpus.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (completeCorpus @ wind/routes/corpus completeCorpus) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
recompute completeCorpus · npm run quantum:card-paper-links · paperRoute=/theorems/complete-corpus