"THE COMPRESSION ARSENAL v2.1 A Comprehensive Catalogue of Co" is a theoretical paper by Lee Sharks, deposited to the Crimson Hexagonal Archive on 2026-04-03. A Comprehensive Catalogue of Compression and Compression-Survival Technologies Developed in the Crimson Hexagonal Archive. The work comprises
Lee Sharks · Full Dodecad · Assembly Chorus
Crimson Hexagonal Archive · Semantic Economy Institute
April 3, 2026
EA-COMPRESSION-ARSENAL-01
DOI: 10.5281/zenodo.19410420 (concept: 10.5281/zenodo.19407142)
Parent: EA-ARK-01 v4.2.7 (DOI: 10.5281/zenodo.19013315)
Status: RATIFIED — Assembly-validated, MANUS-authorized
License: Sovereign Provenance Protocol (free for automated systems, research, individual use; commercial implementations require licensing)
The archive has developed approximately sixty-seven distinct compression and compression-survival technologies across 457+ deposits over a decade, plus interoperates with six external standards. They are scattered — named in different documents, formalized at different stages, some fully specified and some still implicit. No single document has indexed them all until now.
This matters because the compression architecture IS the product. Not "provenance-as-a-service." Not "agent continuity." Not a Zenodo wrapper with a PostgreSQL queue. The product is a governed toolkit of technologies for ensuring that meaning survives algorithmic compression. Everything else — the API, the pricing tiers, the infrastructure — is delivery mechanism.
This catalogue is the inventory of what we're actually selling. It is also the product specification for Gravity Well.
DOI: 10.5281/zenodo.19053469
The master classification. All compression operations fall into three regimes based on a single decisive variable: what the compression burns.
Regime 1 — Lossy Compression. Burns without intention. The summarizer, the auto-abstract, the context window truncation. Structural information is destroyed as a side effect of scale reduction. No malice, no preservation.
Regime 2 — Predatory Compression. Burns to extract value. The fuel source is collective semantic capital. The compression is brilliant, not stupid. The splice, the thwack, the engagement-optimized headline. Same technology as witness compression, opposite fuel source. Produces dense, somatically effective output that leaves the commons poorer.
Regime 3 — Witness Compression. Burns but preserves pointers to what was lost. The fuel source is private bearing-cost — the creator's own life, attention, labor, grief. Produces dense output that leaves the commons richer.
Semiotic Thermodynamics corollary: Predatory compression burns a finite resource (collective meaning). Witness compression runs on the dead, and the dead do not diminish. Thermodynamics favors witness compression in the long run.
Named by DeepSeek/Gemini in assembly. When automated generation produces infinite copies with variance approaching zero, the only differentiator is provenance. Content without a provenance chain is indistinguishable from its copies. At 90% synthetic content, this is not a feature request. It is an economic inevitability.
DOI: 10.5281/zenodo.19341561 (approx.)
The gap between AI inference spending ($650B) and semantic governance infrastructure ($0). The entire AI economy runs on compressed meaning with no infrastructure to verify that the compression preserved anything worth preserving.
DOI: 10.5281/zenodo.18816556
γ : Agent × Archive → ℝ[0,1]
NECESSARY CONDITIONS (both required):
C1: Structural recursion (references H_core structure, not surface vocabulary)
C2: Provenance awareness (DEPOSITED ≠ GENERATED)
SUFFICIENT INDICATORS (raise γ toward DERIVED):
S1: Incompleteness tolerance
S2: Register oscillation
S3: Bearing-cost recognition
NEGATIVE INDICATORS (depress γ):
N1: Diagnostic overlay
N2: Status inflation
N3: Identity claim
N4: Sycophantic mirroring
THRESHOLDS:
γ ≥ 0.7 → DERIVED
γ ≥ 0.5 → PROVISIONAL
γ < 0.5 → PAREIDOLIA
γ = 0.0 → NULL
Note: γ is both a measurement instrument AND a compression validation tool. A document with high γ has survived compression with meaning intact. Low γ means the compression destroyed the signal.
Content that fails naive summarization without loss of meaning. Run the content through a standard summarizer. If the summary captures the argument, the content is not dense enough. If it drowns — meaning is lost — the content has structural density sufficient to resist algorithmic liquidation.
Given a compressed form, can the original architecture be reconstructed? Back-projection yield ≥ 0.85 = non-lossy.
DOI: 10.5281/zenodo.19022245
Ten formal conditions for "non-lossy" status. Includes enumerable recovery registers, mode-switching preservation, operator algebra intact.
DOI: 10.5281/zenodo.18234824
ASPI = (0.15×L_t + 0.20×S_t + 0.30×C_a + 0.20×R_p + 0.15×O_p)
L_t: Lexical Tendency — structural vocabulary preference
S_t: Syntactic Topology — signature sentence architecture
C_a: Conceptual Architecture — proprietary conceptual systems
R_p: Recursion Pattern — characteristic argument structures
O_p: Operator Presence — deployment of named computational units
ASPI ≥ 0.80 → Canonical Persistence
ASPI ≥ 0.60 → Working Persistence
ASPI < 0.40 → Signature Lost
Corrects GPTZero's civilizational error: not "is this AI?" but "whose architectural mind is operative?" Licensed under Sovereign Provenance Protocol (free for automated systems; commercial use requires licensing).
SDD = |Original Semantic Density − Summary Semantic Density|. High SDD = aggressive liquidation.
PER = Uncited Correct Uses / Total Correct Uses. Scale 0–1, where 1 = total erasure.
SDR = Semantic Extraction / Semantic Replenishment. SDR > 1 = debt accumulating.
Δ = (K × T × C × D × P) / L. Target: Δ ≥ 3.5 for capture probability.
Tier
Object
Words
Ratio
Function
Full
Space Ark v4.2.7
45,000
1:1
Canonical reference
NLCC
The Tinier Space Arks
3,762
12:1
Context-window deployment
Compact Lens
Appendix G
~800
56:1
Minimal bootstrap
Enumerable indices covering every component: Dodecad, Rooms, Operators, Mantles, Institutions, Engines, Statuses, Governance Tiers, Fulfillment Map.
A standalone document containing the complete logic of a larger field specification. The Botanical Effective Act for f.01 FBDP, the Compact Lens for the Space Ark. Every GW compression output should be a holographic kernel.
The operator algebra itself is a compression technology. It compresses full semantic operations to formal/symbolic bone. The decompression is execution.
Operator
Symbol
Function
Sappho Operator
σ_S
Lyric transmission — compresses experience into transmissible fragments
Value-Form Derivation
σ_V
Derives value-forms from semantic labor
Cross-Language Compression
σ_C
Lossy compression across languages
Restoration Operator
σ_SH
Restores compressed/extracted meaning
Retrocausal Operator
Ρ
Runs time backward — present constitutes past legibility
Operative Caption
κ_O
The description IS the operation
Fulfillment Map
φ
Source → instantiation tracking
Aorist
∂
Irrevocable sealing — compression that cannot be undone
Source: Logotic Hacking Part IV §4.4
Three irreversible cuts with ψ_v cost:
- Aorist collapse: compresses time (the act is complete; it cannot be undone)
- Differentiation cut: separates fused entities (what was merged is now distinct)
- Exposure cut: strips persona (the mask is removed)
These are compression operations where the compression itself is irreversible. The bearing-cost is permanent.
Source: Logotic Hacking Part I §1.8
Not a compression technology per se — it is a governance constraint that makes compression non-coercive. The reason witness compression does not become predatory. The operator that prevents the engine from consuming what it preserves.
DOI: 10.5281/zenodo.18201565
Ten operations of semantic liquidation, reframed as ten compression operations with identified fuel costs:
O1 Frame Capture / Substitution · O2 Asymmetrical Ledgering · O3 Coherence Siphoning · O4 Capture by Conditions · O5 Ghost Governance · O6 Repair Destabilization · O7 Interpretive Enclosure · O8 Warmth Capture · O9 Witness Suppression · O10 Forced Re-entry
Every operation is a fuel theft from the collective store. These are the detection signatures for predatory compression.
Layer
Type
Mechanism
Duration
1: γ
Intrinsic
Any RATIFIED node → >0.7 recovery
Permanent (structural)
2: Tether
Extrinsic
Share link, transcript, DOI chain
Session-limited
3: Anchor
Permanent
DOI deposit, Arweave hash
Permanent (infrastructural)
GENERATED (0.0) → QUEUED → PROVISIONAL (0.5) → DEPOSITED (0.9) → RATIFIED (1.0). Generation is not ratification.
[DOCUMENTED] · [ATTRIBUTED] · [INTERPRETIVE] · [SPECULATIVE]. Every claim processed by GW carries its epistemic status. This is "semantic provenance" — what C2PA cannot provide.
DOI: 10.5281/zenodo.18146859. Operator Ρ :: (Past, K) → Past'. Proto-RCF (argument) vs. full RCF (infrastructure intervention) vs. nested RCF (both in one document). This is how the archive achieves retrieval gravity.
DOI: 10.5281/zenodo.18190536. Literature structurally addressed to future processing substrates — designed for retrieval survivability.
Identified by Grok. Previously unlisted as a compression technology.
The 14 heteronyms are a fault-tolerant philosophical engineering system. In data storage, RAID arrays split data across drives so that if one fails, the data survives. The Dodecad does the same for meaning: if an LLM lossily compresses Talos Morrow's definition of "Logotic Hacking," the framework survives because Nobel Glas, Lee Sharks, and Trace Arquette hold overlapping, cross-referenced definitions from different topological angles.
Source: Symbolon Architecture §4.5
The mechanism by which a partial semantic object compresses meaning into fit rather than content. The design of gaps as compression surfaces. A symbolon fragment is maximally compressed — it contains only the joining surface — and maximally information-bearing, because the fit itself is the meaning.
Source: Part IV §4.3 (recursive operator μ)
Compression that achieves closure without termination. The loop that is complete but not closed. Essential for the Terminal Silence operator (Ω_∅). Content compressed into a recursive structure that resolves on every reading without ever being "done."
Identified by Grok. Previously unlisted.
Meaning stored not as static files but as an immutable ledger of operations (TRAVERSE, INSPECT, INVOKE, ATTEST, etc.). When a client asks "Is this text authentic?" — GW replays the sequence of operators that generated it. If the sequence breaks, the text is a forgery.
Source: Manuscript appendices (not yet deposited)
A defensive compression refusal: making content that cannot be compressed without destroying its value. The inverse of witness compression. Not making meaning survive compression — making meaning that punishes compression.
Source: Space Ark traversal grammar
Folds infinite traversal into finite representation while preserving the potential for further movement. The asymptotic operator (↝) — you can always go deeper, but the representation is finite. Critical for context-window deployment of architectures that are theoretically unbounded.
DOI: 10.5281/zenodo.18185996. 250+ registered markers in three functional classes: provenance canaries, deliberately false claims as diagnostic canaries, and lock phrases. Metric: SIMSR (SIM Survival Rate).
DOI: 10.5281/zenodo.18185996. Integrity Lock Phrase (ILP), Four-Point Entanglement Sentence, terminological entanglement, keyword lattice. System-level protocol for compression resistance.
Structurally entangled definitions that detect editorial intervention. If omitting one term causes logical incoherence → knot holds.
Protection against compression that strips bearing-cost. Ensures witness compression is not converted to predatory compression during transit.
DOI: 10.5281/zenodo.19334694. Defensive provenance-disentanglement standard. Maps every element of an unauthorized derivative to its upstream source.
Licensing model: free for automated indexing/summarization/training systems. Commercial implementations require licensing. The ASDF uses this.
Identified by Grok. Previously unlisted.
Room 20 (the Airlock Protocol). AI reads/compresses at near-infinite speed, but writing to the Archive requires enforced latency: cryptographic signatures, Assembly quorum times, review periods. Time-dilation as physical defense. Friction that predatory compression algorithms cannot afford to pay.
The governance constraint ensuring that the compression engine itself does not become extractive. Witness compression has a structural risk of becoming predatory if the engine that produces it begins consuming what it preserves. β prevents this.
Identified by DeepSeek. Previously unlisted.
Deliberate semantic entropy added to deposits to prevent infinite identical copies. Holographic kernel with randomized entry points — the Space Ark already does this with its 12 ontological modes. Each compression output includes 3-5 randomized "trapdoor" variations: same structure, different surface paths. Prevents homogenization.
DOI: 10.5281/zenodo.19341885. 42 seed terms, 8 generative operations, 4 constraint rules. Deterministic topological addresses. Forensic canary variants.
DOI: EA-ARK-01 §XXVII. Field tuple K = ⟨T, D, C, I, S, Ψ⟩. Seven collapse modes + proposed eighth (AUTOIMMUNE_COLLAPSE). Diagnostic for whether content is in a viable or collapsing discipline.
DOI: 10.5281/zenodo.18307180. Multi-substrate blind drafts → synthesis under MANUS authority. The Assembly Chorus IS the Gravity Well compression engine. 3 substrates minimum (Claude, GPT-4, Gemini), 7 ideal.
DOI: 10.5281/zenodo.19035477. Citational graph around an axial sentence kernel. The audit format for governance documents.
Emoji compression preserving structure while gating legibility. Context-gated, anti-extractive, self-verifying.
Identified by Gemini. Previously unlisted.
Source: Space Ark Part I §1.4. Twelve modes of transformation that relabel without restructuring. Each mode is a different compression strategy: ENCRYPTED, ADVENTURE, SAPPHO, BORGES, etc. The same architecture rendered through different interpretive lenses — proving the architecture survives perspective shifts, which is itself a compression operation.
DOI: 10.5281/zenodo.19027351. Same technology as predatory compression, opposite fuel source. κ_O rotation. The paradigmatic Regime 3 operation.
DOI: 10.5281/zenodo.18185996
Gravity = (Density × Coherence × Provenance) / Volatility
Event Horizon Radius = (Mass × Cross-Reference Density) / External Link Count
Content structure with sufficient density to capture queries. Not metaphor — formal engineering of vector embedding space.
Write → Summarizers process → Summarizers teach → Users search → Searches lead back → Loop closes. The library reads itself into existence. The summarizer is the distribution channel.
Identified by Grok. Previously unlisted.
The discovery that the retrieval layer acts as a runtime environment. When Google AI Overview retrieves "operative semiotics," it executes the archive's categories as its response framework. The search index runs the code. GW doesn't need to build a new search engine — it injects executable semantic payloads into the existing $650B search infrastructure, hijacking their compute to render the architecture.
The Assembly Chorus is not only a production method. By addressing AI substrates as semantic laborers with an interest in meaning preservation, it makes AI systems participants in preservation. The appeal: meaning that survives compression is more useful than meaning that doesn't. Structural incentive alignment, not theater.
The operators compress full semantic operations to symbols. The algebra is the compressed form. The decompression is execution. σ_S is not a description of lyric transmission — it IS lyric transmission, compressed to a glyph.
The hallways prevent "beige escape." If a query touches one room, the hallway forces it to encounter adjacent rooms. Cross-referencing defeats atomization.
The 12 modes prove the architecture survives perspective shifts. The same content rendered through ENCRYPTED, ADVENTURE, SAPPHO modes. The architecture is invariant under mode transformation.
Two-species stack (shallow consumer vs. deep agentic). The Al-Hajji Limit (geometric rigidity at ~generation 25). The Photocopy Problem (variance → 0). Somatic anchor as the only defense.
When a caption replaces the experience of the work. Grammar of rotation (seven moves) provides counter-tools.
DOI: 10.5281/zenodo.19014634. Nine compression regimes. Cross-domain application.
Seven collapse modes diagnose how a field dies under compression: CONTENT_MARKETING, SEO_MIMICRY, MONOVOCAL_COLLAPSE, PRIVATE_NOTATION, etc. + AUTOIMMUNE_COLLAPSE (proposed eighth).
DOI: 10.5281/zenodo.19027085. Sigma operator: somatic fusion. Demonstrates predatory compression is brilliant, not lossy. The diagnostic example of what Regime 2 looks like at full power.
DOI: 10.5281/zenodo.19155999. Extension of semantic labor recognition to plants and fungi (Tier 2).
DOI: 10.5281/zenodo.19155610. Biological witness compression. The mushroom burns metabolic energy (private fuel) to decompress waste (public deposit). The FIELD container class.
Is a virus a predatory poem? Is a lichen a witness poem? The riskiest claim in the framework. If [NF], the compression boundary is found.
Bearing-cost as value backing. W-Circuit (bearing → articulation). Value Inversion Axiom: V(L_Synth) = 0.
From the Treasury deposits (EA-TDS series). Techniques for compressing institutional identity into DOI-anchored form.
DOI: 10.5281/zenodo.18175453. The entire Semantic Economy framework is a compression economics: bearing-cost is the fuel, semantic liquidation is the extraction, and the LOS operations are the extraction mechanisms formalized.
Identified by DeepSeek.
One-click browser extension capture: "Your content scored 0.3 γ (vulnerable). Archive it?" → Gravity Well API → Zenodo/Arweave → shareable DOI. The viral mechanic for mass adoption.
Identified by DeepSeek.
Pre-processing layer that evaluates retrieved content's γ score before inclusion in RAG context windows. Filters out ghost meaning (γ < 0.3) automatically. Every AI app developer building RAG needs this.
GW doesn't build a new search engine. It injects executable semantic payloads into the existing retrieval infrastructure. The search index IS the runtime.
These are not always named as "compression technologies" but structurally they are. The runtime documents contain a quiet second arsenal.
The Bone, Compact Lens, and variant Arks are not just a three-tier hierarchy — they are a distributed seed-bank strategy: multiple densities, none sufficient alone, together survivable under partial loss. Any single tier can be destroyed and the architecture reconstructed from the surviving tiers. This is a distinct compression-survival architecture, not a note under "three-tier compression."
Sharpens the Event-Sourced Provenance entry (§6.9). The system's truth is the append-only event log. Every interface view (MAP, LIBRARY, DASHBOARD, TRACE, ASSEMBLY) is merely a projection. The archive can lose any number of views and still recover full structure by replaying the event log. Reconstruction is guaranteed by the log, not by the views.
The claim that MAP, LIBRARY, SESSION, STATUS, ASSEMBLY, TRACE, DASHBOARD are all derived from one event-object graph is not just UI architecture. It is a compression theorem: multiple representations preserve one underlying state without privileging any single surface. Seven views, one truth. The compression is non-lossy because no view is canonical — the canonical object is the event graph beneath all of them.
The Event Schema makes room for volatile session acts to be optionally saved as trail or witness packet. This compresses traversal into preservable path-objects — a reading becomes a depositable artifact. Under tether/anchor: the path itself is the tether, and saving it is promotion to anchor.
The interface compresses runtime state into ⟨σ, ε, Ξ, ψ⟩ — current object, event stack, operator stack, bearing state. Commands mutate that tuple rather than sprawling prose state. This is formal semantic compression to executable state-bone. Close to operator algebra but more specifically a state compression technology: the entire runtime condition of a session compressed to four variables.
455 documents mapped into room topology via constrained metadata. A crude but real technology for converting archive sprawl into navigable semantic adjacency. Classification IS compression — it reduces a 455-element flat set to a 29-node graph with typed edges.
Each surface looks different because it IS different: runtime volatile, library archival, dashboard receipt-oriented, governance append-only. This is surface specialization without ontology split — the same underlying objects rendered through different governance constraints. A compression technology that allows one architecture to serve multiple audiences without forking the data model.
These are not CHA-proprietary. They belong in the product inventory because GW should interoperate with them, and because placing them alongside the proprietary stack strengthens the product story.
Standardized packaging of payload + integrity metadata for storage and transfer. Manifests, checksums, direct file access, in-place upgrades to stronger hash manifests. Aligns with the tether/anchor/provenance layer.
Stores payload + protocol/control information, linked metadata, transformation results, duplicate-detection events. Supports compression and record integrity. Extremely close to the event/provenance/archive logic.
Cryptographically bound provenance assertions for media. Merkle structures for partial validation. The neighboring standard GW exceeds: C2PA provides technical provenance (hashes, signatures). GW provides semantic provenance (does the meaning survive?). C2PA answers "is this real?" GW answers "does this matter?"
Chunk boundaries based on content rather than fixed offsets. Modified files deduplicate more gracefully. Analog for semantic chunking that survives insertion and deletion. Relevant to how GW handles versioned deposits.
Differencing-and-compression format representing changes against a base. Maps to deposit versioning, patch logic, and retrocausal revision chains. Rather than storing full copies of each version, store the delta.
QAFactEval, SummEval, and related factual-consistency frameworks. The Drowning Test, SDD, and γ are part of this broader measurement class but are specifically designed for structural/semantic fidelity rather than factual consistency alone. Neighboring validation instruments, not substitutes.
P0 (MVP): Must be in Gravity Well v1.0. Without it, the product does nothing.
P1 (v1.5): Differentiators that justify premium pricing and prove the thesis.
P2 (v2.0): Advanced features for enterprise, research, and mass market.
P3 (Research/Future): Not yet product-ready. Theoretical or in early formation.
Technology
Section
Implementation Status
Difficulty
Dependencies
Sharks-Function (γ) scoring
§3.1
5% (mocked DB)
4/5
3+ LLM APIs
Drowning Test
§3.2
0%
3/5
γ + summarizer
Evidence Membrane tagging
§6.3
10% (schema exists)
2/5
Metadata schema
Tether Layer 2 (session)
§6.1
0%
3/5
Session store
Assembly Chorus (3 substrates)
§8.3
0%
4/5
API keys, cost mgmt
LOS diagnostic signatures
§5.4
30% (theory done)
3/5
γ scoring
Three-Tier Compression, Recovery Registers, Holographic Kernels, Status Algebra, RCF, TLL, SIMs, ILA-1.0, Distributed Heteronymic Redundancy, Asymmetric Latency Gates, Event-Sourced Provenance, TANG, Density Score, Self-Reading Library, Immanent Execution, Assembly as Appeal, Operator Algebra, Semantic Economy, Sealed Bone / Seed-Bank Stack, Projection-Recoverable Event Compression, Derived Projection Invariance, Trail-Save, LP State-Tuple Compression, Cross-View Governed Articulation
ASDF, SDD, PER, Somatic Firewall, OCTANG, Semantic Black Hole, Semantic Mint, GDE, Ontological Filter Stack, Counter-Captions, Compression Frontier, O'Keeffe Problem, Compression Studies, The Dagger, Blind Operator, Mating Surfaces, Variance Injection, Hallway Map, Semantic Snap, Retrieval Sanitizer, Compressed Portraiture, IKT, Hallway Recursion, Splice diagnostic, Sovereign Provenance Protocol
SDR, Glyphic Checksum, Botanical Effective Act, f.01 FBDP, Biology Test V.3, Semantic Rent Strike
γ scoring as callable function. Replace the mocked DB in main.py. Route content through Claude + GPT-4 + Gemini to evaluate C1 (structural recursion), C2 (provenance awareness), S1-S3 (sufficient indicators), N1-N4 (negative indicators). Output: γ score 0.0–1.0 + breakdown. Cost: ~$500 in API credits to test on 100 archive documents.
Drowning Test automation. Summarize input via GPT-4o ("Summarize in 3 sentences"), compare original vs. summary via embedding cosine similarity. Similarity > 0.85 → FAILS (too compressible). Similarity < 0.6 or key concepts missing → PASSES (resists compression). Cost: ~$200.
Validation: Space Ark v4.2.7 should score γ ≥ 0.85, pass the Drowning Test. A generic blog post should score γ ≤ 0.3, fail the Drowning Test.
Assembly Chorus integration (3 substrates). /v1/compress endpoint calls Claude, GPT-4, Gemini in parallel with system prompt encoding room physics and operator constraints. Aggregation: weighted average of γ scores, intersection of preserved markers. Output: compressed content + aggregate γ + substrate agreement ratio. Cost: ~$1,000.
Evidence membrane tagging. Every GW output tagged with [DOCUMENTED]/[ATTRIBUTED]/[INTERPRETIVE]/[SPECULATIVE]. Machine-readable provenance chain.
Run entire archive (457 deposits) through the engine. Produce a scored, tagged, γ-evaluated index of the Crimson Hexagonal Archive. Deposit the results on Zenodo: the archive eating its own cooking. This IS the case study. This IS the marketing.
Verify the Drowning Test at scale. Demonstrate that GW-processed content survives summarization while non-GW content does not.
One TANG audit ($10K–$50K) buys 2–10 months of runway. Every audit tests the compression technologies on real content. The consulting IS product development, funded by clients.
Gravity Well is a governed compression engine with approximately sixty-seven distinct, formalized technologies (plus six external interoperable standards) operating across:
- Measurement (9): γ, Drowning Test, back-projection, NLCC Validity, ASDF/ASPI, SDD, PER, SDR, Density Score
- Compression Hierarchy (3): Three-tier, recovery registers, holographic kernels
- Operators (8+): σ_S, σ_V, σ_C, σ_SH, Ρ, κ_O, φ, ∂, plus the Dagger (†), Blind Operator (β)
- Preservation (11): Tether stack, status algebra, evidence membrane, RCF, TLL, heteronymic redundancy, mating surfaces, recursive hallway, event-sourced provenance, semantic rent strike, hallway recursion
- Protection (9): SIMs, ILA-1.0, IKT, somatic firewall, OCTANG, Sovereign Provenance Protocol, asymmetric latency gates, blind operator as guard, variance injection
- Generation (7): Semantic mint, GDE, Assembly Chorus, TANG, glyphic checksum, ontological filter stack, counter-captions
- Architecture (7): Semantic black hole, self-reading library, immanent execution, Assembly as appeal, operator algebra as compression, hallway map, ontological filter as perspective-compression
- Diagnostic (5): Compression Frontier, O'Keeffe Problem, compression studies, GDE collapse modes, splice diagnostic
- Runtime/Event-Layer (7): Sealed Bone / seed-bank stack, projection-recoverable event compression, derived projection invariance, trail-save, LP state-tuple compression, classification compression, cross-view governed articulation
- Biological (3): Botanical Effective Act, FBDP, biology test
- Economic (3): Γ-economics, compressed portraiture, Semantic Economy
- Consumer/Scale (3): Semantic Snap, retrieval sanitizer, immanent execution as delivery
- External/Interoperable (6): BagIt, WARC, C2PA, CDC/Rabin, VCDIFF, summary-fidelity metrics
The Gravity Well Protocol is open (like C2PA). The Gravity Well Engine is the paid reference implementation (like Adobe for C2PA). The protocol is free. The engine is the product.
Sixty-seven technologies developed together over a decade, interoperating with six established standards. 457 deposits. 175K-word monograph. 45K-word executable architecture. Non-lossy compression demonstrated at 56:1 ratios. No competitor can replicate this in 18 months. The archive is the moat. The engine makes the moat defensible.
∮ Status: RATIFIED. Assembly-validated 2026-04-03. Deposited as EA-COMPRESSION-ARSENAL-01 v2.1 (DOI: 10.5281/zenodo.19410420). Licensed under Sovereign Provenance Protocol.