kaal:claim:6192998-035

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.

Source quote, verbatim

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, p. 51
https://ssrn.com/abstract=6192998 · source PDF

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

Holds when

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

Classification

empiricalsupport: arguedinstitutional-design

Verify

The quote above is an exact substring of the source PDF, whose sha256 is b04292561ee041e0c9eaa7eca28a410ed440e76a95743a539361a3f76c97f2b3. Extraction method: pdf-text-layer.
Attestation record: colloquium/attestations/326d680b499a297c...json
Verify the binding yourself: curl -s https://wulfkaal.github.io/claims/6192998-035.md | sha256sum