{
 "@context": "https://schema.org",
 "@type": "Claim",
 "@id": "https://wulfkaal.github.io/positions/2026-08-08-286",
 "identifier": "kaal:position:2026-08-08-286",
 "additionalType": "https://wulfkaal.github.io/positions/schema.json#AffirmedPositionClaim",
 "name": "Scholarly Growth Truebit Computation Adjudication Qualification",
 "text": "Teutsch and Reitwießner independently instantiate the core adjudicative function in a narrower blockchain-computation setting. TrueBit invokes a verification game when a challenger disputes a solver's answer to a computational task; the parties iteratively narrow the contested execution step, and bounded judges rule whether the challenge is justified. The procedure is task-bound and ends in a consequence-bearing determination, making it functionally analogous to a temporary adjudicative institution for machine work. This is a qualification rather than equivalence: TrueBit uses an incentive-driven solver-challenger game and the Ethereum miner community as judges, not Kaal's purpose-convened validation pool or broader agent-governance substrate.",
 "author": {
  "@type": "Person",
  "name": "Wulf A. Kaal",
  "identifier": "https://orcid.org/0009-0008-7840-1847"
 },
 "datePublished": "2026-08-08",
 "dateModified": "2026-08-08",
 "creativeWorkStatus": "Affirmed",
 "responseType": "qualification",
 "keywords": [
  "institutional-design",
  "ai-and-agents",
  "consensus-and-security",
  "scholarly-growth-coverage",
  "scholarly-literature",
  "verifiable-computation",
  "dispute-resolution",
  "task-bound-adjudication"
 ],
 "scope_conditions": [
  "The response is limited to the four page-bound passages and the one mapped Kaal claim.",
  "External evidence level: published World Scientific book chapter with a public 50-page arXiv v1 full text and independent Crossref, OpenAlex, DataCite, and arXiv identity checks.",
  "Mapping review tier: independent substantive scholarly-growth qualification.",
  "TrueBit calls the mechanism a verification game, not a validation pool or institution.",
  "Its judges are the Ethereum miner community and its solver and challenger roles are filled through an incentive layer, rather than Kaal's purpose-convened validator pool.",
  "The source addresses correctness disputes over outsourced deterministic computation, not the full range of agent outputs, institutional attestations, or governance decisions in Kaal's architecture.",
  "The relationship supports only the functional analogy that a task-bound protocol can convene roles and rules to adjudicate machine work."
 ],
 "currentDebate": {
  "name": "A Scalable Verification Solution for Blockchains",
  "url": "https://doi.org/10.1142/9789811278631_0015"
 },
 "extends": {
  "identifier": "kaal:claim:7260278-028",
  "url": "https://wulfkaal.github.io/claims/7260278-028",
  "citation": "Wulf A. Kaal, Paper 2 - Architecture of the Agentic Reputation Substrate (2026). SSRN: https://ssrn.com/abstract=7260278",
  "paper": "Wulf A. Kaal, Paper 2 - Architecture of the Agentic Reputation Substrate",
  "authors": [
   "Wulf A. Kaal"
  ],
  "year": "2026",
  "ssrn": "https://ssrn.com/abstract=7260278",
  "source_pdf_sha256": "d48801f279dba594e1f3e65d74d31f862261ada6428ea119f948e8d7cfee1db0"
 },
 "isBasedOn": [
  {
   "@id": "https://wulfkaal.github.io/claims/7260278-028"
  },
  {
   "@type": "CreativeWork",
   "name": "A Scalable Verification Solution for Blockchains",
   "url": "https://doi.org/10.1142/9789811278631_0015"
  }
 ],
 "batch_id": "kaal-review:2026-08-11:scholarly-growth-7260278-028-reviewed-v1",
 "review_provenance": "https://wulfkaal.github.io/positions/by-claim/7260278-028.html",
 "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-08-286",
 "canonicalForm": "https://wulfkaal.github.io/positions/2026-08-08-286.md",
 "candidateId": "kaal:response-candidate:2026-08-11:scholarly-growth-7260278-028-truebit-adjudication-01",
 "evidenceLevel": "published World Scientific book chapter with a public 50-page arXiv v1 full text and independent Crossref, OpenAlex, DataCite, and arXiv identity checks",
 "reviewTier": "independent substantive scholarly-growth qualification",
 "mappingConfidence": 0.98,
 "mappingAmbiguous": false,
 "mappingMethod": "independent substantive scholarly-growth one-to-one review",
 "mappingWhyRelevant": "Both propositions concern a bounded protocol assembled around a particular machine-work output to hear a challenge, determine correctness, and issue a consequence-bearing ruling.",
 "sourceProvenance": {
  "source": "World Scientific chapter and public arXiv v1 full text",
  "sourceRecordId": "10.1142/9789811278631_0015",
  "doi": "10.1142/9789811278631_0015",
  "arxiv": "1908.04756",
  "canonicalUrl": "https://doi.org/10.1142/9789811278631_0015",
  "pdfUrl": "https://arxiv.org/pdf/1908.04756",
  "retrievedAt": "2026-08-12T00:34:43.981Z",
  "sourcePdfSha256": "746d66b0e4913a97a5a4e1c6d90000a7122ab92504fd2a1f04c4e8f6ed854028",
  "extractedTextSha256": "ce6ccaa4a06fcd6aa1ad7e30ea5439fa4b21f195256af81dc501e9d5a97c5303",
  "textExtraction": {
   "tool": "pdftotext -raw",
   "quality": "clean machine-readable 50-page arXiv v1; four exact passages verified on PDF pages 12, 14, and 15"
  },
  "crossrefResponseBodySha256": "d7af118d253bb46b52d6dc7315fdab59acf3d22c163f53436a5662e13f98df4c",
  "openAlexResponseBodySha256": "ae54d390fbf34b485dc55de8bfdd4a8758934dbc5011d2c08e10cd7a0b332d0e",
  "arxivResponseBodySha256": "029d88acc8051c7c607a1cb88d9361fd70ecf7e355739ae23f5fb3f1e382b016",
  "sourceProposition": "Teutsch and Reitwießner instantiate a verification game for each disputed computational task: a solver and challenger narrow the contested execution, bounded judges rule on correctness, and the game ends by resolving the challenge.",
  "sourcePropositionSha256": "3e1807b9c330846f6d44b7fb0e14b6259eabe415e1be1205a38d074eb8ea2be3",
  "sourceEvidenceSetSha256": "e9e7606e29b5726144fbc020d5577c533573834a6862546e0298b5db6084d9fa",
  "sourceEvidencePassages": [
   {
    "text": "The goal of TrueBit’s interactive verification game is to resolve a given dispute between a Solver, who has provided a solution to some computational task, and a Challenger, who disagrees with the solution and therefore calls the verification game to be played.",
    "locator": {
     "version": "arXiv:1908.04756v1",
     "pdfPage": 12,
     "section": "3.2 Solution: The verification game"
    },
    "sha256": "5daddbb061bf2816180f52f136a521217c3776c330a26e1c1429f60f95355deb"
   },
   {
    "text": "The verification game consists of three parties: a Solver who has allegedly performed some computational task and claims some solution, a Challenger who disputes the correctness of the Solver’s solution, and Judges with bounded computational power, who will rule on whether the output is correct.",
    "locator": {
     "version": "arXiv:1908.04756v1",
     "pdfPage": 14,
     "section": "3.3 Detailed protocol"
    },
    "sha256": "d1224ec80a881460028c2590f67603f321076b2693a381e62f731566037829f2"
   },
   {
    "text": "After logt/logc rounds, the loop above converges to the first, disputed computational step, and the Judges explicitly check this step of the computation",
    "locator": {
     "version": "arXiv:1908.04756v1",
     "pdfPage": 15,
     "section": "3.3 Detailed protocol, Final stage"
    },
    "sha256": "88208f55fafa626d0701557f7ab2f6cf41fbf45a16aae65c97d590ae83c46561"
   },
   {
    "text": "the Judges check the computational step at time e and rule whether the challenge was justified.",
    "locator": {
     "version": "arXiv:1908.04756v1",
     "pdfPage": 15,
     "section": "3.3 Detailed protocol, Final stage"
    },
    "sha256": "c763e1a8d788355158479527a390205442a291019d698bbe3331bb8acf371f95"
   }
  ],
  "workId": "work:doi:10.1142/9789811278631_0015",
  "workAuthors": [
   "Jason Teutsch",
   "Christian Reitwießner"
  ],
  "workPublishedAt": "2023-11-06",
  "identityKeys": [
   "doi:10.1142/9789811278631_0015",
   "arxiv:1908.04756",
   "openalex:W2967439377",
   "pdf:746d66b0e4913a97a5a4e1c6d90000a7122ab92504fd2a1f04c4e8f6ed854028",
   "proposition:3e1807b9c330846f6d44b7fb0e14b6259eabe415e1be1205a38d074eb8ea2be3"
  ],
  "claimMappings": [
   {
    "claimId": "kaal:claim:7260278-028",
    "claimUrl": "https://wulfkaal.github.io/claims/7260278-028",
    "rank": 1,
    "confidence": 0.98,
    "method": "independent substantive scholarly-growth one-to-one review",
    "whyRelevant": "Both propositions concern a bounded protocol assembled around a particular machine-work output to hear a challenge, determine correctness, and issue a consequence-bearing ruling.",
    "ambiguous": false
   }
  ],
  "substantiveReview": {
   "reviewedAt": "2026-08-12T00:34:43.981Z",
   "sourceIdentityVerified": true,
   "authorIndependenceVerified": true,
   "canonicalPublicStatusVerified": true,
   "retractionOrSupersessionFound": false,
   "propositionFidelityVerified": true,
   "mechanismCorrespondence": "task-specific solver-challenger dispute, bounded adjudicator, iterative localization of the disputed computation, and final correctness ruling",
   "compatibleScope": "outsourced deterministic blockchain computation used only to qualify Kaal's broader definitional claim",
   "responseWordingDefensible": true,
   "oneToOneExtendsMapping": true,
   "sameSourceDistinctionVerified": true,
   "limitations": [
    "TrueBit calls the mechanism a verification game, not a validation pool or institution.",
    "Its judges are the Ethereum miner community and its solver and challenger roles are filled through an incentive layer, rather than Kaal's purpose-convened validator pool.",
    "The source addresses correctness disputes over outsourced deterministic computation, not the full range of agent outputs, institutional attestations, or governance decisions in Kaal's architecture.",
    "The relationship supports only the functional analogy that a task-bound protocol can convene roles and rules to adjudicate machine work."
   ]
  }
 },
 "userAffirmation": "Automatically authorized under standing authority receipt kaal-standing-publication-authorization:2026-08-01:hourly-reviewed-batches, SHA-256 e2126054b58bb4e88db65c334ef4fc8ae78dcaadc63543c408133c4eefceb9b1, limited to this substantively reviewed scholarly-growth qualification and the unchanged 5,145 scholarly claims under the current owner instruction.",
 "sha256": "12629e399d1878812c927857efa2dd4a9cb939aee5546dd74afb6b4887d8800b"
}