notes: research/papers/kerione-cesr-overview-deck

This data as json

path title type status classification words body
research/papers/kerione-cesr-overview-deck CESR: Composable Event Streaming Representation summary v0.1 — 2026-10-14: drafted by Claude from the PDF (22 slides); unread by Mark; marked partner on Mark's word 2026-10-21, paraphrase only partner 470 # CESR: Composable Event Streaming Representation **Abstract.** A 22-slide deck introducing CESR (Composable Event Streaming Representation), the dual text and binary encoding for cryptographic primitives and groups used across the KERI suite. It covers the three domains (raw, compact binary, text), code tables, tritet parsing, the master code table, stream parsing rules, and uses in archiving, legal signatures and audit trails, for implementers. ## Summary The deck, dated 26 April 2022, introduces CESR (Composable Event Streaming Representation), which its title slide describes as composable cryptographic primitives and groups for a streaming protocol that works in text and binary alike. Slide 2 points to the CESR and ACDC (Authentic Chained Data Containers) drafts and the WebOfTrust community. It places CESR among protocol formats: binary internet protocols, text protocols, self-describing maps such as JSON, CBOR and MessagePack, and cryptographic protocols, and calls CESR an inflection point because it gives a dual representation. It weighs binary against text formats and presents CESR as a hybrid of concatenated compact Base64 text and binary. Slides 6 and 7 define three native domains: the raw domain (code and raw bytes, as crypto libraries use them), the compact domain (fully qualified binary for streaming) and the namespace or text domain (fully qualified text, usable in identifiers, documents and verifiable credentials), with round-trip conversion between them, where fully qualified means a prepended derivation code. Slides 8 to 16 give the three classes of codes (basic primitives, indexed codes, group count codes), tritet parsing (the first three bits select the serialization), code table schemes, size tables, special context tables and the master table. Slides 17 and 18 show an annotated signature group example and stream parsing rules. The last slides argue for composability ("Verifiable Text Stream = Verifiable Binary Stream") and describe uses: archival preservation under ISO 14641:2018, legally binding signatures under ESIGN, UETA and eIDAS, and annotated KERLs (key event receipt logs) as audit trails. ## Key terms composability, derivation code, raw domain, compact domain, text (namespace) domain, primitive, indexed code, group count code, tritet, code table ## Claims and their evidence - A verifiable text stream converts to a verifiable binary stream with no loss of verifiability (slide 19). [informative] - A KERL already provides data integrity, data security and traceability, leaving only long-term preservation for an ISO 14641:2018 archive (slide 20). [informative] - Keys controlling a KERI identifier may also create legally binding electronic signatures (slide 21). [informative] - The first three bits of a stream identify its serialization (slides 9 and 18). [informative] ## Related the CESR specification (ToIP); KERI White Paper Slide Deck (whose closing section introduces CESR); CESR for First Years. ## Provenance Drafted by Claude on 2026-10-14 from the PDF, read through every slide title and the text of slides 1 to 3, 6, 20 and 21. Not yet read by Mark.

Links from other tables