feat(data): expand concept map with governance, specs, receipts, infra

Added 170 new entries (822 → 992 total) covering:
- Governance: claims.yaml, VOCABULARY_LOCK, REBASE_RULES, CITATION.cff
- Provenance: 7 CFF files (AlphaFold, DNA Codec, Kaggle, etc.)
- Receipt schemas: 16 FAMM + claims-registry + deepseek-review schemas
- Config: .mcp.json, pyproject.toml, flake.nix, Containerfile, .pre-commit
- Specs: 62 spec files + plans + conjectures + distilled docs
- Reviews: DeepSeek reviews, adversarial reviews, QC reports
- Stack solidification: 21 receipt .md files
- Library/E2E receipts: 4 receipts
- Infrastructure: 5 docs (INFRASTRUCTURE, DR, RUNBOOK, FPGA, API)

Total: 992 entries, 3,972 concepts across 18 type categories

shared-data/data/concept_map/markdown_concept_map.jsonl

@@ -820,3 +820,173 @@
 {"file": "6-Documentation/wiki/Obsidian-connector/Manifold/Modules/YangMillsLattice.md", "title": "YangMillsLattice", "concepts": [{"name": "YangMillsLattice", "description": "Module: YangMillsLattice", "type": "definition"}, {"name": "Attributes", "description": "Section: Attributes", "type": "definition"}, {"name": "Imports", "description": "Section: Imports", "type": "definition"}, {"name": "Imported by", "description": "Section: Imported by", "type": "definition"}, {"name": "Tags", "description": "Section: Tags", "type": "definition"}, {"name": "Semantics", "description": "Identifier in YangMillsLattice", "type": "primitive"}], "tags": ["topology"], "layer": "Documentation", "dependencies": ["FixedPoint", "Bind"], "summary": "| Property | Value | |---|---|"}
 {"file": "6-Documentation/wiki/Obsidian-connector/Manifold/Modules/YangMillsLatticeSizing.md", "title": "YangMillsLatticeSizing", "concepts": [{"name": "YangMillsLatticeSizing", "description": "Module: YangMillsLatticeSizing", "type": "definition"}, {"name": "Attributes", "description": "Section: Attributes", "type": "definition"}, {"name": "Imports", "description": "Section: Imports", "type": "definition"}, {"name": "Imported by", "description": "Section: Imported by", "type": "definition"}, {"name": "Tags", "description": "Section: Tags", "type": "definition"}, {"name": "Semantics", "description": "Identifier in YangMillsLatticeSizing", "type": "primitive"}], "tags": ["topology"], "layer": "Documentation", "dependencies": ["FixedPoint", "Bind"], "summary": "| Property | Value | |---|---|"}
 {"file": "6-Documentation/wiki/Obsidian-connector/Manifold/Modules/YangMillsPerformance.md", "title": "YangMillsPerformance", "concepts": [{"name": "YangMillsPerformance", "description": "Module: YangMillsPerformance", "type": "definition"}, {"name": "Attributes", "description": "Section: Attributes", "type": "definition"}, {"name": "Imports", "description": "Section: Imports", "type": "definition"}, {"name": "Imported by", "description": "Section: Imported by", "type": "definition"}, {"name": "Tags", "description": "Section: Tags", "type": "definition"}, {"name": "Semantics", "description": "Identifier in YangMillsPerformance", "type": "primitive"}], "tags": ["topology"], "layer": "Documentation", "dependencies": ["FixedPoint", "Bind"], "summary": "| Property | Value | |---|---|"}
+{"file":"claims.yaml","title":"Research Stack Mathematical Claim Registry","concepts":[{"name":"Claim Registry","description":"Single source of truth for tracked mathematical claims and their rigor level, validated against claims-registry.schema.json","type":"protocol"},{"name":"Claim Status Ladder","description":"Four-tier rigor: conjecture → verified-by-ai → formally-proven → published","type":"definition"},{"name":"prime-gap-entropy-collapse","description":"Claim that the prime-gap entropy-collapse detector rarely survives the corrected K=21 selective braid threshold","type":"theorem"},{"name":"DeepSeek Review Receipt","description":"Machine-readable attestation of LLM review with prompt hash, answer hash, model, and token usage","type":"receipt"},{"name":"Math-First Contract","description":"Every math claim must be backed by Lean proof or DeepSeek review receipt before promotion","type":"gate"}],"tags":["governance","claims","verification","lean","deepseek","math-first"],"layer":"governance","dependencies":["claims-registry.schema.json","deepseek-review-receipt.schema.json","EntropyCollapseDetector.lean"],"summary":"Tracks every mathematical claim in the stack with its rigor level, Lean proof reference, and DeepSeek review receipts. Validated by CI against the claims-registry JSON Schema."}
+{"file":"6-Documentation/docs/VOCABULARY_LOCK.md","title":"Vocabulary Lock: Sovereign Stack / Bodega Kernel","concepts":[{"name":"Equation Forest","description":"A DAG of mathematical models and their dependencies (Semantics.Forest)","type":"definition"},{"name":"F01–F12","description":"12 foundation kernel signatures including Shannon, Carnot, Landauer (Semantics.Foundations)","type":"definition"},{"name":"DIAT","description":"Dynamic Integer-Address Transform — shell coordinate transform (Semantics.DIAT)","type":"definition"},{"name":"S3C","description":"Shell/Topological Codec for energy cell quantization (Semantics.S3C)","type":"definition"},{"name":"AVMR","description":"Adaptive Vector Manifest Roll-up — hierarchical summary (Semantics.AVMR)","type":"definition"},{"name":"NUVMAP","description":"Non-Uniform Variable Mapping — 2D spectral projection (Semantics.NUVMATH)","type":"definition"},{"name":"FNWH","description":"Formal Non-Wave Harmonic — the underlying framework (Semantics.FNWH)","type":"definition"},{"name":"PIST","description":"Perfectly Imperfect Square Theory — witness/audit surface (Semantics.PIST)","type":"definition"},{"name":"FAMM","description":"Frustration-Aware Manifold Management — memory/route manager (Semantics.FAMM)","type":"definition"},{"name":"Genome18","description":"18-bit address space with 6 bins × 3 bits (Semantics.Genome18)","type":"definition"},{"name":"Q16.16 Fixed Point","description":"All arithmetic in Lean and Verilog must match bit-exactly using Q16_16","type":"invariant"},{"name":"S3C Shells","description":"Energy cells must be quantized to n² + m integer shells before routing","type":"invariant"},{"name":"TREE(3) Bound","description":"All recursive lookups in BHOCS must carry a witness of finiteness","type":"invariant"},{"name":"PIST Witness","description":"Witness format: {event_id, proof_hash, signature, energy_cell} with attest(witness) → bool","type":"protocol"},{"name":"NUVMAP Encoding","description":"Spectral state vector → U/V coordinates → Q^T·A projection with ε_tol failure mode","type":"algorithm"}],"tags":["vocabulary","definitions","core-terms","formal-verification","fixed-point","architecture"],"layer":"governance","dependencies":["Semantics.Forest","Semantics.Foundations","Semantics.DIAT","Semantics.S3C","Semantics.NUVMATH","Semantics.PIST","Semantics.FAMM","Semantics.Q16_16"],"summary":"Canonical vocabulary lock defining 10 core terms (Equation Forest through Genome18), interface signatures for NUVMAP and PIST, and implementation constraints including Q16.16 bit-exactness and TREE(3) finiteness witnesses."}
+{"file":"REBASE_RULES.md","title":"REBASE RULES — Research Stack Agent / Rules Manifest","concepts":[{"name":"Rebase Seed","description":"Port contracts and rituals, not state — the principle for standing up new project maps","type":"protocol"},{"name":"Core Operating Contracts","description":"The 8 AGENTS.md files that are the source of truth for every agent, skill, and editor hook","type":"architecture"},{"name":"Programming Choice Flow","description":"Decision tree: Lean owns decisions, Python owns I/O, AVMIsa.Emit is sole receipt boundary","type":"protocol"},{"name":"ContextStream-First Workflow","description":"Every editor must call init() then context() before any file search or edit","type":"protocol"},{"name":"Cornfield Recovery Manifest","description":"19 archived concepts recoverable via explicit RECOVER LEGACY INFORMATION trigger","type":"architecture"},{"name":"SilverSight Port","description":"Port manifest for cornfield concepts: P0 critical (Φ universal field equation) through LOW priority","type":"protocol"},{"name":"Minimal Rebase Checklist","description":"9-step checklist for standing up a new project map from contracts","type":"recipe"},{"name":"MCP Server Inventory","description":"11 MCP servers: contextstream, filesystem, git, fetch, lean, remote-lean-proof, sympy, wolfram-alpha, aws, github, headroom","type":"definition"},{"name":"Skills Inventory","description":"8 must-port skills: lean-proof, contextstream-workflow, research-stack-workflow, headroom, cad, urdf, rrc-compile, rrc-scale-analysis","type":"definition"},{"name":"Do-Not-Port List","description":"Items explicitly dropped: consolidation manifests, runtime DBs, stale audits, copilot state block","type":"gate"}],"tags":["governance","rebase","contracts","architecture","workflow","cornfield"],"layer":"governance","dependencies":["AGENTS.md","Semantics.AVMIsa.Emit","ContextStream","lean-proof"],"summary":"Defines what to port when starting a fresh project map: core contracts, editor configs, skills, MCP servers. Includes cornfield recovery manifest with 19 archived concepts and their port priorities."}
+{"file":"CITATION.cff","title":"Research Stack (OTOM)","concepts":[{"name":"Research Stack","description":"Formal-methods and compression research repository for integer-routed symbolic systems, Omindirection logogram atoms, and the Rainbow Raccoon Compiler","type":"definition"},{"name":"OTOM","description":"The overarching framework name for the Research Stack project","type":"definition"},{"name":"STARS","description":"STAbility-driven Recurrent Scaling for looped models — regularizes spectral radius of Jacobian","type":"algorithm"},{"name":"Differentiable IPM","description":"Differentiable primal-dual interior-point method with softplus retraction for fixed-point arithmetic","type":"algorithm"},{"name":"Polydisperse Hard Spheres","description":"Close packing, fractionation, and terminal polydispersity ~14% — maps to 1/7 Sidon threshold","type":"definition"},{"name":"Vortex-Glass Phase","description":"Granular superconductor vortex-glass theory with Bragg-glass to vortex-glass transitions","type":"definition"},{"name":"BWT Compressiveness","description":"Burrows-Wheeler transform and bijective BWT compressiveness analysis","type":"algorithm"},{"name":"Poincaré Embeddings","description":"Hyperbolic Poincaré ball embeddings for hierarchical representation learning","type":"algorithm"},{"name":"ANS","description":"Asymmetric Numeral Systems — single-state entropy coding alternative to arithmetic coding","type":"algorithm"},{"name":"MDL Principle","description":"Minimum Description Length — model selection via code-length minimization","type":"definition"},{"name":"Information Bottleneck","description":"Deep learning and the information bottleneck principle for neural networks","type":"definition"},{"name":"Zipf's Law","description":"Word frequency law in natural language — critical review of theories","type":"definition"},{"name":"Hachimoji DNA","description":"8-base synthetic DNA with 3 bits/base — formalized in ExpandedGeneticAlphabetProbe.lean","type":"definition"},{"name":"Language Modeling Is Compression","description":"Chinchilla 70B compresses ImageNet to 43.4% — LLMs as compressors","type":"definition"},{"name":"AngrySphinx","description":"Lattice-based PQC primitive with exponential energy asymmetry and NaN boundary","type":"primitive"}],"tags":["citations","references","compression","information-theory","superconductor","polydispersity","PQC","genetics","LLM","manifolds"],"layer":"governance","dependencies":[],"summary":"CFF citation manifest for the Research Stack project. References 50+ papers across hard-sphere packing, vortex-glass superconductors, information theory, compression (ANS/BWT/MDL), genetic code, PQC, and LLM geometry."}
+{"file":"6-Documentation/docs/provenance/ALPHAFOLD_BULK_STRUCTURE_PRIOR_SOURCES.cff","title":"AlphaFold Bulk Structure Database Prior Sources","concepts":[{"name":"AlphaFold Protein Structure Database","description":"EMBL-EBI/Google DeepMind predicted protein structure corpus — external source, not vendored","type":"definition"},{"name":"AlphaFold Bulk Download","description":"FTP bulk archive source for explicit receipted ingest only","type":"protocol"},{"name":"AlphaFold Paper","description":"Jumper et al. 2021 Nature — required citation for UniProt AlphaFold predictions","type":"definition"}],"tags":["provenance","alphafold","protein-structure","biology","external-source"],"layer":"provenance","dependencies":[],"summary":"Provenance manifest for AlphaFold-derived structure priors. Cites the AlphaFold DB downloads, FTP area, and original Nature 2021 paper. Data is not vendored."}
+{"file":"6-Documentation/docs/provenance/DNA_CODEC_FILTER_SOURCES.cff","title":"DNA Codec Filter Sources","concepts":[{"name":"DNA Codec Filter","description":"Local codec using analogy-bound synthetic binding score — not biological sequence data","type":"definition"},{"name":"seqLogo","description":"Bioconductor sequence-logo information-content reference surface","type":"tool"},{"name":"Nearest-Neighbor Thermodynamics","description":"SantaLucia unified DNA thermodynamics — reference surface only","type":"definition"},{"name":"DNA Replication Fidelity","description":"Layered fidelity and proofreading framing — receipt-layer analogy only","type":"definition"},{"name":"Drake-Rule Mutation Rate","description":"Per-token receipt-budget analogy from mutation-rate scaling","type":"definition"},{"name":"Worm-like Chain","description":"Replay-curvature analogy reference — no polymer simulation claimed","type":"definition"}],"tags":["provenance","DNA","codec","biology","analogy","thermodynamics"],"layer":"provenance","dependencies":[],"summary":"Provenance manifest for the DNA codec filter. Cites seqLogo, nearest-neighbor thermodynamics, replication fidelity, and worm-like chain as reference surfaces. All biological references are analogy-bound only."}
+{"file":"6-Documentation/docs/provenance/KAGGLE_DENSITY_PRIOR_SOURCES.cff","title":"Kaggle Algorithm Density Marker Prior Sources","concepts":[{"name":"Ubiquant Dtype Reduction","description":"Kaggle notebook for chunked dtype reduction — external design-prior surface only","type":"definition"},{"name":"Ubiquant Parquet Loading","description":"Rob Mulla's Parquet columnar loading pattern — external design-prior","type":"definition"},{"name":"Santa 2022 Pixel Travel Map","description":"Kaggle pixel travel map notebook — external design-prior","type":"definition"},{"name":"Mercedes Autoencoder Compression","description":"Neural autoencoder feature compression — external design-prior","type":"definition"},{"name":"AIMO3 Speculative Decoding","description":"Speculative decoding and context-compression appliance — external design-prior","type":"definition"}],"tags":["provenance","kaggle","density-prior","compression","autoencoder"],"layer":"provenance","dependencies":[],"summary":"Provenance manifest for Kaggle-derived density-prior notes. Cites 5 Kaggle notebooks as external design-prior surfaces. No code vendored; licenses must be verified before copying."}
+{"file":"6-Documentation/docs/provenance/LANGUAGE_MATH_MODEL_SOURCES.cff","title":"Language, Mathematics, Genetics, and Information Theory Paper Sources","concepts":[{"name":"Hachimoji DNA","description":"8-base synthetic DNA with 3 bits/base (Hoshika 2019 Science)","type":"definition"},{"name":"12-Letter Supernumerary DNA","description":"12-letter DNA as canonical structural maximum (Kawabe 2023 Nature Comms)","type":"definition"},{"name":"Genetic Code Optimality","description":"Standard genetic code ~10^6 times better than random at error minimization (Freeland & Hurst 1998)","type":"definition"},{"name":"DNA Information Storage","description":"Church 2012: 5.27-megabit book in DNA; Goldman 2013: 739KB with 100% reconstruction","type":"definition"},{"name":"Information Bottleneck","description":"Tishby & Zaslavsky 2015: information bottleneck principle applied to deep neural networks","type":"definition"},{"name":"ANS Optimality","description":"Proves ANS optimality for distributions described by natural powers of 1/2 (Pieprzyk 2023)","type":"theorem"},{"name":"Compound PCFG","description":"Compound probabilistic context-free grammars for grammar induction (Kim 2019 ACL)","type":"algorithm"},{"name":"MDL Principle","description":"Minimum Description Length — model selection via code-length minimization (Grunwald 2020)","type":"definition"},{"name":"Language Modeling Is Compression","description":"Chinchilla 70B compresses ImageNet to 43.4% (Deletang 2024 ICLR)","type":"definition"},{"name":"Poincaré Embeddings","description":"Hyperbolic ball embeddings for hierarchical representations (Nickel & Kiela 2017 NeurIPS)","type":"algorithm"},{"name":"Universal Geometry of Embeddings","description":"Universal latent representation translation across embedding spaces (Jha 2025)","type":"definition"},{"name":"Hyperbolic LLMs","description":"Survey of hyperbolic geometry in LLMs (Patil 2025)","type":"definition"},{"name":"BWT Compressiveness","description":"BWT and bijective BWT compressiveness analysis (Bannai 2024)","type":"algorithm"},{"name":"CAT Transformer","description":"Compress & Attend Transformer for controllably efficient language models (Prakash 2025)","type":"algorithm"}],"tags":["provenance","information-theory","compression","genetics","DNA","grammar","MDL","LLM","manifolds","hyperbolic"],"layer":"provenance","dependencies":[],"summary":"Comprehensive provenance manifest covering 25+ papers on expanded genetic alphabets, DNA information storage, information bottleneck, ANS compression, grammar induction, MDL, language modeling as compression, and hyperbolic geometry."}
+{"file":"6-Documentation/docs/provenance/NSPACE_BULK_DATASET_ROUTE_SOURCES.cff","title":"N-Space Bulk Dataset Route Sources","concepts":[{"name":"Gaia DR3","description":"ESA astronomy dataset for galactic phase-space density matrices — external source","type":"definition"},{"name":"ERA5 Reanalysis","description":"ECMWF climate reanalysis for spatio-temporal grid manifolds — external source","type":"definition"},{"name":"LAION-5B","description":"Semantic embedding and image-text metadata source — external, license-sensitive","type":"definition"},{"name":"AlphaFold DB","description":"Predicted protein structure source (CC-BY-4.0) — external","type":"definition"},{"name":"NCBI/GenBank","description":"Biological sequence sources in ASN.1 and GenBank flatfile formats — external","type":"definition"},{"name":"The Well","description":"Polymathic AI physics-dynamics source for uniform-grid scalar/vector/tensor fields — external","type":"definition"},{"name":"PDEBench","description":"Canonical PDE benchmark surface — external, requires citation verification","type":"definition"},{"name":"MeshGraphNets","description":"Google DeepMind irregular-mesh simulation for graph-topology route tests — external","type":"definition"},{"name":"SRBench","description":"Symbolic-regression benchmark datasets including black-box and ground-truth tasks — external","type":"definition"},{"name":"DLMF/Feynman SR","description":"NIST special-function and physics-equation reference prior — external","type":"definition"},{"name":"LeanDojo/mathlib","description":"Formal theorem-proving and mathlib extraction prior — local Lean replay is proof boundary","type":"definition"},{"name":"NuminaMath","description":"Mathematical reasoning dataset/model collection — proposal-generation curriculum only","type":"definition"}],"tags":["provenance","datasets","astronomy","climate","biology","PDE","symbolic-regression","formal-verification"],"layer":"provenance","dependencies":[],"summary":"Provenance manifest for 12 external bulk datasets used as route priors: Gaia, ERA5, LAION-5B, AlphaFold, NCBI, The Well, PDEBench, MeshGraphNets, SRBench, DLMF, LeanDojo, NuminaMath. None vendored."}
+{"file":"6-Documentation/docs/provenance/PRETHINKER_COMPUTATIONAL_EPISTEMICS_SOURCES.cff","title":"Prethinker Computational Epistemics Prior Sources","concepts":[{"name":"Prethinker","description":"External architecture source for governed semantic intake — LLM proposals, deterministic admission, semantic lenses","type":"definition"},{"name":"Semantic Instrument","description":"Prethinker's semantic instrument specification — reference surface only","type":"spec"},{"name":"Multi-Pass Semantic Compiler","description":"Prethinker's multi-pass compiler architecture — reference surface only","type":"spec"},{"name":"Semantic IR Mapper","description":"Prethinker's IR mapper specification — reference surface only","type":"spec"},{"name":"Current Harness Instrument","description":"Prethinker's harness instrument spec — reference surface only","type":"spec"},{"name":"Selector Guards","description":"Deterministic admission guards from Prethinker architecture","type":"gate"},{"name":"Semantic Lenses","description":"Governing lenses for semantic intake from Prethinker","type":"definition"}],"tags":["provenance","prethinker","computational-epistemics","semantic-intake","admission"],"layer":"provenance","dependencies":[],"summary":"Provenance manifest for the Prethinker computational-epistemics prior. Treats Prethinker as architecture source for governed semantic intake: LLM proposals, deterministic mapper admission, semantic lenses, and selector guards. License unknown."}
+{"file":"6-Documentation/docs/provenance/WEATHER_SYSTEMS_MATH_PRIOR_SOURCES.cff","title":"Weather Systems Math Prior Sources","concepts":[{"name":"IFS Documentation","description":"ECMWF Integrated Forecasting System — primitive-equation dynamics reference surface","type":"definition"},{"name":"ERA5","description":"ECMWF reanalysis and assimilation route priors — external reference surface","type":"definition"},{"name":"Numerical Weather Prediction","description":"NOAA NWP data-family routing reference surface","type":"definition"},{"name":"FV3","description":"NOAA finite-volume cubed-sphere dynamical core — conservation and layered dynamics reference","type":"definition"},{"name":"Primitive Equations","description":"Atmospheric primitive-equation dynamics used as math prior framing","type":"definition"}],"tags":["provenance","weather","atmospheric-model","NWP","FV3","ECMWF"],"layer":"provenance","dependencies":[],"summary":"Provenance manifest for weather systems math prior. Cites IFS, ERA5, NWP, and FV3 as reference surfaces for atmospheric modeling. Only tiny synthetic fixtures used locally."}
+{"file":"shared-data/schemas/claims-registry.schema.json","title":"Research Stack Mathematical Claim Registry Schema","concepts":[{"name":"Claims Registry Schema","description":"JSON Schema for claims.yaml — tracks rigor level of every mathematical claim","type":"schema"},{"name":"Claim Status Enum","description":"Four-tier status: conjecture, verified-by-ai, formally-proven, published","type":"definition"},{"name":"Review Receipt Requirement","description":"verified-by-ai claims must have at least one review_receipts entry","type":"gate"},{"name":"Lean Source Requirement","description":"formally-proven claims must have a lean source reference","type":"gate"},{"name":"Kebab-Case ID Pattern","description":"Claim IDs must match ^[a-z0-9][a-z0-9-]*$ — stable across renames","type":"invariant"}],"tags":["schema","governance","claims","json-schema","verification"],"layer":"governance","dependencies":[],"summary":"JSON Schema validating claims.yaml. Enforces four-tier rigor ladder, requires review receipts for AI-verified claims, Lean source for formally proven claims, and kebab-case stable IDs."}
+{"file":"shared-data/schemas/deepseek-review-receipt.schema.json","title":"DeepSeek Review Receipt Schema","concepts":[{"name":"DeepSeek Review Receipt Schema","description":"JSON Schema for Ollama-compatible DeepSeek review receipts with SHA-256 pinning","type":"schema"},{"name":"Primary Receipt","description":"First receipt pinning context files used to build the review prompt","type":"receipt"},{"name":"Continuation Receipt","description":"Receipt for truncated reviews continued by separate requests","type":"receipt"},{"name":"SHA-256 Pinning","description":"prompt_sha256 and answer_sha256 fields enable re-validation without re-running the model","type":"protocol"},{"name":"Context Files","description":"Array of repo-relative paths to every file that participated in the review prompt","type":"definition"},{"name":"Token Usage","description":"prompt_tokens, completion_tokens, total_tokens as reported by endpoint","type":"definition"}],"tags":["schema","receipt","deepseek","ollama","review","sha256","verification"],"layer":"governance","dependencies":[],"summary":"JSON Schema for DeepSeek review receipts. Supports primary and continuation receipt types with SHA-256 pinning of prompts and answers, context file tracking, and token usage."}
+{"file":"shared-data/schemas/famm_16d_chaos_game_receipt.schema.json","title":"FAMM 16D Chaos Game Field Shrinker Receipt","concepts":[{"name":"16D Chaos Game Field Shrinker","description":"Basis layer for 16-dimensional chaos game field shrinking with orbit hashing","type":"algorithm"},{"name":"Chaos Game Orbit","description":"Iterated function system orbit in 16D with burn-in period and SHA-256 hash","type":"receipt"},{"name":"Projection Axes","description":"2-element array selecting which of 16 dimensions to project onto","type":"definition"},{"name":"No-Drift Boundary","description":"String field ensuring receipt reproducibility — no numerical drift allowed","type":"invariant"},{"name":"Route Recommendations","description":"Array of routing suggestions derived from chaos game convergence","type":"receipt"}],"tags":["schema","famm","chaos-game","16d","orbit","projection","receipt"],"layer":"core-formalism","dependencies":["FAMM","NUVMAP"],"summary":"Schema for FAMM 16D chaos game field shrinker receipts. Tracks orbit SHA-256, projection axes, anchor counts, final state, and route recommendations with no-drift boundary."}
+{"file":"shared-data/schemas/famm_adversarial_duals_receipt.schema.json","title":"FAMM Adversarial Duals Receipt","concepts":[{"name":"Anti-FAMM","description":"Adversarial dual testing FAMM receipt aliasing and routing","type":"protocol"},{"name":"Anti-BraidStorm","description":"Adversarial dual testing Yang-Baxter invariance and braid-order aliasing","type":"protocol"},{"name":"Warden Decision","description":"String field encoding the Warden clock domain's adversarial verdict","type":"gate"},{"name":"NUVMAP Projection","description":"NUVMAP object embedded in adversarial duals receipt","type":"receipt"}],"tags":["schema","famm","adversarial","anti-famm","anti-braidstorm","warden","receipt"],"layer":"core-formalism","dependencies":["FAMM","Anti-BraidStorm","Warden","NUVMAP"],"summary":"Schema for adversarial duals receipts. Tests both Anti-FAMM (receipt aliasing) and Anti-BraidStorm (Yang-Baxter invariance) with Warden decision gate."}
+{"file":"shared-data/schemas/famm_autonomous_speedrun_harness_receipt.schema.json","title":"FAMM Autonomous Speedrun Harness Receipt","concepts":[{"name":"Autonomous Speedrun Harness","description":"Harness for autonomous scored experiments with source pattern tracking","type":"algorithm"},{"name":"Scored Experiments","description":"Array of experiment results scored by the harness","type":"receipt"},{"name":"Source Pattern","description":"Optional string identifying the generation pattern for the speedrun","type":"definition"}],"tags":["schema","famm","speedrun","harness","autonomous","experiment","receipt"],"layer":"core-formalism","dependencies":["FAMM","NUVMAP"],"summary":"Schema for autonomous speedrun harness receipts. Tracks scored experiments, harness configuration, and source patterns with NUVMAP projection."}
+{"file":"shared-data/schemas/famm_bjw_geodesic_cleanup_receipt.schema.json","title":"FAMM Builder-Judge-Warden Geodesic Cleanup Receipt","concepts":[{"name":"BJW Geodesic Cleanup","description":"Builder-Judge-Warden three-clock cleanup with accepted geodesic and rejected moves","type":"protocol"},{"name":"Accepted Geodesic","description":"Array of accepted cleanup moves along the geodesic path","type":"receipt"},{"name":"Rejected Moves","description":"Array of moves rejected during BJW cleanup","type":"receipt"},{"name":"Source Object Hash","description":"SHA-256 of the object before cleanup","type":"receipt"},{"name":"Final Object Hash","description":"SHA-256 of the object after cleanup","type":"receipt"},{"name":"Exact Receipt","description":"Embedded exact receipt for the cleanup operation","type":"receipt"}],"tags":["schema","famm","bjw","geodesic","cleanup","builder-judge-warden","receipt"],"layer":"core-formalism","dependencies":["FAMM","Builder","Judge","Warden"],"summary":"Schema for BJW geodesic cleanup receipts. Records accepted geodesic path, rejected moves, source/final object hashes, and exact receipt with cleanup metrics."}
+{"file":"shared-data/schemas/famm_braidstorm_sidon_crossing_receipt.schema.json","title":"FAMM BraidStorm Sidon Crossing Receipt","concepts":[{"name":"BraidStorm Sidon Crossing","description":"8-strand braid topology with Sidon label assignment for collision-free crossing addresses","type":"algorithm"},{"name":"Sidon Labels","description":"Powers of 2 (1,2,4,8,16,32,64,128) giving collision-free pairwise sums","type":"primitive"},{"name":"Address Budget","description":"Maximum label value available for Sidon set construction","type":"definition"},{"name":"Address Mode","description":"String specifying how addresses are assigned (e.g., powers_of_2)","type":"definition"},{"name":"Capacity","description":"Object tracking Sidon slack and label utilization","type":"receipt"},{"name":"Validation","description":"Object with crossing validation results","type":"receipt"}],"tags":["schema","famm","braidstorm","sidon","crossing","labels","receipt"],"layer":"core-formalism","dependencies":["FAMM","BraidStorm","Sidon","NUVMAP"],"summary":"Schema for BraidStorm Sidon crossing receipts. Tracks strand count, address budget, Sidon labels (powers of 2), capacity, and crossing validation with NUVMAP projection."}
+{"file":"shared-data/schemas/famm_golden_braid_centering_receipt.schema.json","title":"FAMM Golden Braid Centering Receipt","concepts":[{"name":"Golden Braid Centering","description":"Contraction toward eigensolid using φ⁻¹ = 0x00009E70 golden ratio","type":"algorithm"},{"name":"Golden Ratio φ","description":"φ = (1+√5)/2 used for strand contraction centering","type":"primitive"},{"name":"Inverse Phi","description":"φ⁻¹ = 0x00009E70 in Q16_16 fixed-point representation","type":"primitive"},{"name":"Center","description":"Array of center coordinates for the braid contraction","type":"definition"},{"name":"Strand Receipts","description":"Array of per-strand convergence receipts","type":"receipt"},{"name":"Multi-Strand","description":"Object tracking multi-strand convergence state","type":"receipt"}],"tags":["schema","famm","golden-ratio","braid","centering","eigensolid","receipt"],"layer":"core-formalism","dependencies":["FAMM","Golden Ratio","BraidStorm"],"summary":"Schema for golden braid centering receipts. Tracks φ and φ⁻¹ in Q16_16, center coordinates, per-strand convergence, and multi-strand state for eigensolid contraction."}
+{"file":"shared-data/schemas/famm_hessian_curvature_receipt.schema.json","title":"FAMM Hessian Curvature Receipt","concepts":[{"name":"Hessian Curvature","description":"Lanczos-based Hessian eigenvalue computation for curvature analysis","type":"algorithm"},{"name":"Lanczos Iteration","description":"K-step Lanczos algorithm computing top-k eigenvalues and Ritz residuals","type":"algorithm"},{"name":"Spectral Density","description":"Gaussian-broadened spectral density estimate from eigenvalues","type":"receipt"},{"name":"Trace Estimate","description":"Stochastic trace estimate with standard error","type":"receipt"},{"name":"Route Decision","description":"Routing decision derived from Hessian spectral analysis","type":"receipt"},{"name":"Basis Layer HESSIAN_EIGEN","description":"Constant identifying this as a Hessian eigenvalue basis layer","type":"definition"}],"tags":["schema","famm","hessian","curvature","lanczos","eigenvalue","spectral-density","receipt"],"layer":"core-formalism","dependencies":["FAMM","Lanczos"],"summary":"Schema for Hessian curvature receipts. Records Lanczos eigenvalue computation, spectral density, trace estimates, and route decisions with no-drift boundary."}
+{"file":"shared-data/schemas/famm_logogram_chirality_witness.schema.json","title":"FAMM Logogram Chirality Witness","concepts":[{"name":"Logogram Chirality","description":"Chirality witness for Omindirection logogram atoms with direction, handedness, and phase","type":"primitive"},{"name":"Chirality Witness","description":"Object with direction, handedness, phase, placement, and mode fields","type":"receipt"},{"name":"Residual Policy","description":"String policy governing residual handling for the logogram","type":"gate"},{"name":"Benefit Gate","description":"Object gate determining if the logogram chirality provides benefit","type":"gate"},{"name":"Symbol ID","description":"Unique identifier for the logogram symbol","type":"definition"},{"name":"Payload Hash","description":"SHA-256 hash of the logogram payload","type":"receipt"}],"tags":["schema","famm","logogram","chirality","omindirection","witness","receipt"],"layer":"core-formalism","dependencies":["FAMM","Omindirection"],"summary":"Schema for logogram chirality witnesses. Captures chirality direction/handedness/phase for Omindirection logogram atoms with residual policy and benefit gate."}
+{"file":"shared-data/schemas/famm_markovjunior_16d_shim_receipt.schema.json","title":"FAMM MarkovJunior 16D Shim Receipt","concepts":[{"name":"MarkovJunior 16D Shim","description":"MarkovJunior-style rewrite rules applied to 16D space with anchor points","type":"algorithm"},{"name":"Rewrite Rules","description":"Array of rule objects for the MarkovJunior grammar","type":"definition"},{"name":"Anchors","description":"Array of anchor point objects in 16D space","type":"definition"},{"name":"NUVMAP Projection","description":"NUVMAP object embedded in the shim receipt","type":"receipt"}],"tags":["schema","famm","markovjunior","16d","rewrite-rules","grammar","receipt"],"layer":"core-formalism","dependencies":["FAMM","MarkovJunior","NUVMAP"],"summary":"Schema for MarkovJunior 16D shim receipts. Records rewrite rules, anchor points in 16D space, and NUVMAP projection for grammar-based generation."}
+{"file":"shared-data/schemas/famm_nuvmap_delta_dag_receipt.schema.json","title":"FAMM NUVMAP Delta-DAG Search Receipt","concepts":[{"name":"NUVMAP Delta-DAG Search","description":"Delta-stream DAG search on NUVMAP projections with compression estimates","type":"algorithm"},{"name":"Delta Stream","description":"SHA-256 of the delta-encoded stream for the DAG search","type":"receipt"},{"name":"Compression Estimate","description":"Object with compression ratio and method estimates","type":"receipt"},{"name":"DAG","description":"Directed acyclic graph object from the search","type":"receipt"},{"name":"Problem Hash","description":"SHA-256 of the problem instance","type":"receipt"},{"name":"Route Rule Hash","description":"SHA-256 of the routing rule applied","type":"receipt"},{"name":"Projection Level","description":"String identifying the NUVMAP projection level used","type":"definition"}],"tags":["schema","famm","nuvmap","delta-dag","search","compression","receipt"],"layer":"core-formalism","dependencies":["FAMM","NUVMAP","DAG"],"summary":"Schema for NUVMAP delta-DAG search receipts. Tracks problem/route-rule hashes, projection level, solution, compression estimates, and delta stream SHA-256."}
+{"file":"shared-data/schemas/famm_plasma_chiral_drag_witness_receipt.schema.json","title":"FAMM Plasma Chiral Drag Witness Receipt","concepts":[{"name":"Plasma Chiral Drag","description":"Chiral drag witness from plasma model with source model, inputs, and derived quantities","type":"receipt"},{"name":"Source Model","description":"String identifying the plasma model used (e.g., magneto-plasma)","type":"definition"},{"name":"Derived Quantities","description":"Object with derived physical quantities from the plasma simulation","type":"receipt"},{"name":"Packet","description":"Object with the encoded packet representation","type":"receipt"},{"name":"FAMM State","description":"FAMM object embedded in the plasma witness receipt","type":"receipt"}],"tags":["schema","famm","plasma","chiral-drag","physics","witness","receipt"],"layer":"core-formalism","dependencies":["FAMM","MagnetoPlasma"],"summary":"Schema for plasma chiral drag witness receipts. Records source plasma model, input parameters, derived quantities, FAMM state, and encoded packet."}
+{"file":"shared-data/schemas/famm_semantic_mass_route_plow_receipt.schema.json","title":"FAMM Semantic Mass Route Plow Receipt","concepts":[{"name":"Semantic Mass Route Plow","description":"Route plowing through semantic mass with z-domain analysis and ranked routes","type":"algorithm"},{"name":"Basis Layers","description":"Array of basis layer identifiers contributing to semantic mass","type":"definition"},{"name":"Mass Stream","description":"Object with the semantic mass stream data","type":"receipt"},{"name":"Z-Domain","description":"Object with z-transform domain analysis of the mass stream","type":"receipt"},{"name":"Ranked Routes","description":"Array of route objects ranked by semantic mass","type":"receipt"},{"name":"Closure Recommendation","description":"Object with closure recommendation based on mass analysis","type":"gate"},{"name":"Residual Seal","description":"Object sealing the residual after route plowing","type":"receipt"}],"tags":["schema","famm","semantic-mass","route","z-domain","plow","receipt"],"layer":"core-formalism","dependencies":["FAMM","Semantic Mass","NUVMAP"],"summary":"Schema for semantic mass route plow receipts. Records basis layers, mass stream, z-domain analysis, ranked routes, closure recommendation, and residual seal."}
+{"file":"shared-data/schemas/famm_semantic_mass_z_receipt.schema.json","title":"FAMM Semantic Mass Z Receipt","concepts":[{"name":"Semantic Mass Z Transform","description":"Z-transform analysis of semantic mass with AR coefficients and pole locations","type":"algorithm"},{"name":"AR Coefficients","description":"Autoregressive model coefficients for the mass sequence","type":"receipt"},{"name":"Poles","description":"Array of pole objects from the z-transform analysis","type":"receipt"},{"name":"Residual","description":"Object with residual analysis after AR fitting","type":"receipt"},{"name":"Route Decision","description":"Routing decision derived from z-domain pole analysis","type":"receipt"},{"name":"Basis Layer MASS_Z_ACCEL","description":"Constant identifying this as a mass z-acceleration basis layer","type":"definition"}],"tags":["schema","famm","semantic-mass","z-transform","AR-model","poles","receipt"],"layer":"core-formalism","dependencies":["FAMM","Semantic Mass"],"summary":"Schema for semantic mass z-transform receipts. Records AR order, coefficients, poles, residual, and route decisions from z-domain analysis of semantic mass streams."}
+{"file":"shared-data/schemas/famm_sidon_map_receipt.schema.json","title":"FAMM Sidon Map Receipt","concepts":[{"name":"Sidon Map","description":"Receipt verifying a set is Sidon (all pairwise sums unique)","type":"receipt"},{"name":"Sidon Set","description":"Set of integers where all pairwise sums are distinct","type":"primitive"},{"name":"Pair Sums","description":"Array of pairwise sum objects from the set","type":"receipt"},{"name":"Collisions","description":"Array of collision objects (should be empty for valid Sidon sets)","type":"receipt"},{"name":"Is Sidon","description":"Boolean verification that no pairwise sum collisions exist","type":"gate"}],"tags":["schema","famm","sidon","set-theory","pairwise-sums","verification","receipt"],"layer":"core-formalism","dependencies":["FAMM","Sidon"],"summary":"Schema for Sidon map receipts. Verifies a set has all unique pairwise sums, recording the set, pair sums, collisions, and is_sidon boolean gate."}
+{"file":".mcp.json","title":"MCP Server Configuration","concepts":[{"name":"MCP Configuration","description":"Model Context Protocol client configuration for OpenCode in Research Stack","type":"architecture"},{"name":"Filesystem MCP","description":"Read/write proof artifacts, Lean kernels, and receipts","type":"tool"},{"name":"Git MCP","description":"Git history navigation: diff, blame, log","type":"tool"},{"name":"Fetch MCP","description":"HTTP fetch for docs, RFCs, release notes","type":"tool"},{"name":"ContextStream MCP","description":"Persistent memory/context/search with workspace and project IDs","type":"tool"},{"name":"Lean MCP","description":"Lean 4 / Mathlib typecheck bridge via lakefile","type":"tool"},{"name":"Remote Lean Proof MCP","description":"Hermes/OpenCode/Codex proof backend via remote server","type":"tool"},{"name":"SymPy MCP","description":"Symbolic verification of arithmetic claims","type":"tool"},{"name":"Wolfram Alpha MCP","description":"Wolfram Alpha symbolic verification (requires WOLFRAM_APP_ID)","type":"tool"},{"name":"AWS MCP","description":"AWS API access via boto3 credential chain","type":"tool"},{"name":"GitHub MCP","description":"GitHub API via Copilot endpoint with PAT auth","type":"tool"},{"name":"Headroom MCP","description":"Headroom token/context compression proxy","type":"tool"},{"name":"Google Drive MCP","description":"Google Drive search, read, list files, calendar, docs, sheets","type":"tool"}],"tags":["config","mcp","tooling","contextstream","lean","wolfram","headroom"],"layer":"infrastructure","dependencies":[],"summary":"MCP client configuration defining 12 servers: filesystem, git, fetch, contextstream, lean, remote-lean-proof, sympy, wolfram-alpha, aws, github, headroom, and google-drive."}
+{"file":"pyproject.toml","title":"Research Stack Python Project Configuration","concepts":[{"name":"Research Stack Python Project","description":"Python project definition with optional dependency groups for quantum, GPU, compute, DB, and pipeline","type":"architecture"},{"name":"Quantum Dependencies","description":"perceval-quandela, quimb, opt_einsum, cirq, qiskit, qiskit-aer","type":"definition"},{"name":"GPU Dependencies","description":"wgpu for WebGPU compute","type":"definition"},{"name":"Compute Dependencies","description":"ray, networkx, scipy, numpy for distributed and numerical compute","type":"definition"},{"name":"DB Dependencies","description":"psycopg2, boto3, gremlinpython, pymysql for database access","type":"definition"},{"name":"Pipeline Dependencies","description":"reedsolo, cryptography, highspy, requests, pandas, xxhash, pyserial for data pipeline","type":"definition"}],"tags":["config","python","dependencies","quantum","gpu","compute","database","pipeline"],"layer":"infrastructure","dependencies":[],"summary":"Python project configuration with 5 optional dependency groups: quantum (Perceval/Cirq/Qiskit), GPU (wgpu), compute (Ray/NetworkX/SciPy), DB (PostgreSQL/Gremlin), and pipeline (Reed-Solomon/HiGHS)."}
+{"file":"flake.nix","title":"Research Stack Nix Flake — Dev Container + NixOS Topology","concepts":[{"name":"Nix Flake","description":"Nix flake defining dev-container image and NixOS topology for Research Stack","type":"architecture"},{"name":"Dev Container Image","description":"Layered OCI image (research-stack-otom:latest) with Python, Lean, R, Sage, LaTeX, CAD tools","type":"architecture"},{"name":"Python Environment","description":"Python 3.11 with 40+ packages: AWS, PostgreSQL, FastAPI, BioPython, NetworkX, NumPy, SciPy, SymPy, Z3, Pandas, Polars, scikit-learn","type":"definition"},{"name":"R Environment","description":"R with tidyverse, ggplot2, MASS, survival, knitr","type":"definition"},{"name":"Dev Packages","description":"git, bash, ripgrep, jq, Node.js 20, elan (Lean 4), PostgreSQL 16, gnuplot, maxima, octave, sage, typst, texliveFull","type":"definition"},{"name":"Researcher User","description":"Non-root user (UID 1000) with home at /home/researcher","type":"definition"},{"name":"NixOS 24.11","description":"Pinned nixpkgs channel for reproducible builds","type":"definition"}],"tags":["config","nix","devcontainer","OCI","python","lean","R","sage","latex","reproducibility"],"layer":"infrastructure","dependencies":[],"summary":"Nix flake building a layered OCI dev container with Python 3.11 (40+ packages), Lean 4 (elan), R (tidyverse), SageMath, LaTeX, gnuplot, and maxima. Defines researcher user and reproducible PATH."}
+{"file":"Containerfile","title":"Research Stack Containerfile (Alpine)","concepts":[{"name":"Alpine Container","description":"Lightweight Alpine 3.19 container with bash, build-base, Node.js, Python 3","type":"architecture"},{"name":"UV Package Manager","description":"uv installed via pipx for fast Python package management","type":"tool"},{"name":"Researcher User","description":"Non-root user (UID 1000) created with adduser","type":"definition"},{"name":"Python Venv","description":"UV-managed Python 3.11.15 venv with biopython, networkx, pycryptodome, zstandard, z3-solver, PyWavelets","type":"definition"}],"tags":["config","container","alpine","python","uv","devcontainer"],"layer":"infrastructure","dependencies":[],"summary":"Alpine-based Containerfile for Research Stack. Installs bash, Node.js, Python 3, uv, creates researcher user, and sets up Python 3.11.15 venv with scientific packages."}
+{"file":".pre-commit-config.yaml","title":"Research Stack Pre-Commit Configuration","concepts":[{"name":"Pre-Commit Hooks","description":"Math-first guardrails running on every commit: JSON/YAML validation, private key detection, schema validation","type":"gate"},{"name":"DeepSeek Receipt Schema Validation","description":"Validates *.receipt.json against deepseek-review-receipt.schema.json","type":"gate"},{"name":"Claims Registry Schema Validation","description":"Validates claims.yaml against claims-registry.schema.json and checks repo-relative paths exist","type":"gate"},{"name":"Receipt-Required-for-Math-Content","description":"Requires DeepSeek receipt or Lean proof when math-track files are committed","type":"gate"},{"name":"Math-First Contract Enforcement","description":"Commit-time enforcement that math content has backing evidence","type":"protocol"},{"name":"Detect Private Key","description":"Built-in hook preventing private keys from being committed","type":"gate"}],"tags":["config","pre-commit","guardrails","math-first","schema-validation","CI"],"layer":"governance","dependencies":["claims-registry.schema.json","deepseek-review-receipt.schema.json"],"summary":"Pre-commit configuration with 6 hooks: JSON/YAML validation, trailing whitespace, private key detection, DeepSeek receipt schema validation, claims registry validation, and math-content evidence requirement."}
+{"file":"pyrochlore_sidon_receipt_v2.json","title":"Pyrochlore Sidon Receipt v2","concepts":[{"name":"Pyrochlore Sidon Analysis","description":"S=1 tetrahedron with Sidon edge labels {3,5,9,6,10,12} — exact diagonalization spectrum","type":"receipt"},{"name":"Sidon Edge Labels","description":"Edge sums {3,5,9,6,10,12} with Sidon addresses {1,2,4,8} for tetrahedron","type":"primitive"},{"name":"Exact S1 Spectrum","description":"Ground state energy -4J, degeneracy 3, first excited gap 1J, specific heat max at T=0.317J","type":"receipt"},{"name":"FAMM Scar Pressure","description":"Scar equation tracking frustration: scar_ij(t+1) = γ·scar_ij(t) + |S_i·S_j + 0.5|₊ - κ·repair_ij(t)","type":"algorithm"},{"name":"Pist Color Classification","description":"RRC shape classification: NoiseFloor at 10% closure, SignalShapedRouteCompiler at Cv max","type":"gate"},{"name":"S-Dependence Trend","description":"Lower S → stronger quantum fluctuations → higher scar pressure → more frustrated","type":"invariant"},{"name":"Material Comparison","description":"KMMC S=5/2 (15% closure) vs NaCaNi₂F₇ S=1 (90% continuum) — Sidon prediction matches","type":"receipt"},{"name":"Classical Limit","description":"P(L) integral closure = 15% at L_c ≈ 1.09 — Sidon geometric bound","type":"theorem"},{"name":"Thermodynamic Closure Fractions","description":"5%, 10%, 15%, 20%, 25% closure fractions at corresponding T/J values","type":"receipt"}],"tags":["receipt","pyrochlore","sidon","tetrahedron","exact-diagonalization","scar-pressure","thermodynamics","RRC"],"layer":"core-formalism","dependencies":["Sidon","FAMM","PIST","RRC"],"summary":"Pyrochlore tetrahedron exact diagonalization receipt with Sidon edge labels. Records S=1 spectrum, scar pressure equation, PIST color classification, material comparison (KMMC vs NaCaNi₂F₇), and S-dependence trend predicting >92% fluctuation for S=1/2."}
+{"file":"shared-data/artifacts/capability_probe_receipt_2026-06-21.json","title":"Capability Probe Receipt (2026-06-21)","concepts":[{"name":"Capability Probe","description":"9-probe receipt testing quantum, optimization, and compute slot availability","type":"receipt"},{"name":"Photonic SLOs","description":"Perceval-Quandela photonic simulation — BS probabilities verified","type":"receipt"},{"name":"Bosonic Tensor Network","description":"Quimb tensor network contraction — 2-tensor contraction verified","type":"receipt"},{"name":"QAOA Cirq","description":"Cirq quantum approximate optimization — 1-qubit simulation verified","type":"receipt"},{"name":"QAOA Qiskit","description":"Qiskit quantum simulation — 2 distinct outcomes verified","type":"receipt"},{"name":"MIP HiGHS","description":"HiGHS LP solver — obj=-6.0, x=[2.0,2.0] verified","type":"receipt"},{"name":"Continuous SciPy","description":"SciPy optimization — minimization verified","type":"receipt"},{"name":"Graph NetworkX","description":"NetworkX graph analysis — K_5 diameter=1 verified","type":"receipt"},{"name":"GPU wgpu","description":"WebGPU compute via wgpu — RTX 4070 SUPER Vulkan adapter detected","type":"receipt"},{"name":"Tensor opt_einsum","description":"Optimized tensor contraction — GEMM path verified","type":"receipt"},{"name":"Directed Formulation Support","description":"QAP recommended (asymmetric MIP via HiGHS), QAOA not recommended (symmetry loss)","type":"gate"}],"tags":["receipt","capability-probe","quantum","optimization","GPU","tensor","wgpu","HiGHS"],"layer":"infrastructure","dependencies":["perceval-quandela","quimb","cirq","qiskit","highspy","scipy","networkx","wgpu","opt_einsum"],"summary":"Capability probe receipt from 2026-06-21. All 9 probes functional: Perceval photonic SLOs, Quimb bosonic TN, Cirq/Qiskit QAOA, HiGHS MIP, SciPy optimization, NetworkX graphs, wgpu GPU (RTX 4070 SUPER), opt_einsum tensor contraction."}
+{"file":"shared-data/artifacts/braid_diat_codec_benchmark.json","title":"Braid DIAT Codec Benchmark","concepts":[{"name":"Braid DIAT Codec","description":"Braid Dynamic Integer-Address Transform codec — 714.2 avg bytes, 0.029ms encode, 0.034ms decode","type":"receipt"},{"name":"MessagePack Baseline","description":"MessagePack baseline — 1747.8 avg bytes, 0.103ms encode, 0.002ms decode","type":"receipt"},{"name":"Cap'n Proto Baseline","description":"Cap'n Proto baseline — 29.0 avg bytes, 0.002ms encode, 0.0001ms decode","type":"receipt"},{"name":"Codec Comparison","description":"1000-frame benchmark: Braid DIAT is 2.45x smaller than MessagePack but 39x larger than Cap'n Proto","type":"receipt"},{"name":"DIAT","description":"Dynamic Integer-Address Transform — shell coordinate transform for codec encoding","type":"algorithm"}],"tags":["receipt","benchmark","codec","braid","DIAT","messagepack","capnproto","serialization"],"layer":"core-formalism","dependencies":["DIAT","BraidStorm"],"summary":"1000-frame benchmark comparing Braid DIAT codec against MessagePack and Cap'n Proto. DIAT achieves 2.45x compression over MessagePack (714 vs 1748 bytes) but Cap'n Proto is 24.6x smaller (29 bytes) with fastest encode/decode."}
+{"file":"6-Documentation/docs/specs/ENE_MEMORY_ATLAS_SPEC.md","title":"ENE Memory Atlas Spec","concepts":[{"name":"MemoryAtom","description":"Addressable memory record carrying voxel key, manifold coordinates, concept vector, scalar field, cryptographic seal, and body references","type":"primitive"},{"name":"Q0_16","description":"Signed pure-fraction fixed-point in [-1,1] used for scalar field values at memory atoms","type":"definition"},{"name":"ManifoldPoint","description":"MOIM Q8.8 five-dimensional identity point for concept addressing","type":"definition"},{"name":"ed25519 MMR","description":"Cryptographic signing and Merkle Mountain Range attestation for memory atoms","type":"protocol"},{"name":"BFT Trimvirate","description":"Byzantine fault-tolerant quorum requiring ≥2 of 3 nodes (warden, judge, hutter)","type":"protocol"},{"name":"dless_omega","description":"Conformal factor warping search metric from chi, kappa, sigma, lambda, eta components","type":"definition"},{"name":"lane_projection","description":"Three-lane (calculation, defense, verification) scalar projection of Q0_16 values","type":"architecture"}],"tags":["memory","atlas","distributed","cryptographic","fixed-point","manifold","BFT","MMR"],"layer":"infrastructure","dependencies":["FixedPoint","S3C"],"summary":"Defines the unified addressable memory surface for all LLMs in the stack, combining fractal hash, 5D manifold coordinates, signed Q0_16 scalar fields, and BFT attestation into a single MemoryAtom protocol."}
+{"file":"6-Documentation/docs/specs/ENE_HOTSWAP_PLUGIN_ARCHITECTURE.md","title":"ENE Hotswappable Plugin Architecture","concepts":[{"name":"Plugin Lifecycle","description":"8-phase plugin lifecycle: discover, load, admit, scan, plan, commit, verify, unload","type":"protocol"},{"name":"Plugin Manifest","description":"JSON declaration of plugin ID, version, surfaces, capabilities, and entrypoint","type":"spec"},{"name":"TiddlyWiki Bridge","description":"First frontline plugin that watches .tid files and upserts ENE packages per tiddler","type":"recipe"},{"name":"Settlement Policy","description":"Deterministic receipts for each write with dry-run mode and idempotent ingest","type":"gate"}],"tags":["plugin","architecture","ENE","TiddlyWiki","hotswap","settlement"],"layer":"infrastructure","dependencies":["ENE_MEMORY_ATLAS_SPEC"],"summary":"Defines a plugin architecture for ENE where new data surfaces can be attached, detached, audited, and upgraded without rewriting the core substrate, with TiddlyWiki as the first plugin."}
+{"file":"6-Documentation/docs/specs/EMBEDDED_NODE_SURFACE_SPEC.md","title":"Embedded Node Surface Specification","concepts":[{"name":"GCL nanokernel","description":"Smallest executable transition unit that admits work, routes state, checks recovery, and emits receipts","type":"primitive"},{"name":"Appliance Server Model","description":"Node operated as a sealed function rather than a general-purpose stack","type":"architecture"},{"name":"Builder/Warden/Judge phases","description":"Topology phases (constructive, inhibitory, adjudication) carried by the node surface","type":"definition"},{"name":"Recovery Health Endpoint","description":"Plain recovery endpoint available even if compressed API fails","type":"gate"},{"name":"GCL-Edge","description":"Constrained edge node whose primary job is hosting the GCL nanokernel","type":"architecture"}],"tags":["embedded","node","nanokernel","GCL","edge","appliance","recovery"],"layer":"infrastructure","dependencies":["GCL_TOPOLOGY_REVISION_SPEC","OMNITOKEN_GCL_REDESIGN"],"summary":"Defines a reusable embedded surface for low-resource nodes using a GCL nanokernel, keeping only local machinery to join the atlas, expose minimal API, recover itself, and mount external state."}
+{"file":"6-Documentation/docs/specs/DRIFT_QUARANTINE_YANG_MILLS_SPEC.md","title":"Drift Quarantine - Yang-Mills Spec","concepts":[{"name":"Quarantine Notice","description":"Spec quarantined for drift-based claims not supported by evidence","type":"gate"},{"name":"compressionRatio ≠ transmissionAvoidance","description":"Key invariant: Layer 3 can reduce transmission but does not make data smaller by itself","type":"invariant"},{"name":"effective_network_cost","description":"Corrected architecture equation: anchor_frequency × compressed_payload_size","type":"definition"}],"tags":["quarantine","yang-mills","drift","compression","correction"],"layer":"documentation","dependencies":[],"summary":"Quarantined specification containing unsupported claims about Yang-Mills feasibility, with corrected framing that separates lossless compression from transmission avoidance."}
+{"file":"6-Documentation/docs/specs/DP_TEXEL_8K_ENCODING_SPEC.md","title":"DisplayPort × NVENC Texel Stream Specification","concepts":[{"name":"8K60 Texel Transport","description":"DisplayPort 1.4a HBR3 carrying 8K@60Hz pseudo-frames with texel data","type":"spec"},{"name":"NVENC Multi-Session","description":"8 concurrent H.265 encode sessions for parallel data lanes","type":"architecture"},{"name":"FP16 Texel Packing","description":"2 bytes per texel doubling throughput to 800M texels/sec","type":"algorithm"},{"name":"PIST(k,t) encoding","description":"CUDA Core encoding PIST data into NUVMAP texel streams","type":"algorithm"}],"tags":["displayport","NVENC","8K","texel","hardware","GPU","encoding"],"layer":"hardware","dependencies":[],"summary":"Specifies 8K60 texel transport via DisplayPort 1.4a and NVENC hardware encoding, mapping soliton field parameters onto TMDS lanes with FP16 packing."}
+{"file":"6-Documentation/docs/specs/DP_RRC_RECEIPT_ENCODING_SPEC.md","title":"DP-RRC: Depth-Prefix Receipt Encoding","concepts":[{"name":"BraidReceipt","description":"6-dimension receipt: crossing matrix C, Sidon slack σ, step count k, residuals ε_seq, write time t, scar absence ∅","type":"receipt"},{"name":"BraidBracket","description":"Structure with lower, upper, gap, kappa, phi, admissible fields from PhaseVec","type":"definition"},{"name":"Sidon Labels","description":"Powers of 2 (1,2,4,8,16,32,64,128) as collision-free crossing addresses","type":"definition"},{"name":"DP-Expr Encoding","description":"Dot-prefixed depth markers as alternative to parentheses for tree-structured receipt data","type":"algorithm"},{"name":"receipt_invertible","description":"Lean theorem proving reconstruction from receipt is the definition of lossless compression","type":"theorem"}],"tags":["receipt","encoding","braid","sidon","compression","RRC","DP-expr"],"layer":"core-formalism","dependencies":["BraidEigensolid","AVMIsa.Emit","RRC.Emit"],"summary":"Defines depth-prefix encoding for RRC BraidReceipt structures using dot-prefixed depth markers, mapping the 6 receipt dimensions onto a compact tree-structured format."}
+{"file":"6-Documentation/docs/specs/DECODER_FACING_RECONSTRUCTION_CORE.md","title":"Decoder-Facing Reconstruction Core","concepts":[{"name":"Reconstruction Core","description":"Compressed representation that is not assembly but a decoder-facing reconstruction core","type":"architecture"},{"name":"Validity Rule","description":"Core valid only when Repair(Replay(K, Theta, Pi), R) == S and epsilon_byte = 0","type":"gate"},{"name":"Byte Law","description":"|D| + |K| + |Theta| + |Pi| + |R| + |Receipts| < |S|","type":"invariant"},{"name":"Interface Layers","description":"Five layers: human surface, proposal surface, reconstruction core, receipt surface, output surface","type":"architecture"},{"name":"ADMIT/HOLD/QUARANTINE","description":"Three-state gate for compression admission decisions","type":"gate"}],"tags":["compression","reconstruction","decoder","byte-law","admission","gate"],"layer":"core-formalism","dependencies":["LAW_GATED_RECONSTRUCTION_CORE_SHIFT"],"summary":"Defines the interface boundary for the compressed core where validity is established by deterministic replay, residual repair, receipts, and byte-exact output rather than readability."}
+{"file":"6-Documentation/docs/specs/CONTINUED_FRACTION_COMPRESSION_ADAPTATION.md","title":"Continued Fraction Compression Adaptation","concepts":[{"name":"Continued Fraction Encoding","description":"Rational values encoded as finite partial quotients for exact replay","type":"algorithm"},{"name":"CF Byte Law","description":"B(partial_quotients) + B(residual) < B(original value)","type":"invariant"},{"name":"Adaptable Math Surfaces","description":"Fibonacci ratios, golden-angle sampling, fixed-point thresholds, and branch-cut ratios as CF candidates","type":"definition"},{"name":"evalCf","description":"Replay recurrence for reconstructing numerator/denominator from partial quotients","type":"algorithm"}],"tags":["continued-fractions","compression","encoding","exact-arithmetic","ratios"],"layer":"core-formalism","dependencies":["FixedPoint"],"summary":"Adapts ratio-heavy Research Stack math to exact continued-fraction carriers for compression, encoding rational values as compact integer streams with exact replay."}
+{"file":"6-Documentation/docs/specs/CBF_Hardware_Spec.md","title":"Chromatic Braid Field (CBF) Hardware Specification","concepts":[{"name":"CBF Pipeline","description":"DIAT ∘ AMMR ∘ Bracket ∘ AVMR ∘ CMYK ∘ Rope/MIMO unified processing","type":"architecture"},{"name":"DIATLeaf","description":"Local tuple encoding with a, b, ab, a-b, residue, slot, parity, jitter","type":"definition"},{"name":"PhaseVec","description":"Phase vector (x,y) from DIAT Lift operation","type":"definition"},{"name":"Bracket Step","description":"Computes κ, φ, lower/upper/gap, admissibility from PhaseVec accumulation","type":"algorithm"},{"name":"CMYK Colorizer","description":"Maps to coherence, modulation, yield, constraint channels","type":"algorithm"}],"tags":["CBF","hardware","FPGA","braid","DIAT","AMMR","CMYK"],"layer":"hardware","dependencies":["DIAT","AMMR","AVMR"],"summary":"Unifies DIAT local tuple encoding, AMMR vector accumulation, bracket admissibility calculus, AVMR hierarchical strand aggregation, and CMYK channel decomposition into a single FPGA pipeline."}
+{"file":"6-Documentation/docs/specs/BurgersHarmonicPeelingVerification.md","title":"Burgers Harmonic Peeling — Witness Grammar Verification","concepts":[{"name":"FNWH","description":"Field decompilation into witness grammars via peeling","type":"algorithm"},{"name":"Viscosity Stiffening","description":"ν_eff = ν_0 (1 + Ω) trapping mechanism","type":"definition"},{"name":"Stiffening Factor","description":"κ = 0.3547 (35.47%) global bound safety margin","type":"definition"},{"name":"Brillouin Bound","description":"Gradient ceiling |∇u| ≤ ℏ k_max / m","type":"invariant"},{"name":"Witness Grammar","description":"Finite symbolic source code recovered from a field with carrier/texture roles","type":"definition"}],"tags":["burgers","FNWH","witness-grammar","viscosity","brillouin","verification"],"layer":"core-formalism","dependencies":["WitnessGrammar","CoulombComplexity","BHOCS","FAMM"],"summary":"Maps Burgers toy equations to witness grammars, verifying viscosity stiffening, quantum pressure regularization, solidification, phonon draining, and Brillouin zone bounds."}
+{"file":"6-Documentation/docs/specs/BERNOULLI_OCCUPANCY_RECEIPT_MATH.md","title":"Bernoulli Occupancy Receipt Math","concepts":[{"name":"Occupancy Frame","description":"Generic finite slot system with n slots, k throws, s target occupancy","type":"definition"},{"name":"Birthday Problem Generalization","description":"Shift from specific preselected slot to any slot having s hits","type":"algorithm"},{"name":"Expected Slot Formula","description":"E[X_s] = n * C(k,s) * (1/n)^s * (1-1/n)^(k-s)","type":"theorem"},{"name":"Collision Estimation","description":"Estimating expected collisions, survivor buckets, and candidate reuse across finite slots","type":"algorithm"}],"tags":["bernoulli","occupancy","birthday-problem","hash-collision","receipt","probability"],"layer":"core-formalism","dependencies":[],"summary":"Generalizes birthday-problem/hash-collision math into a reusable receipt primitive for estimating expected collisions, survivor buckets, and candidate reuse across finite slots."}
+{"file":"6-Documentation/docs/specs/AVM_CANONICAL_SPEC.md","title":"Canonical Specification for the Adaptive Virtual Machine (AVM)","concepts":[{"name":"AVM ISA","description":"Lean-only instruction set with finite opcodes, finite value types, deterministic step/run semantics","type":"architecture"},{"name":"Adapter Shims","description":"Extraction/interop targets that encode/decode AVM programs but do not define semantics","type":"architecture"},{"name":"Boundary Threshold","description":"δ ∈ [0,1] controlling semantic stripping from language-specific to invariant roots","type":"definition"},{"name":"Float Prohibition","description":"Float forbidden in AVM core and backends; only at external I/O boundary with immediate conversion","type":"invariant"},{"name":"Q0_16 Default","description":"Q0_16 as default for dimensionless scalars, Q16_16 only when range/precision forces it","type":"definition"}],"tags":["AVM","ISA","virtual-machine","lean","fixed-point","bytecode"],"layer":"core-formalism","dependencies":["FixedPoint"],"summary":"Defines AVM as a Lean-only ISA with finite opcodes, deterministic semantics, fixed-point arithmetic, and adapter shims for Python/Rust/Verilog extraction targets."}
+{"file":"6-Documentation/docs/specs/AUTOADAPTIVE_METATYPE_INVARIANTS.md","title":"Auto-Adaptive Metatyping System: Core Invariant Ruleset","concepts":[{"name":"Type Mass Conservation","description":"MetaType mass = t·(2k+1-t) preserved under all lawful type transformations","type":"invariant"},{"name":"Exponential Gate","description":"Type transformation doubling type space must solve E_solve ≥ 2^n","type":"invariant"},{"name":"7 Core Invariants","description":"Mass conservation, exponential gate, convergence, self-consistency, self-preservation, self-optimization, self-guarding","type":"definition"},{"name":"MetaType","description":"Type system that rewrites its own type rules based on runtime observation","type":"architecture"}],"tags":["metatyping","type-system","self-adaptive","invariants","PIST","AngrySphinx"],"layer":"core-formalism","dependencies":["PIST","AngrySphinx"],"summary":"Defines the minimum invariant ruleset for a type system that rewrites itself: mass conservation, exponential gating, convergence, and self-preservation."}
+{"file":"6-Documentation/docs/specs/ANGRYSPHINX_DONATED_CYCLE_GATE_SPEC.md","title":"AngrySphinx Donated-Cycle Gate Specification","concepts":[{"name":"Proof-of-Defense","description":"Web-facing layer where adversarial clients must spend local compute before receiving protected content","type":"protocol"},{"name":"Donated Cycles","description":"Client work is shaped so accepted proofs contribute to defender's gate calibration","type":"architecture"},{"name":"PoD Ledger","description":"Records accepted work, shell depth, attestation, and route metadata","type":"receipt"},{"name":"Challenge Engine","description":"Builds challenge payloads from policy, telemetry, and difficulty state","type":"architecture"},{"name":"S3 Shell Depth","description":"Tracks shell depth for exponential solve energy scaling","type":"definition"}],"tags":["AngrySphinx","security","proof-of-work","web-proxy","anti-bot","PQC"],"layer":"infrastructure","dependencies":["AngrySphinx"],"summary":"Defines a web-facing proof-of-defense layer where adversarial client compute is converted into defensive work, calibrated challenges, and auditable receipts."}
+{"file":"6-Documentation/docs/specs/INFORMATION_MANIFOLD_TAXONOMY.md","title":"Information Manifold Taxonomy","concepts":[{"name":"Information Manifold","description":"Triple (M, g, ∇) with smooth manifold, Fisher-Rao metric, and affine connection","type":"definition"},{"name":"Fisher-Rao Metric","description":"Unique Riemannian metric invariant under sufficient statistics (Chentsov's theorem)","type":"theorem"},{"name":"S1: Fisher-Geometric","description":"Statistical manifold with optional genus-3 topological constraint, torsion-free","type":"definition"},{"name":"S2: Alcubierre Warp","description":"2D submanifold chart (τ, H) for compression frontier analysis","type":"definition"},{"name":"S3: Sovereign Informatic","description":"Full manifold with anisotropic tensors, torsion landscape, hyperfluid phase field","type":"definition"},{"name":"S4: Behavioral MOIM","description":"Discrete lattice approximation with Genome18 addressing (262,144 states)","type":"definition"}],"tags":["information-manifold","Fisher-Rao","Riemannian","torsion","taxonomy","geometry"],"layer":"core-formalism","dependencies":["EntropyMeasures","FAMM"],"summary":"Defines the canonical taxonomy of the Information Manifold as four specializations (Fisher-Geometric, Alcubierre Warp, Sovereign Informatic, Behavioral MOIM) of one fundamental object."}
+{"file":"6-Documentation/docs/specs/HYDROGENIC_PHI_TORSION_BRAID.md","title":"Hydrogenic Phi-Torsion Braid","concepts":[{"name":"Fibonacci Spine","description":"Base exponential expansion r_base(theta) = r0 * exp(k * theta)","type":"definition"},{"name":"Hydrogenic 2s Constraint","description":"Topology-shape form of 2s radial wavefunction as geometric groove","type":"definition"},{"name":"Phi Torsion","description":"Logarithmic growth with phi = (1+sqrt(5))/2 creating spiral structure","type":"definition"},{"name":"Stair/Event Trace","description":"Parametric manifold exposing scale-delayed mass-number event cells","type":"architecture"}],"tags":["braid","phi","torsion","hydrogenic","fibonacci","manifold"],"layer":"core-formalism","dependencies":["FibonacciEncoding","GoldenAngleEncoding"],"summary":"Formalizes the hydrogenic Phi-torsion braid as a parametric manifold from Fibonacci spine through hydrogenic 2s constraint groove to Phi torsion and stair traces."}
+{"file":"6-Documentation/docs/specs/HUMAN_SURFACE_JSONL_SPEC.md","title":"Human Surface JSON-L Spec","concepts":[{"name":"Human Surface","description":"Any interface where a person, tool, model, device, or storage exposes state","type":"definition"},{"name":"JSON-L Envelope","description":"Append-only JSON event line for all human-facing surfaces","type":"spec"},{"name":"HS0-HS4 Layers","description":"Surface classes, JSON-L envelope, admission projection, Omnitoken mapping, shell/storage","type":"architecture"},{"name":"AngrySphinx Quarantine","description":"Default unknown-shell behavior preserving unknown surfaces as archive data","type":"gate"}],"tags":["JSONL","human-surface","envelope","append-only","admission","Omnitoken"],"layer":"infrastructure","dependencies":["OMNITOKEN_GCL_REDESIGN","EMBEDDED_NODE_SURFACE_SPEC"],"summary":"Defines one append-only JSON-L language for all human-facing surfaces that feed Omnitoken, GCL, ENE, RGFlow, and embedded node surfaces."}
+{"file":"6-Documentation/docs/specs/HDMI_Field_Encoding_Spec.md","title":"HDMI Field Encoding Specification","concepts":[{"name":"TMDS Lane Hijacking","description":"Repurposing HDMI TMDS lanes for soliton field parameter transport","type":"architecture"},{"name":"Control Period Abuse","description":"Data Island periods carry soliton topology metadata instead of audio/InfoFrames","type":"architecture"},{"name":"DDC Witness Exchange","description":"I2C channel repurposed for soliton attestation and ZK-STARK verification","type":"protocol"},{"name":"Pseudo-Frame","description":"1920×1080 mapped to 11-dimensional parameter matrix × soliton instances","type":"definition"}],"tags":["HDMI","TMDS","soliton","field-encoding","hardware","abuse-vector"],"layer":"hardware","dependencies":[],"summary":"Specifies physical layer hijacking of HDMI TMDS lanes to transport N-dimensional soliton field parameters, with DDC channel repurposed for witness exchange."}
+{"file":"6-Documentation/docs/specs/GEOMETRY_EMERGENCY_BOOT_WITNESS_2026-04-08.md","title":"Geometry Emergency Boot Witness","concepts":[{"name":"Geometric Encoding","description":"Recovery seed encoded across spatial geometry, capacitance values, interconnect topology, and physical dimensions of graphene supercapacitors","type":"architecture"},{"name":"6502 Design Philosophy","description":"Self-powered calculator architecture with solar panels and calculator-like efficiency","type":"architecture"},{"name":"EM Neutrality","description":"Embedded optical fiber instead of electrical traces for complete electromagnetic neutrality","type":"invariant"},{"name":"AEM20940 Energy Harvesting","description":"60mV cold-start harvesting from ambient energy","type":"recipe"},{"name":"Seed Assembly","description":"Multi-dimensional geometry collapse to 128-bit seed for emergency recovery","type":"algorithm"}],"tags":["emergency-boot","graphene","supercapacitor","hardware","recovery","geometry-encoding"],"layer":"hardware","dependencies":["TINY_IP_CONTIKI_SURFACE_SPEC"],"summary":"Defines a minimal hardware-rooted recovery mechanism where graphene supercapacitor geometric arrangement encodes a recovery seed for emergency boot."}
+{"file":"6-Documentation/docs/specs/GENSIS_COMPILER_SPEC.md","title":"GENSIS Compiler Specification","concepts":[{"name":"Q0_64","description":"64-bit unsigned fixed-point type for [0,1) with 2^-64 precision","type":"definition"},{"name":"Matryoshka Brane Stack","description":"Nested reality shells from quantum foam to universe, each with native dimensionality","type":"architecture"},{"name":"AngrySphinx Gate","description":"Exponential energy gate at every shell boundary","type":"gate"},{"name":"Saturating Arithmetic","description":"All Q0_64 operations stay in [0,1) with saturation on overflow","type":"invariant"}],"tags":["GENSIS","compiler","Q0_64","matryoshka","brane","AngrySphinx","scalar"],"layer":"core-formalism","dependencies":["FixedPoint","AngrySphinx"],"summary":"Defines the GENSIS compiler transforming arbitrary data through a Matryoshka Brane Stack with Q0_64 0D scalar as universal lingua franca and AngrySphinx gates at every boundary."}
+{"file":"6-Documentation/docs/specs/GCL_TOPOLOGY_REVISION_SPEC.md","title":"GCL Topology Revision Spec","concepts":[{"name":"GCL Topology Contract","description":"GCL as topology contract: observe→bind→route→sigma_check→policy→dag→verify→receipt","type":"protocol"},{"name":"Builder/Warden/Judge Phases","description":"Three topology phases (constructive, inhibitory, adjudication) in one surface","type":"definition"},{"name":"Canonical Gate","description":"Every route/compression/hardware/recovery passes through the same OBSERVE→RECEIPT gate","type":"gate"},{"name":"Route-Prior Sources","description":"8 surface families: sequence, GCL motif, informaton, MS3C, hardware, node, fractal fold, meta-autotype","type":"definition"},{"name":"FAMM Scar","description":"Failure record used for remembering and downranking similar routes","type":"receipt"}],"tags":["GCL","topology","gate","route-prior","phases","admission"],"layer":"core-formalism","dependencies":["GCL_FIELD_EQUATIONS_SPEC"],"summary":"Revises GCL from a carrier-specific language to a topology contract with canonical gate, route-prior sources, and builder/warden/judge as topology phases."}
+{"file":"6-Documentation/docs/specs/GCL_FIELD_EQUATIONS_SPEC.md","title":"GCL Field Equations Spec","concepts":[{"name":"Candidate Surface Object","description":"x = (A, W, R, O, K) with alphabet, bits/symbol, role flags, operation flags, closure kind","type":"definition"},{"name":"Field Interaction","description":"Surface→metaprobe→field→RGFlow→LUT→finite GCL codon pipeline","type":"algorithm"},{"name":"Smallest Lawful Surface","description":"What is the smallest lawful surface that preserves the useful structure?","type":"invariant"},{"name":"Possibility Space Probe","description":"Discovers candidate computational surfaces across sequence substrates","type":"algorithm"}],"tags":["GCL","field-equations","surface","LUT","admission","RGFlow"],"layer":"core-formalism","dependencies":["GCL_TOPOLOGY_REVISION_SPEC"],"summary":"Defines field equations for GCL surface combination, compression, adaptation, and admission across sequence substrates, GCL motifs, and informaton surfaces."}
+{"file":"6-Documentation/docs/specs/GCCL_ENCODING_CONTRACT.md","title":"GCCL Encoding Contract","concepts":[{"name":"GCCL","description":"Geometric, Cognitive, and Compression Law — the law layer deciding transformation admissibility","type":"definition"},{"name":"Seven Law Surfaces","description":"Geometric, Cognitive, Compression, Residual, Cost, Scale, Receipt","type":"definition"},{"name":"UMUP-lambda","description":"M = (S, T, I, R, K, P, Q, Lambda) encoding tuple for GCCL transitions","type":"definition"},{"name":"LawAxis","description":"Inductive type with 7 axes: geometric, cognitive, compression, residual, cost, scale, receipt","type":"definition"}],"tags":["GCCL","encoding","law","admission","transitions","receipt"],"layer":"core-formalism","dependencies":[],"summary":"Defines GCCL as the law layer encoding transitions through seven law surfaces (geometric, cognitive, compression, residual, cost, scale, receipt) wrapped in UMUP-lambda tuples."}
+{"file":"6-Documentation/docs/specs/FORWARD_FOUNDATION_EQUATION_COMPILER.md","title":"Forward Foundation Equation Compiler","concepts":[{"name":"Foundation Kernel","description":"F0 = {O4, SD, MN, gamma_star, H_dV, Omega, Lambda, A} root equation set","type":"definition"},{"name":"Forward Admissibility","description":"No backward trust chain — only forward admissible generation from foundation kernel","type":"invariant"},{"name":"Shell Equation","description":"Equation atoms must compile from foundation kernel, closed under declared transform, with receipt","type":"gate"},{"name":"Origin Doctrine","description":"Origin may inspire; only closure admits","type":"invariant"}],"tags":["foundation","equation","compiler","forward","admission","kernel"],"layer":"core-formalism","dependencies":[],"summary":"Defines the forward foundation equation compiler where trusted equation objects must be generated forward from the foundation kernel, closed under declared transforms, and accompanied by receipts."}
+{"file":"6-Documentation/docs/specs/MS3C_NESTED_REDUCTION_GEAR_SPEC.md","title":"MS3C-RG: Matroska S3C Nested Reduction Gear","concepts":[{"name":"Nested Shell Reducer","description":"Signed nested-shell route-prior geometry from S3C coordinates","type":"architecture"},{"name":"Gear Stack","description":"7 gears from raw coordinate shell through contra-rotation to GCL admission","type":"architecture"},{"name":"Contra-Rotation","description":"Gear that reverses shell rotation for boundary detection","type":"algorithm"},{"name":"Shear-Boundary Detector","description":"Detects phase transitions at shell boundaries","type":"algorithm"},{"name":"MatroskaCodon","description":"Compact shell descriptor encoding nested reduction state","type":"definition"}],"tags":["MS3C","S3C","matroska","reduction-gear","shell","routing"],"layer":"core-formalism","dependencies":["S3C","GCL_TOPOLOGY_REVISION_SPEC","FAMM"],"summary":"Defines the Matroska S3C Nested Reduction Gear as a signed nested-shell route-prior geometry system with 7-gear stack from raw coordinates through GCL admission."}
+{"file":"6-Documentation/docs/specs/MORPHIC_NEURAL_NETWORK_ROUTING_SPEC.md","title":"Morphic Neural Network Routing Layer","concepts":[{"name":"MNN Routing","description":"Low-level adaptive routing between LUT admission and GCL codons","type":"architecture"},{"name":"Morphic Topology","description":"Topology that reshapes based on current manifold state, not fixed routing tables","type":"definition"},{"name":"Goal-Aware Routing","description":"Routes based on packet goal, node state, carrier conditions, recovery pressure, cost","type":"algorithm"},{"name":"Cost-Aware","description":"Every routing decision minimizes total cost (energy, time, bandwidth, recovery)","type":"invariant"}],"tags":["MNN","routing","adaptive","morphic","LUT","GCL"],"layer":"infrastructure","dependencies":["OMNITOKEN_GCL_REDESIGN"],"summary":"Defines a morphic neural network routing layer that adaptively reshapes paths from LUT admission to GCL actions based on goals, state, carrier conditions, and cost."}
+{"file":"6-Documentation/docs/specs/LLM_REFINEMENT_PROTOCOL.md","title":"LLM Refinement Protocol","concepts":[{"name":"Refinement Loop","description":"7-step protocol: table expansion, lens sweep, glossary lock, primitive compression, residual audit, test hook, warden pass","type":"protocol"},{"name":"Lens Sweep","description":"Running concept through multiple charts: hostile scientist, patent examiner, systems engineer, etc.","type":"algorithm"},{"name":"Primitive Compression","description":"Collapse concept into four keeper primitives: field, shear, packet, spectral","type":"algorithm"},{"name":"Warden Pass","description":"Ask what would make the claim false, what would upgrade it, what language hides uncertainty","type":"gate"}],"tags":["LLM","refinement","protocol","audit","lens-sweep","warden"],"layer":"documentation","dependencies":[],"summary":"Converts rough research ideas into stable, auditable refinement loops by forcing models to expose hidden dimensions, rotate lenses, lock vocabulary, compress to primitives, and audit residuals."}
+{"file":"6-Documentation/docs/specs/LAW_GATED_RECONSTRUCTION_CORE_SHIFT.md","title":"Law-Gated Reconstruction Core Shift","concepts":[{"name":"Reconstruction Core Shift","description":"Migration from route-prior accumulation to decoder-facing, law-gated reconstruction-core promotion","type":"architecture"},{"name":"Canonical Object","description":"S -> (K, Theta, R, Pi, Receipts) -> S_hat with hard gate Repair(Replay(K,Theta,Pi),R) == S","type":"definition"},{"name":"Byte Law Gate","description":"The only compression admission is counted bytes against raw bytes","type":"gate"},{"name":"Lowest-Cost Reconstruction Basis","description":"Find the lowest-cost reconstruction basis whose residual is cheap enough to repair byte-exactly","type":"algorithm"}],"tags":["reconstruction","law-gated","compression","shift","byte-law"],"layer":"core-formalism","dependencies":[],"summary":"Roadmap shift from route-prior accumulation to decoder-facing, law-gated reconstruction-core promotion where the compressed object is a decoder-facing reconstruction core."}
+{"file":"6-Documentation/docs/specs/LANGUAGE_SET_MANIFOLD_GRAPH_TYPING.md","title":"Language Set Manifold Graph Typing","concepts":[{"name":"Language Set Graph","description":"Typed nodes and edges representing an entire language/code-set graph","type":"definition"},{"name":"Density Markers","description":"Payload-relevant signals explaining unusually high information density in surface forms","type":"definition"},{"name":"RRC Admissibility","description":"RRC classifying a language family as reusable compression/projection surface","type":"gate"},{"name":"Surface Form vs Payload","description":"Glyphs/words are adapter views; canonical payload is typed graph plus replay law","type":"invariant"}],"tags":["language","graph-typing","RRC","density","morphology","compression"],"layer":"core-formalism","dependencies":["Rainbow Raccoon Compiler"],"summary":"Defines how entire language sets (conlangs, programming languages, formal systems) can be typed as manifold graphs for RRC compression and projection."}
+{"file":"6-Documentation/docs/specs/K3_COMPLIANT_NODE_STRUCTURE.md","title":"K3-Compliant Node Structure","concepts":[{"name":"K3 Compliance","description":"ENE mesh node with computational state bound to k=3 shell of S3C manifold","type":"definition"},{"name":"S3C Shell Boundaries","description":"k=3 shell: admissible energy 9 ≤ n < 16, throat at n=12","type":"definition"},{"name":"K3 Surface Coupling","description":"Topological coupling to K3 Surface Calabi-Yau manifold with χ=24","type":"definition"},{"name":"Throat Midpoint","description":"n=12 where a=b^0 giving isThroat=true as gravitational throat","type":"definition"}],"tags":["K3","S3C","node","topology","Calabi-Yau","shell"],"layer":"core-formalism","dependencies":["S3C","FixedPoint","NUVMATH"],"summary":"Details mathematical and software design for K3-compliant nodes where computational state is bound to the k=3 shell of S3C manifold, coupled to K3 Surface invariants."}
+{"file":"6-Documentation/docs/specs/OMNITOKEN_GCL_REDESIGN.md","title":"Omnitoken GCL Redesign","concepts":[{"name":"Omnitoken","description":"Scale-invariant 1D scalar → compressed LUT → lawful GCL codon","type":"architecture"},{"name":"OMNIsurface","description":"Takes local shape of whatever substrate it touches while preserving one internal meaning","type":"definition"},{"name":"OT0-OT4 Layers","description":"Codon vocabulary, frame, fragment/manifest, JupiterBox envelope, carrier binding","type":"architecture"},{"name":"JupiterBox","description":"Bounded carrier envelope for Omnitoken/GCL state","type":"architecture"}],"tags":["Omnitoken","GCL","scalar","LUT","codon","redesign"],"layer":"infrastructure","dependencies":["GCL_TOPOLOGY_REVISION_SPEC","GCL_FIELD_EQUATIONS_SPEC"],"summary":"Redesigns Omnitoken as an OMNIsurface language taking the shape of whatever substrate it touches while preserving one internal scalar/LUT meaning admitted by GCL."}
+{"file":"6-Documentation/docs/specs/OMINDIRECTION_LOGOGRAM_DESIGN_AND_COMPILER.md","title":"Omindirection Logogram Design and Compiler","concepts":[{"name":"Omindirectional Atom","description":"Oriented, placed, receipted symbolic atom with payload, identity, orientation, phase, position, status","type":"definition"},{"name":"Nine First Principles","description":"Payload≠presentation, direction≠handedness, chirality=phase projection, position=state, etc.","type":"invariant"},{"name":"Phase as Cyclic","description":"Chirality classes derived from cyclic phase in Z/360Z","type":"definition"},{"name":"Residual Policy","description":"Explicit declaration of what was lost and why projection was trusted or rejected","type":"gate"}],"tags":["logogram","omindirection","symbolic","atom","orientation","phase"],"layer":"core-formalism","dependencies":[],"summary":"Defines Omindirection as a system-agnostic contract for encoding symbolic payloads as oriented, placed, receipted atoms from first principles."}
+{"file":"6-Documentation/docs/specs/NII_CORE_DRIVER_IMPLEMENTATION_PLAN.md","title":"NII Core Surface Driver Implementation Plan","concepts":[{"name":"NII Core Driver","description":"Mathematically defendable surface driver leveraging system topology","type":"architecture"},{"name":"SSS Monitoring","description":"Steady-State Stability monitoring from Layer 6","type":"algorithm"},{"name":"Alcubierre Information Metric","description":"Warp-speed compression from Layer 7","type":"definition"},{"name":"TSM-VDP ISA","description":"128-bit RISC-V custom extension for topological state machine","type":"architecture"},{"name":"FAMM-aware Scheduling","description":"Scheduling based on frustration timing","type":"algorithm"}],"tags":["NII","driver","FPGA","TSM","FAMM","hardware","Lean"],"layer":"hardware","dependencies":["Canonical Core v1","TSM-VDP","CBF"],"summary":"Outlines implementation plan for a Lean-verified NII core surface driver with SSS monitoring, Alcubierre Information Metric, and FAMM-aware scheduling."}
+{"file":"6-Documentation/docs/specs/NII_CORE_DRIVER_COMPLETION_SUMMARY.md","title":"NII Core Surface Driver Completion Summary","concepts":[{"name":"Lean Formalization","description":"SurfaceDriver.lean with SSS, slip threshold, warp function, FAMM scheduler","type":"receipt"},{"name":"C Driver","description":"Linux kernel driver with Q16_16 arithmetic, SSS monitoring, FPGA Manager integration","type":"recipe"},{"name":"FPGA Bitstream","description":"Verilog with Q16_16 arithmetic units, SSS monitor, sigmoid approximation","type":"recipe"}],"tags":["NII","completion","Lean","C-driver","FPGA","verification"],"layer":"hardware","dependencies":["NII_CORE_DRIVER_IMPLEMENTATION_PLAN"],"summary":"Completion summary for NII Core Surface Driver with Lean formalization, C driver implementation, FPGA bitstream generation, and integration testing complete."}
+{"file":"6-Documentation/docs/specs/PROJECTABLE_GEOMETRY_COMPRESSOR_SPEC.md","title":"Projectable Geometry Compressor Spec","concepts":[{"name":"Projectable Geometry","description":"Shared projectable geometry + compact carrier symbols + bounded residual sidecars + rehydration receipts","type":"architecture"},{"name":"Projection Pipeline","description":"project→preserve→improve: map to lower-dim control basis, track displaced coordinates, amortize over corpus","type":"algorithm"},{"name":"Genus-3 Residual Boat","description":"12D residual lane with genus-3 geometric structure","type":"definition"},{"name":"DNA Carrier Substitution","description":"Using DNA-style encoding as compact carrier for projected geometry","type":"algorithm"},{"name":"Byte Law","description":"K(model) + K(residuals|model) < K(raw objects)","type":"invariant"}],"tags":["compression","geometry","projection","residual","carrier","DNA"],"layer":"core-formalism","dependencies":[],"summary":"Defines compression architecture turning large structured objects into shared projectable geometry, compact carrier symbols, bounded residual sidecars, and exact rehydration receipts."}
+{"file":"6-Documentation/docs/specs/PHI_S3C_PIST_BRIDGE_SPEC.md","title":"Phi-S3C-PIST Bridge Spec","concepts":[{"name":"Phi-S3C-PIST Bridge","description":"Connects Phi center to S3C shell coordinates and PIST witness transport","type":"bridge"},{"name":"Phi Correction Boundary","description":"Absolute cost vs relative efficiency distinction in Phi field","type":"definition"},{"name":"S3C Mass Boundary","description":"Closed mass (throat activation) vs open mass (next-shell tension) distinction","type":"definition"},{"name":"Phinary Indexing","description":"Zeckendorf-based irrational spacing and descent/address indexing","type":"algorithm"}],"tags":["phi","S3C","PIST","bridge","mass","phinary"],"layer":"core-formalism","dependencies":["UniversalField","S3C","PIST"],"summary":"Connects the Phi center to S3C shell coordinates and PIST witness transport, establishing correction boundaries and mass distinctions."}
+{"file":"6-Documentation/docs/specs/Oracle_Interrogation_IDPC_v0_1.md","title":"Oracle Interrogation IDPC v0.1","concepts":[{"name":"IDPC Operator","description":"Inverse Delta Phi over Cosine: coherence per phase displacement","type":"definition"},{"name":"IDPC Formula","description":"IDPC = cos(theta) / (DeltaPhi + epsilon)","type":"definition"},{"name":"Fallible Oracle","description":"Oracle useful because wrong answers can reveal deeper patterns, not because always right","type":"definition"},{"name":"Three Oracle Layers","description":"Literal answer layer, pattern-detection layer, invariant-extraction layer","type":"architecture"}],"tags":["IDPC","oracle","interrogation","coherence","phase","OTOM"],"layer":"core-formalism","dependencies":[],"summary":"Records the IDPC operator as part of the OTOM oracle-interrogation path, measuring coherence per phase displacement with fallible oracle readings."}
+{"file":"6-Documentation/docs/specs/Quaternion_Sidon_Standing_Field_v0_1.md","title":"Quaternion Sidon Standing Field v0.1","concepts":[{"name":"Quaternion Rotors","description":"Square-grid lattice with local SU(2)-like phase rotors","type":"definition"},{"name":"Sidon Pair Uniqueness","description":"Δq_ij = Δq_kl only for same unordered pair — anti-aliasing property","type":"invariant"},{"name":"Triangle-Wave Standing Field","description":"Cellular standing-flow update driving lattice dynamics","type":"definition"},{"name":"Pressure-Locking","description":"Extreme compression enabling paired collective modes","type":"definition"}],"tags":["quaternion","Sidon","lattice","standing-field","SU(2)","anti-aliasing"],"layer":"core-formalism","dependencies":[],"summary":"Records a speculative toy formalism of square-grid cellular lattice with quaternion spin/phase rotors, triangle-wave standing field, and Sidon pairwise uniqueness."}
+{"file":"6-Documentation/docs/specs/RECONSTRUCTION_CORE_MATH_REVIEW_2026_05_09.md","title":"Reconstruction Core Math Review","concepts":[{"name":"Stage Review","description":"17-stage consistency review of reconstruction core shift","type":"receipt"},{"name":"Three Separations","description":"counted byte law ≠ auxiliary score; ADMIT_FIXTURE ≠ ADMIT; glyph/prior ≠ payload truth","type":"invariant"},{"name":"Receipt Fields","description":"raw_hash, kernel_hash, theta_hash, protocol_hash, residual_hash, repaired_hash","type":"receipt"},{"name":"enwiki8/9 Probes","description":"Wiki-logogram, XML dictionary, receipt aggregation, dictionary amortization probes","type":"recipe"}],"tags":["math-review","reconstruction","consistency","byte-law","enwiki"],"layer":"documentation","dependencies":["LAW_GATED_RECONSTRUCTION_CORE_SHIFT"],"summary":"Stage-by-stage math consistency review after the law-gated reconstruction-core shift, confirming the core equation holds and identifying remaining caveats."}
+{"file":"6-Documentation/docs/specs/RESEARCH_STACK_NUVMAP_ADDRESS_SPACE.md","title":"Research Stack Address Space: Mountain on Mountains","concepts":[{"name":"NUVMAP","description":"Hierarchical meta-topological address space with 14-axis hyperbolic manifold","type":"architecture"},{"name":"Genome18","description":"Bit-exact 18-bit witness address from 6×3-bit bins","type":"definition"},{"name":"Matroska Shell Depth","description":"Recursive shell depth Sk representing conceptual distance from Core Formalism","type":"definition"},{"name":"Crystalline Core","description":"S0 root shell with m=1.0 maximum activation for OTOM core model","type":"definition"}],"tags":["NUVMAP","address-space","Genome18","MS3C","matroska","topology"],"layer":"infrastructure","dependencies":["MS3C_NESTED_REDUCTION_GEAR_SPEC"],"summary":"Defines the hierarchical meta-topological address space mapping projects/assets onto NUVMAP coordinates within 14-axis hyperbolic manifold."}
+{"file":"6-Documentation/docs/specs/SilverSight_Spec.md","title":"SilverSight Specification","concepts":[{"name":"SilverSight","description":"Clean-slate successor to Research Stack with stable IDs, Lean definitions, and receipts","type":"architecture"},{"name":"YaFF Schema/Layout/WireFormat","description":"Three separate Core modules: Schema gives size+well-formedness, Layout is encoding choice, WireFormat is certified encoder/decoder","type":"architecture"},{"name":"DynamicCanal","description":"Physical instantiation abstraction: 1-Wire, PCIe, DRAM, JSON all equivalent","type":"definition"},{"name":"Claim-State Ladder","description":"BEAUTIFUL_PROVISIONAL → CALIBRATED_ENGINEERING_DELTA → REVIEWED → VERIFIED","type":"gate"}],"tags":["SilverSight","clean-slate","YaFF","schema","layout","wire-format","Lean"],"layer":"core-formalism","dependencies":[],"summary":"Clean-slate successor keeping formally verified concepts, discarding duplication, re-expressing as substrate-agnostic compute fabric with stable IDs and receipts."}
+{"file":"6-Documentation/docs/specs/virtio_net_compute_fabric_spec.md","title":"Virtio-Net DMA Compute Fabric","concepts":[{"name":"Packet-as-Computation","description":"Ethernet is Math: packet headers are structural dimensions of computation state vector","type":"architecture"},{"name":"PistPacket","description":"Compute frame with Ethernet header + PIST computation header + Q16_16 payload","type":"definition"},{"name":"Toeplitz Transform","description":"RSS engine as hardware-accelerated binary matrix-vector convolution","type":"algorithm"},{"name":"Ring Buffer Transport","description":"virtio-net TX/RX rings as lock-free compute transport","type":"architecture"}],"tags":["virtio-net","DMA","PIST","compute-fabric","Ethernet","Toeplitz"],"layer":"infrastructure","dependencies":["PIST"],"summary":"Specifies treating virtualized Ethernet networking as high-throughput zero-copy packetized DMA computation backplane with PIST packets and NIC algebra offloads."}
+{"file":"6-Documentation/docs/specs/vectorless_technical_review_response.md","title":"Vectorless Spatial Hash Architecture — Technical Review Response","concepts":[{"name":"Morton Code Locality","description":"Z-order curves preserving semantic locality in spatial hash","type":"algorithm"},{"name":"Lean/Python Boundary","description":"Python wraps Lean theorem only, no decision logic in Python","type":"invariant"},{"name":"Hierarchical Refinement","description":"Maintaining ~10 rows/cell for O(1) neighbor boundedness","type":"algorithm"},{"name":"classify_voltage_mode","description":"Lean theorem for voltage mode classification, Python wrapper only","type":"theorem"}],"tags":["spatial-hash","Morton-code","review","Lean-boundary","locality"],"layer":"infrastructure","dependencies":["SpatialHashCodec"],"summary":"Technical review response correcting AGENTS.md boundary violations, Lean/Python semantic drift, locality problems, and float contamination in spatial hash architecture."}
+{"file":"6-Documentation/docs/specs/unified_manifold_blit_equation.md","title":"Unified Manifold-Blit Equation","concepts":[{"name":"Manifold-Blit Equation","description":"M_{k+1}(x) = Quant_LLM(J_DAG[M_k ⊕ (Ψ_q ⊗ R_RT)])","type":"definition"},{"name":"Blitter Operator","description":"Hardware-accelerated bitwise accumulation as discrete Picard integral","type":"algorithm"},{"name":"DAG-LUT Short-Circuit","description":"Hash check for solved states enabling O(1) lookup","type":"algorithm"},{"name":"Quantum Walk Amplitude","description":"Superposition of potential paths for quadratic convergence search","type":"definition"}],"tags":["manifold","blit","equation","GPU","quantum","Picard","DAG"],"layer":"core-formalism","dependencies":["AVMR"],"summary":"Defines the unified manifold-blit equation combining DAG-LUT short-circuiting, quantum amplitude sampling, hardware blitter accumulation, and LLM quantization."}
+{"file":"6-Documentation/docs/specs/tag-addressable-compute-fabric.md","title":"Tag-Addressable Compute Fabric (TACF)","concepts":[{"name":"Tag Rings","description":"6 channel rings (STRAND, CROSSING, PIST, LUPINE, VAAPI, FLAC) for work dispatch","type":"architecture"},{"name":"Copy-If Pattern","description":"Content-addressed work: same payload = same hash = no copy needed","type":"pattern"},{"name":"HEP as LUT","description":"Hardware capability as tag subscription table, not device tree","type":"definition"},{"name":"Spatial Hash as Storage","description":"Node pool IS a spatial hash with tags as dimensions","type":"architecture"},{"name":"Virtio Ring as Scheduler","description":"Tag ring IS the scheduler — write descriptor, consumer reads and computes","type":"architecture"}],"tags":["TACF","tag-addressable","compute-fabric","spatial-hash","virtio","ring"],"layer":"infrastructure","dependencies":["FrameDispatcher"],"summary":"Ground-up redesign where work is published to tags, nodes self-select based on capability LUTs, and the 6 tag rings ARE the entire addressing scheme."}
+{"file":"6-Documentation/docs/specs/self-adapting-compute-fabric.md","title":"Self-Adapting Compute Fabric","concepts":[{"name":"Node Bootstrap Agent","description":"One-shot agent running on first boot: tailscale, detect hardware, build labels, join k3s","type":"recipe"},{"name":"Capability Registry","description":"Nodes declare what they are and what they can do; fabric routes around failures","type":"architecture"},{"name":"Adaptive Scheduler","description":"Orchestrator engine absorbing new capacity instantly and degrading gracefully","type":"algorithm"},{"name":"k3s Labels from Probe","description":"Auto-generated k3s labels from hardware capability detection","type":"recipe"}],"tags":["self-adapting","compute-fabric","k3s","bootstrap","capability","orchestrator"],"layer":"infrastructure","dependencies":[],"summary":"Design for Research Stack that automatically adapts to rapid node changes with one-shot bootstrap agents, capability registries, and adaptive scheduling."}
+{"file":"6-Documentation/docs/specs/sdta_spec.md","title":"Semantic Degenerate Tensor Adapter (SDTA)","concepts":[{"name":"SDTA","description":"Structural reformulation of NP-hard search as deformation theory over high-curvature eigensolid","type":"definition"},{"name":"Portability Coefficient","description":"η = ‖Π_D A Π_D†‖_F / ‖A‖_F measuring problem structure captured in degenerate subspace","type":"definition"},{"name":"Coordinate Failure","description":"Impossible ≠ ∞ — it means NaN (coordinate failure), not exponential growth","type":"invariant"},{"name":"Degenerate Chart","description":"Chart where eigensolid is degenerate, making constraint manifold flat (Laplace not Helmholtz)","type":"definition"},{"name":"SMN","description":"Semantic Mass Number — low SMN = high η = problem compresses into degenerate subspace","type":"definition"}],"tags":["SDTA","NP-hard","tensor","degenerate","eigensolid","portability"],"layer":"core-formalism","dependencies":["eigensolid_convergence"],"summary":"Reformulates NP-hard search as deformation theory over high-curvature eigensolid, introducing portability coefficient η to measure how much problem structure survives degenerate projection."}
+{"file":"6-Documentation/docs/specs/quantization.md","title":"Quantization Specification","concepts":[{"name":"Ternary Weight Quantization","description":"W̃ = RoundClip(W/(γ+ε), -1, 1) achieving 10× memory reduction vs FP16","type":"algorithm"},{"name":"BitLinear","description":"Activation scaling with dynamic range preservation","type":"algorithm"},{"name":"MLGRU Recurrence","description":"h_t = f_t ⊙ h_{t-1} + (1-f_t) ⊙ c_t — no matrix multiplication, O(d) not O(d²)","type":"algorithm"},{"name":"RoundClip","description":"Values < 0.5 → -1, > 1.5 → +1, else 0 for ternary quantization","type":"algorithm"}],"tags":["quantization","ternary","BitLinear","MLGRU","memory-reduction","inference"],"layer":"core-formalism","dependencies":["FixedPoint"],"summary":"Defines ternary weight quantization for efficient neural network inference achieving 10× memory reduction with fixed-point arithmetic."}
+{"file":"6-Documentation/docs/specs/lonely_runner_betti_mapping.md","title":"Lonely Runner Conjecture — Betti-2 Topological Obstruction Mapping","concepts":[{"name":"Lonely Runner Conjecture","description":"For k runners with distinct speeds on S¹, ∃t such that min_i dist(v_i t, 0) ≥ 1/(k+1)","type":"theorem"},{"name":"Scar Region","description":"Uncovered set M_t = S¹ \\ ∪ B(v_i t, δ) — the loneliness field","type":"definition"},{"name":"Coverage Density","description":"Φ(t,θ) = Σ 1_{B(v_i t, δ)}(θ) — which regions are illuminated by runners","type":"definition"},{"name":"NK-Hodge-FAMM Mapping","description":"Isomorphism between runner configuration and FAMM velocity/scar/β₂ structure","type":"bridge"},{"name":"Betti-2 Regularity","description":"β₂ = 0 condition: no uncovered region = no scar = no topological blowup","type":"invariant"}],"tags":["lonely-runner","Betti","topology","FAMM","conjecture","scar"],"layer":"core-formalism","dependencies":["FAMM","BettiSwoosh"],"summary":"Maps the Lonely Runner Conjecture onto NK-Hodge-FAMM framework, establishing isomorphism between runner coverage and FAMM scar/velocity structure."}
+{"file":"6-Documentation/docs/specs/cole_hopf_vorticity_resolution.md","title":"Cole-Hopf + Vorticity Tension: Rigorous Resolution","concepts":[{"name":"Cole-Hopf Transformation","description":"u = -2ν₀ · ∇(ln Φ) making velocity field everywhere irrotational","type":"theorem"},{"name":"Vorticity Paradox","description":"Cole-Hopf implies ∇×u=0 (no vorticity) yet NS requires ω≠0","type":"definition"},{"name":"Hodge Decomposition Resolution","description":"Full state is DualQuaternion Q=(Q₁,Q₂)∈ℝ⁸; torsion from dual part generates vorticity","type":"theorem"},{"name":"DualQuaternion","description":"Q₁×Q₂ = ℝ⁴×ℝ⁴ encoding both rotational and translational information","type":"definition"}],"tags":["Cole-Hopf","vorticity","Navier-Stokes","DualQuaternion","Hodge","Burgers"],"layer":"core-formalism","dependencies":["ColeHopfTransform","BurgersPDE","BettiSwoosh"],"summary":"Resolves the apparent contradiction between Cole-Hopf irrotationality and Navier-Stokes vorticity through Hodge decomposition of the full DualQuaternion state."}
+{"file":"6-Documentation/docs/specs/WitnessGrammar.md","title":"Witness Grammar Specification","concepts":[{"name":"Witness Grammar","description":"Finite symbolic source code recovered from a field: active witnesses, amplitudes, frequencies, phases, roles","type":"definition"},{"name":"Equation Sniffer","description":"Compares witness grammars, not raw data; searches for shared behavioral operators","type":"algorithm"},{"name":"Market-Data Bridge","description":"Same pipeline applied to price/volume/fundamental streams for behavioral operator class extraction","type":"bridge"},{"name":"FNWH Pipeline","description":"Raw field → FNWH peeling → WitnessGrammar → EquationSniffer → route suggestion","type":"pipeline"}],"tags":["witness-grammar","FNWH","equation-sniffer","field","decompilation"],"layer":"core-formalism","dependencies":["FNWH"],"summary":"Defines witness grammars as finite symbolic source code recovered from fields, with equation sniffers comparing grammars for shared behavioral operators."}
+{"file":"6-Documentation/docs/specs/UNIVERSE_MODEL_ORBIT_ZOOM_PROTOCOL.md","title":"Universe Model Orbit-Zoom Protocol","concepts":[{"name":"Orbit-Zoom Protocol","description":"Navigation from coarse structure to checkable local laws via zoom ladder","type":"protocol"},{"name":"Zoom Ladder","description":"L0 Orbit → L1 Region → L2 State → L3 Derivation → L4 Receipt → L5 Gate","type":"architecture"},{"name":"Assigned vs Derived","description":"Critical distinction: assigned values (initial conditions) ≠ derived values (consequences)","type":"invariant"},{"name":"Torsional Fluid Baseline","description":"Baseline state with q1=q2=q3=1, eta=1.0, energy=velocity=0","type":"definition"}],"tags":["orbit-zoom","universe-model","navigation","receipt","protocol"],"layer":"documentation","dependencies":[],"summary":"Defines navigation and receipt protocol for mapping local problems into mathematical continents via orbit classification and zoom ladder descent."}
+{"file":"6-Documentation/docs/specs/UNIFIED_TRANSPORT_ENCODING_SPEC.md","title":"Unified Transport Encoding Architecture","concepts":[{"name":"TMDS Lane Encoding","description":"Wire encoding over GPU display controller TMDS lanes with fragment packets","type":"architecture"},{"name":"VCN Video Encoding","description":"RDMA payload packed into video frames with hardware H.265 encode/decode","type":"architecture"},{"name":"Multi-Transport Routing","description":"Transport selection, fragmentation, multi-hop relay, fallback across 11 transports","type":"architecture"},{"name":"Unified Envelope","description":"[tag(1)] + [transport-header] + [RDMANetHeader(41)] + [payload] wire format","type":"spec"}],"tags":["transport","encoding","TMDS","VCN","RDMA","multi-transport"],"layer":"infrastructure","dependencies":[],"summary":"Defines unified transport encoding across TMDS lanes, VCN video, and mesh multi-transport routing with fragment packets and unified envelope wire format."}
+{"file":"6-Documentation/docs/specs/UNIFIED_SIGNAL_ARCHITECTURE.md","title":"Unified Signal Architecture — DisplayPort × Audio × FPGA","concepts":[{"name":"NUVMAP Texel Stream","description":"PIST → Cayley V4 → braid/rope encoding feeding three hardware pathways","type":"architecture"},{"name":"Three-Column Architecture","description":"DisplayPort 8K60, PipeWire Audio 192kHz, FPGA Tang Nano 9K as unified frame sync","type":"architecture"},{"name":"VBLANK/SUBTRACT/HBLANK/PAUSE","description":"Blanking intervals carry TVI samples, mistake vectors, GCL diff deltas","type":"definition"},{"name":"Unified Frame Sync","description":"DP VSYNC = audio buffer swap with keyframe+attestation at frame 0","type":"protocol"}],"tags":["signal","architecture","DisplayPort","PipeWire","FPGA","unified","texel"],"layer":"hardware","dependencies":["DP_TEXEL_8K_ENCODING_SPEC","PIST"],"summary":"Bridges DisplayPort 8K60, PipeWire Audio 192kHz, and FPGA Tang Nano 9K into one texel state machine with unified frame synchronization."}
+{"file":"6-Documentation/docs/specs/Two_Layer_Kinetic_Sidon_Lattice_v0_1.md","title":"Two-Layer Kinetic Sidon Lattice v0.1","concepts":[{"name":"Two-Layer Lattice","description":"Kinetic layer (motion/energy/phase-clock) coupled with Sidon relational layer (pair signatures/anti-aliasing)","type":"architecture"},{"name":"KineticToSidonFlow","description":"Kinetic flux producing Sidon-addressed pair signatures","type":"definition"},{"name":"SidonToKineticFlow","description":"Addressed relations feeding back into kinetic updates","type":"definition"},{"name":"Motion with Addressability","description":"Combining dynamics with clean pair addresses for coherence without alias collapse","type":"invariant"}],"tags":["Sidon","lattice","kinetic","two-layer","anti-aliasing","dynamics"],"layer":"core-formalism","dependencies":["Quaternion_Sidon_Standing_Field"],"summary":"Refines Quaternion Sidon Standing Field into two coupled layers: kinetic substrate generating flux and Sidon layer assigning pairwise relational addresses."}
+{"file":"6-Documentation/docs/specs/TOPOLOGICAL_BRAID_ADAPTER_SPEC.md","title":"Topological Braid Adapter Specification","concepts":[{"name":"Fibonacci Anyon Isomorphism","description":"Five isomorphisms mapping HydrogenicPhiTorsionBraid to Fibonacci Anyon system","type":"bridge"},{"name":"ColorRope to DualQuaternion","description":"CMYK channels map to dual quaternion coordinates Q₁+εQ₂","type":"bridge"},{"name":"stairIndex to SLUG3State","description":"Crossing events map to B₃ braid group generator words","type":"bridge"},{"name":"tensegrityCoherent to Yang-Baxter","description":"Static equilibrium maps to Yang-Baxter equation consistency","type":"bridge"},{"name":"Zeckendorf to Fusion Tree","description":"Zeckendorf bits map to Fibonacci anyon fusion tree basis vectors","type":"bridge"}],"tags":["braid","adapter","Fibonacci-anyon","isomorphism","DualQuaternion","Yang-Baxter"],"layer":"core-formalism","dependencies":["HydrogenicPhiTorsionBraid","SLUG3","UnitQuaternion"],"summary":"Establishes five mathematical isomorphisms showing existing braid constructs are isomorphic to Fibonacci Anyon systems via dual quaternions and braid group representations."}
+{"file":"6-Documentation/docs/specs/TINY_IP_CONTIKI_SURFACE_SPEC.md","title":"Tiny IP Surface Spec","concepts":[{"name":"Cooperative Event Loop","description":"Contiki-inspired cooperative processes that must return quickly, no blocking","type":"architecture"},{"name":"Fixed Packet Buffers","description":"96-byte MTU with 4 RX and 4 TX buffers for tiny nodes","type":"definition"},{"name":"Admission Before Expansion","description":"GCL must admit before payload expansion on tiny nodes","type":"gate"},{"name":"Shell Packet","description":"Small datagram-like shell packets for constrained systems","type":"definition"}],"tags":["tiny-IP","Contiki","embedded","cooperative","packet-buffer","shell"],"layer":"infrastructure","dependencies":["OMNITOKEN_GCL_REDESIGN"],"summary":"Defines Contiki-inspired shell concepts for embedded GCL/Omnitoken nodes with cooperative event loops, fixed packet buffers, and admission-before-expansion."}
+{"file":"6-Documentation/docs/specs/SYMBOLOGY_DERIVED_LOGOGRAM_DESIGN.md","title":"Symbology-Derived Logogram Design","concepts":[{"name":"Safe Quarry Rule","description":"Borrow compression principle, not protected symbol identity","type":"invariant"},{"name":"Borrowable Principles","description":"denseOperator, modifierFamily, customCodePage, residualOmission, radicalComposition, etc.","type":"definition"},{"name":"Source Classes","description":"9 classes: array languages, code-golf, math notation, shorthand, logographic, syllabaries, ancient, constructed, specialist","type":"definition"},{"name":"Omindirection Atom","description":"Original receipted atom from extracted design grammar","type":"definition"}],"tags":["symbology","logogram","design","compression","principles","quarry"],"layer":"core-formalism","dependencies":["Omindirection"],"summary":"Defines safe quarry rules for extracting compression principles from dense symbolic systems (APL, Cuneiform, Hangul, etc.) into original Omindirection atoms."}
+{"file":"6-Documentation/docs/specs/SSMS_nD_FUNCTIONAL_SPEC.md","title":"SSMS-nD: Scalar State Manifold Segmentation","concepts":[{"name":"Variable-n Manifold","description":"Dynamic n-dimensional submanifolds where n is determined per detection instance","type":"definition"},{"name":"Sequential Lifting","description":"L_{1D→n} operator lifting 1D sequences into n-dimensional space via ternary-quantized weights","type":"algorithm"},{"name":"OISC Architecture","description":"One Instruction Set Computer operating on dynamic n-manifolds","type":"architecture"},{"name":"Betti Number Penalty","description":"Complexity(n') = n'·log(n') penalty for dimensionality selection","type":"definition"}],"tags":["SSMS","manifold","segmentation","OISC","detection","lifting"],"layer":"core-formalism","dependencies":[],"summary":"Functional specification for promptable object detection using OISC architecture on dynamic n-manifolds with variable dimensionality determined by intrinsic structure."}
+{"file":"6-Documentation/docs/specs/SMN_SEMANTIC_MASS_NUMBERS.md","title":"SMN: Semantic Mass Numbers","concepts":[{"name":"SMN","description":"Semantic load carried by a symbol inside the stack: identity+relation+provenance+constraint+decision+repair load","type":"definition"},{"name":"Mass Number","description":"Admissibility packet with residual and boundary guard — not proof or truth by itself","type":"gate"},{"name":"Non-Identities","description":"SMN ≠ atomic mass number, isotope mass, SI mass, Mass Number packet, proof, truth","type":"invariant"},{"name":"Pipeline","description":"semantic mass pressure → SMN score → optional Mass Number packet → admissibility receipt","type":"pipeline"}],"tags":["SMN","semantic-mass","load","admissibility","routing"],"layer":"core-formalism","dependencies":[],"summary":"Defines SMN as a project-local semantic-load measure for routing attention, with explicit non-identities separating it from physical mass and admissibility receipts."}
+{"file":"6-Documentation/docs/specs/SEMANTIC_ENGINE_BINDING_DERIVATION_WORKBENCH.md","title":"Semantic Engine Binding Derivation Workbench","concepts":[{"name":"Conceptual Binding","description":"Relation that makes a semantic engine useful: document→chunk, chunk→embedding, etc.","type":"definition"},{"name":"Research Stack Re-Derivation","description":"Rebuilding external bindings through local bind/primitive/invariant/metric/receipt","type":"algorithm"},{"name":"Inspection Template","description":"License surface, binding inventory, hidden assumptions, Research Stack derivation per engine","type":"recipe"}],"tags":["semantic-engine","binding","derivation","ENE","inspection"],"layer":"documentation","dependencies":["ENE_MEMORY_ATLAS_SPEC"],"summary":"Defines methodology for inspecting MIT-licensed semantic engines, identifying minimum laws, and rederiving from Research Stack theory base."}
+{"file":"6-Documentation/docs/specs/Receipt_Core_Infrastructure_v0_1.md","title":"Receipt Core Infrastructure v0.1","concepts":[{"name":"Receipt Infrastructure","description":"Safety and evidence-routing layer: executable/benchmark/adversarial receipts do not authorize promotion alone","type":"architecture"},{"name":"Proof Receipt Gate","description":"CANDIDATE + proof receipt may promote to REVIEWED; CANDIDATE + non-proof evidence ≠ REVIEWED","type":"gate"},{"name":"ClaimState","description":"Inductive type for claim states in receipt ledger","type":"definition"},{"name":"ReceiptKind","description":"proof, leanBuild, executableEval, benchmark, adversarialTrial receipt constructors","type":"definition"},{"name":"AdversarialTrial","description":"Receipt type for adversarial testing evidence","type":"definition"}],"tags":["receipt","infrastructure","proof","gate","adversarial","evidence"],"layer":"core-formalism","dependencies":[],"summary":"Defines minimal receipt infrastructure scaffold where workspaces cannot promote to reviewed status without explicit proof receipts."}
+{"file":"6-Documentation/docs/plans/SilverSight_completion_pipeline.md","title":"SilverSight Completion Pipeline — Microstep Edition","concepts":[{"name":"8-Phase Pipeline","description":"Core Semantics → Formal theorems → Corpus/PIST → Comp theorems → Shims → Hardware → Apps → Promotion","type":"architecture"},{"name":"Claim-State Ladder","description":"BEAUTIFUL_PROVISIONAL → CALIBRATED → REVIEWED → VERIFIED with exit gates","type":"gate"},{"name":"Microstep Methodology","description":"Per-file, per-theorem, per-commit microsteps with goals, verification commands, commit messages","type":"recipe"},{"name":"Library Method","description":"Core/ defines contracts; libraries implement them; libraries never import other libraries","type":"invariant"}],"tags":["SilverSight","pipeline","microstep","plan","Lean","promotion"],"layer":"documentation","dependencies":["SilverSight_Spec"],"summary":"Expands SilverSight pipeline into per-file microsteps covering 8 phases from Core Semantics through hardware extraction to promotion, with claim-state tracking."}
+{"file":"6-Documentation/docs/plans/SOVEREIGN_PROCEED_PLAN_V1.md","title":"Sovereign Proceed Plan: 48-Hour Execution","concepts":[{"name":"Burgers Theorem Hardening","description":"All 4 Burgers PDE theorems proven via 0D Braid Isomorphism using native_decide","type":"receipt"},{"name":"Hardware Loopback","description":"UART packet structure for Tang Nano 9K FPGA test harness","type":"recipe"},{"name":"AVM-R Integration","description":"Hierarchical vector roll-up integrating Burgers kernels into AVM-R structure","type":"architecture"},{"name":"BFS-Prover","description":"Breadth-First Search Prover for automatic lemma proof","type":"tool"}],"tags":["plan","Burgers","FPGA","AVM-R","execution","48-hour"],"layer":"documentation","dependencies":["BurgersPDE"],"summary":"48-hour execution plan covering Burgers theorem hardening, hardware loopback design, and AVM-R integration."}
+{"file":"6-Documentation/docs/provenance/creation_os_adaptation_analysis.md","title":"Creation OS → Sovereign Stack: Adaptation Analysis","concepts":[{"name":"σ-Gate Mapping","description":"Creation OS σ-gate maps to Sovereign Stack bind instance with Q0_16 metric","type":"bridge"},{"name":"Conformal Calibration","description":"Creation OS empirical α=0.80 needs upgrade to 6.5σ Lean-proven threshold","type":"definition"},{"name":"Branchless Integer Kernels","description":"40 branchless Q0_16 kernels composed into one verdict, matching Creation OS architecture","type":"architecture"},{"name":"Ω-Loop Self-Improvement","description":"Creation OS recursive improvement maps to Master Equation for recursive evolution","type":"bridge"}],"tags":["creation-os","adaptation","σ-gate","conformal","bind","bridge"],"layer":"documentation","dependencies":["EntropyMeasures","Bind"],"summary":"Maps Creation OS σ-gate pipeline to Sovereign Stack bind/Lean architecture, identifying partial overlap and 7-order-of-magnitude confidence upgrade needed."}
+{"file":"6-Documentation/docs/provenance/EVIDENCE_ATTACHMENT_GUIDELINES.md","title":"Evidence Attachment Guidelines","concepts":[{"name":"Build Log DAG","description":"UUID-tagged build steps in DAG structure with timestamps","type":"receipt"},{"name":"Benchmark Artifacts","description":"CSV, PNG, JSON artifacts in data/benchmarks/ with markdown links","type":"receipt"},{"name":"Path Quoting Invariant","description":"All filesystem paths must be quoted to handle spaces","type":"invariant"},{"name":"Citation Verification","description":"Automated verification of citation URL accessibility","type":"recipe"}],"tags":["evidence","provenance","build-log","benchmark","citation","DAG"],"layer":"documentation","dependencies":[],"summary":"Systematic approach for attaching evidence to claims: build logs with UUID DAG structure, benchmark artifacts, and citation accessibility verification."}
+{"file":"6-Documentation/docs/provenance/ALL_ACTIONS_REPORT_2026-04-29.md","title":"All Actions Provenance Report","concepts":[{"name":"Provenance Compliance","description":"6 compliant claims, 0 critical issues after remediation","type":"receipt"},{"name":"External Verification Claims","description":"Arithmetic sanity checks with CAS provenance disclaimers replacing Wolfram claims","type":"receipt"},{"name":"Build Log Verification","description":"DAG build logger with UUID and timestamp per step","type":"recipe"},{"name":"Citation Accessibility","description":"17 URLs checked: 14 accessible, 3 infrastructure URLs","type":"receipt"}],"tags":["provenance","report","compliance","build","citation","2026-04-29"],"layer":"documentation","dependencies":[],"summary":"Provenance report for 2026-04-29 covering external verification claims, build claims, benchmark claims, and citation accessibility verification."}
+{"file":"6-Documentation/docs/rrc_equation_classification.md","title":"RRC Equation Projection","concepts":[{"name":"RRC Shape Classification","description":"278 equations classified into 5 RRC shapes: CadForceProbeReceipt, CognitiveLoadField, LogogramProjection, ProjectableGeometryTopology, SignalShapedRouteCompiler","type":"receipt"},{"name":"Scale Witness","description":"Declares routing scale band, unit hint, threshold/tolerance/budget policy","type":"definition"},{"name":"Negative Control Witness","description":"Fail-closed controls: empty-equation invalidation, label-shuffle baseline, missing-receipt HOLD","type":"gate"},{"name":"CANDIDATE Status","description":"Object fits type-shape well enough for next proof/route stage, not mathematically proved","type":"definition"}],"tags":["RRC","equation","classification","projection","witness","admissibility"],"layer":"core-formalism","dependencies":["Rainbow Raccoon Compiler"],"summary":"RRC projection pass over 278 local equation surfaces recording nearest lawful shapes, projection axes, and admissibility holds."}
+{"file":"6-Documentation/docs/rrc_logogram_projection_formalism.md","title":"RRC Logogram Projection Formalism","concepts":[{"name":"LogogramReceipt","description":"Structure with shape, status, regime, payloadBound, contradictionWitness, tearBoundary, detachedMass, residualLane","type":"definition"},{"name":"TypeAdmissible","description":"Logogram admissible only when shape=LogogramProjection, status=Candidate, payloadBound=true","type":"gate"},{"name":"Projection Admissible","description":"Projection safe under local payload and semantic-regime checks","type":"gate"},{"name":"Merge Admissible","description":"Additional condition beyond projection admissibility for merge operations","type":"gate"},{"name":"Torn Logogram Repair","description":"Torn logogram can be projection-admissible after repair/quarantine while not merge-admissible","type":"theorem"}],"tags":["RRC","logogram","projection","formalism","admissibility","Lean"],"layer":"core-formalism","dependencies":["RRCLogogramProjection"],"summary":"Formal scaffold with Lean-checked routing theorems for logogram projection admissibility, proving torn logograms can be projection-admissible after repair."}
+{"file":"6-Documentation/docs/rrc_logogram_projection_bridge.md","title":"RRC Logogram Projection Bridge","concepts":[{"name":"LogogramProjection Bridge","description":"Binds canonical cell hash, bounded glyph payload, substitution receipt, semantic regime, RRC type witness into single receipt","type":"bridge"},{"name":"Projection Equation","description":"P_logogram(source) = (canonical_hash, cell_hash, glyph_payload_16, semantic_regime, substitution_receipt, rrc_type_witness)","type":"definition"},{"name":"5/5 CANDIDATE","description":"All 5 sample logograms achieve RRC CANDIDATE status with 4 merge-admissible, 1 repaired tear","type":"receipt"}],"tags":["RRC","logogram","bridge","projection","receipt","shim"],"layer":"infrastructure","dependencies":["RRCLogogramProjection"],"summary":"Projection bridge binding logogram components into single LogogramProjection receipts, with 5/5 samples achieving RRC CANDIDATE status."}
+{"file":"6-Documentation/docs/compression_signal_shaping_synthesis.md","title":"Compression Signal-Shaping Synthesis","concepts":[{"name":"Signal-Shaped Route Compiler","description":"Shape route space before coding, then pay exact residual/witness/decoder/container bytes","type":"architecture"},{"name":"12 Approach Classes","description":"PAQ context mixing, decision-diagram search, T16 pipeline, Phi response, compressed sensing, etc.","type":"definition"},{"name":"Holographic Fractional Recursive Fold","description":"Boundary descriptor plus bounded memory compression approach","type":"definition"},{"name":"Semantic Topology Regimes","description":"Fold/prune/tear decisions based on semantic topology","type":"algorithm"}],"tags":["compression","signal-shaping","route-compiler","PAQ","sensing","topology"],"layer":"core-formalism","dependencies":[],"summary":"Synthesizes compression approaches into signal-shaped route compiler pattern: shape route space before coding, then pay exact residual bytes."}
+{"file":"6-Documentation/docs/rainbow_raccoon_compiler_integration.md","title":"Rainbow Raccoon Compiler Integration","concepts":[{"name":"RRC Type-Checker","description":"Manifold-indexed type-checker: object→projection→shape→witness→field-equation→receipt","type":"architecture"},{"name":"16-Axis Manifold","description":"Projection into semantic_entropy, geometric_mass, compression_pressure, topology_torsion, etc.","type":"definition"},{"name":"MetaManifoldProver","description":"First proof-backed RRC lane: Q16_16 fixed-point lowering certificate","type":"theorem"},{"name":"CANDIDATE/HOLD","description":"Conservative emission: CANDIDATE only with enough declared evidence, HOLD otherwise","type":"gate"}],"tags":["RRC","integration","manifold","type-checker","Q16_16","certificate"],"layer":"core-formalism","dependencies":["MetaManifoldProver"],"summary":"Represents Rainbow Raccoon Compiler as manifold-indexed type-checker with 16-axis projection and first proof-backed fixed-point lowering lane."}
+{"file":"6-Documentation/docs/famm/FAMM_Stigmergic_Route_Memory.md","title":"FAMM — Stigmergic Route Memory","concepts":[{"name":"FAMM","description":"Frustration-Aligned Memory Management: scars becoming navigation","type":"definition"},{"name":"Stigmergic Memory","description":"Agents leave traces in medium; altered environment biases later action","type":"definition"},{"name":"FAMM vs AMMR/AVMR","description":"AMMR preserves history, AVMR aggregates vector state, FAMM changes where system searches next","type":"definition"},{"name":"FAMM Load","description":"L_famm = Σ² + I_lock + Δ_φ measuring frustration timing load","type":"definition"},{"name":"Scar Navigation","description":"Failed→avoid, partial→preserve as torsion, successful→reinforce, ambiguous→quarantine","type":"algorithm"}],"tags":["FAMM","stigmergy","route-memory","frustration","scar","navigation"],"layer":"core-formalism","dependencies":["AMMR","AVMR"],"summary":"Bridges FAMM to stigmergic memory: failed routes become avoid signals, partial routes become torsion signals, successful routes become attractors."}
+{"file":"6-Documentation/docs/transfold_enwiki8_magnetic_domain_generator.md","title":"Transfold Enwiki8 Magnetic Domain Generator","concepts":[{"name":"Transfold Map","description":"byte_stream_signal → magnetic_domain_equation mapping entropy to field demand","type":"algorithm"},{"name":"Magnetic Domain Equations","description":"L_info, G_over, M_i, Q_i equations from byte statistics","type":"definition"},{"name":"Magnetization/Hysteresis","description":"Mean magnetization 0.644 and heat loss 1.012 from 64KiB enwik8 slice","type":"receipt"},{"name":"Stress Sweep","description":"Capacity threshold sweep from 2.50 to 5.25 showing overflow behavior","type":"recipe"}],"tags":["transfold","enwiki8","magnetic-domain","byte-signal","stress-test"],"layer":"infrastructure","dependencies":[],"summary":"Converts byte slices into magnetic-domain equation receipts for stress-testing, mapping entropy/transition-rate/repeated-4-grams to field/remanence/hysteresis channels."}
+{"file":"6-Documentation/docs/transfold_couch_data_magnetic_domain_comparison.md","title":"COUCH Data Magnetic-Domain Comparison","concepts":[{"name":"COUCH vs enwik8","description":"COUCH bundle: higher remanence (0.889), lower susceptibility (0.569), lower heat loss (0.239) than enwik8","type":"receipt"},{"name":"Routing Implication","description":"COUCH = compact high-remanence surface preferring dictionary/state reuse; enwik8 = high-transition needing boundary-aware shaping","type":"definition"},{"name":"Magnetic Domain Analogue","description":"Byte-statistical analogue supporting routing and stress-test comparisons only","type":"invariant"}],"tags":["COUCH","enwik8","comparison","magnetic-domain","routing"],"layer":"infrastructure","dependencies":["transfold_enwiki8_magnetic_domain_generator"],"summary":"Compares COUCH data bundle vs enwik8 under magnetic-domain transform, showing COUCH is more memory-like and less transition-agitated."}
+{"file":"6-Documentation/docs/speculative-materials/PhotonChasedFerriteTraceFormation.md","title":"Photon-Chased Ferrite Trace Formation","concepts":[{"name":"Guided Reaction Space","description":"Confined channel as guided reaction space with traveling activation front biasing deposition","type":"definition"},{"name":"Activation-Deposition Alignment","description":"v_front ≈ v_deposition_response for optimal field-biased ferrite deposition","type":"invariant"},{"name":"Rate Equation","description":"dF/dt = k·A[I,λ]·R_leak·C_wall·η_EET - D_loss","type":"definition"},{"name":"Axial Memory","description":"Desired effect is field-biased ferrite deposition with axial memory, not mere ferrite","type":"definition"}],"tags":["ferrite","photon","speculative","materials","deposition","trace"],"layer":"documentation","dependencies":[],"summary":"Speculative materials concept for using traveling electromagnetic activation fronts to bias ferrite-like deposition along confined channels with axial memory."}
+{"file":"6-Documentation/docs/distilled/Total_Calculation_Review.md","title":"Total Calculation Review","concepts":[{"name":"Monthly Cost Projection","description":"Projected monthly costs from $109.42 through August, dropping to $61.20 by November","type":"receipt"},{"name":"Bill Detection","description":"36 bill groups detected with $6,257.59 projected 2026 total","type":"receipt"}],"tags":["cost","projection","subscription","billing","review"],"layer":"documentation","dependencies":[],"summary":"Reviews projected monthly costs for Research Stack subscriptions showing $648.40 Jun-Dec total with Kimi and Wolfram expiring."}
+{"file":"6-Documentation/docs/distilled/Pythagorean_Theorem_and_Beyond.md","title":"Pythagorean Theorem and Beyond","concepts":[{"name":"n=2 Specialness","description":"Only n=2 works because Euclidean geometry is quadratic; orthogonality adds squared lengths","type":"theorem"},{"name":"Hyperoperation Address Space","description":"AMMR+BMMR→CMMR with hyperoperation-indexed address coordinates","type":"architecture"},{"name":"Tetration Addressing","description":"address = 2↑↑5 giving finite machine address preserving higher-order generative identity","type":"definition"}],"tags":["Pythagorean","Fermat","hyperoperation","AMMR","BMMR","CMMR","tetration"],"layer":"documentation","dependencies":["AMMR","BMMR"],"summary":"Explains why only n=2 works for Pythagorean theorem (quadratic Euclidean geometry) and extends to hyperoperation-indexed address spaces."}
+{"file":"6-Documentation/docs/distilled/Prioritization_BlowupPotential_2026-05-11.md","title":"Prioritization — Given Blowup Potential from Minimal Tests","concepts":[{"name":"8-Week Sequence","description":"Math characterization → crypto fast track → tech report → starling → preprint → prose pipeline","type":"recipe"},{"name":"Prime Gap Result","description":"Detector fired with zero calibration on domain never designed for","type":"receipt"},{"name":"Falsification Boundary","description":"Know what detector CAN and CANNOT see before touching noisier domains","type":"invariant"}],"tags":["prioritization","blowup","detector","primes","validation"],"layer":"documentation","dependencies":[],"summary":"Recommended 8-week sequence starting with mathematical characterization of entropy-collapse detector, then crypto fast track and starling validation."}
+{"file":"6-Documentation/docs/distilled/ObserverScale_RegimeGate_VoidScar.md","title":"Observer-Scale Regime Gate & VoidScar Fractal Field","concepts":[{"name":"VoidScar Fractal","description":"Hybrid Menger void deletion + Koch boundary growth creating recursive manifold field","type":"definition"},{"name":"Menger-Koch Hybrid","description":"Boundary explodes while mass vanishes: D_MK(n) ~ (9/5)^n scaling ratio","type":"definition"},{"name":"Regime Gate","description":"Observer-scale dependent coupling regime determining field behavior","type":"gate"}],"tags":["VoidScar","Menger","Koch","fractal","regime","observer-scale"],"layer":"documentation","dependencies":["DESI_Menger_Probe_Result"],"summary":"Defines VoidScar Fractal as hybrid Menger-Koch recursive manifold where boundary grows faster than interior scaffold survives."}
+{"file":"6-Documentation/docs/distilled/Neurobiological_Hacker_Concept.md","title":"Neurobiological Haker Concept","concepts":[{"name":"Negative Cognition","description":"Mental-state negative: brain emits alive signs but mental-state map has deliberate non-region","type":"definition"},{"name":"Passive Scan","description":"Device passively samples EM side effects from nervous systems, reconstructs state contours","type":"definition"},{"name":"Detectability Hunt","description":"Predator that hunts readable phenomena, not prey","type":"definition"}],"tags":["neurobiological","hacker","negative-cognition","passive-scan","detectability"],"layer":"documentation","dependencies":[],"summary":"Conceptual exploration of negative cognition and passive electromagnetic scanning for state contour reconstruction."}
+{"file":"6-Documentation/docs/distilled/Load_Distribution_Concept.md","title":"Load Distribution Concept","concepts":[{"name":"Three-Plane System","description":"Mechanical plane (load/stress), puzzle/admissibility plane (memory-hard proof), Merkle plane (commitment)","type":"architecture"},{"name":"Equihash as Witness","description":"Equihash does not distribute load physically; certifies costly-to-fake search/verification","type":"definition"},{"name":"Invariant Geometry","description":"T·A·ω - T·B·δ gives admissible physical load space from tensegrity/origami","type":"definition"}],"tags":["load-distribution","Equihash","Merkle","tensegrity","origami","proof"],"layer":"documentation","dependencies":[],"summary":"Separates cryptographic bits from mechanical equilibrium: use hash/Merkle/Equihash as admissibility witness, not literal force term."}
+{"file":"6-Documentation/docs/distilled/Fractal_Pathfinding_Model.md","title":"Fractal Pathfinding Model","concepts":[{"name":"Unified Search Field","description":"BFS, DFS, Dijkstra, A*, Greedy as different projections of single reconfigurable traversal manifold","type":"architecture"},{"name":"Fractal Search Operator","description":"SolveBind(S_t, q, Θ) → (P_t, R_t, S_{t+1}) with solver mixture Θ","type":"definition"},{"name":"Search as Braid-Field Renormalizer","description":"Each solve emits topology update receipt; solver rewrites graph metric at every scale","type":"definition"},{"name":"Adaptive Metric","description":"Successful corridors get lower resistance; dead ends get higher pressure; repeated structures collapse to macro-nodes","type":"algorithm"}],"tags":["pathfinding","fractal","search","BFS","DFS","Dijkstra","A*","renormalization"],"layer":"documentation","dependencies":[],"summary":"Models five pathfinding algorithms as projections of one reconfigurable traversal manifold that rewrites graph metrics at every scale."}
+{"file":"6-Documentation/docs/distilled/Dual_Model_MoE_Concepts.md","title":"Dual Model MoE Concepts","concepts":[{"name":"VLMo","description":"Mixture-of-Modality-Experts with vision, language, and fusion experts","type":"definition"},{"name":"LIMoE","description":"Sparse Language-Image Mixture of Experts with modality-partitioned routing","type":"definition"},{"name":"Bilateral MoE","description":"V-expert, L-expert, B-expert (binding), R-router, M-memory workspace","type":"architecture"}],"tags":["MoE","dual-model","VLMo","LIMoE","multimodal","routing"],"layer":"documentation","dependencies":[],"summary":"Surveys architectures close to bilateral MoE: CLIP-style dual encoders, Flamingo bridges, VLMo modality experts, LIMoE sparse routing."}
+{"file":"6-Documentation/docs/distilled/DetectorValidation_MinimalTests_2026-05-11.md","title":"Entropy-Collapse Detector — Minimal Validation Tests","concepts":[{"name":"Test 1: Silent on Dead Sequence","description":"Simple sentence correctly produces no opinion (no temporal dynamics)","type":"receipt"},{"name":"Test 2: Fires on Prime Gaps","description":"14 windows fired (16% hit rate) with zero calibration on primes, correctly at constraint pressure points","type":"receipt"},{"name":"Triple Condition","description":"Braid crossings > K AND σ_q < σ_c AND D_q → 1","type":"invariant"},{"name":"Dense Ranking","description":"Equal values get equal rank; tied pairs excluded from crossing count","type":"algorithm"}],"tags":["detector","validation","primes","entropy-collapse","braid-crossing","Hurst"],"layer":"documentation","dependencies":[],"summary":"Two baseline validation tests: correctly silent on dead sentence sequence, correctly fires on prime gaps with zero calibration."}
+{"file":"6-Documentation/docs/distilled/DeepSeek_V4-Pro_Requirements.md","title":"DeepSeek V4-Pro Requirements","concepts":[{"name":"1.6T MoE Architecture","description":"1.6T total parameters, 49B activated per token, 1M-token context, FP4+FP8 mixed precision","type":"definition"},{"name":"Memory Planning Floor","description":"~1 TB aggregate HBM as minimum for V4-Pro inference","type":"definition"},{"name":"Token Rate Bottleneck","description":"tokens/s = min(expert bandwidth, MoE compute, KV cache, GPU-to-GPU all-to-all, scheduler)","type":"invariant"}],"tags":["DeepSeek","V4-Pro","MoE","inference","GPU","requirements"],"layer":"documentation","dependencies":[],"summary":"Hardware requirements for DeepSeek V4-Pro: 1.6T MoE needing 8+ H200 GPUs, NVLink interconnect, vLLM/SGLang serving."}
+{"file":"6-Documentation/docs/distilled/DESI_Menger_Probe_Result.md","title":"DESI Menger Probe Result","concepts":[{"name":"16D Packet Vector","description":"V₁₆(k) = q_void ⊕ q_orbit ⊕ q_braid ⊕ η_observer","type":"definition"},{"name":"Menger Hausdorff Dimension","description":"d_H = ln(20)/ln(3) ≈ 2.7268 for Menger sponge addressing","type":"definition"},{"name":"QR State Machine","description":"Void/orbit/braid/observer blocks with Menger sponge geometry in q_void subspace","type":"architecture"},{"name":"Void-Scar Boundary","description":"DESI void structure mapped to Menger sponge with rough evolving interfaces","type":"definition"}],"tags":["DESI","Menger","16D","void","QR-state-machine","fractal"],"layer":"documentation","dependencies":[],"summary":"Probes Menger void QR state machine against DESI void structure, establishing 16D packet vector decomposition and Hausdorff dimension."}
+{"file":"6-Documentation/docs/distilled/ChatLog_Math_Synthesis_2026-05-11.md","title":"Chat Log Math Synthesis — 2026-05-11","concepts":[{"name":"16D Canonical Decomposition","description":"V₁₆ = (q_void⁴ᵈ, q_orbit⁴ᵈ, q_braid⁴ᵈ, η_observer⁴ᵈ) with 4D blocks","type":"definition"},{"name":"Master Atlas Equation","description":"𝓐₁₆ = Σₖ Γₖ[Mengerₖ ⊗ Torusₖ ⊗ Braidₖ ⊗ Observerₖ]","type":"definition"},{"name":"Closure Condition","description":"close(k) iff ‖V₁₆(k) - lift(P(V₁₆(k))) - R₁₆(k)‖² = Σᵢ₌₅¹⁶ σᵢ²","type":"invariant"},{"name":"O₄ Projection","description":"O₄(k) = P₁₆→₄(V₁₆(k)) = (field, packet, shear, spectral)","type":"definition"}],"tags":["synthesis","16D","atlas","closure","projection","chat-log"],"layer":"documentation","dependencies":[],"summary":"Filtered math synthesis from chat exports retaining only claims surviving bind test: 16D manifold structure, projection/lift, master atlas equation."}
+{"file":"6-Documentation/docs/distilled/BoundaryEigenFire.md","title":"Boundary Eigenfire — The Modal Burn Surface Doctrine","concepts":[{"name":"Modal Burn Surface","description":"Boundary as activated superposition surface where multiple latent values forced into local reality","type":"definition"},{"name":"Boundary Field","description":"B_∂(x) = Proj_∂(Σ λᵢψᵢ(x)) — weighted superposition of eigenmodes projected onto boundary","type":"definition"},{"name":"Modal Basis","description":"8-component shape-state vector: ρ, ∇ρ, T, σ, κ, β, η, ε","type":"definition"},{"name":"λ_YAH Spectrum","description":"Hyper-eigenvalue weights from the λ_YAH hyper-eigenspectrum","type":"definition"}],"tags":["boundary","eigenfire","modal","burn-surface","eigenspectrum","doctrine"],"layer":"documentation","dependencies":["HCMMR"],"summary":"Redefines boundaries as activated modal burn surfaces where multiple latent eigenmode values are forced into simultaneous local reality."}
+{"file":"6-Documentation/docs/distilled/Blockchain_HardcodedMath_VortexSignal_2026-05-11.md","title":"Blockchain as Hardcoded Human Math — Vortex Signal","concepts":[{"name":"AMM as Eigenmass","description":"Concentrated liquidity ticks as HCMMR depth levels with stepwise eigenmass","type":"definition"},{"name":"Liquidation Cascade Vortex","description":"Liquidation events as programmed vortexes with eigenmass distribution ρ(H,P)","type":"definition"},{"name":"Tick Crossing as Braid","description":"Upward crossing = σᵢ, downward = σᵢ⁻¹; high frequency → vortex signal","type":"bridge"}],"tags":["blockchain","AMM","liquidation","vortex","eigenmass","HCMMR"],"layer":"documentation","dependencies":["HCMMR"],"summary":"Maps on-chain AMM curves and liquidation cascades to HCMMR vortex detection: tick crossings as braid generators, eigenmass as liquidity depth."}
+{"file":"6-Documentation/docs/distilled/AtomicResolution_EntropyCollapse_2026-05-11.md","title":"Atomic Resolution — Entropy Collapse Detector","concepts":[{"name":"Minimal Observable","description":"1D coordinate s_longitudinal along group heading, per individual","type":"definition"},{"name":"Behavioral Atom","description":"Single pairwise overtaking event σᵢ — substrate-invariant across slime mold, fish, starlings, cattle, rats, AMMs","type":"definition"},{"name":"Data Schema Atom","description":"individual_id:u16, timestamp:u32, s_longitudinal:i32 (Q16.16 fixed-point)","type":"definition"},{"name":"Triple Condition","description":"Braid crossings > K, σ_q < σ_c, D_q → 1 — fully computable from N scalar streams","type":"invariant"}],"tags":["atomic-resolution","entropy-collapse","detector","behavioral","overtaking","schema"],"layer":"documentation","dependencies":[],"summary":"Strips entropy-collapse detector to atomic resolution: minimal per-individual observable is 1D longitudinal coordinate, behavioral atom is pairwise overtaking event."}
+{"file":"6-Documentation/docs/distilled/ArithmeticSpec_Corrected_2026-05-11.md","title":"Corrected Arithmetic Specification — Entropy-Collapse Detector","concepts":[{"name":"Dense Ranking Rule","description":"Equal values get equal rank; tied pairs excluded from crossing count","type":"algorithm"},{"name":"Crossing Count","description":"W=8: crossings=12 (corrected from 18), K=7 FPR=94.57%, K=21 strict FPR=3.05%","type":"receipt"},{"name":"Hurst Exponent","description":"H=σ_q=0.032 on test series (extremely anti-persistent, n=8 too short for robust estimate)","type":"receipt"},{"name":"Rényi D2","description":"D_q bounded in [0,1]; D_c=1.2 is definition mismatch for this estimator","type":"definition"}],"tags":["arithmetic","correction","braid-crossing","Hurst","Rényi","detector"],"layer":"documentation","dependencies":[],"summary":"Corrected arithmetic for entropy-collapse detector: dense ranking, corrected crossing count 12 (not 18), K=21 strict FPR 3.05%."}
+{"file":"6-Documentation/docs/distilled/Alpha_Inverse_137_Derivation.md","title":"α⁻¹ ≈ 137.036 — Fine-Structure Constant Derivation Survey","concepts":[{"name":"Fine-Structure Constant","description":"α⁻¹ = 137.035999084(21) CODATA 2018, dimensionless ratio coupling electron charge to photon field","type":"definition"},{"name":"HCMMR Calibration Reference","description":"α⁻¹ anchored as calibration reference, not derived from first principles in HCMMR","type":"definition"},{"name":"Q16_16 Anchor","description":"alpha_inverse = ⟨8980791⟩ = 137.036 × 65536 in FixedPoint.lean","type":"receipt"}],"tags":["alpha","fine-structure","constant","CODATA","HCMMR","calibration"],"layer":"documentation","dependencies":["Law18_Constants"],"summary":"Survey of geometric/dimensional arguments for why α⁻¹ ≈ 137, with HCMMR anchoring it as calibration reference rather than first-principles derivation."}
+{"file":"6-Documentation/docs/distilled/16D_Manifold_Adjustment.md","title":"16D Manifold Adjustment","concepts":[{"name":"16D Shell Atlas","description":"Gap-6 prime-lens shell atlas with hourglass pinch, torus lens, mirrored cone/void, spectral bands","type":"architecture"},{"name":"Composite as Closure Defect","description":"Composites are not mistakes — they become closure defects, NaN0 scars, or residual packets","type":"definition"},{"name":"4D Block Decomposition","description":"q_void (triangles/filled cones), q_orbit (circles/lenses), q_braid (X diagonals), η_observer (color bands)","type":"definition"}],"tags":["16D","manifold","adjustment","shell-atlas","prime","projection"],"layer":"documentation","dependencies":[],"summary":"Adjusts 2D drawings into 16D universe model projections with prime/composite shell structure and 4D block decomposition."}
+{"file":"6-Documentation/docs/distilled/0D_genus_layer_infinity_absorption_2026-06-19.md","title":"0D Genus Layer: Absorbing Infinities","concepts":[{"name":"0D Genus Layer","description":"Zero-width layer at genus-0 absorbing all infinities from physics equations (Hawking-Ellis, Vaidya, EFE)","type":"definition"},{"name":"Gabriel's Horn Model","description":"Finite volume (π) + infinite surface area; tip as x→∞ IS the 0D genus layer geometry","type":"definition"},{"name":"Menger-Horn Pipeline","description":"16D→0D dimensional descent like Gabriel's Horn with shrinking cross-section","type":"architecture"},{"name":"Torricelli Paradox Reframed","description":"You can fill coverage domain (finite) but cannot paint its boundary (infinite); 0D layer absorbs painting","type":"definition"}],"tags":["0D-genus","infinity","Gabriel-Horn","Menger","pipeline","compactification"],"layer":"documentation","dependencies":[],"summary":"Resolves infinity requirements from physics equations by embedding them into zero-width 0D genus layer, modeled by Gabriel's Horn tip geometry."}
+{"file":"shared-data/artifacts/deepseek_review/prime_gap_entropy_collapse_deepseek_deepseek-v3.2_20260512T033551Z.md","title":"Prime Gap Entropy Collapse DeepSeek v3.2 Review","concepts":[{"name":"Prime Gap Entropy Collapse Detector","description":"Sliding-window detector using braid crossing count, Hurst exponent (σ_q), and correlation dimension (D₂) on prime gaps to identify entropy-collapse motifs.","type":"algorithm"},{"name":"K=7 Braid Threshold","description":"Original non-selective threshold with 94.57% FPR under random-permutation null. Identified as artifact source.","type":"invariant"},{"name":"K=21 Corrected Threshold","description":"Calibrated threshold yielding ~5% FPR under random-permutation null. Strict >21 gives 3.05% FPR; inclusive >=21 gives 5.43%.","type":"invariant"},{"name":"Fusion Rule","description":"Triple condition: braid(t→t+1) AND sigma_q(window t+1) AND D_q(window t+1) targeting turbulent transition into collapsed arrival window.","type":"protocol"},{"name":"Random-Permutation Null","description":"Statistical null model assuming distinct values and uniform marginals; inappropriate for prime gaps due to ties and local dependence.","type":"definition"},{"name":"Sidon Label","description":"Address from a set where all pairwise sums are distinct; powers of 2 are canonical Sidon set for 8 strands.","type":"definition"}],"tags":["prime-gaps","entropy-collapse","braid-crossing","statistical-validation","FPR","permutation-null","deepseek-review"],"layer":"receipt","dependencies":["ArithmeticSpec_Corrected_2026-05-11"],"summary":"DeepSeek v3.2 review validates the prime-gap entropy-collapse detector arithmetic, identifies K=7 as non-selective (94.57% FPR), confirms K=21 as defensible at ~5% FPR, and catalogs 6 failure modes including tied ranks and overlapping windows."}
+{"file":"shared-data/artifacts/deepseek_review/prime_gap_entropy_collapse_deepseek_deepseek-v4-flash_continuation_20260512T033849Z.md","title":"Prime Gap Entropy Collapse DeepSeek v4-Flash Continuation","concepts":[{"name":"Canonical Spec Patches","description":"10 explicit warnings and clarifications to add to the canonical spec covering heuristic thresholds, window features, prime-gap null mismatch, multiple testing, and reproducibility.","type":"recipe"},{"name":"Parameter Sensitivity","description":"Results depend on window size (n=8), step size (1), and feature thresholds; small changes can eliminate or create signals.","type":"invariant"},{"name":"Edge Effects","description":"First and last n-1 windows have incomplete neighbors for the fusion rule; must be excluded or treated separately.","type":"recipe"}],"tags":["prime-gaps","statistical-validation","spec-patches","reproducibility","deepseek-review"],"layer":"receipt","dependencies":["Prime Gap Entropy Collapse Detector"],"summary":"Continuation of DeepSeek review providing 10 canonical spec patches including warnings about heuristic thresholds, window features, prime-gap null mismatch, multiple testing, and reproducibility requirements."}
+{"file":"shared-data/artifacts/adversarial_review/adversarial_semantics_review_2026-05-31.md","title":"Adversarial Review: Semantics Lean Codebase","concepts":[{"name":"QFactor Double-Scaling Bug","description":"ofNat 65536 creates Q16_16 with raw integer 65536*65536=4294967296 which saturates to q16MaxRaw, producing garbage results in calculateQFactor.","type":"gate"},{"name":"sub_eq_add_neg Overflow","description":"Admitted theorem that is false when b.toInt = q16MinRaw because neg q16MinRaw overflows to q16MaxRaw, off by 1.","type":"theorem"},{"name":"abs_mul_le False Theorem","description":"Admitted theorem with documented counterexamples; downstream modules can derive False from it.","type":"theorem"},{"name":"ofFloat in Compute Paths","description":"942 occurrences of ofFloat in compute paths violating AGENTS.md mandate; undermines fixed-point determinism guarantee.","type":"invariant"},{"name":"Division by Zero Asymmetry","description":"Q16_16 division by zero returns infinity (maxVal) while Int division by zero is silent no-op; creates divergent behavior.","type":"gate"},{"name":"Tautological Eigensolid Convergence","description":"eigensolid_convergence proof is h_eig — hypothesis IS the conclusion; provides no actual convergence guarantee.","type":"theorem"},{"name":"ACI Preservation Theorem","description":"Central safety theorem of SSMS admitted with dependencies on known-false lemmas sub_eq_add_neg and abs_triangle.","type":"theorem"},{"name":"Sidon Slack Underflow","description":"UInt32 subtraction wraps around if slot > 128; no precondition ensures slot ≤ 128 in BraidEigensolid.lean.","type":"gate"},{"name":"AVMIsa Missing Primitives","description":"Prim.addSatQ16 and Prim.subSatQ16 declared but not implemented in evalPrim; always return typeMismatch error.","type":"gate"},{"name":"Q16_16 Constants via ofFloat","description":"pi, e, ln2, sqrt2 defined via ofFloat introducing 1 LSB error; should use ofRatio with rational approximations.","type":"definition"}],"tags":["adversarial-review","lean-verification","q16-16","fixed-point","proof-integrity","false-theorems","ofloat-violation"],"layer":"receipt","dependencies":["FixedPoint.lean","BraidEigensolid.lean","AVM.lean","QFactor.lean","SSMS.lean","AdjugateMatrix.lean"],"summary":"Comprehensive adversarial review of Semantics Lean codebase finding 7 CRITICAL, 12 HIGH, 18 MEDIUM, 9 LOW issues including false admitted theorems, 942 ofFloat violations, tautological convergence proof, and systemic Q16_16 compliance failures."}
+{"file":"shared-data/artifacts/adversarial_review/FULL_ADVERSARIAL_REVIEW_2026-05-31.md","title":"Full Adversarial Review — Research Stack","concepts":[{"name":"Verilog Q16_16 Multiply Bug","description":"a_reg * b_reg produces Q32.0 not Q16.16; missing >>16 shift means every hardware computation through the central ALU is off by 2^16.","type":"gate"},{"name":"WGSL Data Races","description":"Pervasive non-atomic += on shared storage buffers from multiple workgroups; all GPU compute results are non-deterministic.","type":"gate"},{"name":"Rust Double-Free","description":"Arc::from_raw on pointer from Arc::as_ptr steals reference count; exploitable memory corruption in thermodynamic.rs.","type":"gate"},{"name":"Shell Injection","description":"format!(\"command -v {command}\") passes unsanitized input to sh -lc; arbitrary command execution in tools/src/lib.rs.","type":"gate"},{"name":"Hardcoded Credentials","description":"30+ files contain plaintext passwords, OAuth secrets, and API keys committed to git.","type":"gate"},{"name":"SHA-256 Padding Bug","description":"Only 62 bits assigned instead of 64-bit big-endian bit count in cff_accelerator.v; all hardware hashes incorrect.","type":"gate"},{"name":"Remote Code Execution Vectors","description":"11 RCE vectors across Python (pickle.load, eval, torch.load, trust_remote_code), Rust (shell injection), and Shell (root password in process list).","type":"gate"},{"name":"Credential Exposure","description":"8 credential exposure sites including production RDS hostname, internal Tailscale IPs, decrypted credentials printed to stdout, and bearer tokens over HTTP.","type":"gate"}],"tags":["adversarial-review","security","verilog","wgsl","rust","python","credential-exposure","rce","memory-safety"],"layer":"receipt","dependencies":["adversarial_semantics_review_2026-05-31"],"summary":"Full-codebase adversarial review scanning ~35,000 source files finding 248 issues (51 CRITICAL, 76 HIGH, 80 MEDIUM, 41 LOW) across Lean, Verilog, WGSL, Rust, Python, TypeScript, and Shell with 11 RCE vectors, 8 credential exposures, and systemic AGENTS.md compliance violations."}
+{"file":"shared-data/artifacts/lean_expert_agent/qc_report_2026-05-13.md","title":"QC Report — Physics/ Code Structure & Efficiency","concepts":[{"name":"absDiff Duplication","description":"absDiff function duplicated 4x across DESIInvariant, H0ValveTest, ValveTestSuite, ClusterBHAnchors; should be in Shared.lean.","type":"recipe"},{"name":"scale = 65536 Duplication","description":"scale constant duplicated 6x; should be single shared definition.","type":"recipe"},{"name":"Dead Code","description":"Dead q16_div in DESIModelProjection, dead DESIParam in DESIInvariant, dead ModelParams/Residual/Verdict structures.","type":"recipe"},{"name":"Naming Convention Audit","description":"rD → rd field naming, SCALE vs scale casing inconsistency, Q16.16 arithmetic inconsistency between files.","type":"recipe"}],"tags":["qc-report","lean-structural","duplication","dead-code","naming-conventions","physics"],"layer":"receipt","dependencies":["DESIInvariant.lean","UniversalBridge.lean","DESIModelProjection.lean"],"summary":"QC report finding 4 high-priority structural issues (duplication + dead code), 5 medium-priority (dead structures, consolidation), and 5 low-priority (consistency, naming) across 8 Physics/ files, all building cleanly with 3529 jobs."}
+{"file":"shared-data/artifacts/claim_cross_reference_report_2026-05-21.md","title":"Claim Cross-Reference Report: Attack CSVs vs. Research Stack Repo","concepts":[{"name":"Claim Cross-Reference Methodology","description":"Direct grep search across repo followed by file content inspection; classification: DEFENDED, ORPHANED, RENAMED, UNEXPECTED_CONNECTION.","type":"protocol"},{"name":"Epistemic Tag Self-Correction","description":"Repo uses PRIOR ART, PROJECT DATA, INFERENCE, SPECULATIVE tags to self-label claim strength; attack misses this self-correction mechanism.","type":"pattern"},{"name":"Sidon Addressing Novelty","description":"Attack confirms Sidon addressing as genuinely novel; implemented in Rust + Python + Lean.","type":"definition"},{"name":"Conversational Genre Mischaracterization","description":"Attack reads user-requested analogies and thought experiments as scientific claims; assistant consistently warned against literal interpretation.","type":"pattern"},{"name":"Honesty Audit","description":"Repo's boundary statements and epistemic tags are more precise than attack's blunt verdicts; repo is self-critical about its own claims.","type":"pattern"},{"name":"Orphaned Claims","description":"RFS-16096, hydrogen closure η_H=τ/α, and 'Underverse' have zero repo evidence.","type":"definition"}],"tags":["claim-verification","adversarial-attack","epistemic-honesty","cross-reference","sidon-addressing"],"layer":"receipt","dependencies":["CITATION.cff","AGENTS.md","MATH_MODEL_MAP.tsv"],"summary":"Cross-references attack CSVs against repo evidence across number theory, math physics, fractal topology, and framework domains; finds attack is directionally correct but systematically mischaracterizes conversational genre as scientific claims, missing the repo's self-correction mechanisms."}
+{"file":"shared-data/data/stack_solidification/theorem_jiggle_dag_2026-05-13.md","title":"Theorem Jiggle DAG","concepts":[{"name":"Theorem Jiggle","description":"Placeholder or vacuous theorem proving trivial statements; fixed by replacing with honest comments or real consistency checks.","type":"pattern"},{"name":"get! Without isSome Guard","description":"Unsafe array access .get! without companion .isSome theorem; fixed by adding intermittency_midpoint_some companion theorem.","type":"gate"},{"name":"Heuristic Constants","description":"Moody chart slopes, calibrated w0, wa with no SM derivation — acknowledged as heuristic but acceptable for engineering bridge.","type":"definition"}],"tags":["theorem-jiggle","lean-verification","physics","q16-16","build-receipt"],"layer":"receipt","dependencies":["PhotonTorsionProbe.lean","DESIInvariant.lean","UniversalBridge.lean"],"summary":"Audited 82 theorems across Physics/ files, fixed 3 jiggles (placeholder theorems, vacuous bounds, missing guards), acknowledged 10 known jiggles as acceptable heuristics, with 69 clean theorems (84%) and 3529-job zero-error build."}
+{"file":"shared-data/data/stack_solidification/rg_flow_assumption_dag_2026-05-13.md","title":"RG Flow Assumption DAG","concepts":[{"name":"SM Beta Functions","description":"Standard 1-loop RGEs for SM couplings validated by LEP, LHC, g-2 to 10^-12; Generation 1 — SOLID.","type":"theorem"},{"name":"omega = |β|/|g|","description":"Well-defined dimensionless number at EW scale (0.05775); calling it 'torsion' is a metaphysical leap with no geometric justification.","type":"definition"},{"name":"alpha = max|β|/(4π)","description":"Invented relation with no Lagrangian term; 1-loop formula gives 10% error, 2-loop correction retrofitted to match α=1/137.036.","type":"definition"},{"name":"w0 Projection Formula","description":"Heuristic projection with no QFT derivation; uses ΛCDM best-fit values to predict deviation from ΛCDM — circular.","type":"definition"},{"name":"wa from SM Running","description":"SM gives wa≈-0.06 from Higgs running; DESI observes wa=-0.59±0.25. Factor 10 gap — most interesting tension.","type":"definition"},{"name":"CMB from omega","description":"Q≈ω·α/π predicts CMB fluctuation amplitude 13× above measured; handwaved as Saha approximation error.","type":"definition"}],"tags":["rg-flow","renormalization-group","cosmology","dark-energy","assumption-tracing","heuristic"],"layer":"receipt","dependencies":["DESIModelProjection.lean","CMBTorsion.lean","TorsionWall.lean","CouplingRotation.lean"],"summary":"Traces 7 generations of RG flow assumptions; Gens 1-2 pass inspection (SM beta functions solid, omega defined but mislabeled), Gens 3-7 are invented/heuristic/broken; recommends deleting CMBTorsion.lean and TorsionWall.lean unless alpha formula gets proper derivation."}
+{"file":"shared-data/data/stack_solidification/qc_witness_fix_dag_2026-05-13.md","title":"QC Fix DAG — Missing Witnesses","concepts":[{"name":"Missing Witness Fix","description":"Added #eval witnesses and annotations to 10 files that lacked computational verification for their definitions.","type":"recipe"}],"tags":["qc-fix","lean-witnesses","eval","build-receipt"],"layer":"receipt","dependencies":["Q16Utils.lean","DESIModelProjection.lean","QCLEnergy.lean","StringStarConstants.lean"],"summary":"Added missing #eval witnesses and annotations to 10 Physics/ files; lake build passes."}
+{"file":"shared-data/data/stack_solidification/qc_unused_imports_fix_dag_2026-05-13.md","title":"QC Fix DAG — Unused Imports Removal","concepts":[{"name":"Unused Import Removal","description":"Removed redundant imports from 6 files; kept imports that are directly used. Verified by 3530-job lake build.","type":"recipe"}],"tags":["qc-fix","lean-imports","dead-code","build-receipt"],"layer":"receipt","dependencies":["BindPhysics.lean","Interaction.lean","QCLEnergy.lean","StringStarConstants.lean","NBody.lean","Tests.lean"],"summary":"Removed unused imports from 6 Physics/ files while preserving all directly-used imports; 3530-job build passes."}
+{"file":"shared-data/data/stack_solidification/qc_naming_round2_fix_dag_2026-05-13.md","title":"QC Naming Round 2 Fix DAG","concepts":[{"name":"Naming Convention Enforcement","description":"Completed 20 renames across 4 files converting snake_case to camelCase per AGENTS.md §2 naming conventions.","type":"recipe"},{"name":"Hermite Spline Constants","description":"RE_LAMINAR→reLaminar, RE_TURBULENT→reTurbulent, Y0→y0, Y1→y1, H_M0→hM0, H_M1→hM1 in UniversalBridge.lean.","type":"definition"}],"tags":["qc-fix","naming-conventions","camelcase","lean-structural","build-receipt"],"layer":"receipt","dependencies":["UniversalBridge.lean","QCLEnergy.lean","StringStarConstants.lean","NBody.lean"],"summary":"Completed 20 renames across 4 files converting snake_case to camelCase; verified cross-file references, 3530-job build passes."}
+{"file":"shared-data/data/stack_solidification/qc_naming_fix_dag_2026-05-13.md","title":"QC Fix DAG — Naming Convention Fixes","concepts":[{"name":"LawfulInteraction Rename","description":"Renamed to lawfulInteraction across Conservation.lean, Interaction.lean, Tests.lean (3 files).","type":"recipe"},{"name":"FaithfulMeasurement Rename","description":"Renamed to faithfulMeasurement in Projection.lean and Tests.lean (2 files).","type":"recipe"},{"name":"Q16 Constant Naming","description":"Renamed G_const→gConst, c_const→cConst, hbar_const→hbarConst, kB_const→kBConst in StringStarConstants.lean.","type":"recipe"}],"tags":["qc-fix","naming-conventions","camelcase","cross-file-references","build-receipt"],"layer":"receipt","dependencies":["Conservation.lean","Projection.lean","Interaction.lean","SuperpositionalBoundaryLayers.lean","QCLEnergy.lean","StringStarConstants.lean","DESIModelProjection.lean","ValveTestSuite.lean","Tests.lean"],"summary":"Renamed 40+ symbols from snake_case to camelCase across 9 files; all cross-references updated; 3530-job build passes."}
+{"file":"shared-data/data/stack_solidification/qc_l13_l14_fix_dag_2026-05-13.md","title":"QC Fix DAG — L13/L14: DESIInvariant Naming & Precision","concepts":[{"name":"rD→rd Field Rename","description":"Renamed DESIObservation.rD to rd for camelCase consistency.","type":"recipe"},{"name":"rdDr1/rdDr2 Precision Fix","description":"Changed rdDr1 from 147 to 14709 and rdDr2 from 147 to 14718 (×100) for sub-Mpc precision.","type":"recipe"}],"tags":["qc-fix","naming","precision","desi","build-receipt"],"layer":"receipt","dependencies":["DESIInvariant.lean"],"summary":"Renamed rD→rd field and increased BAO sound horizon precision to ×100 (147→14709/14718) in DESIInvariant.lean; 3530-job build passes."}
+{"file":"shared-data/data/stack_solidification/qc_l10_fix_dag_2026-05-13.md","title":"QC Fix DAG — L10: h00/h01 Helper Factoring","concepts":[{"name":"hermiteSharedTerms Helper","description":"Private helper factoring shared Q16.16 arithmetic (t2, t3, term3, term2) from h00 and h01 basis functions.","type":"recipe"}],"tags":["qc-fix","code-deduplication","hermite-spline","q16-16","build-receipt"],"layer":"receipt","dependencies":["UniversalBridge.lean"],"summary":"Factored shared Q16.16 arithmetic into hermiteSharedTerms helper, reducing duplication in h00/h01 basis functions; 3530-job build passes."}
+{"file":"shared-data/data/stack_solidification/qc_flagger_build_dag_2026-05-13.md","title":"QC Flagger Build DAG — Automated Inspection Tool","concepts":[{"name":"lean_qc_flagger","description":"Automated 5-point inspection tool for Lean files: structural health, naming conventions, Q16_16 compliance, proof quality, dependency analysis.","type":"tool"},{"name":"QC Flagger Protocol","description":"5-point inspection: structural health (sorry/axiom count), naming (camelCase check), Q16_16 compliance (Float detection), proof quality (companion theorems), dependency analysis (unused imports).","type":"protocol"}],"tags":["qc-tooling","lean-inspection","automated-verification","scripts"],"layer":"receipt","dependencies":["AGENTS.md"],"summary":"Built lean_qc_flagger.py automated 5-point inspection tool covering structural health, naming, Q16_16 compliance, proof quality, and dependencies; tested on 20 Physics/ files with 227 issues found (0 ERROR)."}
+{"file":"shared-data/data/stack_solidification/qc_f01_fix_dag_2026-05-13.md","title":"QC Fix DAG — F01: 7 sorry Theorems","concepts":[{"name":"F01 Q16_16 FixedPoint Theorems","description":"7 theorems examined: 6 PASS (add_total, mul_total, div_total, round_valid, mul_no_overflow, E_0_bounds), 1 FAIL (convergence_to_fixed_point requires Banach fixed-point theorem).","type":"theorem"},{"name":"convergence_to_fixed_point Quarantine","description":"Theorem quarantined because it requires Banach fixed-point theorem not available in Mathlib.","type":"gate"}],"tags":["qc-fix","lean-proofs","q16-16","fixed-point","banach","quarantine"],"layer":"receipt","dependencies":["F01_Q16_16_FixedPoint.lean"],"summary":"Examined 7 sorry theorems in F01_Q16_16_FixedPoint.lean; proved 6 via exact/simp tactics, quarantined convergence_to_fixed_point as it requires Banach fixed-point theorem; 3530-job build passes."}
+{"file":"shared-data/data/stack_solidification/qc_consolidated_fix_dag_2026-05-13.md","title":"QC Consolidated Fix DAG","concepts":[{"name":"Consolidated QC DAG","description":"Mermaid DAG aggregating all QC fixes: L10 (helper factoring), L13/L14 (naming/precision), F01 (sorry proofs), flagger tool.","type":"receipt"},{"name":"QC Resolution Rate","description":"13 of 14 original QC issues resolved, 1 quarantined (convergence_to_fixed_point).","type":"gate"}],"tags":["qc-consolidated","lean-verification","build-receipt","dag"],"layer":"receipt","dependencies":["qc_l10_fix_dag","qc_l13_l14_fix_dag","qc_f01_fix_dag","qc_flagger_build_dag"],"summary":"Consolidated DAG of all QC fixes: 9 issues fixed, 1 quarantined, 1 new tooling (lean_qc_flagger.py); 3530-job zero-error build."}
+{"file":"shared-data/data/stack_solidification/prime_gap_k21_rerun_receipt_2026-05-11.md","title":"Prime Gap Entropy-Collapse Rerun Receipt — K=21","concepts":[{"name":"K=21 Rerun","description":"Rerun of prime-gap detector with corrected strict threshold crossing_count>21; 38 strict fires across 999,991 windows in first 1M primes.","type":"receipt"},{"name":"Braid-Tail-Only Counts","description":"Counts using only the braid component without sigma_q/D2 filter; shows braid component alone fires much more frequently.","type":"gate"},{"name":"Strict Fire Examples","description":"First 5 strict fires at t=51541,71717,88616,117020,136640 with crossing counts 22-23 and alternating small/large gap motifs.","type":"definition"}],"tags":["prime-gaps","k21-threshold","entropy-collapse","rerun","statistical-validation"],"layer":"receipt","dependencies":["ArithmeticSpec_Corrected_2026-05-11"],"summary":"Reruns prime-gap entropy-collapse detector with corrected K=21 threshold; original K=7 signal (86,565 fires) reduces to 38 strict fires (0.0038%), confirming the original was an artifact of non-selective threshold."}
+{"file":"shared-data/data/stack_solidification/full_stack_assumption_dag_2026-05-13.md","title":"Full-Stack Assumption DAG","concepts":[{"name":"Full-Stack Audit","description":"78 files audited, ~280 assumptions identified across Physics/Lean, Infrastructure/Shim, and 5-Applications.","type":"receipt"},{"name":"Assumption Severity Grades","description":"Green (solid proofs), Yellow (structurally correct but claims not proven), Red (0 theorems, claims in comments only).","type":"gate"},{"name":"Physics Module Grades","description":"PIST.lean Green (17+ real proofs), BraidedFieldPaths Yellow, BraidCross/Law19_VoidScar/BoundaryEigenFire/HyperEigenSpectrum/FAMM/BraidBracket/BraidStrand/BraidField/NBody Red.","type":"definition"},{"name":"Infrastructure Heuristic Assumptions","description":"190+ heuristic assumptions across ~22 receipt generators; dominant failure mode: metaphors written as equations.","type":"definition"},{"name":"PIST Compression","description":"PIST 'compression' is coordinate remapping, not compression; multiple scripts import shock physics as metaphor.","type":"definition"}],"tags":["full-stack-audit","assumption-tracing","physics","infrastructure","severity-grading"],"layer":"receipt","dependencies":["PIST.lean","BraidCross.lean","FAMM.lean","MengerSpongeFractalAddressing.lean"],"summary":"Full-stack audit of 78 files finding ~280 assumptions; PIST.lean is Green (17+ real proofs), 10+ modules are Red (0 theorems, claims in comments only), Infrastructure has 190+ heuristic assumptions, and NBody.lean has a broken theorem referencing nonexistent lemma."}
+{"file":"shared-data/data/stack_solidification/deterministic_build_receipt_2026-05-13.md","title":"Deterministic Build Receipt","concepts":[{"name":"DESI DR2 Constants","description":"Hardcoded Int literals for w₀=-58327, w_a=-31457, w₀(ΛCDM)=-65536, H₀=6826, Ω_m=19312, σ₈=52953, r_d=147; zero Float.","type":"definition"},{"name":"native_decide Theorems","description":"17 theorems verified by native_decide: w0_above_LCDM, wa_below_LCDM, w0_in_3sigma, wa_in_3sigma, omegam_in_3sigma, model_w0_direction_aligns, model_wa_direction_aligns, residual bounds.","type":"theorem"},{"name":"Determinism Guarantee","description":"Every value is a hardcoded Int literal, verified by native_decide (compile-time deterministic), verified by #eval (same result every build), within Lean namespace (no global mutable state).","type":"invariant"},{"name":"Adjacent Coprime Classification","description":"30 theorems verified by native_decide for Fibonacci, Bad, Ex3, Bad2, Ex5 examples with pairwise gcd checks.","type":"theorem"}],"tags":["deterministic-build","desi-dr2","q16-16","native-decide","build-receipt"],"layer":"receipt","dependencies":["DESIInvariant.lean","DESIModelProjection.lean","AdjacentCoprimeClassification.lean"],"summary":"Deterministic build receipt with 3529 jobs, 0 errors; all values are hardcoded Int literals verified by native_decide and #eval; 17 theorems in DESI modules, 30 in AdjacentCoprimeClassification; zero Float arithmetic."}
+{"file":"shared-data/data/stack_solidification/desi_model_projection_receipt_2026-05-13.md","title":"DESI Model Projection Receipt","concepts":[{"name":"DESI DR2 Observational Invariants","description":"w₀=-0.89, w_a=-0.48, Ω_m=0.2947, σ₈=0.808, H₀=68.26, r_d=147 Mpc with Q16_16 encodings.","type":"definition"},{"name":"16D Menger/Koch/Gabriel-Horn Fiber Model","description":"Model projected onto DESI DR2 observables; w₀ calibrated (not predicted), w_a/Ω_m/σ₈ are structural predictions.","type":"architecture"},{"name":"Boundary Statement","description":"Explicit statement: NOT a cosmological model, NOT a replacement for ΛCDM; IS a receipt that Menger/Koch/Gabriel-Horn geometry reproduces direction and sign of observed dark-energy deviation.","type":"invariant"},{"name":"Verified Geometry Constants","description":"Menger d_H=2.7268, Koch D_K=1.2619, divergence base=1.8, horn volume=finite, horn surface α=0.007, torsion β=0.003; all proven in Lean.","type":"theorem"},{"name":"w_a Tension","description":"Model predicts -0.55, DESI observes -0.48; within 1σ but model central value more negative; worth tracking as precision improves.","type":"definition"}],"tags":["desi-dr2","cosmology","dark-energy","menger","koch","gabriel-horn","q16-16","lean-proofs"],"layer":"receipt","dependencies":["DESIInvariant.lean","DESIModelProjection.lean"],"summary":"DESI model projection receipt documenting 17 native_decide theorems comparing 16D Menger/Koch/Gabriel-Horn fiber model against DESI DR2; all observables consistent within 1σ; w₀ calibrated not predicted; explicit boundary statement that this is NOT a cosmological model."}
+{"file":"shared-data/data/stack_solidification/codebase_memory_receipt_2026-05-13.md","title":"Research Stack Receipt: Persistent Codebase Memory","concepts":[{"name":"FAMM-Based Codebase Memory","description":"Rust crate implementing persistent codebase memory with DualMapMemory (ahead/behind maps), DomainBank (1000-cell FAMM bank), and scar differentials.","type":"architecture"},{"name":"CodeDomain","description":"7 domains (0-Core through 6-Docs) for organizing codebase artifacts.","type":"definition"},{"name":"CodeCell","description":"Artifact with path, type, data, delay (staleness), delay_mass (uncertainty), version_hash.","type":"definition"},{"name":"DualMapMemory","description":"ahead (speculative) + behind (committed) + per-domain scar differentials; commit_if_admissible checks |Delta| <= epsilon.","type":"architecture"},{"name":"MemoryAccessReceipt","description":"Receipt emitted by observe/commit operations for auditability.","type":"receipt"}],"tags":["famm","codebase-memory","rust","persistent-state","dual-map","scar-differentials"],"layer":"receipt","dependencies":["FAMM.lean"],"summary":"Built FAMM-based persistent codebase memory Rust crate with 7 CodeDomains, 1000-cell DomainBank, DualMapMemory with scar differentials; 6 tests pass; 3 Lean modules quarantined due to naming collisions."}
+{"file":"shared-data/data/stack_solidification/m4_rydberg_preregistration_receipt_2026-05-22.md","title":"M4 Receipt — Rydberg 1/n Experimental Test Pre-Registration","concepts":[{"name":"Rydberg 1/n Prediction","description":"Fractional frequency shift Δν/ν of rotational transitions in high-n circular Rydberg states scales as 1/n with coefficient C=7/27≈0.259.","type":"theorem"},{"name":"Pre-Registration Lock","description":"Prediction coefficient C=7/27 and test states [40..100] fixed on 2026-05-22; not subject to post-hoc modification.","type":"invariant"},{"name":"Falsification Criteria","description":"If |Δν/ν(n) - C/n| > 2σ for ≥3 distinct n values in [40,100], prediction falsified; if ≥5 of 7 test states consistent, provisionally confirmed.","type":"gate"},{"name":"RydbergExperimentalTest Module","description":"Lean module with predictedFracShift, uncertainty envelopes, fracShiftConsistent, testStates, minConsistentStates, falsificationThreshold, PreRegistration structure, 4 theorems + 7 #eval! witnesses.","type":"spec"}],"tags":["rydberg","pre-registration","experimental-test","spectroscopy","lean-formalization","falsifiable"],"layer":"receipt","dependencies":["RydbergExperimentalTest.lean"],"summary":"Pre-registered experimental test predicting Δν/ν = (7/27)/n for high-n Rydberg states; formalized in Lean with honest uncertainty envelopes, falsification criteria, and 7 test states; awaiting ETH Zürich experimental data."}
+{"file":"shared-data/data/stack_solidification/m3_honest_uncertainty_bounds_receipt_2026-05-22.md","title":"M3 Receipt — Honest Uncertainty Bounds Fix","concepts":[{"name":"PredictedValue Structure","description":"Structure with central/lower/upper/sigma fields for honest uncertainty envelopes; replaces exact-match claims.","type":"definition"},{"name":"Exact-Match Replacement","description":"Replaced 6 '0.00% error' exact-match theorems with honest uncertainty envelopes using residualBounded and percentResidual.","type":"recipe"},{"name":"Calibration vs Prediction","description":"w₀ is calibrated (set equal to DESI central value), not predicted; residual bounded at 0σ by design.","type":"invariant"},{"name":"Fine Structure Constant Honest Bound","description":"Changed from residual=0 to residual≤66 (Q16_16 resolution); residual≈1.7×10⁻⁶ well within fixed-point truncation.","type":"definition"}],"tags":["uncertainty-bounds","honest-reporting","q16-16","desi","fine-structure","calibration"],"layer":"receipt","dependencies":["UncertaintyBounds.lean","DESIModelProjection.lean","Law18_Constants.lean"],"summary":"Replaced 6 exact-match '0.00% error' claims with honest uncertainty envelopes using PredictedValue structure; clarified w₀ calibration vs prediction; fine-structure constant residual bounded at Q16_16 resolution."}
+{"file":"shared-data/data/stack_solidification/credential_server_recovery_receipt_2026-05-17.md","title":"Credential Server & PQ SSH Recovery Receipt","concepts":[{"name":"Credential Server","description":"HTTP API at 172.245.19.182:8444 serving credentials for 8 providers (deepseek, quandela, wolfram_alpha, gemini, ollama, venice, bedrock, linear).","type":"architecture"},{"name":"Post-Quantum SSH","description":"OpenSSH 10.0p2 with ML-KEM + X25519 hybrid KEX (mlkem768x25519-sha256); Ed25519 host keys; legacy DSA/SSHv1 removed.","type":"protocol"},{"name":"Credential Provider","description":"Client-side module querying microVM for credentials; resolution chain: rds → remote → config_file → env.","type":"tool"},{"name":"Credential Recovery","description":"Recovery steps: extract keys from Research-Stack-Archive-2026-05-12.tar, run recover_credential_server.sh, verify /status endpoint.","type":"recipe"}],"tags":["credential-server","post-quantum-ssh","ml-kem","recovery","microvm","tailscale"],"layer":"receipt","dependencies":["recover_credential_server.sh","credential_provider.py"],"summary":"Documents credential server deployment on RackNerd microVM with 8 provider backends, post-quantum SSH (ML-KEM+X25519 hybrid), and recovery procedure from Research-Stack-Archive."}
+{"file":"shared-data/data/stack_solidification/rds_substrate_provisioning_receipt_2026-05-17.md","title":"RDS Substrate Provisioning Receipt","concepts":[{"name":"RDS Substrate","description":"PostgreSQL 17.7 on aarch64 at database-1-instance-1.cghu8yqogqwo.us-east-1.rds.amazonaws.com:5432; IAM auth, SSL required.","type":"architecture"},{"name":"Provisioned Schemas","description":"4 schemas (credential_store, topology, knowledge, ingestion) with 9 tables covering encrypted credentials, node topology, pgvector embeddings, and job queue.","type":"spec"},{"name":"pgvector Knowledge Storage","description":"HNSW-indexed pgvector(1536) embeddings table for document chunk vectors.","type":"architecture"},{"name":"Credential Ingestion","description":"6 providers (bedrock, deepseek, ollama, quandela, venice, wolfram_alpha) ingested with classification levels and node assignments.","type":"recipe"}],"tags":["rds","postgresql","pgvector","credential-store","topology","knowledge-graph"],"layer":"receipt","dependencies":["provision_schema.py","credential_provider.py"],"summary":"Provisioned PostgreSQL 17.7 RDS as central data substrate with 4 schemas (credential_store, topology, knowledge, ingestion), pgvector HNSW embeddings, and 6 ingested credential providers."}
+{"file":"shared-data/data/stack_solidification/credential_provider_deployment_receipt_2026-05-17.md","title":"Credential Provider Deployment Receipt","concepts":[{"name":"apiProvider Service","description":"New ServiceKind added to TopologyNode.lean with [.network] hardware requirements and 1 Q16_16 cost per tick.","type":"definition"},{"name":"Source Credential Extraction","description":"6 API keys extracted from Research-Stack-Archive-2026-05-12.tar: DeepSeek, Quandela, Wolfram Alpha, Gemini, Ollama, Venice.","type":"recipe"},{"name":"Credential Provider Module","description":"Python module credential_provider.py with resolve_credential(provider) interface; resolution chain: rds → remote → config_file → env.","type":"tool"}],"tags":["credential-provider","topology","api-provider","deployment","microvm"],"layer":"receipt","dependencies":["TopologyNode.lean","credential_provider.py","embedded_surface/server.py"],"summary":"Deployed apiProvider service to microVM topology; extracted 6 API keys from archive; created credential_provider.py with multi-source resolution chain; Lean verification blocked by pre-existing FixedPoint.lean failures."}
+{"file":"e2e/E2E_MASTER_RECEIPT.md","title":"E2E Master Receipt — End-to-End Trace for E = mc²","concepts":[{"name":"E2E Master Trace","description":"8-step end-to-end pipeline processing E=mc² from raw LaTeX through EquationShape, spectral profile, Sidon address, chaos game, Finsler metric, QUBO, QAOA, Hachimoji state, to SHA-256 receipt.","type":"receipt"},{"name":"EquationShape Parsing","description":"Structural signature ⟨n_vars=3, n_ops=2, max_depth=1, n_quantifiers=0, n_relations=1⟩ for E=mc²; proven by rfl.","type":"theorem"},{"name":"Sidon Address","description":"8-element Sidon address [4,16,16,1,16,1,16,8] as spectral fingerprint; proven valid by simp.","type":"theorem"},{"name":"Chaos Game Basin Convergence","description":"Deterministic Sidon-guided chaos game converging to q_braid basin in 1390 steps; IFS contraction α=0.5.","type":"algorithm"},{"name":"Finsler Metric Construction","description":"F = α(Fisher) + β(torsion drift) Randers metric; α=0.4167 base cost, β=0.1500 drift strength.","type":"definition"},{"name":"QUBO Encoding","description":"8 binary variables, 36 couplings encoding Finsler path cost as quadratic unconstrained binary optimization.","type":"algorithm"},{"name":"QAOA Circuit","description":"p=2 depth, 8 qubits, approximation ratio >0.95; bitstring [1,0,0,0,0,0,0,0] selecting Φ state.","type":"algorithm"},{"name":"Hachimoji State Φ","description":"beautifulTopologicalFolding regime, phase 0°, forward direction, ambidextrous chirality; proven by rfl.","type":"theorem"},{"name":"Merkle Receipt Hash","description":"SHA-256 hash of canonical JSON (sorted keys, no whitespace) of all 8 step witnesses; any change invalidates receipt.","type":"receipt"}],"tags":["e2e-trace","e-mc2","equation-shape","sidon-address","chaos-game","finsler","qubo","qaoa","hachimoji","merkle","lean-proofs"],"layer":"receipt","dependencies":["E2EMasterTrace.lean","BinnedFormalizations.lean","EquationFractalEncoding.lean","TransportTheory.lean","HachimojiSubstitution.lean","SidonSets.lean","chaos_game_16d.py","qaoa_adapter.py"],"summary":"Complete 8-step E2E trace for E=mc²: 3 steps PROVEN (shape, Sidon, Hachimoji), 3 COMPUTED (chaos game, QAOA, hash), 2 STATED with sorry (Finsler, QUBO); 15 top-level theorems, receipt SHA-256 committed."}
+{"file":"library/MASTER_LIBRARY_RECEIPT.md","title":"Master Receipt: Chentsov-Hachimoji Library Integration","concepts":[{"name":"Chentsov's Uniqueness Theorem","description":"Fisher information metric is the unique Riemannian metric on the 8-state Hachimoji probability simplex; proven with zero sorry in ChentsovFinite.lean.","type":"theorem"},{"name":"HachimojiCodec Pipeline","description":"5-stage deterministic pipeline: Parse → Classify → Receipt → Admit → Emit; converts equations to certified emit stamps.","type":"architecture"},{"name":"Fisher-Metric Classification","description":"Equations classified by Fisher-metric distance on the Chentsov-unique simplex; thresholds forced by the metric, not hand-tuned.","type":"algorithm"},{"name":"Triple RRC Admission","description":"Three gates: typeAdmissible (structural type match), projectionAdmissible (Fisher distance in region), mergeAdmissible (both pass).","type":"gate"},{"name":"Hachimoji States","description":"8 states: ADMIT(A), TRACE(T), GROUND(G), CHALLENGE(C), BIND(B), SEARCH(S), PROOF(P), ZERO(Z) with Fisher distance ranges.","type":"definition"},{"name":"Deterministic Classification","description":"No randomness, no ML, no external state; same equation always produces same state, receipt, and stamp.","type":"invariant"}],"tags":["chentsov","hachimoji","fisher-metric","codec","classification","admission-gates","lean-proofs"],"layer":"receipt","dependencies":["ChentsovFinite.lean","HachimojiCodec.lean","hachimoji_codec.py"],"summary":"Integrates Chentsov's uniqueness theorem (Fisher metric is unique on Δ⁷, proven zero sorry) with HachimojiCodec 5-stage pipeline; 12/12 test equations pass; 7/12 admitted via triple RRC gating; receipt hash committed."}
+{"file":"library/codec_receipt.md","title":"Hachimoji Codec — Library Receipt","concepts":[{"name":"EquationShape","description":"5-field structure: n_vars, n_ops, max_depth, n_quantifiers, n_relations extracted from equation text.","type":"definition"},{"name":"HachimojiState","description":"8 Greek states (Φ, Λ, Ρ, Κ, Ω, Σ, Π, Ζ) with conditions based on structural features.","type":"definition"},{"name":"LogogramReceipt","description":"Receipt with regime (beautifulTopologicalFolding/tornManifoldRegime/horribleManifoldTearing) and 5 witness booleans.","type":"receipt"},{"name":"Admission Gates","description":"typeAdmissible, projectionAdmissible (payloadBound ∨ (tearBoundary ∧ ¬detachedMass)), mergeAdmissible (¬residualLane).","type":"gate"},{"name":"Regime Table","description":"Maps each Hachimoji state to regime and 5 boolean witness flags determining admission outcome.","type":"spec"}],"tags":["hachimoji","codec","equation-shape","admission-gates","regime-table","deterministic"],"layer":"receipt","dependencies":["hachimoji_codec.py","HachimojiCodec.lean"],"summary":"Hachimoji codec receipt documenting 5-stage pipeline (Parse→Classify→Receipt→Admit→Emit), 8 Hachimoji states with regime tables, 3 admission gates, 6/6 tests passing, and full determinism guarantee."}
+{"file":"library/CONCEPTUAL_UPGRADE_RECEIPT.md","title":"Conceptual Upgrade Receipt — Operator-Theoretic Hachimoji Codec V2","concepts":[{"name":"HachimojiState4D","description":"4-dimensional state descriptor: Phase × Chirality × Direction × Regime; 144 possible 4-tuples, only 8 canonical states satisfy all invariants.","type":"definition"},{"name":"Consistency Invariant","description":"6 rules encoding structural coherence: Phase-Direction, Axis-Chirality, Beautiful Phase Range, Horrible Phase Range, Left Chirality-Direction, Regime Half-Plane.","type":"invariant"},{"name":"consistency_error_bound Theorem","description":"¬consistencyInvariant(s) → admission(s, shape) = QUARANTINE; deterministic structural guarantee replacing statistical reasoning.","type":"theorem"},{"name":"Counterexample Detection","description":"Detects old pipeline E∘S failure modes: DEGENERATE_PROJECTION, EMPTY_EIGENSPACE, NO_SPECTRAL_STRUCTURE, SAMPLING_NON_TERMINATION, BASE_RATE_LEAKAGE.","type":"gate"},{"name":"Base-Rate Leakage","description":"Old spectral pipeline appeared to work because Fiedler vector is near center of eigenspace distribution; any estimator returning mean gets ~92.5% purity for free.","type":"definition"},{"name":"Operator-Theoretic Shift","description":"From statistical reasoning ('92.5% purity') to structural reasoning ('4-tuple satisfies all 6 invariants'); no sampling, no randomness.","type":"pattern"}],"tags":["hachimoji-v2","operator-theoretic","consistency-invariant","counterexample-detection","base-rate-leakage","lean-proofs"],"layer":"receipt","dependencies":["HachimojiCodecV2.lean","hachimoji_codec_v2.py","counterexample_detector.py","ChentsovFinite.lean"],"summary":"Upgrades Hachimoji codec from 1D regime classifier to 4D state descriptor with 6-rule consistency invariant, counterexample detection for old pipeline failure modes, and theorem-backed deterministic structural guarantee; 17/17 + 14/14 + 10/10 tests pass."}
+{"file":"lean_binned/receipts/BIND_OPT_RECEIPT.md","title":"BIND Optimization Receipt v2.0","concepts":[{"name":"Bind Semigroup Cocycle","description":"Reformulated BindAssociative as semigroup cocycle condition: f(ab,c)+f(a,b) = f(a,bc)+f(b,c); well-typed, mathematically meaningful, general for any A and M.","type":"theorem"},{"name":"Five Bind Axioms","description":"Associativity (cocycle), Identity (monoid), Metric Monotonicity, Triangle Inequality, Torsion Awareness; all as Lean classes extending Associative.","type":"definition"},{"name":"T1 SIM Reduces to Fisher-Rao","description":"When τ=0, torsion tensor vanishes, Fisher metric is unique monotone metric by Chentsov's theorem, SIM flow reduces to Fisher-Rao natural gradient flow.","type":"theorem"},{"name":"S1-S4 Specializations","description":"S1_FisherRaoBind (τ=0, commutative), S2_AlcubierreBind (τ=warp), S3_MOIM_Bind (empirical), S4_MetabolicBind (evolving, genus-3).","type":"definition"},{"name":"s1_fisher_symmetry","description":"Fisher information matrix is symmetric by commutativity of real multiplication; proven by rw [mul_comm].","type":"theorem"},{"name":"Vacuous Theorem Elimination","description":"Replaced 4 True:=by trivial theorems (T1-T4) with proper mathematical statements with sorry and detailed proof sketches.","type":"recipe"}],"tags":["bind-axioms","cocycle","fisher-rao","chentsov","coherence","lean-proofs","s1-s4"],"layer":"receipt","dependencies":["BindAxioms.lean","T1_Coherence.lean","InformationManifold.lean"],"summary":"Rewrites bind axiomatization from broken ill-typed associativity to semigroup cocycle condition; eliminates 4 vacuous True:=by trivial theorems with proper statements; adds S1-S4 specializations; 4 proven theorems, 10 sorry with proof sketches."}
+{"file":"lean_binned/receipts/CLOSED_TRACE_RECEIPT.md","title":"Closed Trace Receipt — End-to-End Integration","concepts":[{"name":"Closed Trace v1","description":"6-step end-to-end trace for E=mc²: EquationShape → 5D Manifold → Sidon Address → Chaos Game → Bind Cost → Merkle Hash; 9 proven, 3 stated.","type":"receipt"},{"name":"5D Manifold Projection","description":"complexity=0.667, abstraction=0.0, verification=1.0, cross_domain=0.5, utility=0.42 for E=mc²; proven by rfl.","type":"theorem"},{"name":"Bind Cost (Fisher-Rao)","description":"bind_cost≈1.208 using Fisher-Rao distance with BindTriangleInequality axiom; stated with sorry.","type":"definition"},{"name":"Merkle Tree Hash Chain","description":"SHA-256 receipt hash computed from all 5 witness hashes; singleton root equals element, mixing is non-commutative.","type":"receipt"}],"tags":["closed-trace","e2e","equation-shape","sidon-address","chaos-game","bind-cost","merkle","lean-proofs"],"layer":"receipt","dependencies":["ClosedTrace.lean","BindAxioms.lean","SidonSets.lean","EquationFractalEncoding.lean","BinnedFormalizations.lean","T1_Coherence.lean","InformationManifold.lean","chaos_game_16d.py"],"summary":"First closed end-to-end trace for E=mc² through 6 components; 9 theorems proven, 3 stated with sorry; demonstrates all optimized components wire together from equation text to cryptographic receipt."}
+{"file":"lean_binned/receipts/SIDON_OPT_RECEIPT.md","title":"Sidon-Chaos Optimization Receipt","concepts":[{"name":"Sidon Chaos Addresses","description":"8-element Sidon set {1,2,4,8,16,32,64,128} for strand labeling; proven Sidon by native_decide.","type":"theorem"},{"name":"chaos_trajectory_no_collision","description":"MAIN THEOREM: Two trajectories with same total address and length≤2 have same unordered strand pairs; proven via Sidon property of powers of 2.","type":"theorem"},{"name":"sidon_guided_basin_unique","description":"Basin assignment is unique for short trajectories; same address implies same trajectory (up to permutation).","type":"theorem"},{"name":"sidon_8strand_full_capacity","description":"All 36 unordered pairwise sums are distinct, achieving theoretical Sidon maximum; proven by native_decide.","type":"theorem"},{"name":"E8-to-8-Strand Bridge","description":"240 E8 roots → 120 positive roots → 8 simple roots; each αᵢ maps to strand i with Sidon address 2ⁱ; Coxeter number h=30 connects to Singer modulus 31=5²+5+1.","type":"architecture"},{"name":"Deterministic Sidon-Guided Chaos Game","description":"LCG seeding from equation hash, strand selection via sidon_address(hash%8), convergence detection by energy ratio variance <0.01.","type":"algorithm"},{"name":"e8_sidon_embed","description":"Core function: hash → (Sidon addr, E8 coeff) triple-step embedding; proven valid, deterministic, and injective on addresses.","type":"algorithm"}],"tags":["sidon-sets","chaos-game","e8-lattice","collision-free","deterministic-convergence","lean-proofs"],"layer":"receipt","dependencies":["SidonSets.lean","E8Sidon.lean","chaos_game_16d.py"],"summary":"Optimizes Sidon-chaos pipeline with 10 proven theorems including chaos_trajectory_no_collision, E8-to-8-strand bridge (Coxeter number connects to Singer modulus), and deterministic convergence; 3 conjectural/WIP theorems remain."}
+{"file":"lean_binned/receipts/SPECTRAL_OPT_RECEIPT.md","title":"Spectral Optimization Receipt","concepts":[{"name":"EquationShape Parser","description":"Replaced meaningless omega proofs with prove_shape function computing actual parse; rfl proves parsing equals claimed structure at compile time.","type":"recipe"},{"name":"5D Manifold Coordinates","description":"Replaced hash-based golden-ratio noise with actual equation properties: complexity=operator density, abstraction=quantifier depth, verification=proof status, cross_domain=cross-refs, utility=search frequency.","type":"recipe"},{"name":"Proper Merkle Tree","description":"Replaced commutative addition-based subtree fold with mixHash using 33-bit rotation, 17-bit rotation, and odd constant multiplication; non-commutative and non-associative.","type":"algorithm"},{"name":"Spectral-to-Sidon Bridge","description":"spectral_to_sidon_address maps 8D spectral profile to Sidon address via magnitude thresholds; B2 Sidon property guarantees unique addressing.","type":"algorithm"},{"name":"Sidon Address Validity","description":"sidon_address_valid theorem proven; all pairwise sums distinct; chaos game IFS contraction ensures convergence to unique fixed point.","type":"theorem"}],"tags":["spectral-binning","equation-shape","merkle-tree","sidon-addressing","chaos-game","lean-proofs"],"layer":"receipt","dependencies":["BinnedFormalizations.lean","EquationFractalEncoding.lean","eigensolid_pipeline.py"],"summary":"Rewrites 3 core files fixing 4 critical issues: meaningless binned formalizations replaced with real EquationShape parser, hash-based manifold replaced with equation properties, broken Merkle tree replaced with proper non-commutative mixHash, and spectral-to-Sidon bridge added."}
+{"file":"6-Documentation/INFRASTRUCTURE.md","title":"Research Stack Infrastructure","concepts":[{"name":"Tailscale Mesh Network","description":"5-node mesh: nixos (control plane), qfox-1 (GPU RTX 4070), 361395-1 (edge/funnel), racknerd (edge worker), steamdeck (worker).","type":"architecture"},{"name":"k3s Cluster","description":"v1.35.4+k3s1 with Flannel CNI, Traefik ingress; namespaces: services, media, mail, monitoring, edge, ai-models, research.","type":"architecture"},{"name":"Tang Nano 9K FPGA","description":"Gowin GW1NR-LV9 with Blitter6502OISC SUBLEQ CPU, Q16 LUT Core, Voltage Controller, Scale Space BRAM, HiGHS Pivot; 195.92 MHz achieved.","type":"architecture"},{"name":"Video-as-Compute","description":"GPU detection and optimization routing for NVIDIA/AMD/CPU via vcn_compute_substrate.py; lossless YUV range correction; heterogeneous frame slicing.","type":"architecture"},{"name":"Q16 LUT Core","description":"Hardware fixed-point arithmetic unit: 8 ops (add, sub, mul, div, sqrt, abs, min, max), 2-stage pipeline, 74ns latency.","type":"primitive"},{"name":"Blitter6502OISC","description":"SUBLEQ CPU with 4K memory, UART; 2000 LUTs, ~500 FFs.","type":"architecture"},{"name":"Lean 4 / Semantics","description":"Lean 4.30.0-rc2 + Mathlib; 3572 jobs, 0 errors; 10,353 .lean files; key modules: FixedPoint, AdjugateMatrix, GoldenRatioSeparation, etc.","type":"spec"},{"name":"Caddy with Porkbun DNS-01","description":"Wildcard TLS certificates via Porkbun DNS-01 challenge; domain researchstack.info.","type":"protocol"},{"name":"Authentik OIDC","description":"SSO authentication for web-facing endpoints; auth.researchstack.info.","type":"protocol"}],"tags":["infrastructure","tailscale","k3s","fpga","tang-nano-9k","gpu","lean-4","caddy","authentik"],"layer":"infrastructure","dependencies":[],"summary":"Comprehensive infrastructure documentation covering Tailscale mesh (5 nodes), k3s cluster (7 namespaces), Tang Nano 9K FPGA (SUBLEQ CPU + Q16 LUT), GPU video-as-compute, Lean 4 Semantics (3572 jobs), and Caddy/Authentik TLS/SSO."}
+{"file":"6-Documentation/DISASTER_RECOVERY.md","title":"Disaster Recovery — Research Stack","concepts":[{"name":"etcd Backup","description":"k3s etcd-snapshot save with automated cron job (3 AM daily, 7-day retention); restore via --cluster-reset-restore-path.","type":"recipe"},{"name":"FPGA Bitstream Recovery","description":"Source and compiled bitstream in git repo; re-flash via openFPGALoader -b tangnano9k; SRAM contents volatile (UART dump before power-off).","type":"recipe"},{"name":"Tailscale Re-authentication","description":"Restart tailscaled, use auth key from password manager or backup; state stored at /var/lib/tailscale/.","type":"recipe"},{"name":"Git Repository Backup","description":"Canonical backup is remote origin; push all changes + tags; add backup remote for redundancy.","type":"recipe"},{"name":"sops-nix / age Key Backup","description":"Backup age keys from /etc/age/keys.txt; re-encrypt secrets with new key as last resort.","type":"recipe"},{"name":"DNS/Porkbun Recovery","description":"Regenerate Porkbun API key, update k8s secret, restart Caddy for renewal.","type":"recipe"},{"name":"Recovery Priority Order","description":"Tailscale → Git → age keys → k3s cluster → DNS/Porkbun → FPGA → Services.","type":"recipe"}],"tags":["disaster-recovery","backup","restore","k3s","fpga","tailscale","sops","age","dns"],"layer":"infrastructure","dependencies":["INFRASTRUCTURE.md"],"summary":"Disaster recovery procedures for all Research Stack components: etcd backup/restore, FPGA re-flash, Tailscale re-auth, git remote backup, sops-nix age keys, DNS/Porkbun API key recovery; recovery priority order documented."}
+{"file":"6-Documentation/RUNBOOK.md","title":"Ops Runbook — Research Stack","concepts":[{"name":"k3s Health Check","description":"kubectl get nodes/pods, journalctl -u k3s, rollout restart for pod restarts, force delete for stuck pods.","type":"recipe"},{"name":"FPGA Debug","description":"LED state interpretation (all off=halted, blinking=running, LED0 solid=trap), UART debug via picocom at 115384 baud, re-flash procedure.","type":"recipe"},{"name":"Tailscale Debug","description":"tailscale status/ping, funnel restart on 361395-1, relay detection, direct-peers-only mode.","type":"recipe"},{"name":"GPU/Ollama Ops","description":"nvidia-smi monitoring, Ollama restart (k3s pod or systemd), model pull/manage, NodePort access at 31434.","type":"recipe"},{"name":"DNS/TLS Ops","description":"LE cert check (valid until 2026-08-18), Caddy renewal trigger, Porkbun DNS verification.","type":"recipe"},{"name":"Escalation Matrix","description":"Pod down→rollout restart, Node down→SSH+systemctl, FPGA→re-flash, Tailscale→auth key, DNS→Caddy, GPU→nvidia-smi.","type":"recipe"}],"tags":["runbook","ops","k3s","fpga","tailscale","gpu","dns","tls","troubleshooting"],"layer":"infrastructure","dependencies":["INFRASTRUCTURE.md"],"summary":"Quick-reference operational procedures for k3s cluster, FPGA Tang Nano 9K, Tailscale mesh, GPU/Ollama, and DNS/TLS with escalation matrix for common failures."}
+{"file":"6-Documentation/FPGA_PROGRAMMING_GUIDE.md","title":"FPGA Programming Guide — SUBLEQ on the Blitter","concepts":[{"name":"SUBLEQ Instruction","description":"3-word instruction: [src][dst][next]; mem[dst]-=mem[src], if≤0 PC=next else PC+3; next==0 is HALT.","type":"primitive"},{"name":"Memory Map","description":"$0000-$0FFF program+data, $8000-$800F Q16 LUT registers, $8010 voltage controller, $8011 scale space, $8020-$8025 HiGHS pivot, $FF00-$FF03 UART, $FFF0 LED, $FFF1 button.","type":"spec"},{"name":"Q16 LUT Operations","description":"8 opcodes: add, sub, mul, div, sqrt, abs, min, max; 2-cycle latency (74ns @ 27MHz); operands written to $8000-$8003, result read from $8008-$8009.","type":"primitive"},{"name":"Q16.16 Encoding","description":"value = integer_part × 65536 + fraction_part; 1.0=65536, 0.5=32768, 3.14=205887, -1.0=-65536.","type":"definition"},{"name":"Voltage Controller Modes","description":"4 BRAM modes: STORE (direct R/W), COMPUTE (Q16 LUT), APPROX (fast), MORPHIC (morphic field).","type":"definition"},{"name":"UART Loading","description":"Programs loaded via UART at 115384 baud; each word as 2 bytes big-endian; also via openFPGALoader SRAM/flash.","type":"recipe"},{"name":"SUBLEQ Example Programs","description":"Blink LED (toggle loop), Q16 Addition (hardware LUT), UART Send Character (poll + write).","type":"recipe"}],"tags":["fpga","subleq","blitter","q16-lut","uart","memory-map","tang-nano-9k","gowin"],"layer":"infrastructure","dependencies":["research_stack_top.v","q16_lut_core.v","Blitter6502OISC_small.v"],"summary":"FPGA programming guide for SUBLEQ CPU on Tang Nano 9K: instruction format, memory map ($0000-$FFFF), Q16 LUT operations (8 opcodes, 74ns), voltage controller modes, UART loading, and 3 example programs."}
+{"file":"6-Documentation/API_DOCS.md","title":"API Documentation — Research Stack Services","concepts":[{"name":"Authentik OIDC","description":"Web-facing endpoints use Authentik OIDC SSO at auth.researchstack.info; scopes: openid, profile, email, groups.","type":"protocol"},{"name":"Bearer Token Auth","description":"API endpoints (/api/*) use Bearer token authentication managed by Credential Server.","type":"protocol"},{"name":"Cluster Dashboard API","description":"FastAPI+Vite at /server/dash/; endpoints: /api/status (cluster health), /api/metrics (Prometheus), /ws/live (WebSocket events).","type":"spec"},{"name":"Credential Server API","description":"Endpoints: /health, /tokens (list), /issue (create), /validate; Bearer token auth.","type":"spec"},{"name":"Registry API","description":"Artifact registry with CRUD; filters by type (bitstream, lean-build, receipt), since timestamp, limit.","type":"spec"},{"name":"Jobs API","description":"Job queue with create/list/cancel/logs; types include lean-build; SSE for log streaming.","type":"spec"},{"name":"Blobs API","description":"Binary blob storage with upload (multipart+SHA-256 verification), download, existence check, delete, list.","type":"spec"},{"name":"Rate Limits","description":"100 req/min for cred, 200 for registry, 50 for jobs, 100 for blobs; X-RateLimit headers.","type":"spec"}],"tags":["api","oidc","authentik","credential-server","registry","jobs","blobs","rate-limits"],"layer":"infrastructure","dependencies":["INFRASTRUCTURE.md"],"summary":"API documentation for 5 services: Cluster Dashboard (FastAPI+Vite), Credential Server, Registry API, Jobs API, and Blobs API; all use Authentik OIDC or Bearer token auth; rate limits documented."}