Skip to main content

Recompute Agreement

Zeq binds every sealed record and every fact to the Zeqond it was sealed at — so integrity becomes time-witnessable, verified by recomputation, with no network vote needed.

Each machine owns its own entangled state — a hash-linked, tamper-evident transition log, PoEZ-sealed so rewriting history costs real elapsed Zeqonds. The protocols here compose signed facts and quorum signatures on top of those sovereign chains; "fork choice" below means choosing between candidate histories of one machine by their Zeqond drift, not coordinating a network. (The theme keeps its historical URL.)

  • Theme — recompute-agreement
  • Protocol count — 22 (record-propose, record-seal, fork-choice, finality, fact-publish, fact-verify, dag-walk, quorum-sign, verifier-join, verifier-retire variants)
  • Anchor operatorsKO42 · CS87 · ZEQ-TETHER-003
  • Verification — bit-exact block commitments; bit-exact DAG verify

What it solves

Most record-keeping systems have to invent their own notion of time, and a timestamp ends up being a claim rather than a fact. Zeq removes that tax: every sealed record and every fact is bound to the Zeqond at which it was sealed, signed by the tethered verifier that sealed it. Integrity is then checked by anyone, offline, by recomputation — the bits either reproduce or they don't.

Two primary structures live here:

  • The entangled state — each machine's hash-linked log, where every sealed record commits to phase_at_seal, zeqond, parent_hash, tether_quorum_sig. Between two candidate histories of the same machine, prefer the entangled state whose cumulative Zeqond drift is smallest. Verifiers join and retire via ZEQ-TETHER-003 quorum signatures. See the Entangled State Explorer.
  • Truth DAG — a directed graph of signed facts (claim, author, phase, zeqond, parents, signature). Verification is a purely cryptographic DAG walk; no trusted timestamping authority needed.

CS87 is the Kolmogorov floor on record / fact identifier material; ZEQ-TETHER-003 is the quorum primitive that makes verifier sets themselves first-class objects.


Operator map

OperatorFormulaRole
KO42.1ds² = g_μν dx^μ dx^ν + α sin(2π · 1.287 t) dt²Mandatory — block / fact time-binding
CS87`Ω(x) = min{p
ZEQ-TETHER-003`B_sib = ∑_k e^(i·φ_k)sibling_k⟩`

Runnable worked example — seal + verify a block

# 1. Seal
curl -s -X POST https://zeqsdk.com/api/playground/compute \
-H "Authorization: Bearer $ZEQ_DEMO_KEY" \
-H "Content-Type: application/json" \
-d '{
"operators": ["KO42", "CS87", "ZEQ-TETHER-003"],
"inputs": {
"protocol": "block-seal",
"parent_hash": "0x...",
"txs": ["tx1","tx2","tx3"]
}
}'

Expected:

{
"block_hash": "0x...",
"height": 10422,
"phase_at_seal": 0.3311,
"zeqond": 1745125300.144,
"quorum_signers": 7
}
# 2. Fork-choice query
curl -s -X POST https://zeqsdk.com/api/playground/compute \
-H "Authorization: Bearer $ZEQ_DEMO_KEY" \
-H "Content-Type: application/json" \
-d '{"operators":["KO42","CS87"],"inputs":{"protocol":"fork-choice","heights":[10418,10419,10420,10421,10422]}}'

Expected: the entangled state whose cumulative Zeqond drift is minimal, with the drift value explicit in the response.


Extend it

  • Cross-system anchoring — publish an entangled-state head hash to any external system as an additional time-witness; the proof stays self-contained either way.
  • Light-client attestation — a phone-sized client only needs Zeqonds + quorum signatures to verify inclusion.
  • Supply-chain Truth DAG — every transition in a physical supply chain is a fact whose parents are the upstream facts; tampering is a visible DAG mutation.

Seeds

  • Stake-without-token verification — Zeqond-weighted verifiers without a coin economy; compute contribution is the stake.
  • Planetary-scale finality — ZTB1 + interplanetary latency models drive deep-space sealing cadences.
  • ZK-compliance blocks — every block carries a ZK proof that its transitions satisfy a regulatory predicate, without revealing the transitions.

Papers

Middleware active. Kernel on the 1.287 Hz HulyaPulse. Awaiting next Zeqond.