Protocol / Future / Light Clients (Future)
plannedLayer 1 · Protocol

Light Clients (Future)

Speculative light-client verification — let a browser verify a space's state from succinct proofs (recursive ZK) instead of the full authorization DAG.

Light Clients (Future)

Light clients are a speculative direction that would let a constrained instance — e.g. a browser — verify a space's current state without holding the full authorization DAG, by checking succinct proofs (recursive ZK proofs over state roots) instead of replaying every delegation and epoch from genesis. This is the "Recon" exploration in the whitepaper.

Why

Today verifying a space means validating its event history bottom-up. A light client would instead trust a small recursive proof (optionally anchored on-chain as an L2/L3 state root), so a thin client could confirm "this is the space's authorized state" cheaply — making consistency checkable from the edge without full replication.

Current status

Speculative — research phase. Named in the whitepaper Future Directions (alongside on-chain state anchoring) and sketched in the explorations/ "recon" / lite-client drafts; no implementing code. Depends on ZK-VM proving that does not yet exist. Do not treat as committed.

See also

Builds on ZK VMs (the proof system) and relates to replication & discovery (the full-node counterpart) and consistency. Sits in Layer 1; see the roadmap.

Sources

  • whitepaper: README.md §6 (Light Client Verification; On-Chain State Anchoring); explorations/ (recon / lite-client drafts)