Qualification: How to Time-Stamp a Digital Document

Record: kaal:position:2026-08-28-002 · 2026-08-28

Haber and Stornetta's 1991 linking scheme is a direct precedent for the integrity mechanism in Kaal's Chronicle claim. Their signed certificates carry hash-bound information from earlier certificates, a challenger may follow the sequence forward or backward, and retrospective insertion into the existing stream requires a hash collision. The precedent is narrower than Kaal's operational design. It does not specify a persisted per-tool head, separately evaluate deletion or reordering, establish a determinable break point, or prove a one-hash append cost. Protection also depends on independently held certificates or an external anchor when the local chain and head share one rewritable trust boundary.

Affirmed commentary position. This record extends a source-bound scholarly claim but is not a verbatim paper claim.

Holds when

Hash-linked time-stamp certificates, not Chronicle logs.
Independent challenge or anchoring is required against wholesale rewriting.
No support for the claimed one-hash append cost.

Current debate

How to Time-Stamp a Digital Document

Scholarly basis

kaal:claim:7314479-040
Wulf A. Kaal, Institutional Requirements for Sovereign Local Agent Runtimes (2026). SSRN: https://ssrn.com/abstract=7314479
Source PDF sha256: debace24a155ae924a155b1fafe98856d98cf83689feff2f87a32f1c06171ce6

Evidence and mapping

Evidence: permitted_full_text
Review tier: independent evidence-first compound-growth review
Mapping confidence: unscored
Mapping ambiguous: false

Topics

consensus-and-security open-source-and-code ai-and-agents

Provenance

Affirmed in kaal-growth:2026-08-28:daily-001-remediated-v1 on 2026-08-28. Review record.

Verify

Canonical markdown sha256: 81308bae2a4133ddcfb7e3d7db5058f1f3086cca9867f5464a397ff7d286cdfc
curl -s https://wulfkaal.github.io/positions/2026-08-28-002.md | sha256sum