notes: research/papers/acdc-for-wizards

This data as json

path title type status classification words body
research/papers/acdc-for-wizards Authentic Chained Data Containers (ACDC): Verifiable Credentials with Stuff summary v0.1 — 2026-10-14: drafted by Claude from the slides (PDF, 95 slides); unread by Mark; marked partner on Mark's word 2026-10-21, paraphrase only partner 492 # Authentic Chained Data Containers (ACDC): Verifiable Credentials with Stuff **Abstract.** A 95-slide deck by Samuel M. Smith, linked on keri.one as 'ACDC for Wizards', presenting ACDC (Authentic Chained Data Containers) features and field labels and the reasoning behind them: graduated disclosure, contractually protected disclosure, the PAC (privacy, authenticity, confidentiality) theorem, issuance models and KERI-based registries, and a long background section on OOBIs, BADA policy and discovery. For implementers who want the design rationale in detail. ## Summary The deck opens with resources (the ACDC specification repository, the 'ACDC for Muggles' deck, keri.one and the KERI white paper) and a list of basic ACDC (Authentic Chained Data Container) features: ACDCs are built on KERI (Key Event Receipt Infrastructure), use SAIDs (self-addressing identifiers), make schemas SAIDified and immutable, chain as a property graph, and support graduated disclosure (compact, partial, private, selective), contractually protected disclosure and protection against exploitation, including statistical correlation. Slides 4 to 12 walk through an ACDC's structure: the normative field labels (version string, SAID, issuer AID, UUID salt, registry identifier, schema, attributes, attribute aggregate, edges, rules, and the node, operator and weight labels of edges), public and private attribute sections, and nested edge sections with operators. Slides 13 to 22 cover disclosure and privacy: the principle of least disclosure and its mechanisms (compact, blinded, unbundled and bulk-issued content), a three-party exploitation model, contractually protected disclosure drawing on Ricardian contracts and chain-link confidentiality, a contractual exchange of offer, accept and disclosure, and the PAC theorem: a conversation may be private, authentic and confidential, but not all three to the same degree. Slides 23 to 46 argue for solving secure attribution, contrast non-repudiable and repudiable authenticity, discuss correlation economics, and introduce the AID|LID couplet (an autonomic identifier with a legitimized human-meaningful identifier), the BADA (Best Available Data Acceptance) policy and 'RUN off the CRUD'. Slides 47 to 61 compare issuer-holder-verifier and delegation models and KERI-based registries, with a key event log (KEL) controlling a transaction event log (TEL) registry. The remainder is background on internet safety: OOBIs (Out-Of-Band Introductions), endpoint disclosure, DNS and BGP hijacking, the spanning layer, discovery and certificate transparency. ## Key terms SAID, graduated disclosure, contractually protected disclosure, chain-link confidentiality, PAC theorem, AID|LID couplet, BADA policy, OOBI, TEL, edge section ## Claims and their evidence - ACDCs inherit KERI's properties because they are issued by KERI identifiers [informative] - A conversation cannot be private, authentic and confidential all to the same degree (PAC theorem) [informative] - Non-repudiable authenticity is legally binding and repudiable authenticity is not (slide 27) [presenter-reported] - Bulk issuance of blinded content can make presentations uncorrelatable [informative] ## Related - ACDC Whitepaper - ACDC Slides - ACDC for Muggles - ACDC specification repository - KERI white paper - CESR overview deck ## Provenance Drafted by Claude on 2026-10-14 from the PDF from SmithSamuelM/Papers (95 slides), titles of every slide and the text of slides 1 to 27 and 38 to 42. Not yet read by Mark.

Links from other tables