Zero-knowledge proofs start with some solution to a problem that can be verified in polynomial time. The prover then generates curve points with a specific relationship. Generating those values without knowing the problem solution is not feasible. The verifier checks the relationship between the curve points.
For the specific case of a validium, what is the ‘solution’ here? Is it the list of leaf merkle hashes for a specific root? Is it the transactions? Is the validity of the transaction signatures a constraint of the solution?
[link] [comments]
You can get bonuses upto $100 FREE BONUS when you:
💰 Install these recommended apps:
💲 SocialGood - 100% Crypto Back on Everyday Shopping
💲 xPortal - The DeFi For The Next Billion
💲 CryptoTab Browser - Lightweight, fast, and ready to mine!
💰 Register on these recommended exchanges:
🟡 Binance🟡 Bitfinex🟡 Bitmart🟡 Bittrex🟡 Bitget
🟡 CoinEx🟡 Crypto.com🟡 Gate.io🟡 Huobi🟡 Kucoin.
Comments