Data Structures & Discovery Mechanisms

Primes about how information is structured, addressed, and found: representational primitives (data structure, empty set, serialization, template instantiation), and mechanisms for indirection and discovery across a distributed system (publish-subscribe, registry-mediated discovery, persistent placeholders, attestation).

14 primes in this family — primes that sit near one another in abstraction space (k-means over structural-signature embeddings). Each is shown with its short description.

• Attestation — A verifiable, principal-binding, tamper-evident mark lets a third party confirm who committed to what.
• Data Structure — An arrangement of information that makes some operations cheap at the structural cost of others.
• Embedding — A structure-preserving injection of one system faithfully into a richer one.
• Empty Set — Absence made into a fully-typed, first-class object rather than an error.
• Formal System — Symbols, formation rules, axioms, and inference rules closed under mechanical derivation.
• Future Or Promise — A first-class placeholder for a value committed to be supplied later.
• Open Publication for Interoperability — Publishing artifacts in an addressable, license-clear, machine-readable, openly accessible, versioned form so other communities can build on them without per-use negotiation.
• Publish Subscribe — Producers emit to a topic and consumers subscribe to the topic, routed by an anonymous broker.
• Registry-Mediated Discovery — Agents find each other through a shared registry rather than by direct reference: a named indirection mapping stable identifiers to current locations, so coupling survives turnover.
• Reification — An abstraction designed to summarise a substrate is treated as the substrate itself, with the audit trail back to the original allowed to atrophy.
• Representation — Model complex ideas.
• Serialization — Convert structured content into a flat, transportable form that reconstructs.
• Site — A persistent, addressable position whose identity is given by its capacity to host or contain entities, surviving the turnover of whatever occupies it.
• Template Instantiation — Reuse an invariant frame of typed slots by binding variable payloads into it, producing comparable instances while exposing slot-fit failures and frame drift.