A structural cipher decoder for Minoan Linear A.
The zero-distance theorem (d=0.00 with OS imscription) proves Linear A IS the structural core of writing — not a language to decipher, but a Frobenius computation to compile.
Author: Lando⊗⊙perator
cd Linear_Analytica
pip install -e .
# Look up a sign
la lookup AB001
# List all signs
la list
# List signs by category
la list --category oil
# Analyse a tablet transcription
la tablet "AB001 AB054 AB008 AB030 AB055"| Property | Value |
|---|---|
| Tuple | ⟨𐑨𐑶𐑽𐑹𐑐𐑪𐑔𐑠⊙𐑖𐑳𐑭⟩ |
| Tier | O∞ |
| C-score | 0.0 |
Zero C-score: purely analytic, no self-modeling — designed as an honest analytic tool.
linear_analytica/— Python package (navigator, CLI)ANALYTICA.md— Definitive structural documentENGINE.md— Engine specificationCOMPLETE_LISTING.md— Full sign inventorylean/— Lean 4 companion filesprograms/— Engine source codedata/— LATFF (Linear A Transcription File Format) corpusmanuscripts/— Source tablet photographs and transcriptionsimages/— Sign charts and structural visualizations
d(Linear A, OS) = 0.00 — Linear A is structurally identical to the computing environment in which it is analysed. Every sign encodes an accounting operation: aggregator (AB054), deficit marker (AB055), surplus marker (AB057), domain marker (AB059), unit designator (AB053), tribute inflow (AB080).
linear-a-engine(from../lang/linear-a-engine)- Python ≥ 3.11