Succinct State Proofs Decouple Verification from State Bloat
A novel polynomial commitment scheme enables constant-size cryptographic proofs of the entire blockchain state, resolving the critical state synchronization bottleneck and preserving decentralization.
Dynamic Vector Commitments Enable Sublinear State Updates and Stateless Clients
A new algebraic commitment primitive achieves sublinear state updates, fundamentally solving the efficiency bottleneck for large-scale stateless blockchain architecture.
Automated Formal Analysis Secures DeFi Oracle Input Vulnerabilities
OVer, a formal verification framework, uses SMT solvers to automatically identify and guard against oracle manipulation, securing DeFi protocols against skewed data.
Moonwell Lending Protocol Drained via External Oracle Price Manipulation Flaw
Flawed oracle integration permitted a collateral token's price to be grossly inflated, enabling an under-collateralized asset drain.
WisdomTree Publishes Tokenized Private Credit Fund Net Asset Value on Ethereum
Integrating Chainlink DataLink for on-chain NAV ensures cryptographically-verifiable fund data, unlocking new institutional liquidity pathways in DeFi.
ZKPoT Consensus Secures Decentralized Learning against Privacy and Centralization
A Zero-Knowledge Proof of Training consensus mechanism leverages zk-SNARKs to validate machine learning model performance privately, securing decentralized AI.
Certificateless Proxy Re-Encryption Enables Private Decentralized Data Access Control
Certificateless Proxy Re-Encryption (CL-PRE) securely delegates data access on-chain by eliminating PKI overhead and private key exposure, enabling privacy-preserving data markets.
Polynomial Commitments Secure Erasure Codes for Scalable Data Availability Sampling
Cryptographically-secured erasure codes enable light clients to verify data availability by sampling, resolving the scalability bottleneck for modular architectures.
Plonky2-FRI Enables Scalable Zero-Knowledge Proof for Cryptographic Hashing Verification
This research integrates Plonky2 with FRI to generate succinct proofs for SHA-256 integrity, fundamentally decoupling computational work from verification cost.
