• Language

  • Non-English translations are machine-generated.

  • Language Preferences
  • Theme
Sign In

Knowledge Base

Browse the concepts behind Truestamp. Follow the links between concepts, or search across everything.

Tagged: sha-256

7
Cryptography
Domain-Separated Hashing (SHA-256 Byte Prefixes) How Truestamp separates SHA-256 hash contexts with single-byte domain prefixes, keeping leaf hashes, node hashes, and each kind of hashed object in distinct hash spaces to prevent ambiguity and second-preimage confusion.
Glossary
Domain separation Truestamp's rule that every hash over its own evidence is SHA-256 computed over a reserved single-byte prefix plus the data, so a hash made for one purpose (Merkle leaf, node, item claims, proof payload) can never collide with or be replayed as a hash for another purpose. Merkle tree A binary hash tree where each parent is the SHA-256 hash of its two children, reducing a whole set of leaves to one root; Truestamp builds these trees over item and entropy observation hashes per block and over block hashes per epoch. RFC 6962 The Certificate Transparency standard Truestamp takes its Merkle hash primitives from - SHA-256 with 0x00 leaf and 0x01 node domain-separation prefixes, and the empty-tree root - while shaping the tree above them by its own key-sort and power-of-two padding rules.
Items
The Item's Composite Fingerprint How an item's claims fingerprint and timing fingerprint are bound into the composite fingerprint (item_hash) so user data stays independently verifiable, the witnesses that open the submitted-after edge are committed, and authorship is deliberately excluded from every hash.
Library
Secure Hash Standard (SHS) FIPS PUB 180-4, the NIST Secure Hash Standard specifying SHA-1 and the SHA-2 family (SHA-224, SHA-256, SHA-384, SHA-512, SHA-512/224, SHA-512/256) message-digest algorithms.
Merkle
Truestamp's Merkle Tree Truestamp's binary Merkle hash tree, which sorts leaves by key, pads to a power of two, and hashes leaves and internal nodes under separate byte prefixes over SHA-256, defining leaf, node, and root and how the root is computed.