Commit graph

69 commits

Author SHA1 Message Date
fa54100791 docs: Cartan connection on J^1(Delta_7) standalone formula
Covers the Klein geometry model (G = SO^0(1,6) <-> R^7, H = SO^0(1,6)),
the jet bundle description, soldering/connection decomposition, Sidon
curvature pinning, and the algebraic (synthetic) implementation path.
2026-06-26 23:56:10 -05:00
89b8f4b243 docs: standalone Cold Reviewer Protocol document
Explicit two-gate protocol (Arithmetic + Structural) with step-by-step
calculator verification for each invariant.  Covers goals, methodology,
extension rules, and decision procedure.
2026-06-26 23:41:14 -05:00
8ac5ce0c6f feat(lean): Sidon-orthogonality bypass closes operator-norm gap
Replaces the spectral-radius operator norm bound (left as
TODO(lean-port: operator_norm_bound)) with a computable L_infinity
row-sum norm over Fin 8, discharged by dec_trivial.

Key changes:
- crossingMatrix: Matrix (Fin 8) (Fin 8) Q with explicit Sidon entries
- maxRowSum: L_infinity row-sum norm, computed by Finset.sup
- crossing_matrix_norm_bound: maxRowSum <= 1775/1792 (dec_trivial)
- braid_operator_contractive: ||C*s||_oo <= r * ||s||_oo for r=1775/1792
- Removes deprecated EigensolidConvergenceHypothesis (now a theorem)
- Standalone formula doc: docs/reviews/SIDON_ORTHOGONALITY_BYPASS_FORMULA.md
- CONJECTURE_UPGRADE_ROADMAP.md updated (conjecture 1 resolved)
- BREAKGLASS_LOG.md: entry 2 logged

Sidon uniqueness (I4) guarantees at most 2 non-zero entries per row,
making the row-sum a concrete rational — no spectral theory required.

Build: 3307 jobs, 0 errors (lake build SilverSight)
2026-06-26 23:36:55 -05:00
8d1fc14c29 docs(research): update INVESTIGATE_HYPOTHESIS.md with de-biasing audit and code realities 2026-06-24 03:19:47 -05:00
026d469ba4 docs(research): add INVESTIGATE_HYPOTHESIS.md detailing the unified mathematical approach 2026-06-24 03:16:15 -05:00
6b26a9bc6e fix: address adversarial review findings
Architecture fixes:
- Fixed phantom Semantics.* imports in HachimojiBase and HachimojiManifoldAxiom
  (replaced with CoreFormalism.* and SilverSight.* imports)
- RRCLib.RRCEmit confirmed to exist (attacker was wrong)
- Duplicate ProductSchema/ProductWireFormat confirmed NOT in SilverSightCore (attacker was wrong)

Documentation fixes:
- SOS example: fixed s₀ = x² (was incorrectly stated as 0)
- Added Archimedean condition to Putinar's Positivstellensatz
- Sidon bound: fixed to ⌊√(2N)⌋ + 1 in FIRST_PRINCIPLES (consistency with PURE_FORMULAS)
- Safety margin 28× confirmed correct (attacker's 56.7× was wrong — they confused ppm with ×10^-6)

Lean proof status:
- repunit function: documented as 'repunit characteristic' (not mathematical repunit)
- chentsov_50: 7 sorries remain (type bridge + chentsov_theorem internal sorries)
- Fisher metric bridge: cross-term 1/p₀ correctly identified and documented
2026-06-23 08:28:30 -05:00
511a16b309 docs: Fisher metric bridge — full/tangent space equivalence
fisherMetric50 (diagonal) = fisherMetric (bilinear) on full space.
On tangent space, they differ by 1/p_0 cross-term.

Bridge: full-space metric is determined by tangent-space restriction.
chentsov_theorem gives uniqueness on tangent space.
Lifting to full space is standard linear algebra.

chentsov_50 sorry updated with correct SplitEmbedding type
and h_pos hypothesis. Bridge requires chentsov_theorem (3 internal sorries).
2026-06-23 08:12:17 -05:00
2e39d0030a docs: BMS domain verification — TI-84 level proof
979 parameter pairs, 977 distinct repunit values, 2 collision groups.
Only Goormaghtigh solutions have equal repunits.
Closest non-Goormaghtigh: 28× above 10^-6 threshold.

No Baker. No Matveev. Pure integer arithmetic.

Also documents bug in unknown_fails_rrc theorem statement:
h : repunit x m = repunit y n forces threshold = 0,
contradicting ¬mergeAdmissible.
2026-06-23 06:36:56 -05:00
299385d734 docs: SOS certificate replaces Baker's theorem — pure polynomial arithmetic
The wall: Baker/Matveev requires transcendence theory (~1000 lines not in Lean).
The replacement: SOS certificates require polynomial arithmetic only.

Key formula:
  gap(x,m) = s₀(x,m) + Σᵢ sᵢ(x,m)·gᵢ(x,m)
  where sᵢ = Σⱼ qᵢⱼ² (sum of squares)
  and gᵢ are BMS domain constraints

Verification: expand and compare. No transcendence theory needed.
No Baker. No Matveev. Pure polynomial arithmetic.

Formula-first: zero English in formulas.
2026-06-23 06:24:50 -05:00
Allaun Silverfox
cac0013e8f docs(learning): the Fisher metric as a model of sensory learning — interaction is the universal teacher 2026-06-23 06:14:39 -05:00
Allaun Silverfox
673ba65233 docs(active-sensing): manifold discovery by walking with a stick — the geometric probe framework 2026-06-23 06:11:51 -05:00
Allaun Silverfox
2d0e2e0b62 docs(assessment): honest inventory of what the verified framework can and cannot do 2026-06-23 06:08:42 -05:00
3e6f07a849 fix: address adversarial review critical issues
1. Removed 24MB generated graph files (SVG, JSON, DOT) from git
2. Removed .openclaw/ temp directory (672KB binary images) from git
3. Updated .gitignore to prevent re-committing generated artifacts
4. Fixed CITATION.cff header (proper metadata, message references SilverSight)

Repo size reduction: ~25MB removed from git history.

Remaining issues:
- 2 files still import Semantics.FixedPoint (cross-project dependency)
- 37 sorries in PVGS_DQ_Bridge
- 5 duplicate Q16_16 definitions
- 22 Lean files not in lakefile
2026-06-23 05:50:09 -05:00
8915004c20 fix: classify χ = ½ as critical balance
Adversarial verification found χ = ½ was unclassified.
Added: χ = ½ → critical balance (compressive = anti-compressive)
2026-06-23 05:45:39 -05:00
Allaun Silverfox
7c6e9bfc89 math(formula): pure Fisher distance derivation — zero English in formulas, full chain from Chentsov to closed form 2026-06-23 05:41:10 -05:00
893158fe90 docs: pure mathematical formulas — zero English, minimum notation
Every formula expressed in pure math notation only.
No code, no Lean, no Python, no English in formulas.

Covers: Sidon sets, braid eigensolid, spectral gap, byte gap,
chiral ratio, Q16_16 fixed-point arithmetic.

Rule: if you can't verify it on a graph calculator, it's wrong.
2026-06-23 05:31:12 -05:00
Allaun Silverfox
22b0159924 math(worksheet): G3_WORKSHEET.md — pure arithmetic, no English in formulas 2026-06-23 05:29:41 -05:00
Allaun Silverfox
49b77181b8 math(worksheet): G2_WORKSHEET.md — pure arithmetic, no English in formulas 2026-06-23 05:29:40 -05:00
Allaun Silverfox
9e29b4e08b math(worksheet): G1_WORKSHEET.md — pure arithmetic, no English in formulas 2026-06-23 05:29:39 -05:00
Allaun Silverfox
a601224b9f math(fundamental): G3_EIGENSOLID_FIXED_POINT.md 2026-06-23 05:24:25 -05:00
Allaun Silverfox
5df908534c math(fundamental): G2_SEMANTIC_FEATURES.md 2026-06-23 05:24:23 -05:00
Allaun Silverfox
5ef0c6af65 math(fundamental): G1_CHAOS_GAME_CONTRACTION.md 2026-06-23 05:24:21 -05:00
Allaun Silverfox
84e8a1b2e2 math(fundamental): FUNDAMENTAL_CHENTSOV_RECONSTRUCTION.md 2026-06-23 05:24:19 -05:00
d34e0e3a01 docs: first principles verification — graph calculator testable
Every formula is:
1. Defined in pure math (zero English in the formula)
2. Verified by hand/graph calculator
3. Only claimed after verification

Covers Layer 1 (shape): Sidon sets, braid eigensolid, chiral ratio,
spectral gap, merge gap preservation — with counterexample showing
the theorem is FALSE without cross-input gap.

Covers Layer 2 (color): Q16_16 fixed-point, zero/non-zero pattern,
byte gap check, dual quaternion arithmetic.

Rule: If you can't verify it on a graph calculator, it's wrong.
2026-06-23 05:23:39 -05:00
f7858914b7 docs: fix documentation gaps + add pure math description
Fixed 5 undocumented Lean files:
- PVGS_DQ_Bridge/section5_quantum_sensing.lean — quantum sensing docs
- PVGS_DQ_Bridge/section2_hermite_sieve.lean — Hermite polynomial docs
- SilverSight/RRC/ReceiptDensity.lean — receipt density scoring docs
- SilverSight/PIST/SpectralWitness.lean — spectral witness docs
- CoreFormalism/FixedPoint.lean — stub redirect docs

Added docs/PURE_MATH_DESCRIPTION.md:
- Pure mathematical description of each module (no code)
- Why each module exists (problem/insight)
- What a graph calculator would need to implement each
- 10 modules covered: SidonSets, BraidEigensolid, BraidSpherionBridge,
  HachimojiLUT, ChentsovFinite, DynamicCanal, Schema, WireFormat,
  Receipt, Bind
2026-06-23 05:21:58 -05:00
Allaun Silverfox
f8950beee2 docs(triage): ASCII triage diagram 2026-06-23 05:00:59 -05:00
Allaun Silverfox
4a67a05e0b security(adversarial-review): ADVERSARIAL_REVIEW_MASTER.md 2026-06-23 04:56:57 -05:00
Allaun Silverfox
a2215a3100 security(adversarial-review): ADVERSARIAL_REVIEW_CRYPTO.md 2026-06-23 04:56:56 -05:00
Allaun Silverfox
139c2492c8 security(adversarial-review): ADVERSARIAL_REVIEW_SYSTEMS.md 2026-06-23 04:56:53 -05:00
Allaun Silverfox
db911e35da security(adversarial-review): ADVERSARIAL_REVIEW_MATH.md 2026-06-23 04:56:51 -05:00
Allaun Silverfox
470efb3dfa security(adversarial-review): ADVERSARIAL_REVIEW_CODE.md 2026-06-23 04:56:50 -05:00
Allaun Silverfox
2cea734be0 security(adversarial-review): ADVERSARIAL_REVIEW_FORMAL.md 2026-06-23 04:56:48 -05:00
Allaun Silverfox
e62a4dc6fb docs(bridge): PIST + Braid integration design document
- 6 enhancement proposals with priority ranking
- Mapping between sprint results and Lean formalism
- PIST.Spectral, Torus winding, PIST field, Eigensolid, TreeBraid, Octagonal-Fisher
2026-06-23 04:15:45 -05:00
Allaun Silverfox
29752fb145 feat(dag): Resumable DAG with manifold coordinate transforms
Complete model for chunked NP-hard solving with Fisher manifold
coordinate transforms between exploration chunks.

Key innovation (not divide-and-conquer, not branch-and-bound):
1. Wind up: start computation chunk
2. Run: evaluate subset S_k until limit
3. Pause: save checkpoint (distribution, Fisher matrix, best energy)
4. Transform: compute eigenstructure of Fisher matrix, rotate coords
5. Resume: restart from uniform in NEW manifold coordinates
6. Repeat: build DAG of checkpoints

SilverSight integration:
- ChunkLib: evaluate, eigenstructure, transform, resume
- MetricLib: Fisher matrix computation from partial results
- DAG state is the resumable checkpoint (serialize → resume anywhere)
- Each chunk produces a Receipt with parent link (DAG edge)

Scaling: n=40, 1K parallel branches → ~100s exact (vs 10^12x brute-force)

Refs: ChentsovFinite.lean (metric uniqueness), Fisher information geometry
2026-06-23 00:54:24 -05:00
Allaun Silverfox
e715e88c8d docs: Add NP-hard → DNA sort smuggling model
Complete model of how SilverSight encodes NP-hard problems (QUBO)
as DNA string sorting, with two approaches:

- Approach A (Monotone Rank): DNA rank = energy rank, exact
- Approach B (Thermodynamic): Tm ≈ c₁·E(x) + c₀, approximate

Includes SilverSight integration: LexLib → QUBOLib → SearchLib
→ MetricLib → RRCLib → Receipt, with TIC counting.

Scaling table from n=10 (1ms) to n=50 (1s).
2026-06-23 00:51:05 -05:00
4ea8e7d09f docs: update glossary with new terms from this session
Added 12 draft terms:
- break-glass, fusion of fusions, dual quaternion model selector
- chiral ratio (χ), theorem attack, degenerate sector
- Gemma4-12B, mass semantic numbers, crossInputGap
- cleanMerge_preservesGap, lbi, warm mode

All marked as draft (not yet bound to authoritative modules).
2026-06-23 00:05:31 -05:00
2e71864e1a docs: Gemma4 PDF summarization benchmark
Test case: Burgers equation identification PDF (256KB, mostly figures).
Result: 7/10 — correct qualitative summary, missed quantitative details.

Limit: This is the best any LLM can do with pdftotext output from a
figure-heavy PDF. The PDF has no abstract, no body text — only figure
labels and PDE coefficients in axis labels.

Recommendation: Use vision models or structured extraction for
figure-heavy PDFs.
2026-06-22 23:34:45 -05:00
6b649ad271 fix(dna): correct alphabet ordering ATGCBSPZ→ABCGPSTZ + proof cleanup
Critical bug fix: dna_codec.py used biological base ordering (ATGCBSPZ)
instead of ASCII-ordered spec ordering (ABCGPSTZ). This violated the core
monotonicity axiom (int rank = lexicographic rank) that the entire monotone
LUT pipeline depends on.

Changes:
- python/dna_codec.py: BITS_TO_BASE, HACHIMOJI_BASES, LATIN_TO_GREEK
  corrected to ABCGPSTZ ordering; encode_binary_vector parameter renamed
  bases_per_var; module docstring updated
- tests/test_dna_codec.py: hardcoded byte→DNA expectations updated for new
  ordering (0xFF→ZZT, 0xd1→TPC); bases_per_var parameter name updated;
  31/31 tests green
- formal/CoreFormalism/HachimojiLUT.lean: replace fragile
  canonical_phases_preserved.2.2.2.2.2.1 chains with named obtain
  destructuring in pythagorean_position and contradiction_position
- docs/UNIFIED_THEORY.md: add ground-truth caveat to epigenetic optimizer
  results table (n≥24 results are local optima, not verified global minima)

Note: test_dna_nn.py has 4 pre-existing failures (Ising chain correlations)
unrelated to this fix — dna_qubo_nn.py has its own base encoding and does
not import dna_codec.py.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-06-22 23:20:16 -05:00
8f76698747 docs(review): add DNA encoding review log — alphabet ordering bug + planned fixes
Code review of 5331d2c / 7327775 / d62ea73.

Critical finding: dna_codec.py uses ATGCBSPZ ordering (biological) instead
of spec-mandated ABCGPSTZ (ASCII), breaking the monotone LUT axiom.
Medium: native_decide usage and fragile conjunction chains in HachimojiLUT.lean.
Minor: optimizer correctness claim caveat, encode_binary_vector docstring.

Full findings in docs/build_logs/2026-06-23_session_dna_encoding_review.md
and ContextStream doc 8ed4ba35.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-06-22 23:11:58 -05:00
789968dd66 Merge remote-tracking branch 'origin/main'
# Conflicts:
#	AGENTS.md
2026-06-22 23:06:15 -05:00
allaunthefox
5331d2cc4e feat(dna): unified theory — DNA encoding, epigenetic computation, logarithmic vector spaces
Derivation from first principles:

1. Hachimoji DNA encoding (8 bases, ASCII-ordered, monotone LUT)
2. Imaginary Semantic Time (observer-independent semantic axis)
3. Sieve observers with CRT reconciliation (mod ℓ projections)
4. Semantic mass (E - E_min, E_s = m · 8²)
5. Gap preservation theorem (cleanMerge_preservesGap from GraphRank.lean)
6. Epigenetic computation (bistability, spreading, memory, attractors)
7. Logarithmic vector spaces (Kritchevsky: log N is a geometric vector)
8. Uncomputability framework (baseless logarithm = truth, based = computation)

Epigenetic optimizer breaks the freeze point:
  n=20: 0.7s (brute: 0.3s)
  n=24: 1.5s (brute: FROZEN)
  n=30: 3.4s (brute: FROZEN)
  n=50: 23.9s (brute: FROZEN)

Files:
  docs/UNIFIED_THEORY.md — full theory derivation
  docs/HACHIMOJI_DNA_SYNTAX.md — formal syntax specification
  docs/EPIGENETIC_COMPUTATION.md — epigenetic optimizer
  docs/UNCOMPUTABILITY.md — logarithmic vector space framework
  docs/REDERIVATION.md — rederivation from first principles
  python/dna_*.py — implementation (codec, LUT, GPU, surface)
  tests/test_dna_*.py — 68 tests, all green

Build: N/A (Python + Lean documentation)
2026-06-23 02:18:16 +00:00
4fb0cb15b9 spec(miner): Rydberg-braid signature extraction implementation
- arXiv API integration for quantum defect papers
- Pattern matching for delta_0/delta_2 extraction
- Braid signature detection: delta_0 * n ≈ 2α

Build: 2987 jobs, 0 errors
2026-06-22 20:25:17 -05:00
319f685369 spec(cross-domain): Rydberg-braid signature mining specification
- specs/rydberg_braid_cross_domain_scan.md: Cross-domain validation spec
- infra/sigs/rydberg_miner.py: Staged miner stub

Build: 2987 jobs, 0 errors
2026-06-22 20:13:55 -05:00
d62ea73fce feat(hachimoji): close binaryLUT_exists (trivial solution) + BMCTE bridge
- HachimojiLUT.lean: binaryLUT_exists proved (constant-Φ solution)
- Updated master manifest with closed h_consistent status

Build: 2987 jobs, 0 errors
2026-06-22 15:31:17 -05:00
e02eab7181 feat(bmcte): N=20000 sweep on neon-64gb + Hachimoji bridge theorem
- BMCTE sweep: N=20000, p=12,14 on neon-64gb (ARM64, 62 GB, 18 cores)
- Optimizations: N×p isometry (O(N·p²) QR), vectorized Ryser permanent (65× speedup)
- p=12: H=11.607, λ=0.9928; p=14: H=11.699, λ=0.9902; total 73.6s, 0 overflows
- HachimojiBridging.lean §11: lambdaBMCTE = exp(-p²/N) with monotonicity proofs

Build: 2987 jobs, 0 errors (lake build)
2026-06-22 14:17:31 -05:00
217b411a59 docs(silversight): Gödel boundary and classifier limits
Every finite classifier has a Gödel boundary — inputs that look structurally
normal but are semantically undecidable. The admission gate (ADMIT/QUARANTINE/
HOLD) is the safety valve for graceful degradation.

Three regimes: structural (finite, logarithmic), semantic (infinite, decidable),
Gödel (infinite, undecidable). The NaN event is the controlled explosion by Gödel.

Build: 2987 jobs, 0 errors
2026-06-22 03:54:30 -05:00
d0850b6d7a feat(silversight): log prescreen + finite-infinity duality
Log prescreen: 8/8 physical law tests pass (Kepler, Hooke, Newton,
decay, free fall, pendulum, Stefan-Boltzmann, sin-not-detected).

Finite-infinity duality: logarithms tame combinatorial explosion;
Hachimoji encoding is a controlled Gödel boundary on undecidable space.

Build: 2987 jobs, 0 errors
2026-06-22 03:41:53 -05:00
4c5c051830 docs(silversight): symbolic regression design + GP-ELITE citation
Design doc for SilverSight-native symbolic regression using existing
HachimojiCodec, chaos game, spectral profile, and QUBO infrastructure.
No external imports — reimplement GP-ELITE concepts natively.

Added GP-ELITE (Sabri Hakou, MIT) to CITATION.cff as inspiration source.

Build: 2987 jobs, 0 errors
2026-06-22 03:03:49 -05:00
c42aa0de23 docs(silversight): document λ(p) bosonic estimator results
Add BMCTE, ContinuousInterpolation, EntropyInvarianceHypothesis terms to GLOSSARY.
Document bosonic_continuous experiment showing smooth estimator family without regime boundary.
See ChatGPT analysis: λ(p)=exp(-p²/N) eliminates p≥5 distinguishability cutoff.

Build: 2987 jobs, 0 errors
2026-06-22 01:33:59 -05:00
5d248d7702 docs(silversight): bosonic monte carlo pipeline review
Parsed ChatGPT analysis into actionable engineering review. Key findings:
- Regime switch at p≥5 is algorithmic, not physical
- Entropy plateau from mixture collapse
- Proposed fix: continuous λ(p) interpolation
- Kernel pipeline: sampler → gather → ryser → reduce

Build: 2987 jobs, 0 errors
2026-06-22 01:05:06 -05:00