Bits per Knot, Bits per Block

Status: Anticipated · untested

Status is derived only from the shepherd-authored triage/prediction data above -- community submissions and claims are a separate overlay and can never change it (see the participation panel below).

This is a proposed connection between two domains, generated by a language model. It is not an article and not evidence: it sits below the evidence/publication boundary. A quantitative prediction and a named kill-dataset are attached (when registered) so the claim stays falsifiable rather than merely evocative.

Claim (verbatim)

The Andean khipu — knotted cords encoding by knot type, knot position, cord color, and ply — and the Maya glyph block are the Americas' two great non-alphabetic information carriers, and they can be compared on equal terms with the plainest of measures: empirical entropy per elementary unit. Whether khipus record language is contested, and this claim does not adjudicate it; realized combinatorial usage, by contrast, is directly measurable from catalogued cord data, no decipherment required. The mechanism is that administrative encoding evolves toward the capacity its medium affords: if cord-keepers loaded their feature space anywhere near as fully as scribes loaded the sign inventory, the per-unit entropies will land within a small factor of each other. If the conjecture holds, the khipu stops being 'maybe writing' and becomes a quantified channel — engineered and non-trivially loaded — whatever it encoded.

Prediction clause (verbatim)

Compute the empirical entropy of cord-level feature bundles (knot type and count, color code, ply and attachment direction where recorded) across the catalogued khipu corpus, and the entropy over sign types per glyph-block slot in the Maya corpus. Primary clause (the verdict follows it): per-cord entropy in the khipu corpus is at least 4 bits. Secondary clause: that figure falls within a factor of 3 of the per-block sign entropy. If cords carry under 2 bits of realized structure, the loaded-channel claim is dead.

Kill-dataset (verbatim)

Open Khipu Repository (OKR) (primary), with Maya Hieroglyphic Database (MHD) sign frequencies as the comparison term: cord-level feature records supply the entropy computation.

Nobody has run this test. The kill-data is named above. If you can run it — or you know the paper that already settles it — claim the kill or submit the prior. Kills and priors are credited here, by name, as they come in.

In the atlas

This conjecture is bridged, as an L1 lead, onto these Inferpedia subject pages.

Provenance

Run: Fresh agent generation · model: claude-fable-5

Generated in a single blind Write by claude-fable-5 with no reads, greps, web access, database queries, or any other tool calls; all content produced from model-internal knowledge under the W18 hard blankness protocol.

Novelty / leakage triage

anticipated in the literature — this exact test has never been run

Per-cord khipu entropy is already measured (~4.45 bits reported from Open Khipu Repository analysis; some khipus ~95 symbols 'within logosyllabic range'), so the primary clause (>=4 bits) is effectively pre-confirmed — but the actual conjecture, an explicit head-to-head empirical-entropy comparison of khipu cords against Maya per-glyph-block sign entropy, is un-run. Flag: primary datum published, join un-run.

Urton, 'Signs of the Inka Khipu: Binary Coding in the Andean Knotted-String Records'
Open Khipu Repository entropy analysis (~4.45 bits; long-knot turn counts), reported via khipu information-capacity studies

Predictions

No prediction registered yet.

Weigh in

No community feedback yet.

Add your take

Posted immediately (spam is removed). Community feedback is never an adjudicated verdict and never changes this conjecture's triage label or status above.