Enjoyed Vitalik’s update to Hard Problems and started thinking about reputational systems again, esp. a smart contract driven implementation of Eigenmorality
The idea was to use the link structure of the web itself to rank which web pages were most important, and therefore which ones should be returned first in a search query. Specifically, Kleinberg defined “hubs” as pages that linked to lots of “authorities,” and “authorities” as pages that were linked to by lots of “hubs.” At first glance, this definition seems hopelessly circular, but Kleinberg observed that one can break the circularity by just treating the World Wide Web as a giant directed graph, and doing some linear algebra on its adjacency matrix. Equivalently, you can imagine an iterative process where each web page starts out with the same hub/authority “starting credits,” but then in each round, the pages distribute their credits among their neighbors, so that the most popular pages get more credits, which they can then, in turn, distribute to their neighbors by linking to them.
I’m curious if anyone is familiar with this concept and thinks it could be implemented on an EVM blockchain. I assume it would need at least 10x the transaction throughput of even a PoS system but perhaps there is some way to mitigate this.