Support
We're here to help you get the most out of Truestamp. Find answers to common questions or get in touch with our support team.
Community & Updates
Share feedback, follow what we're building next, and see what just shipped. Each opens right here in a popup, so no separate account is needed.
Knowledge Base
Browse the concepts behind Truestamp. Pick a domain to explore, follow the links between concepts, or search across everything.
Library
external knowledge and historical references: cited, one-per-source summaries of third-party material on timestamping, Merkle trees, signatures, blockchains, and entropy.
A Hybrid Approach to the Problems of Time-Stamping
UPB Scientific Bulletin paper surveying simple, linking, and distributed time-stamping schemes, their back-dating and verification weaknesses, and a hybrid multi-authority design using control time-stamps.
An Introduction to Merkle Patricia Trie
LambdaClass blog primer on the Merkle Patricia Trie (MPT), the authenticated key-value structure behind Ethereum state: tries, Patricia path compression, Keccak hashing, node types, StateRoot, and proof construction.
Anagram and Cipher Priority Claims
How 17th-century natural philosophers (Galileo, Huygens, Hooke, Newton) staked priority on a discovery by first publishing it as a dated anagram or letter-count cipher: a hand-built hide-and-bind commitment revealed later.
Angela: A Sparse, Distributed, and Highly Concurrent Merkle Tree
UC Berkeley CS262a project report on Angela, a sparse distributed Merkle tree with fine-grained conflict-node locking for concurrent batched updates, built on Ray and Amazon Aurora, achieving 2x over Trillian.
Bitcoin: A Peer-to-Peer Electronic Cash System
Satoshi Nakamoto's 2008 Bitcoin whitepaper: a trustless peer-to-peer cash system using a proof-of-work timestamp server, hash-chained blocks, and Merkle trees to prevent double-spending.
Blockchain vs Traditional Timestamping Methods (ScoreDetect Blog)
ScoreDetect blog article contrasting blockchain timestamping with traditional TSA/RFC 3161 timestamping across security, speed, scalability, cost, immutability, transparency, Merkle-tree batching, hybrid systems, and legal admissibility.
Blockchain-based Infrastructure for Proof of Existence in eGovernment
Vizzarri (2020) CEUR paper proposing a Bitcoin blockchain proof-of-existence scheme for eGovernment documents using OP_RETURN hash records, contrasted with centralized, decentralized, and distributed trusted-third-party systems.
Carbon Dating the Internet Archive with OpenTimestamps
Peter Todd's primary-source account (May 2017) of timestamping about 750 million Internet Archive files with OpenTimestamps: SHA1 digests read from the archive's own metadata, aggregated through a calendar server into a Merkle tree, and committed in a single Bitcoin transaction.
Comprehensive Guide to Merkle Trees, Merkle Proofs, and Merkle Roots
Cyfrin developer primer defining Merkle trees, proofs, and roots, how pair-wise hashing builds a root, how inclusion proofs verify membership, the second preimage attack, and blockchain uses.
Cornerstones, Foundation Deposits, and Time Capsules
How dated, sealed deposits (Mesopotamian foundation pegs, Egyptian foundation deposits, Masonic cornerstones, and modern time capsules) bind an inscribed record into a tamper-evident context to prove provenance, authorship, and a not-later-than date.
Cryptographic Accelerators for Digital Signature Based on Ed25519
IEEE TVLSI 2021 paper by Bisheh-Niasar, Azarderakhsh, and Mozaffari-Kermani presenting two FPGA hardware accelerators for the Ed25519 (EdDSA) digital signature, with Karatsuba multiplication and side-channel countermeasures.
Design of a Secure Timestamping Service with Minimal Trust Requirement
1999 UCL Crypto Group paper (Massias, Serret Avila, Quisquater) on the Belgian TIMESEC timestamping service: round-based Merkle trees, hash-linked round values, and newspaper publication to minimize trust in the authority.
Difference between X25519 and Ed25519 - Cryptography Stack Exchange
Stack Exchange Q&A explaining how X25519 (ECDH key exchange) and Ed25519 (EdDSA signatures) both build on Curve25519 using different curve forms and coordinate representations.
Ed25519 Deep Dive Addendum (r/crypto)
r/crypto discussion of Cendyne's Ed25519 Deep Dive Addendum, covering inconsistent signature-validation criteria across libraries, strong unforgeability, cofactored verification, non-canonical encodings, and the design history of EdDSA.
Ed25519: high-speed high-security signatures
The official Ed25519 site by Bernstein, Duif, Lange, Schwabe, and Yang: an EdDSA elliptic-curve signature scheme over edwards25519 with 128-bit security, deterministic nonces, 32-byte keys, and 64-byte signatures.
EdDSA (Wikipedia)
Wikipedia's overview of the Edwards-curve Digital Signature Algorithm: twisted Edwards curves, Schnorr variant, deterministic nonces, Ed25519 and Ed448, key and signature sizes, and standardization.
How Does OpenTimestamps Work (r/Bitcoin discussion)
A Reddit r/Bitcoin thread explaining how OpenTimestamps proves data existence using SHA-256 hashes, calendar-server Merkle aggregation, .ots proof files, and Bitcoin blockchain commitment.
How The Bitcoin Blockchain Is Fighting Fraud In Guatemala's Presidential Elections
Bitcoin Magazine feature on Simple Proof, which used OpenTimestamps and the Bitcoin blockchain to timestamp Guatemala's 2023 election tally sheets, creating tamper-evident proof-of-existence records citizens could independently verify.
How to Time-Stamp a Digital Document
Haber and Stornetta's 1991 Journal of Cryptology paper founding cryptographic digital timestamping via hashing, digital signatures, hash-linking chains, and distributed-trust witnessing.
Improving the Efficiency and Reliability of Digital Time-Stamping
Bayer, Haber, and Stornetta 1993 paper introducing hash trees (Merkle trees) to batch digital time-stamp requests, reducing storage and verification cost and enabling time-stamp renewal to extend signature lifetimes.
Interoperable Randomness Beacons (NIST CSRC)
NIST CSRC project defining an interoperable public randomness beacon that emits signed, hash-chained 512-bit full-entropy pulses every 60 seconds over a REST API, with the Beacon 2.0 format and NISTIR 8213 reference.
Linked Timestamping (Wikipedia)
Wikipedia overview of linked timestamping: hash chains and Merkle trees that link time-stamps into a tamper-evident order, avoiding private keys, with history, standards, and blockchain publication.
Merkle tree - Wikipedia
Wikipedia's reference article on Merkle (hash) trees: leaf and parent hashing, the root hash, logarithmic inclusion verification, Ralph Merkle's 1979 patent, the second-preimage attack, and uses in Bitcoin, Git, ZFS, and Certificate Transparency.
Merkle Trees in Git and Bitcoin
Initial Commit blog article explaining how Git and Bitcoin both use Merkle trees and content-addressable hashing to build tamper-evident, verifiable distributed data structures.
OpenTimestamps
OpenTimestamps: an open, free standard for Bitcoin-backed proof-of-existence timestamping (client-side hashing, calendar-server Merkle aggregation, .ots proofs), with a feature comparison against Truestamp.
Patents and Caveats as Priority Instruments
How patent filings and confidential caveats used a neutral state office to record a dated priority for an invention: an institutional timestamp and proof-of-existence marker, ancestor to modern cryptographic timestamping.
Poor Man's Copyright
The folk practice of mailing a sealed copy of your own work to yourself so the postal postmark serves as a dated third-party proof the contents existed by that date, with its copyright, authorship, and timestamping limits.
Provenance Marks and Registers
How registers, split tally sticks, assay hallmarks with date letters, dated colophons, and steganographic concealment served as pre-cryptographic proofs of priority, provenance, authorship, integrity, and timestamp.
Proving the Integrity of Digital Evidence with Time
Chet Hosmer's 2002 IJDE article arguing that trusted, auditable, UTC-traceable timestamps must bind who, what, and when to preserve the integrity of digital evidence for forensic and legal use.
Ralph Merkle - Wikipedia
Wikipedia biography of Ralph Merkle, co-inventor of public-key cryptography, inventor of Merkle trees and cryptographic hashing, and researcher in nanotechnology and cryonics.
RFC 6962: Certificate Transparency
IETF Experimental RFC defining Certificate Transparency: publicly auditable append-only Merkle Hash Tree logs of TLS certificates, with SHA-256 leaf/node domain separation, inclusion and consistency proofs, SCTs, and Signed Tree Heads.
RFC 8032: Edwards-Curve Digital Signature Algorithm (EdDSA)
IRTF/CFRG specification of EdDSA deterministic Schnorr signatures over twisted Edwards curves, defining Ed25519 (SHA-512) and Ed448 (SHAKE256), with encoding, verification, and test vectors.
RFC 8785: JSON Canonicalization Scheme (JCS)
RFC 8785 defines the JSON Canonicalization Scheme (JCS), a deterministic serialization of I-JSON data for reliable hashing and signing, using ECMAScript number formatting, UTF-16 property sorting, and UTF-8 output.
RFC 9562: Universally Unique IDentifiers (UUIDs)
IETF standard defining 128-bit UUIDs, obsoleting RFC 4122 and adding versions 6, 7, and 8 for time-ordered, database-friendly, sortable identifiers with CSPRNG and privacy guidance.
Sealed Deposits with Learned Societies
How scientists secured priority by lodging a dated, signed sealed note with a learned society (the French pli cachete, the Soleau envelope), fixing a date without disclosing the content until the seal was opened.
Seals, Signets, and Notaries
How cylinder seals, wax signets, papal leaden bullae, and the notarial instrument bound authorship, authenticity, integrity, and provenance to documents and made tampering evident: physical ancestors of cryptographic proof of existence.
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.
Some Aspects of Merkle Tree - DEV Community
Sergey Shandar's developer article on Merkle tree implementation pitfalls: second preimage and length extension attacks, distinguishing data from branch nodes, and hash alignment limits in content-addressable networks.
ssh-keygen: Wikipedia
Wikipedia overview of ssh-keygen, the OpenSSH command-line utility that generates, manages, and converts authentication keys, covering RSA, DSA, ECDSA, and Ed25519 key types.
Stellar Developer Documentation
Official Stellar Development Foundation developer documentation covering the Stellar network fundamentals: accounts, transactions and operations, ledgers, assets and lumens, fees, and the Stellar Consensus Protocol (SCP).
Stuart Haber - Wikipedia
Wikipedia biography of cryptographer Stuart Haber, co-author of the 1991 linked digital time-stamping work with Scott Stornetta, cited in the Bitcoin whitepaper and foundational to blockchain.
Taproot: SegWit version 1 spending rules (BIP 341)
BIP 341 defines Bitcoin Taproot: SegWit version 1 outputs using Schnorr signatures and a Merkle-branch script commitment (MAST) with key-path and script-path spending.
The First Blockchain or How to Time-Stamp a Digital Document
Decentralized Thoughts article by Ittai Abraham on the 1991 Haber-Stornetta digital timestamping scheme: hash chaining, Merkle trees, trusted repositories, and its influence on Bitcoin.
The Inventor of Blockchain Would Like a Better Bitcoin
Blockworks interview with cryptographic-timestamping pioneer Scott Stornetta on Bitcoin's achievements and flaws: incomplete decentralization, mining incentives, lack of monetary privacy, and immutable record-keeping against AI deepfakes.
The Provable Security of Ed25519: Theory and Practice
Academic paper giving the first detailed security proofs for Ed25519 (EdDSA) signature variants, covering EUF-CMA, SUF-CMA, key substitution resistance, malleability, and small-subgroup element checks.
Things that use Ed25519 - IANIX
IANIX catalog tracking real-world deployment of the Ed25519 EdDSA signature scheme across protocols, operating systems, hardware security modules, and cryptographic libraries.
Timestamping with OpenTimestamps, FOSDEM 2024
FOSDEM 2024 slide deck on OpenTimestamps: a decentralized, trust-minimized protocol that proves data existed at a point in time by Merkle-aggregating hashes through calendar servers and committing to the Bitcoin blockchain.
Towards More Reliable Bitcoin Timestamps (arXiv)
Short paper by Szalachowski (2018) showing Bitcoin block timestamps are miner-manipulable, and proposing external trusted timestamping authorities and SSL/TLS reference times to bound a block to a provable time window.
Tsunami of Blockchain Technology and Patents: A Strategic Data-Analytic Overview
ABA Jurimetrics (Fall 2023) data-analytic survey of global blockchain patent filing trends, the post-Bitcoin surge and crypto-winter cooling, US and IBM leadership, and Section 101 patent-eligibility strategy.
Using Merkle Trees to Efficiently Detect Data Changes
JavaScript Development Substack tutorial on Merkle (hash) trees: bottom-up SHA-256 construction, root-hash summaries, logarithmic change detection, and use in blockchain, P2P, and cloud sync.
Why and how Bitcoin uses Merkle trees - Applied Mathematics Consulting
John D. Cook blog post explaining how Bitcoin organizes block transactions into a Merkle tree, storing only the root in the block header to enable logarithmic-size Simple Payment Verification proofs.
Why do cryptocurrencies use Merkle trees instead of hashing all the data in the block in one go?
Reddit r/cryptography discussion explaining why blockchains use Merkle trees rather than a single block-wide hash: inclusion proofs, SPV light-client verification, partial verification without full data, and second preimage concerns.
Why is implementation relevant to timing attacks?
Cryptography Stack Exchange Q&A on why constant-time implementation, not just algorithm choice, defends against timing and side-channel attacks, covering the realistic attack model and data-dependent operations.
Witnessed and Notarized Laboratory Notebooks
How inventors used bound, dated, countersigned or notarized laboratory notebooks to prove priority, authorship, and a not-later-than date under the historical US first-to-invent patent regime.
Get Help
API Documentation
Comprehensive guides for the REST and GraphQL APIs, including interactive documentation and code examples.
View API DocsFAQ
Quick answers to the most commonly asked questions about timestamping and verification.
Browse FAQSecurity Issues
Report security vulnerabilities through our responsible disclosure program.
[email protected]