Creator

Nicola

Created

Dec 18, 2023 3:23 PM

Summary

Research

SNARKs, etc

• Testudo (paper and open source implementation of core protocol): a proof system that can make prover more efficient (5x) in parallel computation (e.g., in Filecoin execution stage) (see more)
• New techniques for lookup arguments: improvements on cq and apl https://cryptonet.org/projects/lookup-snark
• Paper: Rational proof techniques meet SNARK: how to make rational proofs practical and extractable (to appear on eprint December 2023)
• Upcoming: Folding Groth16 proofs to get a 10x cheaper prover computation

Proof of Space

• Paper: Better analysis for SDR (Leo Reyzin). It shows that the already deployed construction SDR has considerably better security than previously thought. It also introduces techniques that could be used to analyze future constructions of PoS.
• Paper: Modular constructions of PoS and new techniques for auditing stage with single challenge. It shows how to use polynomial evaluation for performing execution in PoS (trading some expansion in the replica). It gives a modular framework people can build on to write PoS papers.

Papers

• Rinocchio: SNARKs for Ring Arithmetic
• Chaya Ganesh, Anca Nitulescu, Eduardo Soria-Vazquez
• Published at Journal of Cryptology 2023
• Lookup Arguments: Extensions and Applications to Zero-Knowledge Decision Trees
• Matteo Campanelli, Antonio Faonio, Dario Fiore, Tianyu Li, and Helger Lipmaa
• Proofs of Space with Maximal Hardness
• Leo Reyzin
• Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation
• Giuseppe Ateniese, Foteini Baldimtsi, Matteo Campanelli , Danilo Francati , and Ioanna Karantaidou
• Testudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup
• Matteo Campanelli, Nicolas Gailly, Rosario Gennaro, Philipp Jovanovic, Mara Mihali, and Justin Thaler
• Accepted at Latincrypt 2023

Protocol

Securing the network

• De-risked high severity cron issues. Detected and prepared a mitigation for an explosion in cron work sufficiently in advance to ship it before disaster with FIP-0060. Developed a long-term resolution to this segment of cron risk in FIP-0074.
• Fixed long-standing Window PoST grinding vulnerability.
• Designed PoRep breakage response protocol with FIP-0047 and improved/simplified it with FIP-0067.

Improving storage utility & efficiency

• Reduced large overhead of temporary sealing data from ~400GiB to ~25GiB with FIP-0059 Synthetic PoRep.
• Designed and implemented verifiable data aggregation (PoDSI) to enable aggregator clients to verify inclusion of their data in a sector with FRC-0058.
• Designed and implemented streamlined data onboarding by avoiding redundant on-chain state and processing with FIP-0067 Direct Data Onboarding. This also introduced a new scheme for data activation notifications to support user-programmed smart contracts to function as data storage applications.
• Implemented code optimisations to reduce cost of PublishStorageDeals by 40%, ProveCommitAggregate by 25%.
• Proposed non-interactive PoRep to drastically improve onboarding pipelines and practically enable Sealing as a Service and HDD wholesale, without compromising security. We plan to ship NI-PoRep in H2 2024.

Stabilising token economy

• Conceived and designed pledge shortfall proposal to mitigate perceived pledge token shortages while also reducing circulating supply inflation and improving token burn. Ultimately decided the impact wasn’t certain enough to justify the effort and new complexity (in retrospect this seems to be the right call).
• Proposed and sketched design for sustainable network token burn via storage/data onboarding fees.
• Presented a resolution in FIP-0081 to the initial pledge baseline denominator blowup, identified by CryptoEconLab. At year end, this is stalled on CEL being uncertain about the short/long-term tradeoffs.

Intelligence