Commit graph

4 commits

Author SHA1 Message Date
openresearch
5c01ec43ea docs: sofa × HN — combined stress test framing
The key insight: standalone they are insanely hard, together they
either melt the model or reveal structure. This is better than 3-SAT
because both components are unsolved — any result is novel.

Combined: sofa navigates corridor (continuous) AND at each step,
occupied positions form a valid unit-distance coloring (discrete).
This is the matter→light move at its deepest.
2026-07-03 23:46:25 +00:00
openresearch
4c47fe4e43 docs: moving sofa × Hadwiger-Nelson as next octagon test case
Two unsolved geometric problems as a combined octagon test:

1. Moving Sofa (Moser 1966): max-area shape navigating L-corridor.
   Unsolved. Best: Gerver 2.2195. Upper: 2.8284.
   Reformulated as: corridor graph + admissible subsets = coloring.

2. Hadwiger-Nelson (1950): chromatic number of the plane.
   Unsolved. Known: 5 ≤ χ(ℝ²) ≤ 7. de Grey (2018): 5-chromatic graph.
   Already has spectral structure: Hoffman bound χ ≥ λ_max + 1.

The connection: both are geometric constraint satisfaction.
- Sofa: which shapes satisfy the corridor constraint?
- HN: which colorings satisfy the unit-distance constraint?
- Reformulation: sofa = corridor coloring, HN = plane coloring.

Pipeline connection: COUCH gate in GCCL.lean already references this.
'Apartment constraint' = sofa-in-corridor. FYC gate = rejects
impossible traversal = rejects shapes that can't make the turn.

Experiment:
1. Discretize corridor → graph → adjacency matrix → spectrum
2. Test known sofa shapes (Gerver, Hammersley) for spectral
   distinguishability
3. Build de Grey's 5-chromatic graph → compute Hoffman bound
4. Is the bound tight (λ_max+1=5)? Or loose?

Priority: BETTER than 3-SAT because the sofa is unsolved (spectral
shortcut = real result) and HN already has spectral structure
(measure how tight). Different problem class (geometric optimization)
from previous tests (combinatorial, number-theoretic, structural).

Effort: 6-12 hours Python+numpy, no GPU needed.
2026-07-03 23:36:29 +00:00
openresearch
5c5c6f94b6 docs: record prime-Sidon honest negative (0/35 after Bonferroni)
Claude Code completed the prime-Sidon spectral detection test:
- 35 test cases
- 0/35 significant after Bonferroni correction
- Adversarial review caught a tautology in original methodology
- Null hypothesis properly added
- Negative finding is properly bounded

ENE database: session prime-sidon-negative-001 (promoted)
GitHub: commit a0d95049

This is a third measured data point for the octagon:
- Sidon sets: YES (4/4)
- Graph coloring: YES (Hoffman)
- Prime distribution: NO (0/35) ← NEW
- Graph isomorphism: NO (cospectral)
- Text: NO (3.088 b/B)

The octagon is NOT universal. It works for some problems and
fails for others. The research question: what determines which
problems have spectral signatures?
2026-07-03 23:29:46 +00:00
openresearch
e4cb242619 docs: create living targets folder for rapidly evolving goals
New folder: docs/living/ — for goals that change daily, not stable
findings (those stay in docs/research/).

Documents:
- README.md: rules for living docs (overwrite freely, one sentence
  per target, link to findings, honesty tag)
- TARGETS.md: 5 active targets (invariant geometry, reaction primes,
  merged O(1), formal cleanup, encoder fidelity) + 3 dead + 3 candidate
- PROJECT_MAP.md: what SilverSight IS right now (not what it was)
- MILESTONES.md: 5 near-term milestones with success criteria
  (3-SAT spectral test, cmix SVD, SLOS eigenvalue products,
   CRT hachimoji pairing, reaction prime proof)
- OPEN_QUESTIONS.md: 8 unanswered questions
- DIRECTION_LOG.md: 5 direction changes from this session, with
  the reason for each

Living docs rules:
- No measurement required (goals, not findings)
- Overwrite freely (git history preserves old versions)
- One sentence per target
- Link to docs/research/ for backing evidence
- Honesty tag: MEASURED / OPEN / SPECULATIVE
2026-07-03 22:13:45 +00:00