e4cb242619
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
3.8 KiB
Current Research Targets
Last updated: 2026-07-03 Changes daily. Old versions in git history.
Active Targets
1. Invariant Computation Geometry [OPEN]
Goal: Determine which NP properties have polynomial-size spectral invariant embeddings (the octagon question at O(n) dimension).
Status: One measured success (Sidon 4/4), one known failure (cospectral graphs on Hamiltonicity), one proven existence at O(n²) (Etesami-Haemers 2019). The O(n) question is open.
Links:
2. Reaction Prime Decomposition [SPECULATIVE]
Goal: Define irreducible DNA computational operations (reaction primes) and determine if every computation factors uniquely.
Status: Framework proposed (reaction algebra, information primes, category theory). No measurements yet. Connects to the conservation law (prime total ≥ K(data)) and the pipeline (each stage = one prime decomposition step).
Links:
3. Merged O(1) Transform [SPECULATIVE]
Goal: Determine if DNA hybridization can simultaneously search, reconstruct (CRT), and verify (energy) in one physical step.
Status: Framework documented. The wall is O(n) readout (conservation law). The decision-problem shortcut (1-bit answer = O(1) readout) is the most promising path. Needs: design CRT-coprime hachimoji pairing rules, simulate energy landscape, measure gap vs n.
Links:
4. Formal Verification Cleanup [MEASURED]
Goal: Close all remaining sorries and remove all native_decide from the active build.
Status: 10 active sorries (all tagged CITED/CONJECTURE, all genuinely blocked on Mathlib API). 21 axioms (all justified). Anti-smuggle scanner passes. 84 modules registered in lakefile.
Links:
- AGENTS.md — current status table
5. Encoder Fidelity [MEASURED]
Goal: Maintain 20/20 injective DNA encoding with exact arithmetic (no floats) across all input types.
Status: 20/20 injective (p-adic + neg-pi). BioSight embed.py updated to v3 (exact arithmetic). Universal pipeline 14/14 PASS. Round-trip lossless on all text types including LaTeX/CJK/emoji.
Links:
Dead Targets (measured, not pursuing)
Compression via spectral methods [DEAD]
Result: Conservation law forbids it. 8 branches measured, all fail. Polynomial = receipt, not compressor. xz beats everything.
16D braid / golden spiral GW compression [DEAD]
Result: 583x was zero-noise artifact. 1.5x at 30dB (ties LPC). 16D adds nothing over 50-year-old LPC.
Braille/T9 text compression [DEAD]
Result: 4.167 b/B, worse than order-2 PPM (3.088), far behind xz (1.989). 64-cell alphabet too small for 256 bytes.
Candidate Targets (not yet committed)
6. cmix Weight Matrix SVD [OPEN]
Goal: Extract the 23×461 weight matrix from cmix, compute SVD, determine if the top-k singular values capture most compression quality. If yes, search the low-rank subspace for better configs.
7. 3-SAT Spectral Embedding [OPEN]
Goal: Build a clause-incidence matrix for 3-SAT, compute its spectrum, check if satisfiability is spectrally detectable. This is the P vs NP experimental program's first NP-complete test case.
8. Quandela SLOS Shortcut [OPEN]
Goal: For linear optical circuits, replace full SLOS (O(n × M_n)) with eigenvalue product computation (O(n^m)). Only works for linear systems. Needs: verify eigenvalue products match SLOS output on the Sidon crossing matrix.