Reputation Algorithms

OpenRank enables verifiable compute for a large class of reputation algorithms, in particular those that (a) operate on a graph, (b) are iterative in nature and (c) have a tendency toward convergence. In the following sections, we give a brief overview of some of these algorithms.

We will also step into the area of even wider family of algorithms that work towards minimising the error through backpropagation, which will give a glimpse of future directions for OpenRank.