Theorem
A structural-gap family of order X / sqrt(log X)
Read with:
Every public research record, readable here. Search as you type.
The library is hosted here. Every public research note below is readable on this site as HTML. The repository remains canonical. The Erdős–Straus conjecture remains open. Novelty and priority stay under review.
There are 213 research records and 27 hosted manuals. Type in the field to see native suggestions. No JavaScript is used.
Theorem
Read with:
Theorem
---
Ancestry
Read with:
Ancestry
Read with:
Synthesis
This note freezes the first successful automated run of the CENTL Erdős-Straus research harness. It records finite computational results only and must be read with the claim boundaries in PRIOR-ART.md and THEORY.md.
Synthesis
Also B-BervigES.kernel. Python reference stack for 4/n = 1/x + 1/y + 1/z.
Theorem
---
Geometry
---
Theorem
Let
Theorem
Let p == 1 (mod 4) be prime and let r == 3 (mod 4) be an odd positive integer such that
Shadow
Read with:
Shadow
See C1-THEOREM.md for the assembled escape theorems including thinness, program-range closure for j ≤ 1500, and small-φ certificates.
Shadow
Read with:
Shadow
---
Shadow
---
Shadow
Fix a directly novel Type A/B candidate
Shadow
---
Shadow
This note sharpens FIBER-SHADOW-KERNEL.md by removing the candidate dependence from the fiber-width estimate. The key observation is that the affine pullback from a Type A/B trap set to the parameter line preserves CRT fiber…
Synthesis
Fast hard-prime engine for the Erdős–Straus residual.
Theorem
This note strengthens QUADRATIC-TRAP-SIGNATURE.md and supersedes the possibility of a genuinely collective obstruction inside the quadratic character shield itself.
Certificate
Read with:
Shadow
Read with:
Geometry
Read with:
Geometry
Read with:
Shadow
---
Certificate
- ratio-lemma checks: 10071, fails=0, minratio=2 - standard pairs checked: 980238, fails=0, c1=0, kinds={'coprime': 949242, 'same-q-tight': 2254, 'lift-room': 27210, 'mixed-tight': 1532} - q3 complete: pairs=37, checked=124, fails=124,…
Certificate
python3 research/erdos-straus/cnsharedanalyzer.py \ --out /tmp/cn-shared-output --j-limit 160 --k-limit 1500 --program-k-limit 200 python3 research/erdos-straus/verifycnshared.py \ --out /tmp/cn-shared-output --j-limit 120 --k-limit 180
Shadow
Read with:
Shadow
Read with COSET-SOURCE-SEMIGROUP-SHADOW.md and STRUCTURAL-GAP-ASYMPTOTIC.md.
Theorem
Read with:
Ancestry
Read with:
Theorem
---
Theorem
---
Theorem
---
Theorem
Write a Mordell-hard prime as
Shadow
Verifier:
Synthesis
Completed GitHub Actions run:
Corridor
Let p be a Mordell-hard prime:
Corridor
Let p be a prime with
Theorem
Take the Mordell-hard prime
Theorem
Read with:
Theorem
Read with:
Cryptology
This note records arithmetic controls that must be applied before interpreting any Type A/B fingerprint as a nontrivial cryptologic signal. It also formalizes the threshold-shadow mechanism exposed by the high-versus-low CAB experiment.
Cryptology
This note records a cryptology-facing research program arising from WS-CAND-003. It does not claim a break of RSA, discrete logarithm systems, elliptic-curve cryptography, post-quantum cryptography, or any deployed cryptosystem.
Corridor
---
Corridor
Write
Synthesis
---
Corridor
---
Shadow
This record extends the candidatewise falsification attack from k <= 600 to k <= 1000.
Shadow
This record extends the candidatewise falsification attack through k=1200 and freezes the first full automated prime-power coordinate-core diagnostic.
Shadow
This record supersedes DIRECT-SHADOW-K1200.md as the latest fully frozen all-stage candidatewise certificate frontier.
Shadow
Read with:
Shadow
This record follows the synthesis in DIAMOND.md and attacks its strongest immediate structural conjecture at the individual candidate-class level, not merely at the layer level.
Shadow
Fix a candidate progression
Ancestry
Read with:
Shadow
---
Corridor
---
Prior art
---
Synthesis
GitHub Actions workflow:
Geometry
Read with:
Synthesis
This directory operationalizes the research program recorded in docs/wellsprings/WS-CAND-003-erdos-straus-type-ab-shadow-structure.md.
Synthesis
Status: OPEN
Corridor
---
Corridor
---
Corridor
Let p be an odd prime. If 4p+1 has a divisor
Corridor
Let p be an odd positive integer. Suppose q is a positive divisor of
Theorem
---
Ancestry
Read with:
Shadow
Read with:
Geometry
---
Corridor
Let p be a Mordell-hard prime. Then
Corridor
---
Corridor
---
Corridor
---
Corridor
---
Corridor
---
Theorem
Let p be a Mordell-hard prime. Then
Theorem
For an admissible target candidate write
Theorem
Let
Theorem
---
Corridor
---
Corridor
---
Theorem
---
Geometry
---
Theorem
---
Theorem
---
Theorem
---
Certificate
---
Theorem
---
Shadow
This strengthens the prime-power peeling lemma in SHADOW-KERNEL.md. The earlier load used the full size |Rj| of a forbidden pullback set against every prime coordinate dividing its modulus. That is deliberately coarse. Once the other…
Finding
Read START-HERE.md first.
Finding
This folder is written by the hunt. You do not need to know Python.
Corridor
---
Certificate
---
Corridor
Let p be a Mordell-hard prime:
Corridor
---
Corridor
Let p be a prime with
Corridor
Let
Shadow
Read with:
Geometry
The Jacobi character records only one bit from a composite modulus. This note keeps the complete vector of local Legendre signs at the distinct prime factors of mk=4k-1 and shows that the Type A/B trap signatures form one exact affine…
Geometry
Read with:
Geometry
This record continues:
Corridor
---
Corridor
Let p≡1 mod4 be prime and suppose coprime positive a,b give a fab certificate with divisor k:
Ancestry
The previous version claimed that for an odd prime s, with
Geometry
Read with:
Shadow
Read with:
Finding
A finding is refused if it claims three denominators that fail
Finding
Each hunt has its own cursor. current.json is the default hunt (main). Sibling hunts live beside it as h-<start>.json or w-<pid>.json. Starting --from or --random creates or resumes a sibling. It does not overwrite current.json.
Theorem
Read with:
Ancestry
---
Theorem
---
Corridor
---
Theorem
---
Geometry
Read with:
Geometry
This note connects:
Corridor
---
Theorem
Read with:
Geometry
Read with:
Shadow
Read with:
Geometry
Read with:
Geometry
Read with:
Geometry
---
Corridor
---
Ancestry
Read with:
Ancestry
Read with:
Synthesis
Completed GitHub Actions run:
Ancestry
Read with PRIME-DEPTH-DICHOTOMY.md and PRIME-MODULUS-BACKBONE.md.
Geometry
---
Corridor
---
Geometry
---
Geometry
---
Ancestry
Let
Shadow
This note develops the prime-power kernel hinted at by ODD-COVERING-BRIDGE.md and the candidatewise results in DIRECT-SHADOW-K1000.md.
Corridor
---
Shadow
Read with MERSENNE-SHADOW-LATTICE.md and MULTIPLICATIVE-TRAP-COSET.md.
Corridor
---
Theorem
---
Prior art
Primary sources checked:
Prior art
---
Prior art
This file records the targeted primary-literature pass used to calibrate claims around CAB, exact trap cardinality, congruence-layer shadowing, the depth-spectrum / survival-process framework, and the later character,…
Theorem
CC.kernel is the theorem/attack provider. It may only set strike: true when a universal certificate is deposited here.
Geometry
Read with:
Prior art
---
Synthesis
---
Geometry
---
Shadow
---
Theorem
---
Theorem
---
Theorem
---
Theorem
---
Theorem
---
Geometry
This note refines QUADRATIC-TRAP-SIGNATURE.md. It explains exactly when the quadratic character shield can fail and turns each failure into a finite squareclass-cycle certificate.
Geometry
This note records a structural invariant discovered while trying to explain why the Type A/B shadow-cover systems overlap so strongly.
Prior art
The quadratic-character branch must be stated carefully.
Geometry
Read with:
Theorem
Read with:
Geometry
---
Ancestry
Read with:
Ancestry
Read with:
Ancestry
Read with:
Ancestry
Read with:
Ancestry
Read with:
Geometry
Read with:
Synthesis
GitHub Actions workflow:
Geometry
Read with:
Theorem
---
Corridor
---
Wellspring
This expedition inspected CENTL's numerical contract, verified rendering core, MIRAGE admissibility loop, CARAVAN authority split, and the Oasis/Wellspring separation.
Shadow
Read with:
Shadow
This note follows DIRECT-SHADOW-COMPLETENESS.md. The candidatewise run established that all 19,016 directly novel hard-compatible candidates through k=600 have reduced avoiding progressions. The question here is why that happens.
Theorem
---
Corridor
---
Shadow
Read with:
Shadow
Read with:
Shadow
Read with:
Theorem
This note continues the reduction developed in SHADOW-KERNEL.md and FIBER-SHADOW-KERNEL.md.
Geometry
---
Geometry
---
Geometry
---
Geometry
Read with:
Geometry
Read with:
Geometry
Read with:
Geometry
Read with:
Geometry
---
Geometry
---
Geometry
Read with:
Geometry
---
Geometry
---
Theorem
For each layer
Synthesis
This document records the point at which the FCF/CENTL Erdős-Straus work stopped being a collection of computational observations and became a coherent theorem program.
Theorem
For a prime p, define
Theorem
Read with:
Geometry
Read with:
Theorem
---
Corridor
---
Synthesis
This note separates proved elementary structure from computational conjecture targets for WS-CAND-003.
Theorem
This note connects the FCF/CENTL shadow program to classical covering-system theory.
Ancestry
Read with:
Corridor
---
Corridor
---
Theorem
---
Theorem
---
Certificate
---
Shadow
Read with:
Shadow
Read with:
Geometry
Read with:
Wellspring
A reusable computational principle: a producer of bytes, prose, or proposals never becomes authority over mathematical meaning, artifact identity, or assurance.
Wellspring
After the verified core accepts dyadic enclosure endpoints and an exponent budget, outward conversion onto a shared decimal scale is a proved containment. Printed digits are therefore justified by the enclosure rather than by host…
Cryptology
The cryptology track now contains three progressively stricter probes.
Wellspring
This record documents a potentially new structural lens on the Type A/B congruence system used in work on the Erdős-Straus conjecture. It does not claim a proof of the Erdős-Straus conjecture, a new global computational verification…
Theorem
Read with:
Corridor
---
Software manuals live in the documentation index. They are also hosted on this site: