Applies Plonky2 (PLONK + FRI) to produce ZK proofs for SHA-256 integrity on random and NEAR blockchain data, reporting manageable proof sizes and runtimes.
The methodology exhibits consistent performance for both random data and real data blocks from the NEAR blockchain, highlighting its potential for practical applications
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.