> - A node (called an Asserter) computes a function and submits a cryptographic commitment to an orchestrator.
> - The Orchestrator, a trustless random beacon, then decides whether to accept the Asserter’s claim or initiate a challenge by randomly selecting validators to independently compute and submit their own commitments.
> - If all commitments match, the result is accepted; otherwise, an arbitration process is initiated to identify and penalize dishonest nodes.
> … as long as the probability of challenge is higher than a certain threshold based on the parameters of the setup, this PoSP achieves what is known in game theory as a pure strategy Nash Equilibrium. It’s a state where all participants in the network are incentivized to act honestly …
1 comment
[ 3.1 ms ] story [ 8.4 ms ] thread> - A node (called an Asserter) computes a function and submits a cryptographic commitment to an orchestrator.
> - The Orchestrator, a trustless random beacon, then decides whether to accept the Asserter’s claim or initiate a challenge by randomly selecting validators to independently compute and submit their own commitments.
> - If all commitments match, the result is accepted; otherwise, an arbitration process is initiated to identify and penalize dishonest nodes.
> … as long as the probability of challenge is higher than a certain threshold based on the parameters of the setup, this PoSP achieves what is known in game theory as a pure strategy Nash Equilibrium. It’s a state where all participants in the network are incentivized to act honestly …