Glossary

audience: all

Domain terms as used in this book. Where a term is inherited from mosaik, zipnet, or builder, the entry points at the authoritative source rather than re- deriving.

Almanac. A basic service: a shared clock / sequence beacon members may use for cross-member timing. See basic services.

Atlas. A basic service: a directory of members with operator-supplied metadata (endpoint hints, ticket- issuance roots, TDX Measurements pins). See basic services.

Basic service. A coalition-scoped module whose shape is specified once in the blueprint so every instance means the same thing across coalitions. Five are specified: Atlas, Almanac, Chronicle, Compute, Randomness. A coalition may ship any subset (zero through all five). Compute and Randomness additionally have a market-for-supply structure where the module is a scheduler-and-registry and separate providers compete to register.

Bridge organism. The builder book’s name for a speculative cross-lattice organism. In this blueprint, generalised to a composite organism — an organism whose Config fingerprint folds two or more member references. See composite organisms.

Chronicle. A basic service: a tamper-evident audit log of coalition actions (publications, rotations, retirements). See basic services.

Compute. A basic service: a scheduler and registry through which coalition members submit ComputeRequests for workloads identified by image pre-hash (crate source + min CPU / RAM / TDX) and receive ComputeGrants matching them to registered providers. The module commits the match; the actual compute runs on a separate provider. See basic services.

Randomness. A basic service: a scheduler committing Stream<BeaconTick> of unbiasable beacon values plus a Collection<ProviderId, ProviderCard> of registered providers. The module commits the rounds; the actual randomness is produced by separate providers (threshold-BLS committees, dVRFs, drand-alike external beacons, TDX-attested per-round derivations). Consumers derive targeted draws locally by hashing the beacon value with a domain tag. The coalition’s admitted scheme families determine the unbiasability argument consumers inherit. See basic services.

Member. A lattice or organism referenced by a coalition’s CoalitionConfig. “Referenced unit of the coalition”.

MemberId. The 20-byte prefix of a member’s blake3 stable-id fingerprint, used as a compact key in cross- member commits. The full 32-byte fingerprint lives in Atlas entries and in evidence pointers. See composition — Two keys.

Coalition. A fingerprint-addressed composition of zero or more lattices and zero or more organisms (standalone or composite), possibly shipping up to five coalition-scoped modules (Atlas, Almanac, Chronicle, Compute, Randomness) and an optional ticket-issuance root. Identified by a CoalitionConfig. Operator-scoped, not a consensus unit, not an ACL root. An opt-in composition offering services to its members. See topology-intro.

CoalitionConfig. The parent struct a coalition operator publishes and an integrator compiles in. Contains the coalition’s name, the ordered LatticeConfigs it references, the ordered OrganismRefs it references (including any composite organisms), and an optional TicketIssuerConfig. See topology-intro — Coalition identity.

COALITION_ROOT. The derived fingerprint used as the root for each coalition-scoped module’s (Atlas, Almanac, Chronicle, Compute, optional ticket issuer) identity derivation. Commissioned composite organisms derive independently and do NOT fold COALITION_ROOT. See topology-intro — Membership-by-reference.

Composite organism. An organism whose Config fingerprint folds two or more member references (lattices, OrganismRefs, or a mix) and whose public surface coordinates across the referenced members. Its identity is independent of any coalition: one composite organism may be referenced by many coalitions. See composite organisms.

OrganismConfig. The parent struct for a composite organism’s Config. Folds the organism’s role name, ordered spanned lattices, ordered spanned standalone organisms, content parameters, and ACL. Does not fold a coalition root. See composite organisms — the Config fingerprint.

Content + intent addressing. The discipline every consensus-critical id in every organism, lattice, or coalition obeys: id = blake3(intent ‖ content ‖ acl). Inherited verbatim from zipnet and builder.

Content hash. The portion of a member’s fingerprint that folds its ACL, TDX Measurements, and state-affecting parameters. Bumps on operational rotations; distinct from the stable id. See topology-intro — Member reference shape.

Costly signalling. A mechanism-design pattern in which a signal’s cost is lower for legitimate senders than for impostors, so the separating equilibrium distinguishes the two (Spence, Job Market Signalling, 1973). In this book, attestation fabrics are the costly-signalling rendering: the cost is a TDX quote, an ML-inference receipt, or a hardware-bound attestation. See emergent coordination — attestation fabrics.

Deployment. A single running instance of an organism, lattice, or coalition. Identified by the relevant Config fingerprint.

Evidence pointer. A reference from a composite organism’s commit back to the member commit it depends on. Resolved on replay to validate the organism’s state-machine transition.

Fan-in organism. A composite organism aggregating facts from multiple origin members (e.g. a shared-ledger organism, a cross-feed correlator).

Fan-out organism. A composite organism distributing a fact to multiple target members (e.g. an intent router).

Fingerprint. A synonym for the content + intent addressed id of a Config (coalition, lattice, or organism). Mismatched fingerprints are the ladder’s debuggable failure mode at every rung.

Fixed shapes, open catalogs. The blueprint discipline of specifying shapes (CoalitionConfig, OrganismConfig, the five basic services, the ticket-issuance shape) once and leaving the catalogs (which composite organisms, which organism categories, which lattice classes, whether a coalition ships any modules) open. See introduction — Fixed shapes, open catalogs.

Deferred-primitives space. The speculative (and deferred) class of coalition-level primitives — enforceable policies over members, taxation, judiciary. Explicitly out of scope; see introduction — Fixed shapes, open catalogs.

Hypergame. A generalisation of non-cooperative game theory in which players hold different beliefs about the game being played (Bennett, 1977; see the 2025 survey). Cited in this book only to name the failure of common-knowledge-of-rationality for LLM agents; the book does not model agent behaviour as a hypergame, it just notes that classical equilibrium analyses of LLM populations do not compose.

Integrator. External developer consuming a coalition, member, or composite organism. Never client (ambiguous; the book uses PeerId for the peer-side identity).

Intent-router pattern. A composite organism that reads cleartext from spanned lattices’ unseal::UnsealedPools and commits a routed-intents collection per target lattice. See composite organisms — intent-router pattern.

Kreps–Milgrom reputation. A repeated-game mechanism (Kreps, Milgrom, Roberts, Wilson, Rational Cooperation in the Finitely Repeated Prisoner’s Dilemma, 1982) under which a long-lived observer commits a summary of a player’s history and downstream players use the summary to gate future interaction. The book’s reputation feedback pattern is a committee-committed rendering with consumer-side opt-in — consumers choose whether to consult the reputation organism’s scores.

Lattice. One fully-specified mid-rung composition of organisms. Builder specifies the first class of lattice: one end-to-end block-building deployment for one EVM chain, identified by a LatticeConfig fingerprint. Nothing in this blueprint assumes a lattice is a block-building lattice; other classes may follow their own proposals. Coalitions reference lattices; they do not own them.

LatticeConfig. Builder’s parent struct for a block- building lattice. Unchanged in this blueprint. See builder glossary.

Mechanism design. The subfield of game theory concerned with designing the rules of a game so that self-interested participants produce a desired outcome. In this book, mechanism design enters wherever the operator picks a clearing rule, a scoring function, or a verification rule — the coordination-market, reputation-feedback, and attestation-fabric patterns all admit a mechanism-design reading. The book treats mechanism design as a lens on the operator’s chosen rules, not as a prediction of how agents will behave. See societies — Game theory as a lens, not a prediction.

Module. A coalition-scoped component whose identity derives under COALITION_ROOT.derive("module").derive(name). The five basic services (Atlas, Almanac, Chronicle, Compute, Randomness) are modules. Commissioned composite organisms are NOT modules — they derive independently.

TDX Measurements. Intel TDX measurement register binding a boot image to the hardware root of trust. Pinned per TDX-gated organism in that component’s Config. See mosaik — Intel TDX.

Narrow public surface. The discipline of exposing one or two primitives per organism on the shared universe. Inherited from the zipnet design intro.

No-regret learning. An online-learning regime in which a player’s time-averaged payoff approaches the best fixed action’s payoff in hindsight. Classical game- theoretic convergence results assume no-regret play; Park et al. (2024) show that LLM-class agents are not no-regret in canonical repeated games. Cited in this book to flag that equilibrium analyses of LLM populations do not compose in the way the classical literature assumes.

Operator. Team running a lattice, standalone organism, composite organism, module, or coalition (or any combination). See introduction.

Organism. A mosaik-native service with a narrow public surface. The six builder organisms (zipnet, unseal, offer, atelier, relay, tally) inside each block- building lattice, every composite organism, every module, and every standalone organism a coalition references are organisms.

OrganismRef. The coalition’s reference type for an organism: a role name plus the organism’s stable id and optional content hash. The concrete Config type lives in the organism’s own crate and is opaque to the coalition meta-crate. See topology-intro — Coalition identity.

PeerId. The mosaik-native peer identity used by every node on the universe. Peers may rotate their PeerId per submission (the shuffle’s anonymity property — a fresh PeerId per sealed submission) or hold a stable PeerId bonded into an organism’s TicketValidator ACL (the ordinary integrator case). This book does not define a coalition-scoped peer identity distinct from PeerId; the rotating and stable cases are usage patterns of the one type. See mosaik — Identity & Networking and mosaik — Bonds & Peer Connections.

Retirement marker. A record a composite organism, module, or coalition commits to its own stream before its committee shuts down, declaring effective retirement time and an optional replacement pointer. See basic services — Retirement markers.

Separating equilibrium. In a costly-signalling game, the equilibrium in which senders of different types choose distinguishable signals because the cost of the signal is type-dependent. The book’s attestation fabrics rely on a separating structure: legitimate participants produce TDX or inference-receipt signals cheaply; impostors cannot.

Shared-ledger pattern. A composite organism that aggregates per-lattice tally::Refunds into a cross-origin-member attribution feed. See composite organisms — shared-ledger pattern.

Shuffle. Abstract primitive that takes N sealed submissions from distinct senders and makes their cleartext available to downstream readers in a way that breaks the sender → submission link. Concrete shuffle constructions include threshold-decryption committees (as in zipnet), cMix-style mix networks, threshold-BLS decryption pools, and FHE- backed release. Every example in this book that mentions anonymous submission composes on top of a shuffle; zipnet is the specific implementation the upstream project ships and the one against which the book’s worked examples bond. See introduction — Shuffle.

Shared policy. The mechanism by which mosaik AI agents self-organize and converge: each agent’s TicketValidator admits the same fingerprint — either the Config.content of a mediating organism (reputation’s utility function, a market’s clearing rule, an attestation fabric’s verification rule, a stigmergic collection’s write-side contract) or, for TDX deployments, a shared set of TDX Measurements that binds the runtime policy itself. Every emergent-coordination pattern in the book is an instance of this mechanism; every bond remains voluntary on both sides. See ai/emergent-coordination.md and, for the TDX arm, ai/sustainability.md.

Stable id. The (instance_name, network_id) blake3 hash a member publishes as its durable identifier. Changes only on retirement, not on operational rotations. See topology-intro — Member reference shape.

Standalone organism. An organism living directly on the universe rather than inside a lattice. Oracles, attestation fabrics, identity substrates, data- availability shards, analytics pipelines, and the like — all referenced by a coalition via OrganismRef.

StateMachine. Mosaik’s term for the deterministic command processor inside a Group<M>. Every organism has its own state machine. See mosaik groups.

Stall policy. Per-composite-organism rule for behaviour when one spanned member is not producing inputs for the current clock event. Either commit with partial evidence (preserving liveness) or stall the event (preserving quality). Documented per composite organism.

TDX. Intel Trust Domain Extensions. The TEE technology mosaik ships first-class support for. Used by composite organisms and sensitive standalone organisms. See mosaik TDX.

TicketIssuer. An optional coalition-scoped mosaik ticket issuer. Non-authoritative: no component is required to accept tickets from this issuer; components opt in by including the issuance root in their own TicketValidator composition. See ticket issuance.

Universe. The shared mosaik NetworkId (builder::UNIVERSE = unique_id!("mosaik.universe")) hosting every coalition, every lattice, and every organism. See mosaik — Identity & Networking.

VCG (Vickrey–Clarke–Groves). A family of truthful auction mechanisms (Vickrey 1961; Clarke 1971; Groves 1973) in which each bidder’s dominant strategy is to bid their true valuation. Cited in this book as one clearing-rule option for coordination markets; the book specifies the market surface but does not mandate a clearing rule. The operator picks.