Introduction
Last updated
Last updated
This SDK allows developers to utilize OpenRank Protocol to create their own context-specific rankings and reputation graphs on any input data set. Developers can bring their onchain or offchain data and define their own parameters for the compute. They can then run a variety of reputation algorithms to compute rankings and reputation scores.
The OpenRank SDK provides a set of ranking and reputation algorithms. v1 offers EigenTrust compute, v2 will support Hubs & Authorities, Collaborative Filtering and Matrix Factorization. These algorithms help generate ranking and reputation scores for any intended object such as users (EOAs), smart contracts, DIDs, entities. Refere to Examples for more details.
In v1, OpenRank supports , which helps compute the reputation of participants in a peer-to-peer graph. The nodes in a graph can be users, wallets, or any object that is to be ranked. The edges between nodes represent the trust heuristic from one node to another. For detailed information regarding how EigenTrust works, .
.
.