mirror of
https://github.com/allaunthefox/SilverSight.git
synced 2026-07-31 01:25:21 +00:00
5c5c6f94b6
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?
113 lines
4.5 KiB
Markdown
113 lines
4.5 KiB
Markdown
# Direction Log — Why the Direction Changed
|
|
|
|
**Purpose:** Record when and why the project's direction shifted.
|
|
Each entry is a decision point, not a finding.
|
|
|
|
## 2026-07-03: Compression → Invariant Geometry
|
|
|
|
**Was:** Build a spectral compressor (polynomial/Braille/T9/16D)
|
|
that beats xz on enwik8 and LPC on signals.
|
|
|
|
**Changed to:** Stop compression. The conservation law (measured 8
|
|
times) forbids it. Pivot to computation shortcuts via the octagon
|
|
principle (embed nonlinear in linear, detect via spectrum).
|
|
|
|
**Why:** Claude Code's conservation-law demo proved k=3 total
|
|
(557,169B) > xz (35,492B). The model column eats the savings.
|
|
No decomposition beats K(data). The polynomial is a receipt, not
|
|
a compressor. Every branch measured the same wall.
|
|
|
|
**What survived:** The conservation law itself (as a pruning
|
|
criterion), the octagon embedding (Sidon 4/4), and the formal
|
|
verification framework (anti-smuggle scanner, GCCL, 20 bugs fixed).
|
|
|
|
## 2026-07-03: 16D Braid → LPC (承认 defeat)
|
|
|
|
**Was:** The 16D braid / golden spiral compresses GW ringdown 583x.
|
|
|
|
**Changed to:** 16D = LPC in a costume. The 583x was a zero-noise
|
|
artifact. At 30dB SNR (realistic), the ratio is 1.5x — tying or
|
|
losing to standard LPC.
|
|
|
|
**Why:** Claude Code's SNR sweep measured the parametric model vs
|
|
LPC across noise levels. Clean signal: 111x. Realistic: 1.5x.
|
|
The residual IS the noise, and noise is incompressible.
|
|
|
|
## 2026-07-03: Universal Shortcut → Problem-Specific
|
|
|
|
**Was:** ManifoldShortcut finds the Kolmogorov-optimal equation
|
|
for any problem.
|
|
|
|
**Changed to:** ManifoldShortcut has ONE universal component
|
|
(Shannon-entropy pruning). Everything else is problem-specific.
|
|
K(data) is uncomputable; can't claim K-optimal.
|
|
|
|
**Why:** 5-way attack: K uncomputable (attack 1), alpha/beta free
|
|
params (attack 2), RIP wrong for combinatorial (attack 3),
|
|
AngrySphinx is timeout not accelerator (attack 4), coherence is
|
|
linear only (attack 5).
|
|
|
|
## 2026-07-03: Weird Machine → Conservation Law
|
|
|
|
**Was:** A Turing-complete weird machine beats unpredictability by
|
|
finding generating programs instead of predicting.
|
|
|
|
**Changed to:** Generation = prediction. The generating program =
|
|
the model. The residual = what can't be predicted/generated. Sum
|
|
is conserved. No machine beats K(data).
|
|
|
|
**Why:** Claude Code's demo: k=0 total=102K, k=1 total=85K (sweet
|
|
spot), k=3 total=557K (model ate savings). Bits relocate between
|
|
program and tape columns, never shrink. The machine is never free;
|
|
it's on the invoice.
|
|
|
|
## 2026-07-03: DNA as Compressor → DNA as Invariant Carrier
|
|
|
|
**Was:** DNA (hachimoji) encodes data compactly for compression.
|
|
|
|
**Changed to:** DNA is the octagon carrier — structurally linear
|
|
(compatible with the pipeline) but carrying nonlinear meaning
|
|
(compatible with the problem). It's not a compressor; it's the
|
|
embedding that makes nonlinear properties spectrally detectable.
|
|
|
|
**Why:** Braille/T9 on text: 4.167 b/B (dead). But the p-adic
|
|
valuations (prime factorization) ARE the prime decomposition — the
|
|
invariant signature. DNA carries invariants, not compressed bytes.
|
|
|
|
## 2026-07-03: Prime-Sidon Hypothesis → Honest Negative
|
|
|
|
**Was:** The prime number distribution has a Sidon-related spectral
|
|
signature detectable via Perceval SLOS.
|
|
|
|
**Result:** Honest negative. 35 test cases, 0/35 significant after
|
|
Bonferroni correction. The adversarial review caught a tautology
|
|
in the original methodology (which would have produced false
|
|
positives), added the null hypothesis, and the negative finding
|
|
is properly bounded.
|
|
|
|
**What this means:** The prime distribution does NOT have a
|
|
Sidon-detectable spectral signature through the SLOS pipeline.
|
|
This is a measured negative — it clears the question off the board.
|
|
|
|
**Recorded in:**
|
|
- ENE database: session prime-sidon-negative-001 (promoted)
|
|
- ENE packages: prime-sidon-pkg-001 (verified, promoted)
|
|
- ENE receipts: negative_result (verified)
|
|
- ENE ingest_events: prime-ingest-001 (recorded)
|
|
- GitHub: commit a0d95049
|
|
|
|
**Implication for the octagon:** primes don't have the spectral
|
|
signature that Sidon sets do. The octagon works for Sidon (4/4)
|
|
but NOT for primes (0/35). This is a third data point:
|
|
|
|
| Problem | Octagon works? | Evidence |
|
|
|---------|----------------|----------|
|
|
| Sidon sets | YES | 4/4 (measured) |
|
|
| Graph coloring | YES | Hoffman bound (known) |
|
|
| Prime distribution | NO | 0/35 after Bonferroni (measured) |
|
|
| Graph isomorphism | NO | Cospectral graphs (known) |
|
|
| Text | NO | 3.088 b/B (measured) |
|
|
|
|
The octagon is NOT universal. It works for some problems and
|
|
fails for others. The research question is now: what determines
|
|
which problems have spectral signatures?
|