Exact evaluation, minimum circuits and correction width for finite Fold words
Exact native Fold evaluation, tight circuit resources and minimum correction width, with complete mathematical proofs. Maria Smith derives BB_F(k)=k, unique accepted evaluation certificates and native P_F=NP_F, tight lawful circuit depth k, width 2^k and layered size 2^(k+1)-2. For every positive finite fault order t, width 2t+1 corrects every allowed mask and every shorter width has a constructive failure. Includes exact circuit composition, four complete 256-candidate classifications, 444 empty-axiom audited declarations, pinned V3/V4 source and portable reproduction. Correspondence: [email protected]. SFT community and invitation: https://discord.gg/QCNkzq6kZC.
Authors
- Maria Smith
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.5281/zenodo.24341295
- Primary Topic
- Coding theory and cryptography
- Type
- preprint