ricardojmendez/morat-reference

Avoid Blunders Designing Reputation Systems

You don’t SPEND reputation because ratings are orthogonal to exchange.

The Eigentrust algorithm for reputation management in P2P networks

As part of the Digital Library's transition to Open Access, new features for researchers are available in the Premium Edition. Click here to learn more.

Reputation and Historical Archives - Stack Overflow

If you've been around Meta Stack Overflow the past few days, you've seen a fair bit of conversation sparked by the recent changes to how reputation is calculated:

(PDF) The EigenTrust Algorithm for Reputation Management in P2P Networks

PDF | Peer-to-peer file-sharing networks are currently receiving much attention as a means of sharing and distributing information. However, as recent... | Find, read and cite all the research you need on ResearchGate

(PDF) HonestPeer: An Enhanced EigenTrust Algorithm for Reputation Management in P2P Systems

PDF | The visible success of the Peer to Peer (P2P) paradigm is associated with many challenges in finding trustworthy peers as reliable communication... | Find, read and cite all the research you need on ResearchGate

MeritRank: Sybil Tolerant Reputation for Merit-based Tokenomics*

Decentralized reputation systems are emerging as promising mechanisms to enhance the effectiveness of token-based economies. Unlike traditional monetary incentives, these systems reward participants based on the actual value of their contributions to the network. However, the advantages and challenges associated with such systems remain largely unexplored. In this work, we investigate the inherent trade-offs in designing a decentralized reputation system that is simultaneously generalizable, trustless, and Sybil-resistant. Specifically, “generalizable” means that the system can assess various types of contributions across different contexts, “trustless” indicates that it functions without the need for a central authority to oversee reputations, and “Sybil-resistant” refers to its ability to withstand manipulations by fake identities, i.e., Sybil attacks.

Web reputation system · Issue #371 · muni-town/roomy

Related to: #67 ‘Trust Levels’ in Discourse are an implicit reputation system. That is, participants in a Discourse community aren’t really aware of any ‘reputation score’ and only vaguely aware th...

Ranking Strategies on Farcaster | OpenRank

Profile reputation scoring to address trustworthiness in social networks

Reputation System Beta: Reputation Standing & Fair Play Program Beta

Information on the Reputation System Beta rollout and Ubisoft Fair Play Program Beta.

mitchellh/vouch

A community trust management system based on explicit vouches to participate.

EigenTrust

The EigenTrust algorithm is a reputation management algorithm for peer-to-peer networks, developed by Sep Kamvar, Mario Schlosser, and Hector Garcia-Molina.[1] The algorithm provides each peer in the network a unique global trust value based on the peer's history of uploads and thus aims to reduce the number of inauthentic files in a P2P network. It has been cited by approximately 5800 other articles according to Google Scholar.[2]

Trust Infrastructure on ATproto

I agree with Nick that you have noted a big hard problem, with Zooko’s triangle type trade-offs. (For a semi-related example that is “easier” but still crazy difficult, see our “PeerFlow: Secure Load Balancing in Tor” https://doi.org/10.1515/popets-2017-0017 ) As noted or implied already in this thread: in the end, if someone can cheaply spin up indefinite unlinked identities and build good reputations for them, and if trust is based on such reputations, it is hard (impossible?) to avoid them s...

How does the Reputation Economy work?

And why should we build it?

Introducing attested.network: Proof of Payment for ATProtocol - Nick's Blog

attested.network is an open spec for decentralized proof of payments on ATProtocol, built on what we learned making atprotofans.com. It formalizes the three-party attestation model and opens it up for any app to implement.

Building Unforgeable Professional Endorsements with ATProtocol - Nick's Blog

Traditional professional endorsements on platforms like LinkedIn lack cryptographic proof—anyone could forge them, and the platform controls the truth. This article introduces a two-record architecture using ATProtocol's Content Identifiers (CIDs) and Decentralized Identifiers (DIDs) to create mathematically unforgeable mutual attestations. By separating proof creation from endorsement acceptance and leveraging the firehose for distributed validation, we build a system where both parties cryptographically consent and no central authority can manipulate the record.