{
  "abstract": "FINDING: Prefix-free (Kraft) codes constrain binary tree branching to a 1/2 ratio per edge, directly linking algorithmic information theory to binary-tree geometry; the Mars OMEGA result is unrelated (atmospheric dust) and contributes nothing here. | MATH: Kraft inequality: Σ 2^(−l_i) ≤ 1 for binary prefix codes (equality = complete tree). Branching ratio per node = 1/2 (each edge halves probability mass). For Chaitin's Ω = Σ_{p halts} 2^(−|p|), the halting set defines a prefix-free code — Ω is the total measure of that tree's leaves. Normality of Ω (Borel normality in base 2) implies the leaf-depth distribution is equidistributed — no ratio beyond 1/2 emerges. | CONNECTION: The binary tree with branching ratio 1/2 is the dyadic lattice — a 1D root system (A₁) with crystallographic symmetry (scale factor 2). No golden-ratio or base-60 structure appears in prefix codes per se; the 1/2 ratio is the only geometric constant. However, the *incompressibility* of Ω (algorithmic randomness) mi\n\nAuthor: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com",
  "abstract_shown": true,
  "affiliations": [
    "Independent Researcher, United Kingdom"
  ],
  "article_type": null,
  "arxiv": null,
  "author_total": 1,
  "authors": [
    {
      "affs": [
        0
      ],
      "name": "Andrew Stewart Caldin"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/b0xzv84bwkqek.bib",
  "cited_by": 0,
  "doi": "10.5281/zenodo.23587029",
  "fulltext_url": null,
  "id": "b0xzv84bwkqek",
  "issns": [],
  "landing_url": "https://zenodo.org/records/23587029",
  "language": "eng",
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "https://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": null,
  "native_subjects": [],
  "openalex": null,
  "pdf_url": null,
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-23",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/b0xzv84bwkqek.ris",
  "sources": [
    {
      "first_seen": "2026-11-06T12:21:53Z",
      "native_id": "23587029",
      "source": "zenodo",
      "url": "https://zenodo.org/records/23587029"
    }
  ],
  "subjects": [],
  "title": "Kraft Codes and Binary Trees: A Direct Link to Algorithmic Information Theory — E8 Intelligence Research",
  "title_text": "Kraft Codes and Binary Trees: A Direct Link to Algorithmic Information Theory — E8 Intelligence Research",
  "type": "preprint",
  "updated_at": "2026-11-06T12:21:53Z",
  "url": "https://research.draconitic.com/paper/b0xzv84bwkqek",
  "venue": "Zenodo",
  "versions": []
}