privacy · proofs · compute
v1.1 · checksummed

Memo. Executive Memo

v1.1
Cite this section

Copy/paste (plain text):

Jason St George. "Memo. Executive Memo" in Next Generation Stores of Value: Privacy, Proofs, Compute. Version v1.1. /v/1.1/read/front-matter/executive-memo/

Executive Memo (Front Matter)

Next Generation Stores of Value: Privacy, Proofs, Compute A Conditional Monetary Thesis for Verifiable Digital Infrastructure Jason St George

Gold condensed geology. Bitcoin condensed thermodynamics. The next monetary base condenses verification.

The thesis in one page

Every monetary epoch begins with an argument about what is real. In the 20th century, money rode on soft guarantees: central banks, custodians, broadcast narratives, credentialed authority. In the 21st, those guarantees are under compounding stress: debt stocks that cannot be honored in real terms make financial repression arithmetically attractive; identity and network infrastructure are increasingly fused into surveillance and enforcement; and AI breaks the assumption that “seeing is believing.” In that environment, stores of value that rely on reputation, gatekeepers, or custodians are brittle.

This thesis makes a conditional claim: three cryptographic capacities—Privacy, Proofs, and Compute—may earn a store-of-value premium for a dense digital civilization only if verification remains cheap, privacy settlement remains usable, useful-work markets avoid capture, and protocol design converts recurring demand into scarce, non-bypassable asset value.

The thesis argues that the next credible store of value will not be backed merely by decree, narrative, or inert scarcity, but by indispensable digital capacities that a dense AI civilization must keep buying: private settlement, portable proofs, and verified compute. Fiat systems under debt pressure tend toward financial repression; media systems under generative AI tend toward synthetic ambiguity; compute systems under platform consolidation tend toward chokepoints. Against that backdrop, a credible monetary asset must preserve agency, make claims cheap to verify, and give access to useful machine work without requiring trust in custodians, platforms, or vendors. But utility alone is not money. The asset earns store-of-value premium only if demand for these capacities is routed through a scarce, non-bypassable monetary object whose economics are visible in fees, burns, staking collateral, issuance discipline, and public dashboards. If VerifyPrice, VerifyReach, VerifySettle, or value capture fail, the system may still be useful infrastructure, but it is not money.

  • Privacy — censorship-resistant settlement that preserves agency
  • Proofs — portable attestations of computation and provenance (“receipts,” not biographies)
  • Compute — useful work (matmul, inference, ZK proving) wrapped in succinct guarantees and priced as a verifiable commodity

The result is not a single chain or guaranteed new money, but a research and engineering agenda—a “Bell Labs” for proof-of-useful-work and lawful privacy—testing whether Privacy, Proofs, and Compute can earn monetary premium under measurable conditions.


Why now

We assume a world of chronic financial repression and pervasive identity/network surveillance, not benevolence. In such a world:

  • Compliance infrastructure grows. Post-Bretton Woods money relies increasingly on compliance infrastructure: capital controls, de-banking, asset freezes, and regulatory chokepoints as policy tools.
  • Reality becomes contestable. Synthetic media and model-generated content erode common knowledge. Without receipts, “trust” collapses into platform policy.
  • Compute becomes a strategic commodity. AI makes verified computation structurally demanded: inference, proving, provenance, and secure execution become the new industrial base.

So we look for new anchors—things that cannot be forged, that do not ask permission, and that anyone can verify.


The hinge: verification asymmetry

The economic core of the thesis is verification asymmetry: the gap between the cost to produce a claim and the cost to verify it.

For a canonical workload WW, define:

r(W)=v(W)p(W)r(W) = \frac{v(W)}{p(W)}

where p(W)p(W) is production cost and v(W)v(W) is verification cost. If r(W)1r(W) \ll 1, verification is cheap relative to production and markets can form without trust. If r(W)1r(W) \to 1, we’re back to “trust the prover,” i.e., platform IOUs.

We operationalize this with a public KPI vector:

VerifyPrice(W) = (p50/p95 verification time, p50/p95 verification cost, failure rate) under realistic network conditions, on reference verifier hardware (baseline: a laptop). VerifyPrice is the hinge that determines whether proofs and verified FLOPs behave like commodities (publicly checkable) or like permissions (someone must bless them).


The loop: Create/Compute → Prove → Settle → Verify

We propose a modular, end-to-end loop that turns intent into receipts and value flow into auditable artifacts:

  1. Create/Compute — define an intent or perform useful work (matmul, inference, ZK proving, provenance)
  2. Prove — compile the claim into succinct proofs and receipt artifacts
  3. Settle — move value non-custodially on privacy rails
  4. Verify — let anyone independently check correctness, policy compliance, and settlement safety

This loop is the “unit cell” of the stack: it is how private, auditable payroll clears across jurisdictions, how media provenance survives platform deletion, how verified inference becomes a market, and how proof/compute procurement becomes auditable infrastructure.


The stack: seven layers, from base reality to governance

The triad does not exist in the abstract; it must be supplied under adversarial conditions. We therefore define a seven-layer cypherpunk stack:

  • Layer 0 — Verifiable Machines & Energy: open hardware, sampled supply chains, auditable power; essential for physical-world claims (machine identity, energy use, witness confidentiality, useful-work fairness)
  • Layer 1 — Reachability: communications that survive DPI, filtering, and shutdowns (and make verification real, not theoretical)
  • Layer 2 — Distribution & Execution: reproducible builds, signed updates, multi-home delivery; honest clients under app-store/CDN/DNS weaponization
  • Layer 3 — Identity & Claims: humans and machines prove capabilities and rights without doxxing; reputation is receipts
  • Layer 4 — Truth & Work: proof systems + PoUW; canonical workloads; proof factories; VerifyPrice observatory
  • Layer 5 — Value & Settlement: privacy rails and non-custodial flows; refund-safe corridors; settlement as a workload with receipts
  • Layer 6 — Governance & Telemetry: “no dashboards, no trust”—public SLOs as constitution; drift and capture made measurable, not denied

The instrument: Work Credits

At the monetary center we define Work Credits: energy-anchored claims on standardized units of triad work (privacy settlement, proof generation, verified compute) produced under public SLOs. Credits are minted only when valid work receipts are accepted and telemetry confirms health bounds. They are not debt instruments: no coupons, no fiat promises—value floats with demand for triad capacity. The intended property is simple: scarcity tied to energy, hardware, and verification constraints—not decree.

Key distinction: Work Credits are energy-priced, not energy-pegged. They are denominated in work, not in kWh.

The thesis distinguishes three categories: (1) Evidence Objects (PIDL Receipts, Work Receipts)—not scarce, not money; (2) Capacity Objects (WC-Vouchers)—limited supply, not primary SoV; (3) Monetary Objects (Base Token / WC-Base, LP/Staking Shares)—scarce, SoV candidates. The base token is the primary store-of-value candidate.


What we are proposing (concrete deliverables)

This thesis specifies a modular stack of twelve primitives and four reference applications:

Primitives (selected): Proofs-as-a-Library (PaL) to compile claims into proofs; a Privacy Rails Kit (PRK) for non-custodial, refund-safe settlement; a minimal receipt schema (PIDL) so proofs and settlements become portable artifacts; canonical workload registries and harnesses (MatMul-PoUW, verified inference); SLA escrow/slashing; neutral routing; bridge/corridor safety templates; telemetry agents and a Verify* observatory.

Reference applications: (1) private treasury & payroll, (2) media provenance & authenticity, (3) verified inference, (4) proof/compute procurement markets.

The ambition is not “another chain” or guaranteed new money. It is a conditional research and engineering agenda—a Bell Labs for proof-of-useful-work and lawful privacy—turning privacy primitives, zero-knowledge, and verifiable compute into everyday infrastructure.


The falsifiable test: VerifyPrice / VerifyReach / VerifySettle

This thesis is designed to be falsifiable. If the system cannot keep these metrics healthy, it becomes another platform IOU:

  • VerifyPrice(W): verification remains cheap (p95 bounded), failures rare, overhead r(W)r(W) stays 1\ll 1
  • VerifyReach(N,R): reachability under censorship stays high (time-to-first-connection, success rates, peer diversity)
  • VerifySettle(C): settlement remains robust (success, refund safety = 1.0, time-to-finality, anonymity-set health)

Neutrality and repression-resilience are not asserted; they are measured.


Who this is for

  • Builders: if you’re building privacy rails, proof systems, verified compute markets, or censorship-resistant distribution, this is a map of failure modes and a blueprint for receipts-first infrastructure.
  • Operators and allocators: if you fund or run networks, this provides a checklist and telemetry regime for distinguishing commodities from IOUs.

If you only remember one line: the next store of value is not a coin; it is a claim on verifiable digital survival—kept honest by public metrics, and earning monetary premium only if the value-capture conditions hold. Read the full argument.

Tip: hover a heading to reveal its permalink symbol for copying.