Deterministic encoding
05A protocol can require one chosen serialization among several valid encodings.
Related RFCs and changes
“Updates” changes part of an earlier RFC. “Obsoletes” replaces it. This list shows selected related documents.
DIAGRAM§ 4.2 ↗
RFC 8949 · § 4.2EXAMPLE
3 / 3
03
Order map entries
Apply the chosen deterministic map-key ordering before hashing or signing.
Protocol participantThreat or exceptionProtocol controlSimplified drawings · precise section references
Read the updated RFC section ↗
Core deterministic encoding uses preferred shortest representations.
- Core deterministic encoding uses preferred shortest representations.
- It disallows indefinite-length items and orders map keys by their deterministic encoded byte order.
- Determinism does not itself provide signatures, schemas, or semantic validity.
Examples are illustrative. Consult the linked RFC and its errata for implementation details.
Read the RFC section ↗Diagrams simplify the RFC. Read the linked sections for complete requirements.
Privacy