Applies Plonky2 (PLONK + FRI) to produce ZK proofs for SHA-256 integrity on random and NEAR blockchain data, reporting manageable proof sizes and runtimes.
These results confirm the efficiency and scalability of the proposed approach for generating and verifying ZKPs using the Plonky2 framework for random data of various lengths
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Scalable Zero-Knowledge Proofs for Verifying Cryptographic Hashing in Blockchain Applications
Applies Plonky2 (PLONK + FRI) to produce ZK proofs for SHA-256 integrity on random and NEAR blockchain data, reporting manageable proof sizes and runtimes.