Digit / CONCEPT
A Twenty-State Finite-Prefix Barrier
An explicit twenty-state table fits all original power indices below 367 and first fails at 367. Dictionaries confined to that prefix cannot refute every twenty-state candidate.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH7
DOCUMENT LINKS1
correct_before_367
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Arithmetic Inputs in the Base Languagestructural-affinity · Closed
- Canonical Input Transport for the Golden Base-Four Machinestructural-affinity · Closed
- Golden-Ratio DFAO Minimality Targetsstructural-affinity · Closed
- Literal Zeckendorf deletionstructural-affinity · Closed
- Published Golden Base-Four Block Sample 79structural-affinity · Closed
- Quaternary response-table coding and the golden power inputstructural-affinity · Closed
- Short Common Canonical Fibonacci Probesstructural-affinity · Closed
- The Base-Four Golden-Ratio Automata Oraclestructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance