Skip to content
13CH13.TXT — Epilogue

Chapter 13 · 2023–2026

Epilogue: Local Confidential Computing and the Machine Economy

> The fab feeds the chip, the chip roots attestation, attestation makes edge compute trustworthy, and trustworthy edge compute makes a private machine economy possible. The epilogue follows that chain from the wafer to the receipt.

C:\HISTORY\CHAPTERS\13>type SECTION1.TXT

Bringing the guarantees home

> Confidential computing grew up in the cloud, where the threat was the operator. Local confidential computing asks for the same guarantees on the device where data is born: a camera that runs its detector inside a protected partition and emits only counts; a medical sensor that seals raw readings to its own measurement; a meter that computes a bill without exposing a household's minute-by-minute life. The aim is privacy that holds because the operator cannot read the data, not because the operator has promised not to.

> The pieces exist. TrustZone-M and DICE give small devices protected partitions and layered identities; on-device NPUs run inference without sending raw data away; TPMs and secure elements seal keys; RATS gives a common language for evidence. What has been missing, and what Emma-Jane MacKinnon-Lee's bench work explores, is attestation that completes between peers without any cloud verifier.

emma-jane-mackinnon-lee-history-edge-meters-signed-receipts.png
Emma-Jane MacKinnon-Lee local confidential computing: edge meters exchanging signed receipts in the M2M economy
> Two meters on a field-site wall, attesting to each other offline.
C:\HISTORY\CHAPTERS\13>type SECTION2.TXT

Machines that verify each other

> In a peer model each device carries the endorsements and reference values it needs to appraise its neighbours. A gateway appraises a sensor's DICE chain before accepting readings; a sensor appraises the gateway before releasing sealed data. Updates to reference values propagate as signed bundles. When the network is absent, trust continues; when it returns, logs reconcile.

> From there the step to an economy is short. If a device can prove what code it ran and on which hardware, it can issue a signed receipt for a measured task: a reading taken, an inference performed, a kilowatt-hour metered. Receipts can settle small obligations between machines, each exposure kept small, each claim anchored in physical work. Markets remain at the boundary, where machines meet people and institutions; inside the boundary, machines exchange proofs rather than promises.

C:\HISTORY\CHAPTERS\13>type SECTION3.TXT

The whole chain

> This is why the history has two strands. A receipt is only as trustworthy as the attestation behind it; the attestation only as trustworthy as the root of trust; the root only as trustworthy as the process that made it and the hands that packaged and provisioned it. The secure coprocessor of 1998 and the open shuttle of 2020 belong to one story.

> The authors end where they began, with the small trusted core that vouches for something larger. What has changed is who can build it. In 2026 a region, a university or a small team can design an open root of trust, tape it out on an open PDK, and deploy devices that prove themselves to one another. The history of confidential computing and the history of fabrication have become one history of who gets to make trust.

C:\HISTORY\CHAPTERS\13>type DATES.LOG
2023RFC 9334 gives peer attestation a shared vocabulary
2024Open silicon roots of trust reach commercial silicon
2025–2026Offline and peer attestation experiments at edge sites
C:\HISTORY\CHAPTERS\13>type STANDARDS.LST
  • RFC 9334
  • TCG DICE
  • TrustZone-M
  • Entity Attestation Token
  • TPM 2.0
C:\HISTORY\CHAPTERS\13>grep TERMS GLOSSARY.DAT
Local confidential computing
Confidential computing on the device where data originates, with attestation completed between peers and no cloud verifier required.
Signed receipt
An attested statement issued by a device that a measured task was performed, used to settle small obligations between machines.
Convergence at the edge
2023–2026
Author: Emma-Jane Mackinnon-Lee