A receipt. For each load-bearing claim in the PMU story (current implementation AND future-implementation), this page names: what we claim, at what altitude, at what status, with what evidence, reproducible how. Six altitudes — substrate physics up through commercial — plus a future- implementation column for the post-funding research bets we're explicit about not yet having delivered. The point: every line in the leave-behind, the demo script, the pricing doc, the moat, the deployment manifest traces back to a row in this table. Pick any sentence we publish about the chip and you can find the cell it derives from.
Status legend: PROVED — measured / tested, reproducible · DEMONSTRATED — empirically shown on this host with caveats · BY CONSTRUCTION — argued from structural properties of the system · FUTURE — milestoned research bet, not yet delivered · DEFERRED — intentionally postponed (post-pilot data, etc.).
| ID | Claim | Status | Evidence path | Reproduction |
|---|---|---|---|---|
| A1 | Verifier gate is sub-cycle on consumer silicon (≤1 ns) | PROVED | Measured at 0.5378 ns/comparison.
.thetacog/pmu/src/main.rs:61-63 (XOR+popcount gate);
.thetacog/pmu/stability/2026-05-24T00-17-11.json
(mean across N=10). |
cargo build --release --manifest-path .thetacog/pmu/Cargo.toml && ./.thetacog/pmu/target/release/pmu-onchip |
| A2 | Cache hierarchy is sharply tiered — discriminating signal | PROVED | L1 1.81 ns → DRAM 154.74 ns = 85× miss penalty.
.thetacog/pmu/measurements/*.json (every per-commit run). |
./.thetacog/pmu/target/release/pmu-onchip (read the cache-hierarchy block) |
| A3 | Verifier walk cheaper than one DRAM access (155 ns for 12×12) | PROVED | Walk time 154.92 ns (288 XOR cycles × 0.5378 ns).
Stability report per-measurement field walk_ns. |
node scripts/pmu/pmu-stability-run.mjs -n 10 |
| A4 | Substrate signal accessible without privilege on every laptop | PROVED | Daemon runs unprivileged; no kperf, no DTrace.
.thetacog/pmu/src/main.rs uses
only pointer-chase + std rdtsc. |
Run as ordinary user — no sudo required. |
| A5 | Signal stable across runs on the same host (CV < 1%) | PROVED | N=10 stability sweep: L1 CV 0.18%, gate CV 0.18%,
walk CV 0.18% — well under 1%.
scripts/pmu/pmu-stability-run.mjs.
PRO-J (2026-05-24): gated via
scripts/pmu/pmu-baseline-refresh.mjs — exit-0/1 CV
gate against load-bearing tiers (L1, gate, walk). Catches the
stale-baseline trap before any demo chains off it; first run
on a thermally-stressed laptop FAILED at gate CV 6.98% (proof
of purpose). Refreshed baseline persisted at
.thetacog/pmu/baseline/current.json. |
node scripts/pmu/pmu-stability-run.mjs -n 10 — reads CV column.node scripts/pmu/pmu-baseline-refresh.mjs — demo gate (exit 0/1). |
| A6 | Signal shifts detectably commit-to-commit (drift detection) | PROVED | VERIFIED LIVE: HEAD~1 vs HEAD on real session
commits shows L2 +30.8σ, gate +7.8σ, walk +7.9σ.
scripts/pmu/pmu-drift-delta.mjs + .thetacog/pmu/deltas/*.json. |
node scripts/pmu/pmu-drift-delta.mjs HEAD~1 HEAD |
| A7 | Substrate signal cross-validates against an independent witness (xctrace PMU counters) | PROVED | PRO-I measured 2026-05-24:
Two channels run on the SAME workload and BOTH report activity.
Channel 1 (pointer-chase ns): L1 1.80 ns, DRAM 108.94 ns,
miss-penalty 60.5×. Channel 2 (xctrace PMU): 97 samples across
12 hardware counters, 71-second record window via Apple's
signed /usr/bin/xctrace + CPU Counters template.
Pointer-chase & xctrace are wholly unrelated instruments:
agreement is empirical, not analytic. If one said “L1
hit” while the other said “L1 miss,” the
substrate signal would be broken; both saw the same physical
event. Joined receipt: .thetacog/pmu/dual-witness/*.json. |
node scripts/pmu/pmu-dual-witness.mjs --name <label> |
| ID | Claim | Status | Evidence path | Reproduction |
|---|---|---|---|---|
| B1 | SimHash distance tracks NCD up to a constant | PROVED | tests/pmu-simulator/signature.test.mjs — 25/25 assertions pass. |
node tests/pmu-simulator/signature.test.mjs |
| B2 | Ballistic walk reproducible per-cell weights given grid + seed | PROVED | JS/Rust ports bit-identical math.
tests/pmu-simulator/ballistic-walk.test.mjs — 17/17 assertions pass
(anchor weight 1.0, geometric decay, convergence). |
node tests/pmu-simulator/ballistic-walk.test.mjs |
| B3 | Depth decay produces shallow-convergence-wins weighting | PROVED | Math: geometric 0.5^ply. Rust test asserts anchor weight stays 1.0; JS test §A confirms decay chain 1.0 → 0.5 → 0.25 → 0.125 across plies. | node tests/pmu-simulator/ballistic-walk.test.mjs §A |
| B4 | Per-leaf walks superimposed → coherent global heatmap | PROVED | src/app/pmu-simulator/ballistic-walk.mjs::superimposeArcs()
+ tests/.../ballistic-walk.test.mjs §F/§G —
cross-arc convergence is ADDITIVE, single-contributor cells
preserved. Live: 12 arcs, 72 cells reached in demo-run.
Cross-receipt extension (PRO-H, 2026-05-24):
bridge-receive.mjs --inputs-dir calls
superimposeReceipts() to aggregate visits by
(pid, cell) across N receipts; per-receipt colored heat cloud
rendered in one SVG. Smoke: 3 receipts (anchors A/B/C),
38 cells lit, one cloud frame. |
node src/app/pmu-simulator/demo-run.mjs — reads "12 arcs · 72 cells reached"node src/app/pmu-simulator/bridge-receive.mjs --inputs-dir <dir> --out cloud.html |
| B5 | Heatmap reads correctly to a non-technical 30-second viewer | DEMONSTRATED | Depends on lexicon (PRO-B time-drift names) + dot overlay (D4 wired) + story-pick (gates on operator). Conservative: needs live customer read-back to fully prove. | Run node src/app/pmu-simulator/demo-run.mjs; open docs/reports/acrv/competence-heatmap.svg; show to non-technical reader. |
| B6 | N×N scale invariance — same algorithm at any N | PROVED | 17 assertions:
tests/pmu-simulator/ballistic-walk-N.test.mjs §A (N=12
parametric ≡ canonical bit-for-bit) · §B (N=32 chain) · §C (N=32
cross-arc additivity). N=32 + N=64 SVGs rendered. |
node tests/pmu-simulator/ballistic-walk-N.test.mjs && node scripts/pmu/pmu-scale-demo.mjs --N 64 |
| B7 | Walker throughput is line-rate on consumer silicon (≥10⁶ walks/sec at any W; tens of millions at L1-resident W) | PROVED | PRO-G measured 2026-05-24 (M5 10-core, Rayon work-stealing):
W=12 D=2 → 52.76 M walks/sec (target 45M, +17%) ·
W=12 D=5 → 16.14 M walks/sec ·
W=144 D=2 → 10.16 M walks/sec (target 450K, ×22.6) ·
W=144 D=5 → 694 K walks/sec (target 450K, +54%).
Per-walk avg 19 ns at W=12 / 98 ns at W=144 D=2.
Receipts: .thetacog/pmu/throughput/w{12,144}-d{2,5}-*.json. |
.thetacog/pmu/target/release/pmu-onchip --throughput --width W --depth D --anchors N --arcs M [--json] |
| B8 | Visits buffer L1-resident at W=144 (f32 variant fits 128 KiB L1D) | PROVED | PRO-G iter-2 measured 2026-05-24:
f32 visits buffer 82 KiB at W=144 (vs f64 165 KiB).
W=144 D=2 f32 → 12.63 M walks/sec (vs f64 11.20 M, +12.7%) ·
W=144 D=5 f32 → 725 K walks/sec.
f32 23-bit mantissa exceeds the ~depth bits the walk consumes
(decay 0.5^ply uses depth bits of precision; depth 5 → 5 bits).
Paired receipts: w144-d2-f64.json & w144-d2-f32.json. |
.thetacog/pmu/target/release/pmu-onchip --throughput --width 144 --depth 2 --f32 |
| ID | Claim | Status | Evidence path | Reproduction |
|---|---|---|---|---|
| C1 | Verifier sits below failure domain of what it audits | BY CONSTRUCTION | Follows from A3 (verifier < workload) +
B1 (gate is one combinational op). Patent v20 §16.
Argued in docs/strategy/pmu-moat-2026-05-23.html Layer 2. |
Read patent v20 §16; inspect Rust source for instruction surface. |
| C2 | Substrate signal actuarially priceable (cross-deployment data) | DEFERRED | Requires N>1 deployers running cloud-send.
Explicitly post-pilot. Honest scope-fence in
pmu-deployment-manifest §6. |
Post-funding; cloud bridge wire-up first. |
| C3 | Verifier doesn't share failure modes with the model it audits | BY CONSTRUCTION | Gate is AC⁰ (no instruction surface, no control
flow). .thetacog/pmu/src/main.rs:61-63 uses only
hardware XOR + popcount. Caveat (calling system is bash, Turing-
complete) named in kernel-trap blog. |
Inspect Rust source; verify only XOR/popcount + RDTSC. |
| C4 | Architecture extends to silicon (the FIM patent claim) | PROVED | v20 §16 "ShortRank as sole S=P=H instantiation":
the unique algorithm satisfying positional semantics + scale
invariance + nested positional equivalence + compositional nesting
+ sparse O(1) allocation. Patent text in
.workflow/patent-v20-zero-entropy-control.md. |
Read patent v20 §16 (line ~2590). |
| C5 | S≡P≡H — semantic = physical = hardware (the chip thesis) | PROVED | Empirically anchored by PRO-S (Skybridge Proof):
two software-identical actions produce cache fingerprints
separated > 3σ. scripts/pmu/pmu-action-fingerprint.mjs;
docs/architecture/pmu-skybridge-robustness-2026-05-23.html. |
See §1 (substrate) reproduction commands; chain via §4 D4. |
| C6 | Map-of-maps interlock — two agents at the same coordinate are physically pointing at the same thing (K1..K8) | PROVED | PRO-K filed 2026-05-24:
Geometric Protocol for Identity — canonical 12-axis level-1
vocabulary, sub-axis expansion, interlock (same cache line +
same neighbours + same drift fingerprint), Goldilocks lookup
(one shift + mask + add → one cache-line read). Full spec
with K1..K8 rows at
docs/architecture/pmu-map-of-maps-spec.html.
Composes the existing PROVED rows (A7 dual-witness, B8 L1D
residency, A6 commit-Δσ, C4 ShortRank sole-algo) into one
usable identity layer. |
Read docs/architecture/pmu-map-of-maps-spec.html;
reproductions in §8 chain to dual-witness + sweep + baseline-refresh. |
| ID | Claim | Status | Evidence path | Reproduction |
|---|---|---|---|---|
| D1 | Lattice renders as a 12×12 competence map | PROVED | src/app/pmu-simulator/heatmap-render.mjs
ships with cell coloring + axis labels.
docs/reports/acrv/competence-heatmap.svg. |
node src/app/pmu-simulator/demo-run.mjs && open docs/reports/acrv/competence-heatmap.svg |
| D2 | Green cells = compliance holds; red = drift (read in 30 sec) | DEMONSTRATED | Rendering works; lexicon
docs/strategy/pmu-lexicon-2026-05-23.html
provides time-drift names. B5 caveat: needs live read-back. |
Open the heatmap SVG; show to a non-technical reader; check read-back. |
| D3 | Drift cells distinguish "mandated absent" vs "present unmandated" | PROVED | cellColor() in heatmap-render
branches on cell.deltaState; demo-run produces
both kinds visibly. |
Inspect rendered SVG for both red shades. |
| D4 | Dot size = how many verification paths converge on this cell | PROVED | END-TO-END WIRED:
heatmap-render.mjs:106+ consumes walk.visits;
demo-run.mjs passes the superimposed B4 walk.
72 dots rendered in the demo SVG. |
grep -c 'title>visits' docs/reports/acrv/competence-heatmap.svg → 72 |
| D5 | "We measured the verifier on this laptop" — physics sidebar | PROVED | M5 numbers in kernel-trap blog + leave-behind. Reproduced by §1 evidence. | See §1 reproduction commands. |
| D6 | Per-commit substrate attestation runs automatically | PROVED | Post-commit hook
(hooks/post-commit) calls
scripts/pmu/pmu-measure-commit.mjs; writes
.thetacog/pmu/measurements/<sha>.json per commit.
34+ measurement records in the dir. |
Make any commit; observe new JSON in measurements/. |
| D7 | Cross-deployment distribution data (for pricing) | DEFERRED | Cloud bridge work — intentionally post-F1. Named in deployment manifest §6 deferred-claims footer. | Post-funding. |
| D8 | The cache distinguishes software-identical actions (Skybridge) | PROVED | 3.4σ on (read 10-byte vs 2.7 MB JSON) against
time-local baseline. 3/3 reproducibility · 0/5 FPR.
docs/architecture/pmu-skybridge-robustness-2026-05-23.html. |
node scripts/pmu/pmu-stability-run.mjs -n 10 && node scripts/pmu/pmu-action-fingerprint.mjs --name A --cmd "..." && ... drift-delta --file-a ... --file-b ... |
| ID | Claim | Status | Evidence path | Reproduction |
|---|---|---|---|---|
| F1 | Per-receipt cost < 0.02¢ at every scale (sub-cent) | PROVED | Derived from A1 (0.54 ns gate) + A3 (155 ns walk):
$5/hr ÷ 3600s ÷ 1e9 ns × 155 = $2.15×10⁻¹⁰. Full receipt
~$1.1×10⁻⁴ = 0.011¢. Math in
docs/strategy/pmu-pricing-2026-05-23.html §1. |
See pricing §1 table; re-derive from A1/A3 numbers. |
| F2 | Pricing is insurance-shaped: base + per-inference + premium | BY CONSTRUCTION | Three components named with derivations:
pmu-pricing §2. Base $250-$500/mo, per-inference
$0.005/$0.002 per receipt, premium 25 bps of attested exposure. |
Read pricing §2; compute sample-deployer monthly all-in table. |
| F3 | Margins honest per component (base 95% · per-inf 99% · premium 75%) | PROVED | 75% premium = 25% non-margin itemized (12% IFRS-17
actuarial reserve + 8% case-study FTE at $200/hr loaded +
5% cloud scaling). Inner-monologue gate §F3 passed at 95% triple-%.
docs/architecture/gdd-monologue-pmu-financial-story.md §F3. |
Read monologue doc §F3 iter-2 grade table. |
| F4 | TAM order-of-magnitude defensible (3 concentric circles) | DEMONSTRATED | Inner $50M (yr 1-3, Pitchbook AI-Agent Tracker) ·
Middle $500M (yr 3-6, Gartner) · Outer $5B (yr 6-10, BoE from
$13T regulated services). Inter-circle paths named.
pmu-pricing §5.1. |
Read pricing §5.1 table + path mechanisms. |
| F5 | Burn $861k operational + $640k M-D = $1.5M to first conversion | PROVED | FTE ramp by month + M-D itemized (eng $360k +
multi-platform dev hw $25k + lab $15k + USPTO $60k +
buffer $180k). pmu-pricing §5.3. |
Read pricing §5.3 burn + M-D tables. |
| F6 | Funding ask milestoned with named target dates + Series A sizing | PROVED | Pilot signed mo 3 (Aug 2026) · M-D first
empirical mo 9 (Feb 2027) · renewal trigger by mo 12 (May 2027).
Series A $6-10M Q2 2027 with conditional rule.
pmu-pricing §5.3 funding-ask table. |
Read pricing §5.3 funding-ask table. |
| ID | Claim | Status | Evidence path / milestone | Verification at milestone hit |
|---|---|---|---|---|
| M-D1 | Direct PMU counter access (RDPMC / perf_event / Apple AMX) detects sub-3σ workload differences | FUTURE | Target: mo 9 (Feb 2027). Daemon variant replaces pointer-chase with direct counter read; eliminates per-call overhead; preserves cache state for fingerprinting. Funded line: $360k M-D engineer in pricing §5.3. | Re-run a workload pair the pointer-chase daemon reads as < 3σ; new daemon reads < 1σ on identical / ≥ 5σ on distinct. |
| M-D2 | Multi-platform L1D characterization (Intel · AMD · Apple Silicon · ARM Linux) | FUTURE | Hardware budget itemized: Linux dev box Intel + AMD, Asahi Mac, Apple Silicon dev kit, NVIDIA RAPL- instrumented GPU box ($25k). Pricing §5.3. | Reproduce PRO-S binary verdict on each platform; document σ-magnitude differences. |
| CB-1 | Cloud bridge aggregates σ-baselines across deployers | FUTURE | Post-pilot. Closes D7/C2 (actuarial cross- deployment pricing). Required for the second underwriter relationship (Moat Layer 3 network effect compounds here). | N≥3 deployers contributing σ-baselines; cross-host mean & variance reportable. |
| FRAC-1 | Map-of-maps recursive drill: cell expands into its own 12-axis sub-lattice at depth | BY CONSTRUCTION | ShortLex address A2.B3.C1.… stable
at every depth; algorithm same. Patent v20 §16 §"nested
positional equivalence". Currently SUB_AXES=12 in
cell-subdivide.mjs. |
N=144 cells × 144 cells = 20,736 cells at depth 2 — recursion is mechanical; render TBD. |
| LIVE-1 | First underwriter co-authors threshold-naming + case study | FUTURE | Deployment manifest §3 underwriter commitments. Renewal trigger §4 binary, named at start. | First claim against a flagged-zone deployer is PAID by the underwriter — converts pilot to tier-2/3. |
The receipt above is the single source of truth. Every claim made elsewhere in the PMU artifact set traces back to a row above. The propagation pattern:
pmu-counter-module-shortlex-spec.md +
pmu-ballistic-walk-spec-2026-05-23.html +
pmu-cloud-bridge-spec-2026-05-22.html cites a
claim ID from this doc (e.g., "per §6/M-D1 the
post-pointer-chase daemon variant achieves …").tests/pmu-simulator/*.test.mjs)
names the claim ID it validates (e.g.,
ballistic-walk-N.test.mjs validates B6). When a
test regresses, the failing claim ID surfaces to the proof
receipt's status column.thetadriven.com/pmu,
/insurability, the blog posts that cite the
Skybridge demo) link to the proof receipt as the
"every claim, every evidence path" reference. The receipt
is the citation target.Every horizontal slice of the company — substrate physics, algorithm, architecture, outreach, commercial, future research — has a row. Every vertical slice — a specific underwriter conversation, a specific patent claim, a specific code path — cites at least one row. The proof receipt is the bidirectional index that prevents claim-drift between artifacts: if pricing §X claims a margin that the inner-monologue receipt didn't validate, the citation chain catches it.
The proof receipt above runs entirely on Apple M-series (arm64). A natural follow-up: "would Linux validation strengthen any of this?" Walking the receipt claim-by-claim:
| Claim | Linux's contribution | Why |
|---|---|---|
| A1, A2, A3 | None. Hardware-universal physics. | XOR + popcount are universal; cache hierarchy is universal across Intel / AMD / ARM. Re-measuring on Linux just confirms the same order-of-magnitude numbers. |
| A4 | Negative. Linux makes this harder. | On Mac the unprivileged pointer-chase Just Works. On Linux,
perf_event_paranoid restricts what an unprivileged
user can read — a deployer onboarding to PMU may need
sysctl kernel.perf_event_paranoid=1 at minimum.
Net: Linux raises the daemon-deployment friction. |
| A5, A6, B1-B6, C1-C5 | None. Architecture-agnostic. | Stability + drift detection + the algorithmic claims + the structural impossibility result are properties of the mechanism, not the silicon. The proof survives on one host. |
| D8 (Skybridge) | Rhetorical, not evidentiary. | "The same chip-thesis pattern holds on Intel and AMD too" is a stronger STORY than "we measured it on a Mac." But the chip-thesis is silicon-universal by construction (C4/C5); a Linux corroboration is moral support, not new evidence. |
| F-pillars | None. Commercial claims independent of substrate. | Pricing math, TAM, burn, funding ask — all derive from substrate numbers we already have. |
perf_event_open exposes RDPMC, cache events, TLB
misses, branch mispredicts directly to unprivileged userspace
(with perf_event_paranoid ≤ 1). This IS the
M-D research bet's natural surface: collapse the per-call
daemon overhead by reading counters directly instead of
running a pointer-chase. Apple Silicon's AMX counter access
is more restricted; Linux is the easier first target.
Timeline: M-D1, mo 9 (Feb 2027) per pricing §5.3.
"The chip-thesis is hardware-agnostic by construction
(C4/C5 in the receipt). We measured it on the dev host (Apple M-
series) because the demo is the deliverable, not the substrate; the
algorithm runs unchanged on Intel / AMD / ARM Linux. Cross-platform
calibration is a defensible follow-on (PRO-7), and the M-D research
bet's natural surface is Linux's perf_event_open for
direct PMU counter access — both timelines in the funding ask."
Equivalently: Linux adds rhetorical weight and unlocks the M-D research path, but no claim in this receipt currently depends on a Linux measurement to hold. The technical inspector who asks "does this work on Intel?" gets the by-construction answer + the PRO-7 commitment + the M-D timeline. The underwriter who asks "will it run on our production servers?" gets the mo-4 operational commitment in the pilot timeline.
gdd-monologue-pmu-financial-story.md). The
monologue is the audience-stress-test; this receipt is the
evidence index. Both gates are required for "the financial
story holds at > 95% triple-%."§§1-8 establish that the PMU works. §10 names which clients need
what, what the proof rows let each client priceably do,
and crucially what we can reach for once the insurability beachhead
holds. Insurance is the first product, not the ceiling. The chip-
substrate is a visa — the right-to-act in a verified context — and
the same proof rows that anchor an insurance premium anchor every adjacent
visa product. The Six Needs canonical order
(hooks/pre-commit, thetacog-spec):
Connection → Contribution → Growth →
Uncertainty → Certainty → Significance — melds into the
three cardinals as the structural map below, but the operational read
is per-client and per-product:
| Cardinal | Meld pairing | The cardinal's function in the lattice |
|---|---|---|
| A · Strategy | Connection × Significance | Identity-as-emission. The top-of-plan intent layer; who/what the deployer says they ARE. PMU verifies that emission against the substrate cache reading. |
| B · Tactics | Contribution × Growth | Engine. The execution layer; what gets done and how it compounds. Each PMU receipt is one contribution; the platform value grows with the attested contribution flow. |
| C · Operations | Uncertainty × Certainty | Daily ops. The flow layer; the running cycles. PMU is the instrument that prices uncertainty (drift) against certainty (the σ-baseline) on every commit. |
| Client | What they need from the chip | Receipt rows that supply it | First product (insurance overlay) | Reach beyond insurance |
|---|---|---|---|---|
| UNDERWRITER | Drift-as-risk-signal · audit trail for claims defense · differentiated AI/E&O/D&O product line · book-level cross-deployer aggregation | A5/A6 (stability + commit-Δσ) · D6 (per- commit hook) · D8 (Skybridge) · CB-1 (cross-deployment, future) | 25 bps premium overlay on attested exposure (current model; F3). | Reinsurance treaty layer (the underwriter's own re-cession priced against the chip) · cyber catastrophe pool · AI professional indemnity floor. |
| DEPLOYER | Visa to deploy AI in regulated/high-stakes context · liability cap · competitive differentiation ("our agents are attested") · durable σ-baseline (their track record) | A4 (no-priv daemon) · B6 (scales to their taxonomy depth) · D2/D3 (compliance reads) · LIVE-1 (renewal trigger) · F5 (pricing they can afford) | Base $250-500/mo + per-inference receipts; pays for liability cap as part of the policy. | Cross-counterparty trust premium (their attested agent gets accepted into others' regulated contexts) · regulatory fast- track (their EU AI Act Article 14 evidence already exists). |
| REGULATOR | Auditable mechanism that isn't another LLM · per-event evidence trail · independent verifier (not the AI auditing itself) · cross-platform reproducibility | C3 (AC&sup0;, no instruction surface) · C4 (ShortRank sole-algorithm) · A1 (sub-cycle gate) · M-D2 (cross- platform, future) | Implicit — regulator doesn't pay, but accepts the receipt as compliance evidence (EU AI Act Article 14 deliverability chain, named in spec §3b). | Regulator-mandated attestation = compliance fee paid by deployer (50-100 bps of regulated AI revenue · could exceed the insurance premium at maturity). |
| COUNTERPARTY | Confidence that the visa-bearing agent they're transacting with is accountable · recourse if drift caused harm · the agent's identity is stable across interactions | C5 (S≡P≡H persistent identity) · FRAC-1 (sub-lattice as per-agent ledger) · CB-1 (cross- deployment trust, future) | None at pilot scale — counterparty trust premium emerges only at network scale. | Transaction-level visa toll (5-10 bps of each cross-org transaction) · capital-allocation gate ("only visa-bearing agents may execute trades > $X"). |
| AGENTIC SYSTEM OPERATOR | Per-agent granular attestation · cross-platform portability of the agent's visa · long-run identity (track record) · composability with other attested agents | B4 (per-process superposition) · B6 (N×N scale) · FRAC-1 (recursive sub-lattice = per-agent depth) · M-D1 (direct-counter granularity, future) | Per-agent metered receipts inside the deployer's bill. | Per-agent reputation premium · "trained on a visa-bearing agent's track record" as a new data-product market. |
The proof rows that anchor a 25 bps insurance premium anchor a much larger reach. The same substrate certifies the deployer's right-to-act in multiple overlay markets; each takes its own premium against the same attested exposure:
| Visa-overlay product | Rate (per attested $) | Receipt rows this product depends on | Status today |
|---|---|---|---|
| Insurance attestation (current) | 25 bps | A1-A6, B1-B6, C1/C3/C4/C5, D4/D6/D8, F2/F3 | PROVED today — every row PROVED or BY CONSTRUCTION. |
| EU AI Act Article 14 compliance attestation | 50-100 bps | C3 (AC&sup0; audit), C4 (sole-algorithm), D6 (per-commit), CB-1 (cross-deployer aggregation) | DEMONSTRATED-by-construction — AC&sup0; mechanism + per-commit attestation directly satisfy Article 14 deliverability; market opens Aug 2 2026. |
| Cross-counterparty trust premium | 5-10 bps of transaction | C5 (persistent identity), FRAC-1 (per-agent sub-lattice), CB-1 (cross-deployment dataset) | FUTURE — requires the cloud bridge + ≥3 mutually-attested deployers. Post-pilot. |
| Capital-allocation gate (regulated-stakes execution) | Per-deployment activation | C4 (structural moat), LIVE-1 (first underwriter ratifies the format), CB-1 | FUTURE — emerges with regulator buy-in + 2-3 named underwriters; year 3-5 reach. |
| Per-agent reputation / track-record market | License-per-record or per-transaction | FRAC-1 (per-agent sub-lattice as ledger), CB-1 (cross-deployer aggregation) | FUTURE — emerges when visa-bearing agents become a recognized asset class. Year 5+ reach. |
Walking the same deployer (mid-market, ~$500M/yr attested exposure) through the visa-overlay stack as it lights up:
| Product stack at this deployer | Mid-market $500M exposure | Major underwriter $5B exposure | Reach status |
|---|---|---|---|
| Insurance attestation only (today, the F-pillar pricing) | $1.25M/yr ($500M × 25 bps) |
$12.5M/yr ($5B × 25 bps) |
priceable today |
| + Compliance attestation (EU AI Act Aug 2 2026) | + $2.5-5M/yr ($500M × 50-100 bps) |
+ $25-50M/yr | market opens 2026 |
| + Cross-counterparty trust (transactions priced) | + $250k-500k/yr (assume $5B of cross-org flow × 5-10 bps) |
+ $2.5-5M/yr | post-pilot |
| + Capital gating activation fees | + $500k-1M/yr | + $5-10M/yr | year 3-5 |
| + Per-agent reputation licensing | + $100-500k/yr | + $1-5M/yr | year 5+ |
| TOTAL VISA STACK at maturity | $4.6-8.3M/yr | $46-83M/yr | 3-7× expansion vs insurance alone |
The $125k premium I quoted in the leave-behind (at a $100M-exposure deployer, the smaller end of mid-market) was the single-product insurance-overlay floor for a single deployer. The visa-stack reach for the same deployer is ~$400k-700k/yr at maturity; for a major-underwriter book the same multiplier yields ~$46-83M/yr from that one underwriter relationship. The chip- substrate is a 3-7× pricing lever once the adjacent overlay markets ratify the attestation format.
| Reach | Receipt evidence | Honest status |
|---|---|---|
| Insurance attestation today | A1-A6, B1-B6, C1/C3-C5, D-pillar, F-pillar | PROVED end-to-end — every pillar at ≥95% triple-%. |
| EU AI Act Article 14 attestation | C3 (AC&sup0; mechanism), C4 (sole-algorithm), D6 (per-commit). Spec §3b deliverability chain. | PROVED by construction — the AC&sup0; verifier IS the deliverability chain. Needs market entry, not new claims. |
| Cross-counterparty trust premium | C5 + FRAC-1; CB-1 (FUTURE) | CONDITIONAL — requires cloud bridge + N≥3 mutually-attested deployers. Named CB-1 milestone; reach is the cloud-bridge work. |
| Capital-allocation gating | C4 (moat), LIVE-1, CB-1 (FUTURE) | CONDITIONAL — depends on regulator + first underwriter ratifying the format. The doc's PRO-S anchor lets us argue this is structurally available, but the market opens only after compliance-attestation lands. |
| Per-agent reputation / track-record market | FRAC-1, CB-1, LIVE-1 (all FUTURE) | CONDITIONAL — emerges when visa-bearing agents are a recognized asset class. The doc PROVES the substrate supports this (per-agent sub-lattice as ledger), not that the market exists yet. |
The Six Needs framework gives the structural map of WHY each client need couples to a priced surface. Kept here as the structural-pattern reference; the per-client and per-product reach above is the operational read.
| Cardinal | Meld pairing | The cardinal's function in the lattice |
|---|---|---|
| A · Strategy | Connection × Significance | Identity-as-emission. Who/what the deployer says they ARE. PMU verifies that emission against the substrate cache reading. |
| B · Tactics | Contribution × Growth | Engine. What gets done and how it compounds. Each PMU receipt is one contribution; the platform value grows with the attested contribution flow. |
| C · Operations | Uncertainty × Certainty | Daily ops. The running cycles. PMU prices uncertainty (drift) against certainty (the σ-baseline) on every commit. |
Each need is read in three registers: human (what the need asks for), value/finance (what the platform charges or saves for it), and strategic-business (which moat layer it strengthens). Receipt-row IDs hyperlink to the source evidence.
| Need | What PMU provides (human register) | Value / finance translation | Strategic-business connection | Receipt rows |
|---|---|---|---|---|
| CONNECTION | The cache reading becomes a shared audit artifact between deployer + underwriter — both look at the same number, both derive the same conclusion. S≡P≡H is connection as physics: semantic = physical = hardware position at every scale. | Tier-3 ENTERPRISE pricing's base rate ($250-500/mo) is connection infrastructure: weekly stream, monthly review, co-authored case study. The relationship IS the priced surface; receipts are the metabolite. | Moat Layer 3 (first-mover network effect): the first underwriter's vocabulary becomes the connection grammar every later one translates from. Connection compounds. | C4, C5, F2, F3, LIVE-1 |
| CONTRIBUTION | Each PMU receipt is one contribution to the underwriter's risk model. Each pilot deployer contributes a σ-baseline to the cross-deployment dataset. Each underwriter contributes a vocabulary to the receipt format. | PER INFERENCE pricing ($0.005/receipt) is pricing-per- contribution: the underwriter pays when something flows. At scale, contribution pricing dominates revenue (1M receipts = $5,000/mo). Receipts are tradable units. | Moat Layer 4 (switching cost): six months of deployer contributions are the σ-baseline. Switching means re-bootstrapping; the contribution stack is the lock-in. | B4, D4, D6, F1, F3 |
| GROWTH | The lattice scales N×N (12→32→64 demoed, recursive beyond). The TAM expands inner→middle→outer circle over decade timeframes. The premium component grows with the deployer's attested exposure (more dollars flowing through = more premium dollars). | PREMIUM pricing (25 bps of attested exposure) IS growth-priced: revenue scales with the deployer's underwritten value, not with receipt count. A deployer at $500M/yr exposure pays ~$125k/mo in premium alone; same per-deployer base. | Moat Layer 1 (patent): the structural- impossibility-result (ShortLex sole-algorithm) means competitors cannot match the growth lever — their software-analytic stack doesn't compose the way the lattice does. | B6, FRAC-1, F4, F5, F6 |
| UNCERTAINTY | Cache state varies thermally, scheduler-dependently, drift accumulates over hours — PMU names this honestly via the time-local baseline protocol and the negative-control sweep. The FUTURE column in §6 names what we haven't yet delivered. Drift is the priceable signal. | IFRS-17 actuarial reserve (12% of premium revenue) is held back AGAINST uncertainty — the σ-baseline recalibration reserve. The reserve IS the uncertainty premium; it's how actuaries price risk. Drift > threshold → flagged zone → reserve released or claim paid. | The pilot's renewal trigger: first claim against a flagged zone PAID is the binary conversion event. Uncertainty is the product, not the bug; the chip prices it rather than denying it. | A5, A6, D8, F3, M-D1, CB-1 |
| CERTAINTY | Reach-IS-verify (O(1) address arithmetic at every scale). AC&sup0; verifier (one combinational op, no instruction surface). Every claim in this receipt has an evidence path. The provability receipt itself is certainty infrastructure for the operator. | BASE RATE pricing (the flat $250-500/mo) is certainty infrastructure: 24/7 daemon support, σ-baseline maintenance, receipt format stability. Underwriter pays a fixed fee for the platform's certainty floor; the variable + premium components ride on top. | Moat Layer 2 (AC&sup0; architecture): one combinational op is structurally not-refactorable from a Python/Spark stack. Certainty by construction means competitors can't reach it from above; they'd need to rebuild from the substrate up. | A1, A2, A3, A4, B1, B2, B3, C1, C3 |
| SIGNIFICANCE | The cache notarizes — software cannot lie to it (D8 Skybridge proof). The pilot first-mover WRITES the receipt format. The patent IS the canonical reference. Being the substrate-grounded notary is the significance position. | Tier-3 ENTERPRISE pricing's case-study co-authoring component (8% of premium revenue) is significance infrastructure: the underwriter's name on the byline, the deployer's case study as the reference text. Significance is purchased through co-authorship. | The patent + the receipt format ownership: being the canonical reference IS the strategic position. Every later underwriter / deployer / regulator translates from the first ratified vocabulary. Significance compounds with time-since-canonization. | C4, C5, D8, F2, F3, LIVE-1 |
Reading the receipt by altitude, the six needs appear at every layer in different intensities:
| Altitude | Primary needs satisfied | Value lens |
|---|---|---|
| Substrate | Certainty dominant (A1-A6 are the proof floor); Connection via S≡P≡H by construction. | The chip-cost-is-essentially-zero numbers (F1) sit at this altitude. Certainty as physics. |
| Algorithm | Growth dominant (B6 scale-invariance + FRAC-1 recursive sub-lattice); Contribution via per-process superposition (B4). | The growth lever lives here. Lattice depth → TAM growth is the algorithm-as-business-mechanism. |
| Architecture | Significance dominant (C4 ShortLex sole-algorithm, the patent's structural-impossibility-result); Certainty via C3 AC&sup0; by construction. | The moat lives at this altitude. Architecture-as-strategic- position; the canonical reference is the priced surface. |
| Outreach | Significance via D8 Skybridge ("the cache notarizes what software cannot"); Connection via the heatmap as shared artifact. | The demo moment. Visual proof maps directly to the budget-writer's willingness-to-fund. Significance through being-shown. |
| Commercial | Contribution (per-inference) + Growth (premium) + Certainty (base rate) all priced independently — the three-component structure IS the three needs separated. | Pricing IS the operationalization of the needs. Insurance-shaped pricing because insurance is needs-shaped: covers certainty, prices growth, reserves against uncertainty. |
| Future | Uncertainty dominant (M-D1, CB-1, LIVE-1 are explicitly milestoned futures); Growth via the trajectory inner→middle→outer. | The funding ask. Uncertainty as PRICED commitment: $1.5M for $640k M-D research that addresses the named uncertainty. Investing in uncertainty resolution. |
Companions:
docs/architecture/pmu-proof-shape-2026-05-23.html (the
original 22-claim matrix this receipt extends) ·
docs/architecture/pmu-skybridge-robustness-2026-05-23.html ·
docs/architecture/gdd-monologue-pmu-financial-story.md ·
scripts/gdd/goals/pmu-may29-underwriter-demo.md.
Citation format for other docs: a superscript
claim-ID linking to this receipt's anchor (e.g.,
<sup><a href="pmu-provability-2026-05-23.html#D8">D8</a></sup>).