{
 "@context": "https://schema.org",
 "@type": "Claim",
 "@id": "https://wulfkaal.github.io/positions/2026-08-28-002",
 "identifier": "kaal:position:2026-08-28-002",
 "additionalType": "https://wulfkaal.github.io/positions/schema.json#AffirmedPositionClaim",
 "name": "Haber Stornetta Hash Linking Qualifies Chronicle Integrity",
 "text": "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.",
 "author": {
  "@type": "Person",
  "name": "Wulf A. Kaal",
  "identifier": "https://orcid.org/0009-0008-7840-1847"
 },
 "datePublished": "2026-08-28",
 "dateModified": "2026-08-28",
 "creativeWorkStatus": "Affirmed",
 "responseType": "qualification",
 "keywords": [
  "consensus-and-security",
  "open-source-and-code",
  "ai-and-agents"
 ],
 "scope_conditions": [
  "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."
 ],
 "currentDebate": {
  "name": "How to Time-Stamp a Digital Document",
  "url": "https://doi.org/10.1007/BF00196791"
 },
 "extends": {
  "identifier": "kaal:claim:7314479-040",
  "url": "https://wulfkaal.github.io/claims/7314479-040",
  "citation": "Wulf A. Kaal, Institutional Requirements for Sovereign Local Agent Runtimes (2026). SSRN: https://ssrn.com/abstract=7314479",
  "paper": "Wulf A. Kaal, Institutional Requirements for Sovereign Local Agent Runtimes (2026). SSRN: https://ssrn.com/abstract=7314479",
  "authors": [
   "Wulf A. Kaal"
  ],
  "year": "2026",
  "ssrn": null,
  "source_pdf_sha256": "debace24a155ae924a155b1fafe98856d98cf83689feff2f87a32f1c06171ce6"
 },
 "isBasedOn": [
  {
   "@id": "https://wulfkaal.github.io/claims/7314479-040"
  },
  {
   "@type": "CreativeWork",
   "name": "How to Time-Stamp a Digital Document",
   "url": "https://doi.org/10.1007/BF00196791"
  }
 ],
 "batch_id": "kaal-growth:2026-08-28:daily-001-remediated-v1",
 "review_provenance": "https://wulfkaal.github.io/positions-src/2026-08-28-compound-growth-kaal-growth-2026-08-28-daily-001-remediated-v1.json",
 "publicationStatus": "public",
 "recordTypeNote": "Dated commentary position extending a scholarly corpus claim. Not a verbatim claim extracted from the paper.",
 "isPartOf": {
  "@id": "https://wulfkaal.github.io/positions/index.json"
 },
 "version": "1.0",
 "canonical_url": "https://wulfkaal.github.io/positions/2026-08-28-002",
 "canonicalForm": "https://wulfkaal.github.io/positions/2026-08-28-002.md",
 "candidateId": "kaal:candidate:131bcbd129478f1058b600d1173b644d8616abb4d0ec4e4782a83b5fe549ded9",
 "evidenceLevel": "permitted_full_text",
 "reviewTier": "independent evidence-first compound-growth review",
 "mappingConfidence": null,
 "mappingAmbiguous": false,
 "mappingMethod": "independent one-to-one proposition and mechanism review",
 "mappingWhyRelevant": "Haber and Stornetta directly support hash-linked sequence integrity and collision-bounded retrospective insertion. They do not establish Kaal's persisted per-tool head, modification/deletion/reordering cases, determinable break point, or one-hash append cost.",
 "sourceProvenance": {
  "canonicalUrl": "https://doi.org/10.1007/BF00196791",
  "retrievedAt": "2026-08-28T13:58:26Z",
  "sourceContentSha256": "ef2290c000332967f5753973597b0d92485cc618e19643a60308ce2606b606de",
  "sourceProposition": "Haber and Stornetta link each signed time-stamp certificate to information from earlier certificates with a collision-resistant hash, making retrospective insertion require a hash collision and permitting forward or backward chain verification.",
  "sourcePropositionSha256": "250b2d5c2a7d424744716348c13fb6db67dc87182c64200ea13b81e07143441d",
  "normalizedWorkId": "doi:10.1007/bf00196791",
  "sourceVersion": "published",
  "exactEvidenceQuote": "An especially suspicious challenger now can call up the next client and verify the next time-stamp in the sequence; this can continue for as long as the challenger wishes. Similarly, the challenger can also follow the chain of time-stamps backward. Furthermore, correctly embedding a new document into the already-existing stream of time-stamp certificates requires the computation of a collision for the hash function H.",
  "exactEvidenceQuoteSha256": "436098ac08ec53fdd307fef510208e258645c8000004de1e77328cb6966240b5",
  "claimMappings": [
   {
    "claimId": "kaal:claim:7314479-040",
    "confidence": null,
    "method": "independent one-to-one review",
    "whyRelevant": "Haber and Stornetta directly support hash-linked sequence integrity and collision-bounded retrospective insertion. They do not establish Kaal's persisted per-tool head, modification/deletion/reordering cases, determinable break point, or one-hash append cost.",
    "ambiguous": false
   }
  ]
 },
 "userAffirmation": "Standing scholarly-growth preauthorization bound to 43b5726c8369904d8596ab3b06b7be37290a6b29fc158dcbb757e38b98e8e5ec; publication remains conditional on successful projection, deployment, and live-byte verification.",
 "publicIdentitySha256": "131bcbd129478f1058b600d1173b644d8616abb4d0ec4e4782a83b5fe549ded9",
 "sha256": "81308bae2a4133ddcfb7e3d7db5058f1f3086cca9867f5464a397ff7d286cdfc"
}