# SilverSight Glossary

A living dictionary of terms used across the SilverSight core, libraries, documentation, and receipts.

**Rule:** Every entry must name the authoritative source file or module. A glossary entry without a source module is a draft; it must be promoted to a bound definition before it is used in a receipt or gate.

**Deep Wiki Compatible:** Each entry includes File:Line references, tags for categorization, and cross-references to related terms.

---

## Standard Terminology Crosswalk

SilverSight invents names only when necessary. When a concept already exists under a standard name, the glossary binds the SilverSight name to the standard name and explains the delta.

| SilverSight Term | Standard Terminology | Delta / Note | File:Line | Tags | See Also |
|------------------|----------------------|--------------|-----------|------|----------|
| **Sidon set** | B₂ sequence, Erdős–Sidon set | Standard combinatorial object; SilverSight uses it for deterministic strand addressing. | formal/CoreFormalism/SidonSets.lean:L1 | #mathematical #core | [Sidon label](#sidon-label), [IsIntervalSidon](#isintervalsidon) |
| **Sidon label** | Sidon-set element, B₂ address | Chosen from the canonical powers-of-2 set for 8-strand braids. | formal/CoreFormalism/InteractionGraphSidon.lean:L1 | #mathematical #core | [Sidon set](#sidon-set) |
| **Q16_16** | Fixed-point arithmetic, Q15.16 / s16.16 | Signed 32-bit fixed point with 16 integer and 16 fractional bits. | Core/SilverSight/FixedPoint.lean:L1 | #core #implementation | [Q0_16](#q0_16), [ofFloat](#offloat) |
| **BraidStorm** | Braid group representation, Artin braid | 8-strand braid action used as a compression/determinism substrate. | formal/CoreFormalism/BraidEigensolid.lean:L1 | #mathematical #core | [eigensolid](#eigensolid), [crossStep](#crossstep) |
| **eigensolid** | Fixed point, attractor | Fixed point of the crossStep operator; not a physical solid. | formal/CoreFormalism/BraidEigensolid.lean:L42 | #mathematical #core | [crossStep](#crossstep), [BraidStorm](#braidstorm) |
| **crossStep** | Braid generator / crossing operator | One deterministic update step in the braid dynamics. | formal/CoreFormalism/BraidCross.lean:L1 | #mathematical #core | [eigensolid](#eigensolid), [BraidStorm](#braidstorm) |
| **AVM** | Abstract/virtual machine, stack machine | SilverSight-specific instruction set and transition relation. | Core/SilverSightCore.lean:L1 | #core #implementation | [TIC](#tic), [AvmTy](#avmty) |
| **TIC** | Logical clock, event counter | Monotone counter derived from AVM transitions. | Core/SilverSightCore.lean:L1 | #core #implementation | [AVM](#avm) |
| **Receipt** | Attestation, certificate, proof certificate | Machine-readable record of a gate result; the compressed state. | Core/SilverSightCore.lean:L1 | #core #protocol | [FixtureRow](#fixturerow), [emit](#emit) |
| **Hachimoji** | 8-letter alphabet, octal state | The 8-symbol output alphabet of the core classifier. | formal/CoreFormalism/HachimojiLUT.lean:L1 | #core #mathematical | [Hachimoji state](#hachimoji-state) |
| **Finsler-Randers** | Asymmetric metric, quasimetric | Directed routing cost with anisotropy parameter beta. | qubo/finsler_metric.py:L1 | #mathematical #planned | [QUBO](#qubo) |
| **QUBO** | Ising model, binary quadratic optimization | Energy minimization over binary variables. | qubo/qubo_builder.py:L1 | #mathematical #planned | [Finsler-Randers](#finsler-randers) |
| **meta-solid** | Topological triple point, phase coexistence | Point where three independent equivalence relations collapse. | formal/CoreFormalism/BraidEigensolid.lean:L1 | #mathematical | [eigensolid](#eigensolid) |
| **promotion** | Certification, acceptance | Status advance only after a formal gate passes. | AGENTS.md:L1 | #protocol | [quarantine](#quarantine) |
| **quarantine** | Archive, staging, broken build exclusion | Module kept out of the active build until repaired. | AGENTS.md:L1 | #protocol | [promotion](#promotion) |
| **Genome18** | Codon LUT, k=6 fixed-point address | Research Stack vocabulary-lock name for CodonLUT (k=6): 6 x 3-bit Hachimoji inputs -> 18-bit address. SilverSight binds this to formal/CoreFormalism/HachimojiLUT.lean CodonLUT. | formal/CoreFormalism/HachimojiLUT.lean:L1 | #mathematical | [CodonLUT](#codonlut) |
| **equationPosition** | Manifold localization, equation embedding | The deterministic map EquationShape -> SpherePoint that answers where does this equation live on the manifold? | formal/CoreFormalism/HachimojiLUT.lean:L4 | #mathematical | [SpherePoint](#spherepoint) |

---

## Core Terms

| Term | Definition | File:Line | Tags | See Also |
|------|------------|-----------|------|----------|
| **Hachimoji state** | One of the 8 output symbols Φ Λ Ρ Κ Ω Σ Π Ζ produced by the core classifier. | Core/SilverSightCore.lean:L1 | #core | [Hachimoji](#hachimoji) |
| **Receipt** | The compressed, machine-readable attestation record that crosses the Core/library boundary. It is not metadata around a result; it is the result. | Core/SilverSightCore.lean:L1 | #core #protocol | [FixtureRow](#fixturerow) |
| **AVM** | Adaptive Virtual Machine. The stack-machine transition semantics delta defined in the core; the universal bridge between math languages and executable traces. | Core/SilverSightCore.lean:L1 | #core #implementation | [TIC](#tic), [AvmTy](#avmty) |
| **TIC** | Temporal Index of Computation. A monotone event counter derived from AVM state transitions. | Core/SilverSightCore.lean:L1 | #core #implementation | [AVM](#avm) |
| **pathCost** | Raw integer cost metric carried on a Receipt; never a Float. | Core/SilverSightCore.lean:L1 | #core | [Receipt](#receipt) |
| **Library method** | The architecture rule: Core/ defines contracts, libraries implement them, and no library imports another library. | AGENTS.md:L1 | #protocol | [Core](#core) |
| **Core** | The invariant center of SilverSight: Core/SilverSightCore.lean and Core/SilverSight/FixedPoint.lean. Defines Receipt, AVM, TIC, and canonical Q16_16. | AGENTS.md:L1 | #core | [Library method](#library-method) |
| **Schema** | Typeclass describing fixed-size, well-formed data: byteSize and wellFormed. | Core/SilverSight/Semantics/Schema.lean:L1 | #core #implementation | [byteSize](#bytesize), [wellFormed](#wellformed) |
| **byteSize** | Number of bytes occupied by a value of a Schema type; constant and statically known. | Core/SilverSight/Semantics/Schema.lean:L1 | #core #implementation | [Schema](#schema) |
| **wellFormed** | Predicate asserting that a value satisfies its Schema invariants. | Core/SilverSight/Semantics/Schema.lean:L1 | #core #implementation | [Schema](#schema) |
| **Layout** | Physical data placement: rowMajor, columnar, compact, mmapView. | Core/SilverSight/Semantics/Layout.lean:L1 | #core #implementation | [AccessProfile](#accessprofile), [rowMajor](#rowmajor) |
| **AccessProfile** | Read/write mix used by the layout cost model. | Core/SilverSight/Semantics/Layout.lean:L1 | #core #implementation | [Layout](#layout) |
| **WireFormat** | Certified encoder/decoder pair for a Schema under a Layout. | Core/SilverSight/Semantics/WireFormat.lean:L1 | #core #implementation | [roundTrip](#roundtrip) |
| **roundTrip** | WireFormat axiom: decode (encode a) = some a for every value. | Core/SilverSight/Semantics/WireFormat.lean:L1 | #core #protocol | [WireFormat](#wireformat) |
| **View** | Zero-copy, address-bounded window into a ByteArray. | Core/SilverSight/Semantics/View.lean:L1 | #core #implementation | [LayoutBridge](#layoutbridge) |
| **LayoutBridge** | Certified conversion between two Layouts with a round-trip guarantee. | Core/SilverSight/Semantics/LayoutBridge.lean:L1 | #core #implementation | [Layout](#layout), [View](#view) |
| **CanalRegime** | Storage regime (cold, warm, hot, flash) used by layout selection. | Core/SilverSight/Semantics/CanalLayout.lean:L1 | #core #implementation | [CanalLayout](#canallayout) |
| **CanalLayout** | Module that maps CanalRegime to a preferred Layout and profile. | Core/SilverSight/Semantics/CanalLayout.lean:L1 | #core #implementation | [CanalRegime](#canalregime) |
| **rowMajor** | Default Layout: fields stored contiguously in declaration order. | Core/SilverSight/Semantics/Layout.lean:L1 | #core #implementation | [Layout](#layout) |
| **mmapView** | Layout optimized for memory-mapped, read-only access. | Core/SilverSight/Semantics/Layout.lean:L1 | #core #implementation | [Layout](#layout) |
| **BraidState** | Aggregated braid carrier state used by the eigensolid compressor. | formal/CoreFormalism/BraidState.lean:L1 | #mathematical #core | [BraidStorm](#braidstorm) |

---

## RRC / AVM ISA

| Term | Definition | File:Line | Tags | See Also |
|------|------------|-----------|------|----------|
| **RRC** | Receipt Routing Classifier. Aligns PIST structural labels with RRC semantic routing shapes and emits gate receipts. | formal/SilverSight/RRC/Emit.lean:L1 | #core #protocol | [RRCShape](#rrcshape), [FixtureRow](#fixturerow) |
| **CoreFormalism** | The SilverSight foundational library containing canonical Q16_16, Sidon sets, braid dynamics, and related lemmas. | formal/CoreFormalism/:L1 | #core #mathematical | [SidonSets](#sidonsets) |
| **RRCShape** | One of six lawful routing shapes: cognitiveLoadField, signalShapedRouteCompiler, logogramProjection, projectableGeometryTopology, cadForceProbeReceipt, holdForUnlawfulOrUnderspecifiedShape. | formal/SilverSight/RRCLogogramProjection.lean:L1 | #core #protocol | [WitnessStatus](#witnessstatus) |
| **WitnessStatus** | candidate (admits next-stage checks) or hold (blocked pending more evidence). | formal/SilverSight/RRCLogogramProjection.lean:L1 | #protocol | [RRCShape](#rrcshape) |
| **LogogramReceipt** | Receipt core for one compiled logogram projection, carrying shape, status, regime, and tear evidence. | formal/SilverSight/RRCLogogramProjection.lean:L1 | #core #protocol | [RRCShape](#rrcshape) |
| **FixtureRow** | One compiled equation record with raw features and optional PIST labels; input to the RRC alignment gate. | formal/SilverSight/RRC/Emit.lean:L1 | #core | [AlignmentStatus](#alignmentstatus) |
| **AlignmentStatus** | Result of determineAlignment: alignedExact, alignedProxy, compatibleStructuralProjection, alignmentWarning, or missingPrediction. | formal/SilverSight/RRC/Emit.lean:L1 | #protocol | [FixtureRow](#fixturerow) |
| **determineAlignment** | RRC alignment gate that maps a FixtureRow and optional PIST labels to an AlignmentStatus. | formal/SilverSight/RRC/Emit.lean:L1 | #protocol | [FixtureRow](#fixturerow) |
| **AvmTy** | Closed-world AVM type universe: q0_16, q16_16, bool. | formal/SilverSight/AVMIsa/Types.lean:L1 | #core #implementation | [AvmVal](#avmval) |
| **AvmVal** | Typed AVM value payload indexed by AvmTy. | formal/SilverSight/AVMIsa/Value.lean:L1 | #core #implementation | [AvmTy](#avmty) |
| **Instr** | AVM instruction set: push, pop, dup, swap, load, store, jump, jumpIf, prim, halt. | formal/SilverSight/AVMIsa/Instr.lean:L1 | #core #implementation | [Prim](#prim) |
| **Prim** | Finite AVM primitive set: boolean ops and saturating Q0_16/Q16_16 add/sub. | formal/SilverSight/AVMIsa/Instr.lean:L1 | #core #implementation | [Instr](#instr) |
| **AVMIsa.Emit** | Top-level JSON output boundary. Stamps AVM canary receipts and RRC corpus bundles. | formal/SilverSight/AVMIsa/Emit.lean:L1 | #core #protocol | [RRC](#rrc) |
| **TDoku16D** | Projected gradient descent constraint propagation on the 16D subspace. | formal/SilverSight/PIST/Tdoku16D.lean:L1 | #mathematical | [Q16_16](#q16_16) |
| **CrossDomainSynthesis** | Enclosure and defect proof boundaries validating critical ratios. | formal/SilverSight/PIST/CrossDomainSynthesis.lean:L1 | #mathematical | [MultiSurfacePacker](#multisurfacepacker) |
| **MultiSurfacePacker** | Multi-surface Lagrangian optimization decision logic. | formal/SilverSight/PIST/MultiSurfacePacker.lean:L1 | #mathematical | [CrossDomainSynthesis](#crossdomainsynthesis) |

---

## Fixed-point and Numerics

| Term | Definition | File:Line | Tags | See Also |
|------|------------|-----------|------|----------|
| **Q16_16** | Canonical 32-bit fixed-point type: 16 integer bits and 16 fractional bits. The sole source of truth for core arithmetic. | Core/SilverSight/FixedPoint.lean:L1 | #core #implementation | [Q0_16](#q0_16), [ofFloat](#offloat) |
| **Q0_16** | 16.16-style fixed-point interpretation used for bounded unit-interval quantities. | Core/SilverSight/FixedPoint.lean:L1 | #core #implementation | [Q16_16](#q16_16) |
| **ofFloat** | Conversion from Float to Q16_16. Permitted only at external boundaries (JSON parsing, sensor input); must be immediately bracketed. | AGENTS.md:L1 | #protocol #implementation | [Q16_16](#q16_16), [Float](#float) |
| **ofNat / ofRatio / ofRawInt** | Canonical constructors for Q16_16 values in compute paths. | Core/SilverSight/FixedPoint.lean:L1 | #core #implementation | [Q16_16](#q16_16) |
| **Float** | IEEE-754 floating-point type. Forbidden in SilverSight compute paths; permitted only at external JSON/sensor boundaries and must be immediately converted to Q16_16. | AGENTS.md:L1 | #protocol #deprecated | [ofFloat](#offloat) |

---

## Braid / Eigensolid Compression

| Term | Definition | File:Line | Tags | See Also |
|------|------------|-----------|------|----------|
| **BraidStorm** | The 8-strand braid topology used by the eigensolid compressor. Strands cross pairwise; each crossing merges phase and produces a residual. | formal/CoreFormalism/BraidEigensolid.lean:L1 | #mathematical #core | [eigensolid](#eigensolid), [crossStep](#crossstep) |
| **eigensolid** | The converged, stable state of a braid crossing loop; detected when crossStep(s) = s. | formal/CoreFormalism/BraidEigensolid.lean:L42 | #mathematical #core | [crossStep](#crossstep), [BraidStorm](#braidstorm) |
| **crossStep** | One braid-crossing iteration that merges phase and emits a residual. | formal/CoreFormalism/BraidCross.lean:L1 | #mathematical #core | [eigensolid](#eigensolid), [BraidStorm](#braidstorm) |
| **strand** | A single braided carrier with phase accumulator, parity, slot, residue, jitter, and admissibility bracket. | formal/CoreFormalism/BraidStrand.lean:L1 | #mathematical #core | [BraidStorm](#braidstorm) |
| **Yang-Baxter** | The braid relation that defines braid-order invariance. | formal/CoreFormalism/BraidEigensolid.lean:L1 | #mathematical | [BraidStorm](#braidstorm) |

---

## Sidon / Number Theory

| Term | Definition | File:Line | Tags | See Also |
|------|------------|-----------|------|----------|
| **Sidon set** | A set where all pairwise sums a + b are unique up to reordering. | formal/CoreFormalism/SidonSets.lean:L1 | #mathematical #core | [Sidon label](#sidon-label) |
| **Sidon label** | An address from a Sidon set. Powers of 2 {1,2,4,8,16,32,64,128} are canonical for 8 strands. | formal/CoreFormalism/InteractionGraphSidon.lean:L1 | #mathematical #core | [Sidon set](#sidon-set) |
| **Sidon slack** | Address budget minus the maximum label used; encodes capacity headroom. | formal/CoreFormalism/SidonSets.lean:L1 | #mathematical | [Sidon set](#sidon-set) |
| **IsIntervalSidon** | Predicate stating that a finite set is a Sidon subset of {1,...,N}. | formal/CoreFormalism/SidonSets.lean:L1 | #mathematical | [Sidon set](#sidon-set) |
| **IsSidonMod** | Predicate stating that a set is Sidon modulo M: sums are unique up to congruence. | formal/CoreFormalism/SidonSets.lean:L1 | #mathematical | [Sidon set](#sidon-set) |
| **sidonMaximum** | Extremal function h(N) returning the maximum size of an interval Sidon set. | formal/CoreFormalism/SidonSets.lean:L1 | #mathematical | [Sidon set](#sidon-set) |
| **Singer theorem** | Existence of a Sidon set of size q+1 modulo q^2+q+1 for prime powers q. | formal/CoreFormalism/SidonSets.lean:L1 | #mathematical | [Sidon set](#sidon-set) |
| **Lindstrom bound** | Upper bound for interval Sidon sets. | formal/CoreFormalism/SidonSets.lean:L1 | #mathematical | [Sidon set](#sidon-set) |
| **interaction graph** | Typed directed graph whose adjacency matrix is tested for the Sidon witness property. | formal/CoreFormalism/InteractionGraphSidon.lean:L1 | #mathematical | [Sidon label](#sidon-label) |
| **weak-axis CRT** | Chinese Remainder Theorem reconstruction used for RRC weak-axis classification. | formal/CoreFormalism/SieveLemmas.lean:L1 | #mathematical | [SieveLemmas](#sievelemmas) |

---

## How to Add or Update an Entry

1. Add a row to the appropriate table
2. Make the File:Line column point at the exact file and line number
3. Add relevant Tags for categorization
4. Add See Also links to related terms using #anchor format
5. If the term has a standard name, add it to the Standard Terminology Crosswalk
6. If the term is used in a receipt or gate, ensure the source module proves the property
7. Run python3 -m py_compile on any touched Python and lake build on any touched Lean

---

## Deep Wiki Integration

All terms are indexed by term name, file path, tags, and cross-references for deep wiki compatibility.


---

## Spiral Packing & Layout

| Term | Definition | File:Line | Tags | See Also |
|------|------------|-----------|------|----------|
| **Integer Spiral Packing** | Corpus-wide packing of signed coefficients using base 328,469 with offset 164,234. Unpack inverts exactly, round-trip verified over all 250 matrices. | python/spectral_codebook.py:L1 | #implementation #mathematical | [phi_corkscrew_index](#phi_corkscrew_index) |
| **phi_corkscrew_index** | Index function for corkscrew packing. Previously not injective ((-1,1) and (1,0) both gave 1 in base 2). Fixed upstream. | python/phi_corkscrew.py:L1 | #mathematical | [Integer Spiral Packing](#integer-spiral-packing) |

---

## f(n) Layout (Decorative)

| Term | Definition | File:Line | Tags | See Also |
|------|------------|-----------|------|----------|
| **f(n) layout** | Decorative layout where each entry gets radius_sq and angle_frac. Computed in decimal because indices reach ~10^44 where float64 keeps zero fractional bits. | python/f_layout.py:L1 | #implementation #mathematical | [radius_sq](#radius_sq), [angle_frac](#angle_frac) |
| **radius_sq** | Spiral index value in f(n) layout, representing squared radius. | python/f_layout.py:L1 | #mathematical | [f(n) layout](#fn-layout) |
| **angle_frac** | Angular fraction in f(n) layout, computed in decimal for precision. Min angular separation ≈ 4.6×10^-6 of a turn. | python/f_layout.py:L1 | #mathematical | [f(n) layout](#fn-layout) |

---

## Cartan Floor & Fingerprints

| Term | Definition | File:Line | Tags | See Also |
|------|------------|-----------|------|----------|
| **Cartan Δ-floor** | Floor parameter Δ = 17/1792 exact (CartanConnection.lean:70). Used for Fisher version on Δ_7. | formal/SilverSight/PIST/CartanConnection.lean:L70 | #mathematical #core | [Fisher version](#fisher-version), [Δ_7](#δ_7) |
| **Fisher version** | Fisher version on Δ_7 with Cartan Δ-floor. 13 fingerprint pairs fall below Δ, merging 196 fingerprints into 187 Δ-resolution codewords. | python/spectral_codebook.py:L1 | #implementation #mathematical | [Cartan Δ-floor](#cartan-Δ-floor) |
| **Δ_7** | 7-dimensional simplex with Fisher-Rao metric. Cartan connection defined on J¹(Δ_7). | formal/SilverSight/PIST/CartanConnection.lean:L1 | #mathematical | [Cartan Δ-floor](#cartan-Δ-floor) |
| **fingerprint** | Characteristic polynomial coefficients as unique identifier. 196 unique fingerprints across 250 matrices. | python/charpoly_codebook.py:L1 | #mathematical | [codeword](#codeword), [Cartan Δ-floor](#cartan-Δ-floor) |
| **codeword** | Δ-resolution codeword after applying Cartan floor. 187 codewords from 196 fingerprints. | python/spectral_codebook.py:L1 | #mathematical | [fingerprint](#fingerprint) |

---

## Torus Winding

| Term | Definition | File:Line | Tags | See Also |
|------|------------|-----------|------|----------|
| **TorusWinding** | Winding data structure carrying a_exact/b_exact (plain ℤ). Supersedes _safe variant which only detected saturation. | python/torus_winding.py:L1 | #implementation #mathematical | [a_exact](#a_exact), [torus_to_spiral_index](#torus_to_spiral_index) |
| **a_exact** | Exact integer parameter in TorusWinding, enables lossless round trips. | python/torus_winding.py:L1 | #implementation | [TorusWinding](#toruswinding) |
| **b_exact** | Exact integer parameter in TorusWinding, enables lossless round trips. | python/torus_winding.py:L1 | #implementation | [TorusWinding](#toruswinding) |
| **torus_to_spiral_index** | Function mapping torus winding to spiral index. Prefers a_exact/b_exact for lossless round trips. Regression-tested at n = 10^9. | python/torus_winding.py:L1 | #implementation #mathematical | [TorusWinding](#toruswinding) |