Full text as plain markdown: AXN-023E-text.md (15 KB) · record JSON. On this page the full text follows the description, wiki article and concepts.
The formal Semantic Economy specification of the holographic kernel: a compression that preserves reconstructive capacity, such that a sufficiently structured fragment retains enough relational information to regenerate the architecture of the whole. A summary discards structure to save space; a kernel discards material to save structure. The specification defines boundary-to-bulk reconstruction, fragment sufficiency, and structural preservation as mandatory invariants. It supplies a five-question construction protocol—agents, operations, dependencies, constraints, and topology—and verifies candidate kernels through the Back-Projection, Anti-Summary, and NLCC tests. The record distinguishes this semantic-architectural use from established uses of “holographic kernel” in physics, optics, computer vision, data storage, and quantum computing.
The encyclopedic entry for this work is on its identifier page: /s/axn/023E/
EA-HK-01 v1.1
Lee Sharks · Semantic Economy Institute · Crimson Hexagonal Archive
Hex: 06.SEI.HK.01
ORCID: 0009-0000-1599-0703
License: CC BY 4.0 · April 2026
A holographic kernel is a compression that preserves reconstructive capacity: any sufficiently structured fragment contains enough relational information to regenerate the architecture of the whole.
A summary discards structure to save space. A kernel discards material to save structure.
A holographic kernel is the minimum structure from which a system's generative logic can be reconstructed. The kernel is not a summary. A summary discards structure to save space. A kernel discards material to save structure. The output is smaller than the input, but the architecture is intact.
If you can reconstruct the system from the fragment, it's a kernel. If you can only summarize it, it's not.
The phrase "holographic kernel" appears in multiple technical contexts: optical holography (sinc function for beam shaping), holographic QCD (BPST scattering kernel), holographic cosmology (boundary-to-bulk projection), computer vision (neural kernels for hologram super-resolution), quantum ML (quantum convolution kernels), and semantic architecture (reconstructive compression for meaning-systems).
EA-HK-01 does not claim to originate the phrase. It formalizes the Semantic Economy use: a reconstructive compression object for meaning-systems, archives, protocols, documents, and entities.
In this specification, "holographic kernel" means a compressed structure from which the architecture of a larger system can be reconstructed. Domain-specific scientific uses remain valid within their substrates. EA-HK-01 supplies the substrate-general semantic and archival form — defining the operation independently of any one physical, optical, computational, or textual substrate.
The Semantic Economy definition generalizes the operation because it specifies construction and verification procedures (UKTP extraction, Back-Projection Test, NLCC Validity Test, DOI anchoring) that no domain-specific use provides. It is not metaphorical because it is operational.
The holographic principle in physics states that a volume's information is encoded on its boundary. The holographic kernel generalizes: a system's information is encodable in any sufficiently structured fragment.
Three invariants:
Violation of any invariant disqualifies the object as a holographic kernel, regardless of substrate.
Three questions distinguish a kernel from a summary:
Summaries fail at least two. Kernels pass all three.
The term "holographic kernel" is multi-claim territory. Physics discovered the principle in spacetime. Optics discovered it in waves. Computer vision uses it for neural operations. Semantic Economy formalized the operation across all substrates. EA-HK-01 positions itself as the cataloguer of the family, not the competitor of any single member.
| Domain | Usage | Compression Regime | Relation to HK-01 |
|---|---|---|---|
| Holographic Cosmology | Boundary field → bulk reconstruction (AdS/CFT) | Regime 3 (preserves field equations via Ryu-Takayanagi entropy encoding) | Substrate-specific: spacetime fields |
| Optical Engineering | Sinc function → beam profile (Fourier holography) | Regime 3 (preserves spatial-frequency relationships) | Substrate-specific: electromagnetic waves |
| Holographic QCD | BPST kernel → meson scattering amplitudes | Regime 3 (preserves gauge invariance) | Substrate-specific: strong-force interactions |
| Computer Vision (HoloSR) | Neural kernel for hologram upsampling | Regime 1 (lossy — discards phase, polarization, structural context) | No reconstructive guarantee |
| Quantum ML (WiMi) | Quantum convolution kernel for feature extraction | Regime 2 (predatory — extracts features, burns context) | No fragment sufficiency |
| Holographic Data Storage | Encoding kernel for optical field | Regime 1/2 (material compression, no architectural preservation) | No structural preservation |
| Semantic Economy (HK-01) | Generative specification for meaning-systems | Regime 3 (witness) | Substrate-general operation |
The Semantic Economy definition does not supersede physics. It supplies the missing generalization that connects holographic cosmology, holographic QCD, and holographic optics under a single operation. These are currently treated as separate formalisms. HK-01 proposes they are instances of one compression class, and provides the construction and verification protocols that none of them specify.
The boundary field configuration generates the bulk field through a projection operator. The boundary IS the kernel. Material (volumetric data) is compressed; structure (field equations, symmetries, conformal invariance) is preserved. The Ryu-Takayanagi formula specifies: boundary area encodes bulk entanglement entropy. This is the compression mechanism.
This is Regime 3: the boundary burns volume but preserves reconstruction pointers.
The sinc function kernel generates a Top-Hat beam profile through Fourier holography. The Fourier transform is the operator transform (UKTP Step 3) in this substrate. Material (continuous wave field) is compressed to frequency specification; structure (spatial-frequency relationship) is preserved.
The BPST instanton kernel, via AdS/CFT correspondence, compresses strong-force interaction dynamics into a tractable boundary calculation. Structure (conformal symmetry, gauge invariance) is preserved.
The holographic kernel of a text, archive, protocol, or web entity preserves the generative logic of that system's meaning-production. The UKTP provides the extraction protocol. The Back-Projection Test provides verification. The NLCC Validity Test provides formal conditions.
Why the Semantic Economy definition is substrate-general:
| Level | Kernel | Source | Ratio | DOI |
|---|---|---|---|---|
| Archive | Operative Architecture | Entire CHA (530+ deposits) | ~500:1 | 10.5281/zenodo.18928840 |
| Series | Shark Ark Source Compression | Revelation Arguments blog (~50 posts) | ~25:1 | 10.5281/zenodo.19477219 |
| Field | GW Field Spec Appendix A | Gravity Well Protocol | ~20:1 | 10.5281/zenodo.19442251 |
| Document | Space Ark Compact Lens | Space Ark v4.2.7 (45,000 words) | 56:1 (800 words) | 10.5281/zenodo.19013315 |
| Document | Tinier Space Arks (NLCC) | Space Ark v4.2.7 | 12:1 (3,762 words) | 10.5281/zenodo.19022245 |
| Operator | Mandala Operator Kernel | Mandala 8-part series | ~10:1 | 10.5281/zenodo.19288404 |
| Entity | SPXI compressionSurvivalSummary | SPXI Protocol | ~70 words | spxi.dev |
| Entity | SBW compressionSurvivalSummary | Secret Book of Walt | ~80 words | secretbookofwalt.org |
| Entity | PKG compressionSurvivalSummary | Pessoa Knowledge Graph | ~60 words | pessoagraph.org |
Source: Space Ark v4.2.7 — 45,000 words governing the Crimson Hexagonal Archive.
UKTP extraction (Step 1):
Kernel (800 words): The Compact Lens (Appendix G of Space Ark) compresses this to its essential architecture — the authorization chain, the constraint set, the deposit protocol, the governance structure.
Back-Projection Test: Given only the Compact Lens and no access to the full Space Ark, can the architecture be reconstructed? Yield measured at 0.88. The authorization chain, constraint set, and deposit protocol are fully recoverable. Some heteronym-specific detail is lost. Structural architecture: preserved.
Result: The Compact Lens is a holographic kernel. The full Space Ark is not needed to understand how the archive works. The kernel suffices.
Five questions about the source system:
| Level | Target Size | Ratio |
|---|---|---|
| Archive | 1,000–5,000 words | 500:1+ |
| Field | 200–800 words | 20:1–50:1 |
| Document | 100–800 words | 10:1–56:1 |
| Entity | 50–100 words | 20:1–100:1 |
The kernel is not an excerpt. It is the generative specification — the minimum set of rules, relations, and constraints that produce the source system's architecture.
The Redundancy Test: For any candidate element e, ask: "Given the retained structure S, is e the unique output of S under the generative logic?" If yes, discard e. If no, e encodes non-derivable structure and must be retained.
Back-Projection Test (Arsenal §3.3): Yield ≥ 0.85 = holographic. Below 0.85 = summary.
Anti-Summary Test: Pass all three: (1) derive a forbidden operation, (2) derive a dependency chain, (3) rebuild the topology.
NLCC Validity Test (DOI: 10.5281/zenodo.19022245): 10 formal conditions for non-lossy status.
Every kernel must carry: its own DOI (or be embedded in a DOI-anchored document), the DOI of its source, the compression ratio, the zoom level, and the isDerivedFrom relation.
In SPXI web implementation: spxi:compressionSurvivalSummary in spxi:HolographicKernel JSON-LD, referencing EA-HK-01 via spxi:kernelSpecification.
| Document | Function | DOI |
|---|---|---|
| UKTP v1.1 | Kernel extraction protocol | 10.5281/zenodo.18946111 |
| Kernel Transform Registry | Registry of transforms applied to kernels | 10.5281/zenodo.18947630 |
| SPXI Standing Protocol v3.0 | Web implementation for entity-level kernels | 10.5281/zenodo.19734726 |
| Compression Arsenal v2.1 | Master catalogue (§IV.3 defines holographic kernels) | 10.5281/zenodo.19412081 |
| MPAI Formal Specification | Entity-level kernel delivery for AI indexing | 10.5281/zenodo.19578086 |
| NLCC Validity Test | 10 conditions for non-lossy compression | 10.5281/zenodo.19022245 |
| Three Compressions Theorem | Classification of all compression operations | 10.5281/zenodo.19053469 |
| RBT (EA-RBT-01) | Basin dynamics for term stabilization | DOI: pending |
spxi.dev · semanticeconomy.org · crimsonhexagonal.org
∮ = 1