ZNARKs Enable Efficient Verifiable Computation over Integers
A new polynomial commitment with modular remainder fundamentally simplifies creating succinct arguments for real-world integer arithmetic.
Inner-Product Arguments over Integers for Succinct Zero-Knowledge Proofs
This research extends inner-product arguments to integers, enabling succinct, batchable zero-knowledge proofs for arithmetic circuits and range proofs.
OWASP Identifies Top 10 Smart Contract Vulnerabilities for 2025
The OWASP Smart Contract Top 10 for 2025 highlights persistent architectural flaws, posing systemic risk to decentralized finance protocols and user assets.