-
Notifications
You must be signed in to change notification settings - Fork 85
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
13 changed files
with
92 additions
and
12 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -380,6 +380,7 @@ <h2 id="libraries"><a class="header" href="#libraries">Libraries</a></h2> | |
| <li><a href="https://github.com/zkcrypto/bellman">Bellman (not updated)</a></li> | ||
| <li><a href="https://github.com/scipr-lab/libsnark">libsnark in C++</a></li> | ||
| <li><a href="https://github.com/o1-labs/snarky">Snarky frontend</a></li> | ||
| <li><a href="https://github.com/mratsim/constantine">Constantine</a></li> | ||
| <li><a href="https://github.com/starkware-libs/cairo">Cairo</a> | ||
| <ul> | ||
| <li><a href="https://cairo-book.github.io">Cairo resource</a></li> | ||
|
|
@@ -514,6 +515,14 @@ <h2 id="advanced"><a class="header" href="#advanced">Advanced</a></h2> | |
| <h1 id="ingonyama-blogs"><a class="header" href="#ingonyama-blogs">Ingonyama Blogs</a></h1> | ||
| <p>Check out blogs, papers, pieces, and videos published by the Ingonyama Team</p> | ||
| <hr /> | ||
| <h3 id="sumcheck-201"><a class="header" href="#sumcheck-201"><strong>Sumcheck 201</strong></a></h3> | ||
| <ul> | ||
| <li><a href="https://medium.com/@ingonyama/sumcheck-201-12e4f42eb669">Medium Link</a></li> | ||
| </ul> | ||
| <h3 id="application-of-graph-methods-for-efficient-quotient-polynomial-evaluation-in-halo2"><a class="header" href="#application-of-graph-methods-for-efficient-quotient-polynomial-evaluation-in-halo2"><strong>Application of Graph Methods for Efficient Quotient Polynomial Evaluation in Halo2</strong></a></h3> | ||
| <ul> | ||
| <li><a href="https://medium.com/@ingonyama/application-of-graph-methods-for-efficient-quotient-polynomial-evaluation-in-halo2-b5da62633efc">Medium Link</a></li> | ||
| </ul> | ||
| <h3 id="fast-danksharding-video--slides"><a class="header" href="#fast-danksharding-video--slides"><strong>Fast Danksharding Video & Slides</strong></a></h3> | ||
| <ul> | ||
| <li><a href="https://medium.com/@ingonyama/fast-danksharding-video-slides-80be7a0a5f21">Medium Link</a></li> | ||
|
|
@@ -762,6 +771,10 @@ <h2 id="stark-tutorials"><a class="header" href="#stark-tutorials">Stark tutoria | |
| </ul> | ||
| </li> | ||
| </ul> | ||
| <h2 id="stark-security"><a class="header" href="#stark-security">Stark security</a></h2> | ||
| <ul> | ||
| <li><a href="https://ethresear.ch/t/stark-round-by-round-soundness-and-security-in-random-oracle-model/18096">STARK round by round soundness and security - Ben Sasson</a></li> | ||
| </ul> | ||
| <link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/[email protected]/dist/katex.min.css" integrity="sha384-AfEj0r4/OFrOo5t7NnNe46zW/tFgW6x/bCJG8FqQCEo3+Aro6EYUG4+cU+KJWu/X" crossorigin="anonymous"> | ||
| <h1 id="applications-1"><a class="header" href="#applications-1">Applications</a></h1> | ||
| <p>A compilation of materials that showcase various applications of zk technology.</p> | ||
|
|
@@ -871,6 +884,7 @@ <h2 id="zkml"><a class="header" href="#zkml">ZKML</a></h2> | |
| <li><a href="https://medium.com/@danieldkang/verified-execution-of-gpt-bert-clip-and-more-6acb693fd55f">Verified execution of GPT,BERT,CLIP</a></li> | ||
| <li><a href="https://medium.com/@vid.kersic/demystifying-zkml-0f3dff7194b9">Overview of ZKML</a></li> | ||
| <li><a href="https://world.mirror.xyz/r09swfSb2r11uagYk34srjMH09VBGFl29Pa8k4qw3VA">autonomous worlds</a></li> | ||
| <li><a href="https://blog.ezkl.xyz/post/benchmarks/">Benchmarking ZKML frameworks</a></li> | ||
| </ul> | ||
| <h2 id="zk-gaming"><a class="header" href="#zk-gaming">ZK Gaming</a></h2> | ||
| <ul> | ||
|
|
@@ -1060,6 +1074,10 @@ <h2 id="rust-learning-resources-for-zkcryptography"><a class="header" href="#rus | |
| <li><a href="https://datawithrust.com">Data engg with rust</a></li> | ||
| <li><a href="https://www.zksecurity.xyz/blog/posts/circomscribe/">Circomscribe - learn circom</a></li> | ||
| </ul> | ||
| <h2 id="gpu--cuda-learning-resources"><a class="header" href="#gpu--cuda-learning-resources">GPU- CUDA learning resources</a></h2> | ||
| <ul> | ||
| <li><a href="https://github.com/srush/GPU-Puzzles">GPU-Puzzles</a></li> | ||
| </ul> | ||
| <h2 id="benchmarking-tools"><a class="header" href="#benchmarking-tools">Benchmarking tools</a></h2> | ||
| <ul> | ||
| <li><a href="https://github.com/delendum-xyz/zk-benchmarking">code</a></li> | ||
|
|
@@ -1157,7 +1175,7 @@ <h1 id="lookup-protocols-1"><a class="header" href="#lookup-protocols-1">Lookup | |
| <tr><td style="text-align: center">Baloo - 2022</td><td><a href="https://eprint.iacr.org/2022/1565"> →📝 </a></td><td style="text-align: center"></td><td style="text-align: center"></td><td style="text-align: center"></td><td style="text-align: center"></td></tr> | ||
| <tr><td style="text-align: center">CQ - 2022</td><td><a href="https://eprint.iacr.org/2022/1763"> →📝 </a></td><td style="text-align: center"><a href="https://github.com/geometryresearch/cq">Geometry</a></td><td style="text-align: center"></td><td style="text-align: center"></td><td style="text-align: center"></td></tr> | ||
| <tr><td style="text-align: center">CqLin - 2023</td><td><a href="https://eprint.iacr.org/2023/393"> →📝 </a></td><td style="text-align: center"></td><td style="text-align: center"></td><td style="text-align: center"></td><td style="text-align: center"></td></tr> | ||
| <tr><td style="text-align: center">Lasso - 2023</td><td><a href="https://eprint.kobi.one/2023/1216"> →📝 </a></td><td style="text-align: center"></td><td style="text-align: center">Introducing Lasso and Jolt<a href="https://a16zcrypto.com/posts/article/introducing-lasso-and-jolt/">[1]</a></li><li>Boosting LassoJolt <a href="https://a16zcrypto.com/posts/article/boosting-lassojolt">[2]</a> </li><li>A Technical FAQ on LassoJolt <a href="https://a16zcrypto.com/posts/article/a-technical-faq-on-lasso-jolt-and-recent-advancements-in-snark-design">[3]</a></td><td style="text-align: center"></td><td style="text-align: center"></td></tr> | ||
| <tr><td style="text-align: center">Lasso - 2023</td><td><a href="https://eprint.kobi.one/2023/1216"> →📝 </a></td><td style="text-align: center"></td><td style="text-align: center">Introducing Lasso and Jolt<a href="https://a16zcrypto.com/posts/article/introducing-lasso-and-jolt/">[1]</a></li><li>Boosting LassoJolt <a href="https://a16zcrypto.com/posts/article/boosting-lassojolt">[2]</a> </li><li>A Technical FAQ on LassoJolt <a href="https://a16zcrypto.com/posts/article/a-technical-faq-on-lasso-jolt-and-recent-advancements-in-snark-design">[3]</a> </li><li>Efficient multilinear PCS in Lasso and Jolt <a href="https://www.hungrycats.studio/posts/lookups-ml-pcs/">[4]</a></td><td style="text-align: center"></td><td style="text-align: center"></td></tr> | ||
| </tbody></table> | ||
| </div><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/[email protected]/dist/katex.min.css" integrity="sha384-AfEj0r4/OFrOo5t7NnNe46zW/tFgW6x/bCJG8FqQCEo3+Aro6EYUG4+cU+KJWu/X" crossorigin="anonymous"> | ||
| <h1 id="folding-scheme-protocols-1"><a class="header" href="#folding-scheme-protocols-1">Folding Scheme Protocols</a></h1> | ||
|
|
@@ -1309,9 +1327,6 @@ <h1 id="hash-functions"><a class="header" href="#hash-functions">Hash functions< | |
| <ul> | ||
| <li><a href="https://decentralizedthoughts.github.io/2020-12-22-what-is-a-merkle-tree/">What is a merkle tree</a></li> | ||
| <li><a href="https://www.rfc-editor.org/rfc/rfc6962#section-2.1">Merkle trees</a></li> | ||
| <li><a href="https://docs.iden3.io/publications/pdfs/Merkle-Tree.pdf">Sparse Merkle trees</a></li> | ||
| <li><a href="https://courses.cs.ut.ee/MTAT.07.003/2019_fall/uploads/Main/0701-merkle-trees.pdf">Merkle Commitment scheme</a></li> | ||
| <li><a href="https://www.derpturkey.com/merkle-tree-construction-and-proof-of-inclusion/">Merkle trees and proof of inclusion</a></li> | ||
| <li><a href="https://alinush.github.io/2023/02/05/Why-you-should-probably-never-sort-your-Merkle-trees-leaves.html">why you should not sort your Merkle Leaves</a></li> | ||
| </ul> | ||
| </li> | ||
|
|
@@ -1476,6 +1491,7 @@ <h1 id="commitment-schemes"><a class="header" href="#commitment-schemes">Commitm | |
| <li><a href="https://youtu.be/bz16BURH_u8">Overview of commitment schemes: Justin Drakes</a></li> | ||
| <li><a href="https://hackernoon.com/kzg10-ipa-fri-and-darks-analysis-of-polynomial-commitment-schemes">Comparison of Commitment Schemes</a></li> | ||
| <li><a href="https://research.polytope.technology/polynomial-commitments">review of polynomial commmitments</a></li> | ||
| <li><a href="https://www.hungrycats.studio/posts/benching-pcs/">Benchmarking multilinear PCS</a></li> | ||
| </ul> | ||
| </li> | ||
| <li><strong>KZG</strong> | ||
|
|
@@ -1498,6 +1514,14 @@ <h1 id="commitment-schemes"><a class="header" href="#commitment-schemes">Commitm | |
| <li><a href="https://scroll.io/blog/kzg#heading-0">KZG in practice: Scroll</a></li> | ||
| </ul> | ||
| </li> | ||
| <li><strong>Merkle commitment</strong> | ||
| <ul> | ||
| <li><a href="https://docs.iden3.io/publications/pdfs/Merkle-Tree.pdf">Sparse Merkle trees</a></li> | ||
| <li><a href="https://courses.cs.ut.ee/MTAT.07.003/2019_fall/uploads/Main/0701-merkle-trees.pdf">Merkle Commitment scheme</a></li> | ||
| <li><a href="https://hackmd.io/@0xKanekiKen/H1ww-qWKa">Field Merkle Tree</a></li> | ||
| <li><a href="https://www.derpturkey.com/merkle-tree-construction-and-proof-of-inclusion/">Merkle trees and proof of inclusion</a></li> | ||
| </ul> | ||
| </li> | ||
| <li><strong>Vector Commitments</strong> | ||
| <ul> | ||
| <li><a href="https://dankradfeist.de/ethereum/2021/06/18/verkle-trie-for-eth1.html">Verkle Trie - Dankrad Feist</a></li> | ||
|
|
@@ -1538,6 +1562,12 @@ <h2 id="general-4"><a class="header" href="#general-4">General</a></h2> | |
| <li><a href="https://eprint.iacr.org/2019/188.pdf">Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs</a></li> | ||
| <li><a href="https://arxiv.org/pdf/1703.06255.pdf">Prio: Private, Robust, and Scalable Computation of Aggregate Statistics</a></li> | ||
| <li><a href="https://eprint.iacr.org/2021/833">ATLAS (Goyal, CMU) Efficient and Scalable MPC in the Honest Majority Setting</a></li> | ||
| <li><a href="https://x.com/gf_256/status/1755077442060886113?t=BTQ7ZsU-IQKgt4RrXvEJLA&s=31">MPC from Scratch</a> | ||
| <ul> | ||
| <li><a href="https://www.zellic.io/blog/mpc-from-scratch/">blog</a></li> | ||
| <li><a href="https://github.com/stong/mpc-from-scratch?tab=readme-ov-file">code</a></li> | ||
| </ul> | ||
| </li> | ||
| </ul> | ||
| <link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/[email protected]/dist/katex.min.css" integrity="sha384-AfEj0r4/OFrOo5t7NnNe46zW/tFgW6x/bCJG8FqQCEo3+Aro6EYUG4+cU+KJWu/X" crossorigin="anonymous"> | ||
| <h1 id="proving-methods"><a class="header" href="#proving-methods">Proving Methods</a></h1> | ||
|
|
@@ -1552,6 +1582,7 @@ <h2 id="sumcheck-protocol"><a class="header" href="#sumcheck-protocol">Sumcheck | |
| </ul> | ||
| </li> | ||
| <li><a href="https://cryptologie.net/article/577/the-intuition-behind-the-sum-check-protocol-in-5-minutes/">Inuition behind sumcheck - Wong</a></li> | ||
| <li><a href="https://eprint.iacr.org/2017/305.pdf">A zeroknowledge sumcheck and applications</a></li> | ||
| <li><a href="https://eprint.iacr.org/2021/333.pdf">Sumcheck argument and applications</a> | ||
| <ul> | ||
| <li><a href="https://www.youtube.com/embed/TmSOC8FN2GE">The amazing sumcheck protocol - Bootle</a></li> | ||
|
|
@@ -1565,7 +1596,16 @@ <h2 id="sumcheck-protocol"><a class="header" href="#sumcheck-protocol">Sumcheck | |
| <li><a href="https://eprint.iacr.org/2017/305.pdf">A Zero Knowledge Sumcheck and its Applications</a></li> | ||
| <li><a href="https://github.com/arkworks-rs/sumcheck">Arkworks Sumcheck</a></li> | ||
| <li><a href="https://www.research-collection.ethz.ch/bitstream/handle/20.500.11850/611002/GarviaBosshard_Azucena.pdf?sequence=1&isAllowed=y">Formal Verification of the Sumcheck Protocol</a></li> | ||
| <li><a href="https://people.cs.georgetown.edu/jthaler/small-sumcheck.pdf">Sumcheck over fields of small charecteristic</a></li> | ||
| <li><a href="https://eprint.iacr.org/2023/1784">Succinct Arguments over Towers of Binary Fields</a></li> | ||
| <li><a href="https://people.cs.georgetown.edu/jthaler/small-sumcheck.pdf">Sumcheck over fields of small charecteristic</a> | ||
| <ul> | ||
| <li><a href="https://gitlab.com/UlvetannaOSS/binius?ref=blog.lambdaclass.com">Code</a></li> | ||
| <li><a href="https://www.youtube.com/watch?v=BeEuphrUipk&list=PLj80z0cJm8QHm_9BdZ1BqcGbgE-BEn-3Y">Video</a></li> | ||
| <li><a href="https://blog.lambdaclass.com/snarks-on-binary-fields-binius/">Part 1 - Lambdaclass</a></li> | ||
| <li><a href="https://blog.lambdaclass.com/binius-part-2/">Part 2 - Lambdaclass</a></li> | ||
| </ul> | ||
| </li> | ||
| <li><a href="https://www.youtube.com/watch?v=REVXWyQjmPQ">Explaining the GKR method - Gabizon</a></li> | ||
| </ul> | ||
| <h2 id="low-degree-testingfri"><a class="header" href="#low-degree-testingfri">Low degree Testing/FRI</a></h2> | ||
| <ul> | ||
|
|
||
Oops, something went wrong.