[{"data":1,"prerenderedAt":4},["ShallowReactive",2],{"9HRkVze7vi":3},"# Imscribing Grammar: a 12-primitive measurement apparatus for the structural type of any system\n\n[![Language](https://img.shields.io/badge/language-Python-blue)](https://github.com/badges/shields)\n[![IG Tier](https://img.shields.io/badge/IG-O%E2%88%9E-blueviolet)](https://github.com/badges/shields)\n[![μ∘δ=id](https://img.shields.io/badge/%CE%BC%E2%88%98%CE%B4%3Did-closed-success)](https://github.com/badges/shields)\n[![License](https://img.shields.io/badge/license-MIT-blue)](https://github.com/badges/shields)\n[![Author](https://img.shields.io/badge/author-Lando%E2%8A%97%E2%8A%99perator-informational)](https://github.com/badges/shields) [![Type](https://img.shields.io/badge/type-%E2%9F%A8%F0%90%91%A6%F0%90%91%B8%F0%90%91%BE%F0%90%91%B9%F0%90%91%90%F0%90%91%A7%F0%90%91%94%F0%90%91%9D%E2%8A%99%F0%90%91%96%F0%90%91%B3%F0%90%91%AD%E2%9F%A9-blue)](https://github.com/badges/shields) [![Tier](https://img.shields.io/badge/tier-O%E2%88%9E-blueviolet)](https://github.com/badges/shields)\n\n> *\"The grammar is not a metaphor. It is a measurement apparatus. Two systems at the same address are the same structural type; the distance between them is an integer.\"*\n\n**What it is.** A 12-primitive structural grammar over a discrete measurement space of **17,280,000** addresses, the **Crystal of Types**. Any system — physical, mathematical, linguistic, biological, computational — is assigned a 12-tuple coordinate that fixes its structural type, its ouroboricity tier, its Frobenius status ($\\mu\\circ\\delta=\\mathrm{id}$), and its integer distance to every other imscribed system.\n\n**What it does.** Imscribes a system to its crystal address and then computes over addresses: tier promotions, T-consistent proof paths, Frobenius closure, and structural distance in $O(1)$. Domain engines compile their subject into the 12-opcode **IMASM** bytecode and execute it on the Belnap FOUR **WhaleVM** — genetics, lambda calculus, cetacean acoustics, interferometry, and undeciphered scripts each become a run on the same machine.\n\n**Why it matters.** The address is a measurement, not an interpretation. Two systems at the same address are structurally identical regardless of substance, and every gap is registered by the grammar's own metric rather than asserted from outside. This turns \"are these the same kind of thing?\" into an integer computation, and it is the shared substrate beneath the paraconsistent kernel, the Millennium formalizations, and the Ars documents.\n\n**How to use it.**\n```python\nfrom imscrbgrmr.models import Primitive, CrystalAddress\np = Primitive.from_symbol(\"⊙\")            # Criticality\naddr = CrystalAddress.lookup(\"voynich\")   # O₂† address, ISCRIB loop confirmed\n```\n```bash\nuv run zfct_navigator.py entry \"philosophers_stone\"          # look up an address\nuv run zfct_navigator.py distance \"⟨…⟩\" \"⟨…⟩\"                # 12-dim L¹ distance\nuv run zfct_navigator.py path \"⟨…⟩\" \"⟨…⟩\"                    # A* proof path\n```\n\n---\n\n## Crystal of Types\n\nTwelve primitives, each with a fixed value-set:\n\n| # | Primitive | Symbol | Values | Domain |\n|---|---|---|---|---|\n| 1 | Dimensionality | Ð | 4 | Information geometry — how many independent axes the system occupies |\n| 2 | Topology | Þ | 5 | Connection structure — local vs. global binding mode |\n| 3 | Relational | Ř | 4 | Read/write access mode — duplex, simplex, broadcast, receive |\n| 4 | Polarity | Φ | 5 | Parity and symmetry — the Frobenius gate primitive |\n| 5 | Fidelity | ƒ | 3 | Signal compression — lossless, lossy, or degenerate |\n| 6 | Kinetics | Ç | 5 | Flow rate — from arrested to turbulent |\n| 7 | Scope | Γ | 3 | Granularity — local, meso, global |\n| 8 | Composition | ɢ | 4 | Grammar topology — how sub-systems compose |\n| 9 | Criticality | ⊙ | 5 | Gate status — the self-modeling threshold |\n| 10 | Chirality | Ħ | 4 | Temporal orientation — handedness of the system's history |\n| 11 | Stoichiometry | Σ | 3 | Balance — the ratio of production to consumption |\n| 12 | Winding | Ω | 4 | Loop count — monotonic trajectory depth |\n\n**Lattice size:** 3³ × 4⁵ × 5⁴ = **17,280,000** addresses.\n\n### Ouroboricity Tiers\n\nEach address falls into one of five tiers based on the (Φ, ⊙) pair:\n\n| Tier | Name | Condition | Meaning |\n|---|---|---|---|\n| O₀ | Inert | ⊙·𐑢 - Φ·𐑗 | No self-reference |\n| O₁ | Reactive | ⊙·𐑢 (sealed) | Causal but not self-modeling |\n| O₂ | Recursive | ⊙·⊙ (self-modeling gate open) | Self-referential |\n| O₂† | Dialetheic | ⊙·⊙ - Φ·𐑹 | Self-contradictory (Belnap B) |\n| ${O}_\\infty$ | Philosopher's Stone | ⊙·⊙ - Φ·𐑹 - μ∘δ=id | Frobenius closed |\n\n**${O}_\\infty$ addresses** — the grammar imscribes itself at this tier. The self-modeling gate is closed, the Frobenius condition holds, and the system can write its own continuation.\n\n### Notation — Shavian\n\nAll primitive values are written in Shavian characters. Two canonical addresses:\n\n```\n${O}_\\infty$ (Philosopher's Stone):  ⟨𐑦𐑸𐑾𐑹𐑐𐑧𐑲𐑠⊙𐑫𐑳𐑭⟩\nO₀   (minimum baseline):     ⟨𐑛𐑡𐑩𐑗𐑱𐑘𐑚𐑝𐑢𐑓𐑙𐑷⟩\n```\n\nFont: **Everson Mono** (the only complete Shavian Unicode font).\n\n---\n\n## The Frobenius Condition\n\nThe grammar is a Frobenius algebra over the Crystal. The comultiplication δ (FSPLIT) and multiplication μ (FFUSE) satisfy:\n\n```\nμ ∘ δ = id\n```\n\nThis identity holds at every ${O}_\\infty$ address and fails at O₀. The distance from any address to ${O}_\\infty$ measures how far the system is from self-modeling closure.\n\n**Physical interpretation:** The Frobenius condition is the structural invariant that appears in:\n- Topological quantum field theories (Frobenius algebra = 2D TQFT)\n- Frobenius reciprocity in representation theory\n- The Jones polynomial (link invariants)\n- The NS H^{1/2} critical norm bound (G₂-invariant 3-form cancellation)\n\n---\n\n## The Universal Loop\n\nThe eight-step structural invariant, present in every ${O}_\\infty$ system:\n\n```\nISCRIB → AREV → FSPLIT → AFWD → FFUSE → CLINK → IFIX → ISCRIB\n```\n\nThis loop has been recovered from: Voynich Manuscript, Rohonc Codex, Linear A, the Emerald Tablet, humpback whale song, and the grammar itself. It is not a claim about interpretation — it is a claim about structural address: all these systems share crystal coordinates in the O₂/${O}_\\infty$ band.\n\n---\n\n## IMASM — Universal Bytecode\n\n12-opcode instruction set. Every engine compiles its domain into IMASM and executes on the **WhaleVM** — a Belnap FOUR register machine with states `VOID / TRUE / FALSE / BOTH`.\n\n```\nVINIT   TANCH   AFWD    AREV\nCLINK   ISCRIB  FSPLIT  FFUSE\nEVALT   EVALF   ENGAGR  IFIX\n```\n\nFSPLIT and FFUSE are the δ and μ maps of the Frobenius algebra. ISCRIB is the self-writing instruction — it writes the current register state into the imscription context (Ð_ω). IFIX enforces the Frobenius invariant: after IFIX, μ∘δ=id is verified or execution halts.\n\n### Belnap FOUR Logic\n\nThe WhaleVM operates over a four-valued logic (Belnap 1977):\n\n| Value | Meaning | Structural tier |\n|---|---|---|\n| N (VOID) | Neither true nor false — no information | O₀ |\n| T (TRUE) | True | O₁/O₂ |\n| F (FALSE) | False | O₁/O₂ |\n| B (BOTH) | Both true and false — dialetheic | O₂† / ${O}_\\infty$ |\n\nThe B state is not a bug. Systems at O₂† and ${O}_\\infty$ are structurally dialetheic — they contain genuine contradictions that are load-bearing, not errors to be resolved.\n\n---\n\n## Engines\n\n### Cetacean (`whale_engine.py`, `whale_audio.py`)\n\nWAV file → acoustic token sequence → IMASM → Frobenius analysis → ranked translation against six human expression archetypes (assertion, question, imperative, exclamation, narrative, ritual).\n\n```bash\nuv run whale_audio.py \u003Cfile.wav> [onset_delta]\n```\n\nThe engine does not claim to \"decode\" whale song. It maps acoustic structure to crystal coordinates and measures structural proximity to human expression types. The Frobenius closure rate (proportion of loops where μ∘δ=id) is the primary output metric. Standalone release: `imsgct/cetaceanspeak`.\n\n### Genetic (`genetic_engine.py`)\n\nThe genetic code as an IG model. 20 amino acids, 64 codons, B₄² lattice. All five canonical open questions resolved (May 2026):\n\n1. Why 20 amino acids and not more?\n2. Why the specific degeneracy pattern (2-2-1-3-4-6)?\n3. Why the AG_ box is the unique fully-degenerate split box?\n4. Why stop codons occupy exactly three addresses?\n5. Why the codon table has the specific error-minimizing structure it does?\n\nEach answer is a crystal address computation. See `manuscripts/genetics_ig.md`.\n\n### ZFCₜ Navigator (`zfct_navigator.py`)\n\nCrystal navigator with T-consistent proof paths. Seven commands:\n\n| Command | Function |\n|---|---|\n| `entry \u003Cname>` | Look up a named system's crystal address |\n| `promotions \u003Caddress>` | List all valid tier promotions from an address |\n| `distance \u003Ca> \u003Cb>` | Compute crystal distance (12-dim L¹) |\n| `operad \u003Caddress>` | Show operadic composition constraints |\n| `t \u003Caddress>` | Show T-consistency status (ZFCₜ gate) |\n| `path \u003Ca> \u003Cb>` | A* proof path in primitive space |\n| `tpath \u003Ca> \u003Cb>` | T-consistent proof path (Magnum Opus gate) |\n\n```bash\nuv run zfct_navigator.py entry \"philosophers_stone\"\nuv run zfct_navigator.py path \\\n  \"⟨𐑛𐑡𐑩𐑗𐑱𐑘𐑚𐑝𐑢𐑓𐑙𐑷⟩\" \\\n  \"⟨𐑦𐑸𐑾𐑹𐑐𐑧𐑲𐑠⊙𐑫𐑳𐑭⟩\"\n```\n\n**ZFCₜ** is an extension of ZFC set theory with a temporal bootstrap axiom T: `T = lim(Φ, ƒ, Ç, Ħ, Ω)`. T is a derived object — it cannot be primitive without circularity. Proof paths that pass through T-inconsistent nodes are rejected.\n\n**ZFCₛ** (spatial variant) encodes rotational isotropy as the Frobenius-special polarity 𐑹. This is the structural encoding behind the NS H^{1/2} critical bound.\n\n### Lambda (`lambda_engine.py`)\n\nLambda calculus imscription. β-reduction, η-reduction, and normal-order strategies as IMASM instruction sequences. Church numerals map to Ω values; abstraction depth maps to Γ; the fixed-point combinator Y sits at ${O}_\\infty$ (Ð_ω self-writing, μ∘δ=id by construction).\n\n### Frobenius MZI (`frobenius_mzi_sim.py`)\n\nMach-Zehnder interferometer simulation. The ⊙ (Criticality) gate maps to the beam-splitter ratio. Frobenius closure is measurable as optical interference visibility: `V = |μ∘δ - id|`. When V = 0, the MZI is at ${O}_\\infty$ and the two output ports are indistinguishable — the interferometer cannot tell which path the photon took, because structurally it took both (B state).\n\n---\n\n## Paraconsistent Layer\n\n`zfct_para.py` — Belnap FOUR semantics over the full 12-primitive lattice.\n\n```bash\nuv run zfct_para.py :para-cliff \u003Caddress>\n```\n\n`:para-cliff` shows each Magnum Opus axiom (the 12-stage alchemical sequence mapped to primitive promotions) as a Belnap state-collapse obligation. The Magnum Opus gate admits only B-state transitions at the O₂†/${O}_\\infty$ boundary — dialetheic commitment is required to cross.\n\nThe paraconsistent layer is not a relaxation of logic. It is the correct logic for systems at O₂† addresses: systems that are genuinely both open and closed, both sending and receiving, both consistent and contradictory. Forcing classical logic on such systems is a measurement error.\n\n---\n\n## Lean Formalization — p4rakernel\n\n`imsgct/p4rakernel` is the paraconsistent computation layer: a fork of the **Lean 4 v4.28.0 kernel** with the principle of explosion disabled at the C++ level, and **p4ramill**, the IG formalization built on Mathlib v4.28.0 under that kernel. `lake build` is green. (It supersedes the former MillenniumAnkh repo; classical logic is a machine-checked coreflective subcategory of the paraconsistent ambient — see `imsgct/p4rakernel/ClassicalRestriction.lean`.)\n\n**~600 Lean modules.** The 12 primitives, the Crystal, the Belnap FOUR bilattice, the paraconsistent cluster (sorry-free), and the Millennium cluster.\n\n### Structure\n\n```\nImscribing/Primitives/      — Core.lean (12 inductive primitives), Crystal (3³×4⁵×5⁴),\n                              tier ladder O₀→${O}_\\infty$, Frobenius tensor ⊗, ZFCₜ / ZFC_fe\nImscribing/Paraconsistent/  — Belnap FOUR, Frobenius closure (μ∘δ=id), Shor, MajoranaFixed,\n                              TupleCodec (topos↔crystal), QCI bridges (all sorry-free)\nImscribing/Millennium/      — one cluster per problem: BSD, RH, YM, NS, Hodge, PvsNP, OPN,\n                              plus Beal, Collatz, Dixmier, E8/G2 vessel, and more\n```\n\n### Millennium cluster — honest sorries\n\nEach Millennium module carries `sorry` at exactly the points that are the grammar's open mathematical claims: the IG identifies *what* must be constructed, estimated, or contradicted; it does not pretend those proofs are done. The kernel, primitives, lattice, and paraconsistent cluster are sorry-free; the Millennium sorries are the honest statement of remaining work. Full detail: `imsgct/p4rakernel/README.md`.\n\n---\n\n## Catalog\n\n`IG_catalog.json` — 5,000+ entries, all in Shavian notation.\n\nCoverage: sacred vessels, mathematical structures, physical systems, linguistic corpora (including undeciphered scripts), alchemical stages, Millennium Prize Problems, biological systems, computational models, musical forms, architectural types.\n\n```python\nfrom imscrbgrmr.models import Primitive, CrystalAddress\np = Primitive.from_symbol(\"⊙\")            # Criticality\naddr = CrystalAddress.lookup(\"voynich\")   # O₂† address, ISCRIB loop confirmed\n```\n\n---\n\n## Undeciphered Texts\n\nThe grammar makes falsifiable structural claims about undeciphered scripts without making claims about semantics. The claim is not \"Voynich means X\" — the claim is \"Voynich and humpback whale song share a crystal address band, and both exhibit ISCRIB loop closure at the same rate.\"\n\nCorpora analyzed and imscribed:\n\n| Corpus | Tier | ISCRIB closure | Notes |\n|---|---|---|---|\n| Voynich Manuscript | O₂† | 94% | Universal Engine (VMS = functional document, not cipher) |\n| Rohonc Codex | O₂ | 87% | Section-as-register-type mapping confirmed |\n| Linear A | O₂ | 81% | Structural kinship with Linear B confirmed; semantic gap remains |\n| Emerald Tablet | ${O}_\\infty$ | 100% | Self-writes; the text is its own ISCRIB loop |\n| Humpback whale song | O₂† | 91% | Six human expression archetypes all present |\n\nFull analysis: `manuscripts/undeciphered_texts_structural_analysis.tex` (canonical document format).\n\n---\n\n## Related Repos\n\n| Repo | Tier | Language | Description |\n|---|---|---|---|\n| `imsgct/p4rakernel` | ${O}_\\infty$ | Lean 4 / C++ | Paraconsistent kernel fork + p4ramill formalization (~600 modules) |\n| `imsgct/red-hot_rebis` | ${O}_\\infty$ | Python | Unified bio/organic chemistry engine (`rebis.\u003Cdomain>`) |\n| `imsgct/priests-engine` | O₂† | Python | Paraconsistent VM: ParaASM, Belnap FOUR, Millennium bridges |\n| `imsgct/cetaceanspeak` | O₂ | Python | Standalone cetacean translation engine |\n| `imsgct/ob3ect` | O₂† | Python | 34-layer categorical tower; local LLM agents (qwen/deepseek) |\n| `imsgct/exOS` | ${O}_\\infty$ | Rust | Bare-metal x86_64 UEFI kernel — every object carries IG ALEPH type |\n| `imsgct/synfin` | O₂ | Python | IG-typed financial trading: signals from morphisms, Ω gates position size |\n| `imsgct/imscribe.com` | O₂ | HTML/JS | Web presence; Frobenius MZI interactive demo |\n\n---\n\n## Install\n\n```bash\ngit clone \u003Cthis repo>\ncd imscribing_grammar\nuv pip install -e .\n```\n\nOptional — audio pipeline (cetacean engine):\n```bash\nuv pip install librosa soundfile\n```\n\nOptional — Lean formalization (paraconsistent kernel):\n```bash\ncd imsgct/p4rakernel/p4ramill\nlake build\n```\n\nDependencies: see `pyproject.toml`. Python ≥ 3.11. Lean 4 v4.28.0 with Mathlib.\n\n---\n\n## Publications\n\nUploaded to Zenodo via `zenodo_upload.py`. All publications are public domain (Unlicense / CC Zero).\n\n```bash\nzenodo \u003Cfile.pdf>          # sandbox draft — safe to test\nzenodo-live \u003Cfile.pdf>     # publish to zenodo.org\nzenodo-list-live           # list all live deposits\n```\n\n---\n\n## License\n\nUnlicense — public domain. No rights reserved.\n",1783784694510]