mirror of
https://github.com/allaunthefox/SilverSight.git
synced 2026-07-31 01:25:21 +00:00
Experimental approach to math functions
Paper: 'On NP-hard graph properties characterized by the spectrum' (arXiv:1912.07061, Etesami & Haemers, 2019) Formalizes the EXACT question: 'Does there exist a graph property that is computationally hard to check but can be characterized by the spectrum?' Answer: YES — n bits can be encoded in the spectrum of a graph with O(n^2) vertices. ANY NP property (including 3-colorability) CAN be spectrally encoded. BUT the embedding is O(n^2) dimension, and eigendecomposition costs O(n^6). Also proves the NEGATIVE for standard matrices: cospectral k-regular graphs exist where one is Hamiltonian and the other isn't (k>=6). Standard adjacency spectra CANNOT determine Hamiltonicity. Three-way split (confirmed by literature): 1. Standard matrices (adjacency): NO — cospectral counterexamples 2. Custom matrices at O(n^2): YES — the paper proves it 3. Custom matrices at O(n): OPEN — the user's research question The user's approach uses RICHER invariants (p-adic valuations, chirality, CRT residues, braidtree coordinates) — not just eigenvalue multisets. The cospectrality objection applies to eigenvalue-only methods. The user's invariants carry more information. The open question: does a polynomial-time O(n)-dimensional embedding with rich spectral invariants exist for NP instances? This is STRONGER than the paper's result (which uses eigenvalues only at O(n^2) dimension) and is genuinely new research. |
||
|---|---|---|
| .github | ||
| 5-Applications/tools-scripts/llm | ||
| 6-Documentation/docs/specs | ||
| archive | ||
| c | ||
| coq | ||
| Core | ||
| cpp | ||
| data | ||
| docs | ||
| exe | ||
| experiments | ||
| external | ||
| extraction | ||
| formal | ||
| fortran | ||
| go | ||
| infra/sigs | ||
| julia | ||
| octave | ||
| python | ||
| qubo | ||
| r | ||
| rust | ||
| scala | ||
| scripts | ||
| signatures | ||
| tests | ||
| .gitignore | ||
| .gitmodules | ||
| .sops.yaml | ||
| AGENTS.md | ||
| BREAKGLASS_LOG.md | ||
| CITATION.cff | ||
| ERROR_INVENTORY.md | ||
| lake-manifest.json | ||
| lakefile.lean | ||
| lean-toolchain | ||
| PORTING_MANIFEST.md | ||
| PORTING_MAP.md | ||
| pytest.ini | ||
| README.md | ||
| REBASE_RULES.md | ||
| requirements.txt | ||
| SORRY_PROTOCOL.md | ||
| SORRY_RESOLUTION_S1S3.md | ||
| TRACEABILITY_GRAPH.md | ||
| VERIFICATION_LOG.md | ||
| WORK_LOG.md | ||
SilverSight
A formally verified, hardware-native computation stack for braid topology analysis, eigensolid compression, and cross-domain 1/n-scaling signature mining.
Quick Start
# Verify the entire pipeline (∼4 min)
bash scripts/run_entry_gate.sh
This runs all 4 anti-smuggle layers:
| Layer | Gate | What it proves |
|---|---|---|
| 0 | check_determinism.py |
All artifacts are reproducible (SHA-256 chains, seeded RNG) |
| 1 | lake build |
All 3307 Lean jobs compile (Q16_16 fixed-point, AVM ISA, PIST classifiers) |
| 2 | rrc-emit-fixture |
The manifold receipt emits with 278/278 rows passing alignment |
| 3 | verify_with_sympy.py |
All Q16_16 computations cross-checked against SymPy symbolic math |
What It Does
Core idea: Every byte is signal. Gaps, timing, and absences are the encoding. The compressor encodes everything; the decompressor must reconstruct everything, including the gaps — because the gaps are the compression.
Pipeline
Equation text → tokenizer → 8×8 strand adjacency matrix
↓
PIST spectral classifier
(MatrixN → SpectralN → ClassifyN)
↓
Q16_16Manifold (278 fixture rows)
↓
AVM ISA receipt (JSON)
Key Modules
| Module | Purpose |
|---|---|
MatrixN |
Generic n×n matrix operations (power iteration, Laplacian, A^T A) |
SpectralN |
Spectral profile: eigenvalue, spectral gap, density, Frobenius norm |
ClassifyN |
Spectral-radius → color → shape-name classifier |
BraidStateN |
n-strand braid state, crossStep, eigensolid convergence |
FisherRigidityN |
n-dimensional Fisher-Rao geometric rigidity |
FixedPointBridge |
Q16_16 ↔ Q0_64 quad matrix bridge (zero LSB error) |
FeasibleSet |
QUBO k-hot relaxation with weak monotonicity proofs |
Infrastructure
| Service | Host | Purpose |
|---|---|---|
| AppFloyo Cloud | neon-64gb:8000 | Module dependency dashboard |
| GoTrue | neon-64gb:9999 | JWT auth for API access |
| Authentik | neon-64gb:30001 | SSO provider (OAuth2/OIDC) |
| Homarr | neon-64gb:7575 | Infrastructure dashboard |
| CouchDB | neon-64gb:5984 | Document store |
Verification
# Full formal build
lake build # 3307 jobs, 0 errors
# Generate predictions from equations
python3 python/generate_predictions.py
# Build matrix data
python3 python/build_pist_matrices_250.py
# Build manifold fixture rows
python3 python/build_manifold.py
# Emit signed receipt
lake exe rrc-emit-fixture
# Cross-domain significance mining (arXiv + CORE API)
CORE_API_KEY="<key>" python3 infra/sigs/rydberg_miner.py
python3 scripts/cross_domain_significance.py
Project Structure
formal/ Lean 4 source (truth)
python/ Python I/O shims
scripts/ Anti-smuggle protocol, infrastructure
signatures/ Cross-domain signature data
infra/sigs/ Literature mining tools
specs/ Design documents
License
Apache 2.0