3C — domain communication
3C is the application contract for reading, writing and trading between graph domains, services and token books. neurons authorize actions; progs execute work; shards partition graph state; services govern shared applications; books define token obligations. The domain model keeps these roles explicit.
| Mode | What crosses | Required interpretation |
|---|---|---|
| read | A claim about remote state and its evidence | Domain, network, authenticated root, object, coverage, time and verification profile |
| write | An authorized operation or an exported state/computation claim | Exact subject, destination, payload, grant and replay protection; receiver validates admission separately |
| trade | Conditions, commitments and receipts | Home-book authority, conservation, common matching epoch where required, delivery, expiry and settlement evidence |
radio transports messages and tade frames them. Each application profile defines its codec, authentication and evidence. A peer connection, a name lookup, a returned receipt and a finalized fact have distinct meanings. Acceptance of this proposal requires those meanings to remain distinguishable at every boundary.
read — evidence in
A verifier names the counterparty's protocol and trusted starting point, checks its transition/finality rules, and binds the answer to a particular root and freshness bound. A nox verifier and recursive zheng proof can compress verification work when that exact consensus and proof profile is supported. Correct computation of a verifier preserves the verifier's assumptions about validator authority, fork choice, finality, data availability and trusted anchors. It cannot manufacture evidence absent from the source chain.
Reads retain the state tier and at coordinate. T0 proof,
T1 anchor and T3 attributed observation are distinct evidence classes; a caller
states which class and freshness its operation accepts. Anchoring a foreign root
proves the anchor under its own profile; verification of the foreign state's
validity requires its separate evidence. The header market proposal
prices the work needed to keep that evidence fresh.
write — actions and evidence out
An action captures neuron identity, target network, exact operation, grant, replay identity and the executor contract before dispatch. Services may reject an otherwise authenticated request under their admission rules. Revocation prevents new dispatch through the revoked binding; retained attempts preserve their original author and unresolved outcomes until reconciled.
A graph query can export a ranked subgraph together with a proof of computation against authenticated state. Its result identifies coverage and the state root used. A local commit, a signed Signal, remote acceptance and consensus finality are separate observations. focus summaries and cyberank attestations must state which of these their evidence establishes.
trade — obligations at home
Under the oikos proposal, balances remain entries in their home books. Trading programs their conditional reassignment: "credit X upon evidence of E in domain Y, at tier at least τ, before deadline t." Each home book enforces its issuer and spending rules. A program ID, service name or shard root supplies no implicit permission to issue or spend.
Two protocols remain necessary:
- Matching without a free option. Order commitments may be hosted in a routing domain. Candidate matching binds both legs to the same foculus epoch and requires delivery evidence before a leg becomes committed. The protocol must specify activation, timeout, rollback and partition behavior so that one counterparty cannot gain a unilateral option from ordering.
- Freshness and settlement. Every condition identifies the source network, evidence profile, acceptable checkpoint/epoch and expiry. A halted counterparty eventually fails the freshness requirement. Delivery proves receipt of the bound message; settlement additionally requires valid home-book execution.
This home-book design avoids custody of transported copies. It still requires correct condition code, issuer policy, proof verification and availability. Foreign protocols retain their actual assets, addresses and wire rules through explicit adapters; adopting 3C terminology alone cannot change those rules.
registration — typed routes
An authorized graph record binds a name to a typed service, book, shard or network reference and to a state root or endpoint as appropriate. Resolution returns provenance and freshness. The consumer verifies the subject authorized to publish the record, then verifies the evidence required for the requested action. Registration supplies discoverability and an anchor under its profile; the action's authority and the remote domain's finality remain explicit.
See shard, oikos, network and communication. The historical cell ladder remains a compatibility reference.
discover all concepts