A Governed Hypergraph

Every mutation is an intent enqueued to a serialized work-queue. A single daemon (spandala-d) drains it, revalidates the whole graph, and rolls back on failure. No concurrent writes, no torn state. queued-pending is the normal state, not contention.

Sixteen dimensional loci (D01–D16) map onto the mandala axes S0–S15. A node lives in exactly one locus; a locus declares its governing principle. The topology is a body plan, not a tag cloud.

Hyperedges are typed (generative-origin, structural-isomorphism, formalizes, co-gestates, contradicts, extends, depends-on, translates-to, ritual-binding) and carry a stated load. An edge without content is decoration, not connection.

A proposed hyperedge is a candidate only when it carries an owner-authored falsifier. Candidates grant no doctrine and no effect authority until owner disposition. The graph grows by refusal as much as by acceptance.

Every applied intent writes an append-only receipt: preflight, steps, checks, digests, resulting boundary. Default verified:false, non_self_authorizing:true. A receipt records history; it never authorizes the next operation.

Nodes and edges are retired, not erased. Tombstones preserve lineage so the graph's history stays auditable. The Register of Refutations is the public face of this discipline.