OnChainScores: Part 2

[lazovicff]

Proving that the score is >X for a specific user, by providing a merkle membership proof for that user:

• Check if membership is correct against the commitment
• Check if score is >X

Membership proof can also be submitted in a form of a ZK proof, but a research needs to be done to find which proving system is most suitable and has these characteristics:

• Cheap to verify on-chain
• Has fast implementation of Keccak256 hashing function

Until this is concluded, we can use pre-compiles of Keccak256 to verify membership proofs. The cost of verification will scale linearly with the number of levels of a Merkle Tree used.

• [x] #110
• [x] #111
• [x] #114
• [ ] #112

[lazovicff]

Prerequisite is to do research on recent proving systems, that have support for on-chain verification.