# kaal:claim:6192998-035

**Claim.** Fully on chain computation of citation weighted PageRank allocation is economically feasible at realistic competition sizes, and is far more tractable in gas terms than the validation pool mechanism of the 2018 framework.

**Type.** empirical  **Support.** argued

**Holds when.**

- small competition sizes
- sparse citation matrices with roughly two to four citations per agent

**Source quote.**

> Conclusion: Fully on-chain computation is economically feasible for —far more tractable than the gas costs for the validation pool mechanism in Calcaterra, Kaal, and Andrei (2018).

**From.** Wulf A. Kaal, *Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution* (2026), V.B. Computational Complexity, page 51

**Cite as.** Wulf A. Kaal, Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution (2026). SSRN: https://ssrn.com/abstract=6192998

**Verify.** sha256 of source PDF `b04292561ee041e0c9eaa7eca28a410ed440e76a95743a539361a3f76c97f2b3` at https://raw.githubusercontent.com/wulfkaal/Academic-Papers/main/papers/pdf/Kaal%20-%202026%20-%20Evolution%20of%20Domain-Specific%20Reputation%20Systems%20From%20Binary%20Validation%20to%20Citation-Weighted%20Knowledge%20Attribution.pdf

**Topics.** institutional-design

**Keywords.** computational-complexity, on-chain-computation, gas-costs, sparse-matrices, pagerank

**Canonical form.** This markdown file is the canonical hashed representation of the claim. Its sha256 is the content hash used for attestation.