I / the egg
boundaries are
theorems.
dregg models the whole machine — desktop, database, and distributed swarm — in one verified language of cells, turns, and capabilities. You don't get permissions that can be granted and revoked behind your back; you hold authority you can prove, every time, at the point of use. Consent is a precondition of the math.
the four words
The whole kernel is one sentence: a turn is the exercise of an attenuable, proof-carrying token over owned state, leaving a verifiable receipt.
cell — the unit of self
State + identity, holding four kinds of knowledge: conserved value, revisable state, productive authority (what it can prove), and an append-only evidence ledger.
turn — one step of inference
An atomic, capability-gated transition across cells, executed as a transaction — all-or-nothing, journalled, rolled back on any failure.
capability — constructive knowledge
You hold a capability iff you can exhibit a witness the kernel accepts. Authority doesn't deplete by being used; it's constituted by what you can prove.
receipt — a proof it happened
Every turn binds the whole post-state. Tamper a field the effect didn't legitimately write and the receipt simply won't verify — the anti-ghost property.
five guarantees, one theorem
Machine-checked and conjoined in one apex theorem (deployed_system_secure) over the exact function the node runs. Every keystone is axiom-pinned with zero sorry, build-enforced — modulo the named cryptographic carriers the proofs assume as hypotheses. Circuits are emitted from Lean; Rust authors zero constraints.
- authority — every change justified by an unforgeable, non-amplified token chain; delegation only narrows:
granted ⊆ held - conservation — per asset, the resource sum is identically zero; money never appears from nowhere
- integrity — a receipt binds the whole post-state; un-written memory can't be forged into a passing proof
- freshness — no replay, no double-spend; a stored capability cannot outlive its grantor's revocation
- unfoolability — a light client checking one aggregate STARK root, re-running nothing, learns the entire history executed correctly
- the verified executor is the executor — the Lean function
execFullForestGruns the node via FFI, differentially verified byte-identical - post-quantum proofs — Plonky3 · BabyBear · Poseidon2 · FRI; recursive aggregation folds history into one root
- one entry, credential-gated — a turn that can't exhibit its token chain simply does not execute
- assumed, named, never hidden — STARK/FRI soundness and hash collision-resistance enter as typed hypotheses, out loud
what runs today
shipped has passing tests / proofs / boot logs behind it; in progress has a real foundation with named gaps; planned is designed, not yet wired.
the road, this season
Every named gap carries a closure lane. No parking lots, only burn-downs.
days–weeks
The verifier-epoch flip: staged conditional-truths become deployed truths, then re-genesis · restart-durable committees ride in front · a live LLM brain inside the jail · Hermes ⋈ Zed · zkOracle in anger.
weeks–months
DreggNet Cloud opens, paid in $DREGG · the Orb demonstrated end-to-end, then the verified-compiler descent · promise pipelining on its proven foundation · the l4v ascent begins.
months–quarters
Federations harden and scale · reproducible OS images — "here's my OS, and a proof of its confinement" · the deep assurance frontier: machine-checked UC + crypto config-pinning.