privacy · proofs · compute
v2.0 · checksummed

Defs. Key Definitions

v2.0
Cite this section

Copy/paste (plain text):

Jason St George. "Defs. Key Definitions" in Next Generation Stores of Value: Privacy, Proofs, Compute. Version v2.0. /v/2.0/read/front-matter/key-definitions/

Key Definitions

Before proceeding, we establish precise definitions for the core constructs that recur throughout this thesis. These are not metaphors; they are operationally specified primitives.

Definition: VerifyPrice(W) — Specification Stub

For a canonical workload WW, VerifyPrice is the public KPI vector:

\verifyprice(W)(p50,t(W),  p95,t(W),  p50,c(W),  p95,c(W),  fail(W))\verifyprice(W) \equiv \bigl(p_{50,t}(W),\; p_{95,t}(W),\; p_{50,c}(W),\; p_{95,c}(W),\; \mathrm{fail}(W)\bigr)

Where:

  • p50,t(W)p_{50,t}(W), p95,t(W)p_{95,t}(W): median and 95th-percentile verification time (seconds)

  • p50,c(W)p_{50,c}(W), p95,c(W)p_{95,c}(W): median and 95th-percentile verification cost (see cost vector below)

  • fail(W)\mathrm{fail}(W): verification failure rate (fraction of attempts that fail or timeout)

Verifier Hardware Class (Reference Machine)

TierCPURAMStorageNetworkUse Case
Laptop (baseline)4-core x86-64, 2.5GHz16 GBSSD100 MbpsDefault reference
MobileARM, 2GHz4 GBFlash20 MbpsLightweight verification
Datacenter16-core, 3GHz64 GBNVMe1 GbpsHigh-throughput nodes

All published VerifyPrice metrics specify which tier they target. The baseline is Laptop; mobile and datacenter metrics are supplementary.

Cost Vector

Verification cost is expressed as a vector, not a scalar:

c(W)=(tcpu,  mpeak,  bnet,  ejoules,  cest)c(W) = \bigl(t_{\mathrm{cpu}},\; m_{\mathrm{peak}},\; b_{\mathrm{net}},\; e_{\mathrm{joules}},\; c_{\mathrm{est}}\bigr)
ComponentUnitDescription
tcput_{\mathrm{cpu}}CPU-secondsTotal CPU time consumed
mpeakm_{\mathrm{peak}}MBPeak memory usage
bnetb_{\mathrm{net}}KBBytes transferred (witness, proof, state)
ejoulese_{\mathrm{joules}}JEnergy consumed
cestc_{\mathrm{est}}USDEstimated fiat cost at current rates

Adversarial Conditions

VerifyPrice assumes realistic, mildly adversarial network conditions:

  • Network RTT: 200ms (global average)

  • Packet loss: 10% (degraded conditions)

  • Witness size: Worst-case for the workload class (prevents gaming via cherry-picked inputs)

  • DoS hardening: Verifier must handle malformed proofs gracefully (no crash, bounded resource use)

Measurement Harness

  • Reproducible benchmark suite: Open-source, deterministic test vectors for each canonical workload.

  • Signed results: Verifiers publish measurements signed by their attestation key.

  • Aggregation: Observatory collects results from diverse verifiers (geo, ASN, hardware) and publishes p50/p95 with confidence intervals.

  • Auditable: Raw measurements are archived; anyone can reproduce and challenge published metrics.

Target SLOs (Reference Design)

Workload Classp95,tp_{95,t}p95,cp_{95,c}failNotes
ZK proof (SNARK)5\leq 5s\leq \0.01$0.1%\leq 0.1\%Standard recursive/aggregated proofs
MatMul-PoUW10\leq 10s\leq \0.05$0.1%\leq 0.1\%Large matrix verification
Provenance proof2\leq 2s\leq \0.005$0.1%\leq 0.1\%Media/document attestation
Corridor settlement30\leq 30s\leq \0.10$0.5%\leq 0.5\%Includes finality confirmation

These are targets, not guarantees. Actual SLOs are published per workload and adjusted as technology improves.

Why this matters: VerifyPrice is the hinge that determines whether proofs and verified compute behave as commodities (publicly checkable) or as platform IOUs (trust someone’s claim). If r(W)=v(W)/p(W)1r(W) = v(W)/p(W) \ll 1, verification is cheap relative to production and markets can form; if r(W)1r(W) \to 1, we’re back to “trust the prover.”

Definition: Work Credits

A Work Credit is an energy-anchored claim on a standardized unit of triad work (privacy settlement, proof generation, or verified compute) that has been produced and attested under public SLOs.

Issuance: Credits are minted only when:

  1. A valid proof of workload WW at tier TT is accepted by the network.

  2. Telemetry confirms VerifyPrice(WW,TT) and other SLOs (latency, failure rate, decentralization) are within bounds.

Claim semantics: Implementation-dependent. Work Credits can be designed across a service-contract spectrum:

  • Non-redeemable evidence-linked claims: transferable claims referencing historical work. Scarcity may support price, but does not make them money.

  • Redeemable vouchers: credits burnable for future proofs, compute, or settlement capacity. Provides direct utility claim.

  • Fee/collateral/governance medium: credits required for network operations:

    • Fee prepayment: credit burns in lieu of per-call fees.

    • Collateral: credit staked as skin-in-the-game for provers, routers, and LPs.

    • Governance weight: credit-weighted voting in telemetry disputes and parameter changes.

These options are not mutually exclusive; a single network may support multiple redemption paths for different use cases.

Energy anchoring: Marginal cost of minting one credit is bounded below by energy and hardware required to pass verification. The difference from SHA-256 PoW is that this work has an external buyer—which is the point of the design and also its cost, since a buyer can be regulated, subsidized, or coerced in a way that a hash puzzle’s absent buyer cannot (§30: Objections & Responses). Each credit references a Facility Energy Receipt (FER) chain; if the referenced plant drifts out of profile (PUE >1.5> 1.5, carbon intensity >> threshold, etc.), downstream credits are flagged.

Deliverability bound: Issuance is capped by stress-adjusted DVC for the specified workload and tier, not by gross energy, installed hardware, or benign-state proof throughput.

Non-debt property: Work Credits do not promise fixed coupons or redemption in fiat terms. Value floats with demand for triad capacity.

Failure mode: If VerifyPrice regresses materially, new issuance halts until SLOs recover. Existing credits remain valid but may trade at a discount, reflecting the network’s degraded utility.

Definition: Instrument Hierarchy

The thesis distinguishes five categories of objects:

Evidence Objects (not scarce, not money):

  • PIDL Receipt: Proof that a specific interaction occurred. Copyable, verifiable, not scarce.

  • Work Receipt: Proof that a unit of work was completed. Evidence of past work; confers no future rights.

  • FER/FCR: Evidence about energy, infrastructure, resilience, and the edge capacities used to compute DVC.

Capacity and Service Objects (typed claims, not presumed SoV):

  • Work Credit / WC-Voucher: Prepaid or transferable access to specified triad capacity under workload, location, hardware, SLA, and delivery terms. May expire. Useful for service procurement and hedging, not presumed savings.

Duration-Bearing Credit:

  • Project Notes and Capacity Bonds: Explicit credit claims with maturity, covenants, default states, and loss waterfalls. Proof-audited, but never transferred onto the base asset.

Derivatives and Operating Claims:

  • LP/Staking Shares: Positions granting fee, slashing, corridor, or validator exposure. They are not monetary objects.

Conditional Monetary Candidate:

  • Base Asset: The native fee and settlement unit. It is evaluated for monetary premium only if DVC, non-bypassability, holder quality, agency, and the remaining chain conditions pass.

Hierarchy rule: Throughout this thesis, “the asset” refers to the base asset unless otherwise specified. Evidence, service claims, duration-bearing credit, and derivatives do not inherit its conditional monetary candidacy.

Definition: Lawful Privacy

Lawful privacy is the design principle: default privacy with optional, user-controlled disclosure.

Concretely:

  • Default state: Transactions, identities, and flows are encrypted and unlinkable without explicit consent.

  • Disclosure mechanisms: Viewing keys, auditable receipts, and selective-disclosure proofs allow holders to prove specific facts (e.g., “I paid X to Y for purpose Z”) without exposing the full transaction graph.

  • No backdoors: The protocol has no master keys, regulatory escrow, or “lawful intercept” APIs. Disclosure is always at the holder’s discretion.

Why “lawful”: The term signals that privacy is compatible with compliance when the holder chooses to disclose, without requiring surveillance infrastructure. Regulated entities can satisfy audits via viewing keys; the protocol itself remains neutral.

Coercion boundary: Lawful privacy is a technical guarantee. It cannot prevent social or legal coercion to disclose viewing keys. What it guarantees is that (1) non-custodial routes exist, (2) disclosure cannot be forced at the protocol level, and (3) coercion surface is minimized by keeping data encrypted by default.

Quick Reference: Political Economy & Physical Capacity

These terms carry the thesis’s political-economy and physical-capacity vocabulary. Full treatments appear at the cited locations; short forms are collected here for quick reference.

  • Balance-Sheet Repression (§2: The World Forces New Monetary Primitives): financial repression implemented through collateral rules, capital treatment, stablecoin reserve rules, custody mandates, and institutional balance-sheet incentives.

  • Administrative Repression (§4: Threat Model): the conversion of formally optional financial, identity, compute, and settlement rails into practically mandatory rails through custody defaults, compliance rules, app-store control, tax treatment, institutional mandates, benefit systems, and platform terms of service.

  • Participation Line (§2: The World Forces New Monetary Primitives): the household or organizational threshold below which a person or firm lacks the redundancy to act freely across time—to fail, retry, transact, move, learn, refuse coercive terms, or survive shocks.

  • Agency-Preserving Infrastructure (§2: The World Forces New Monetary Primitives, §3: First Principles: What a SoV Must Survive): infrastructure that expands a user’s capacity to act without converting the user into a dossier, dependency object, or platform account.

  • Homestead Ratio (§4: Threat Model): the share of verified compute, proof generation, and AI-service capacity supplied by open-admission, non-hyperscaler, geographically diverse, independently verifiable operators.

  • Facility Capacity Receipt (FCR) (§14: Layer 0: Verifiable Machines & Energy): a signed, auditable receipt that extends Facility Energy Receipts with grid, cooling, redundancy, hardware, jurisdiction, and infrastructure-resilience claims.

  • Physical VerifyPrice (§19: Layer 4: Truth & Work, Appendix A: Formal Model of Verification Asymmetry & VerifyPrice): the time, cost, and confidence required to verify the physical infrastructure claims behind a unit of verified work.

  • Wrapper Dominance Ratio (WDR) (§10: Work Credits: Energy-Anchored Claims): the ratio of custodial or synthetic economic exposure to protocol-native usage. A rising WDR indicates the asset may be financializing faster than it is becoming money.

Quick Reference: Physical Sovereignty & Substrate

These terms make the physical layer falsifiable and name the closed-stack competitor. Full treatments appear at the cited locations.

  • Energy & Physical Interdiction (§4: Threat Model): adversary class using curtailment, rationing, tariff discrimination, interconnection denial, and load prioritization to raise verification cost without prohibiting cryptography.

  • Sovereign Optionality (Os\mathcal{O}_s) (§14: Layer 0: Verifiable Machines & Energy): capacity-weighted index from Facility Capacity Receipt fields; feeds risk haircuts and Red Line 13.

  • Disruption-Adjusted VerifyPrice (§14: Layer 0: Verifiable Machines & Energy): probability-weighted verification cost across physical disruption states; resilience is subordinate to constitutional VerifyPrice SLOs.

  • Red Line 13: Energy Sovereignty Failure (§27: Risk Analysis & Failure Modes): verification affordability becomes a sovereign policy variable; monitors upstream of Red Line 1.

  • Closed vs. open sovereign stack (§29: The Closed Sovereign Stack): convergent trust-minimization applied to matter; inverted locus of sovereignty (state vs. participant).

  • Physical VerifyPrice (two senses) (Appendix A: Formal Model of Verification Asymmetry & VerifyPrice, glossary): constitutional real-resource SLO vs. cost to audit FCR infrastructure claims—Red Lines 1 and 10 respectively.

Quick Reference: Market Realization & Price Formation

This is the market-structure vocabulary for reasoning about price without confusing it with adoption. Full treatments appear at the cited locations.

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