deploy: d2dc155

applicationszk.html

@@ -309,6 +309,7 @@ <h2 id="zkml"><a class="header" href="#zkml">ZKML</a></h2>
 <li><a href="https://arxiv.org/abs/2402.02675">Verifiable evaluations of ML models using ZKSnarks</a></li>
 <li><a href="https://medium.com/dragonfly-research/dont-trust-verify-an-overview-of-decentralized-inference-c471a9f7a586">An overview of Decentralized inference</a></li>
 <li><a href="https://hackmd.io/@Guy1m0/B1G8YyE3a">Analysis of leading ZKML frameworks on neural networks</a></li>
+<li><a href="https://np.engineering/posts/zkml-tradeoffs/">zkML tradeoffs in accuracy vs proving cost</a></li>
 </ul>
 <h2 id="zk-gaming"><a class="header" href="#zk-gaming">ZK Gaming</a></h2>
 <ul>

elliptic.html

@@ -217,9 +217,12 @@ <h2 id="general"><a class="header" href="#general">General</a></h2>
 <li><a href="https://solvable.group/posts/riemann-roch-crypto/">Applications of Riemann Roch theorem in cryptography - Borgeaud</a></li>
 <li><a href="https://www.lix.polytechnique.fr/Labo/Antonin.LEROUX/manuscrit_these.pdf">Quaternion algebras and Isogeny based cryptography</a></li>
 <li><a href="https://math.mit.edu/classes/18.783/2022/LectureNotes9.pdf">Notes on Discrete log</a></li>
+<li><a href="https://alinush.github.io/2024/05/31/Schnorr-signatures.html">All you need to know about Schnorr signatures - Tomescu</a></li>
 </ul>
 <h2 id="pairings"><a class="header" href="#pairings">Pairings</a></h2>
 <ul>
+<li><a href="https://hackmd.io/@brozorec/pairings-for-the-rest-of-us-1">Pairings for the rest of us Part 1 - Barakov</a></li>
+<li><a href="https://hackmd.io/@brozorec/pairings-for-the-rest-of-us-2">Pairings for the rest of us Part 2 -Barakov</a></li>
 <li><a href="https://static1.squarespace.com/static/5fdbb09f31d71c1227082339/t/5ff394720493bd28278889c6/1609798774687/PairingsForBeginners.pdf">Pairings for beginners - Craig Costello</a></li>
 <li><a href="https://medium.com/@VitalikButerin/exploring-elliptic-curve-pairings-c73c1864e627">Pairings - Vitalik Buterin</a></li>
 <li><a href="https://members.loria.fr/AGuillevic/pairing-friendly-curves/">Pairing friendly curves</a></li>

ff.html

@@ -200,6 +200,7 @@ <h2 id="modular-arithmetic"><a class="header" href="#modular-arithmetic">Modular
 <li><a href="https://jeffhurchalla.com/2022/04/28/montgomery-redc-using-the-positive-inverse-mod-r/">Montgomery REDC using positive inverse mod r</a></li>
 <li><a href="https://blog.janestreet.com/really-low-latency-multipliers-and-cryptographic-puzzles/">Low latency multipliers and cryptographic puzzles</a></li>
 <li><a href="https://research.nccgroup.com/2021/06/09/optimizing-pairing-based-cryptography-montgomery-arithmetic-in-rust/">optimizing pairing based cryptography, montgomery arithmetic in rust</a></li>
+<li><a href="https://eprint.iacr.org/2017/1057.pdf">Montgomery arithmetic from a software perspective - Bos and The Montgomery</a></li>
 </ul>
 <h2 id="related-math"><a class="header" href="#related-math">Related Math</a></h2>
 <ul>

fft.html

@@ -184,6 +184,8 @@ <h1 id="discrete-fourier-transforms"><a class="header" href="#discrete-fourier-t
 <h2 id="algorithms-and-methods"><a class="header" href="#algorithms-and-methods">Algorithms and methods</a></h2>
 <ul>
 <li><a href="https://vitalik.eth.limo/general/2019/05/12/fft.html">FFT - Vitalik</a></li>
+<li><a href="https://www.davidhbailey.com/dhbpapers/fftq.pdf">Bailey’s method</a></li>
+<li><a href="https://www.cis.rit.edu/class/simg716/FFT_Fun_Profit.pdf">FFTs for fun and profit - GentleMan Sande</a></li>
 <li><a href="https://ethresear.ch/t/reed-solomon-erasure-code-recovery-in-n-log-2-n-time-with-ffts/3039">Reed-Solomon code: Vitalik</a></li>
 <li><a href="https://www.csee.umbc.edu/~phatak/691a/fft-lnotes/fftnotes.pdf">FFT Notes</a></li>
 <li><a href="https://www.ams.org/journals/mcom/1971-25-114/S0025-5718-1971-0301966-0/S0025-5718-1971-0301966-0.pdf">The Fast Fourier Transform in a Finite Field - Pollard</a></li>
@@ -212,6 +214,18 @@ <h2 id="algorithms-and-methods"><a class="header" href="#algorithms-and-methods"
 <li><a href="https://people.maths.ox.ac.uk/trefethen/barycentric.pdf">Barycentric interpolation - Math Oxford</a></li>
 <li><a href="https://solvable.group/posts/walshhadamard-transform/">Walsh Hadamard Transform - Borgeaud</a></li>
 <li><a href="https://t.co/qXTu1Z4OzK">FFT on finite fields intro</a></li>
+<li><a href="https://rje.li/24-07-03-alg-fft.html">Algebraic FFTs - Sage</a></li>
+</ul>
+<h2 id="large-ffts"><a class="header" href="#large-ffts">Large FFTs</a></h2>
+<ul>
+<li><a href="https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=9465154">Large-Scale Discrete Fourier Transform on TPUs</a></li>
+<li><a href="https://www.eecis.udel.edu/~xli/publications/chen2013hybrid.pdf">Hybrid CPU/GPU FFTs - Chen</a>
+<ul>
+<li><a href="https://udspace.udel.edu/server/api/core/bitstreams/3d81b1ab-87da-4379-ab3b-7b3c716b7ba9/content">Thesis</a></li>
+</ul>
+</li>
+<li><a href="https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2022-0297">Large Scale 3d FFT on GPU</a></li>
+<li></li>
 </ul>
 <h2 id="implementations"><a class="header" href="#implementations">Implementations</a></h2>
 <ul>

hwzk.html

@@ -221,11 +221,15 @@ <h2 id="tee-and-confidential-computing"><a class="header" href="#tee-and-confide
 <li><a href="https://github.com/NVIDIA/nvtrust">TEE for CPU and GPU Nvidia</a></li>
 <li><a href="https://www.youtube.com/watch?v=Xq7oWtiwWII">TEE for blockchain applications</a></li>
 </ul>
-<h2 id="niche-tricks"><a class="header" href="#niche-tricks">Niche tricks</a></h2>
+<h2 id="niche-tricks-and-guides"><a class="header" href="#niche-tricks-and-guides">Niche tricks and guides</a></h2>
 <ul>
 <li><a href="https://catonmat.net/wp-content/uploads/2009/07/cacheobliviousalgorithmsanddatastructures.pdf">Cache oblivious algorithms</a></li>
 <li><a href="https://developer.nvidia.com/blog/improving-gpu-performance-by-reducing-instruction-cache-misses/">Cache skipping</a></li>
 <li><a href="http://www.ziti.uni-heidelberg.de/ziti/uploads/ce_group/seminar/2015-Guenther_Schindler.pdf">Techniques for caches in GPUs</a></li>
+<li><a href="https://medium.com/gpgpu/multi-gpu-programming-6768eeb42e2c">Multi GPU programming guide</a></li>
+<li><a href="https://siboehm.com/articles/22/CUDA-MMM">GPU matrix mul</a></li>
+<li><a href="https://medium.com/gpgpu/block-sparse-matrix-vector-multiplication-with-cuda-4e616b30267">Sparse matrix mul</a></li>
+<li><a href="http://eprints.utar.edu.my/2494/1/CS-2017-1401837-1.pdf">Large Integer arithmetic in GPU for cryptography</a></li>
 </ul>
 <h2 id="computer-architectureisas"><a class="header" href="#computer-architectureisas">Computer Architecture/ISAs</a></h2>
 <ul>

print.html

@@ -921,6 +921,7 @@ <h2 id="zkml"><a class="header" href="#zkml">ZKML</a></h2>
 <li><a href="https://arxiv.org/abs/2402.02675">Verifiable evaluations of ML models using ZKSnarks</a></li>
 <li><a href="https://medium.com/dragonfly-research/dont-trust-verify-an-overview-of-decentralized-inference-c471a9f7a586">An overview of Decentralized inference</a></li>
 <li><a href="https://hackmd.io/@Guy1m0/B1G8YyE3a">Analysis of leading ZKML frameworks on neural networks</a></li>
+<li><a href="https://np.engineering/posts/zkml-tradeoffs/">zkML tradeoffs in accuracy vs proving cost</a></li>
 </ul>
 <h2 id="zk-gaming"><a class="header" href="#zk-gaming">ZK Gaming</a></h2>
 <ul>
@@ -1281,6 +1282,7 @@ <h2 id="modular-arithmetic"><a class="header" href="#modular-arithmetic">Modular
 <li><a href="https://jeffhurchalla.com/2022/04/28/montgomery-redc-using-the-positive-inverse-mod-r/">Montgomery REDC using positive inverse mod r</a></li>
 <li><a href="https://blog.janestreet.com/really-low-latency-multipliers-and-cryptographic-puzzles/">Low latency multipliers and cryptographic puzzles</a></li>
 <li><a href="https://research.nccgroup.com/2021/06/09/optimizing-pairing-based-cryptography-montgomery-arithmetic-in-rust/">optimizing pairing based cryptography, montgomery arithmetic in rust</a></li>
+<li><a href="https://eprint.iacr.org/2017/1057.pdf">Montgomery arithmetic from a software perspective - Bos and The Montgomery</a></li>
 </ul>
 <h2 id="related-math"><a class="header" href="#related-math">Related Math</a></h2>
 <ul>
@@ -1333,9 +1335,12 @@ <h2 id="general-2"><a class="header" href="#general-2">General</a></h2>
 <li><a href="https://solvable.group/posts/riemann-roch-crypto/">Applications of Riemann Roch theorem in cryptography - Borgeaud</a></li>
 <li><a href="https://www.lix.polytechnique.fr/Labo/Antonin.LEROUX/manuscrit_these.pdf">Quaternion algebras and Isogeny based cryptography</a></li>
 <li><a href="https://math.mit.edu/classes/18.783/2022/LectureNotes9.pdf">Notes on Discrete log</a></li>
+<li><a href="https://alinush.github.io/2024/05/31/Schnorr-signatures.html">All you need to know about Schnorr signatures - Tomescu</a></li>
 </ul>
 <h2 id="pairings"><a class="header" href="#pairings">Pairings</a></h2>
 <ul>
+<li><a href="https://hackmd.io/@brozorec/pairings-for-the-rest-of-us-1">Pairings for the rest of us Part 1 - Barakov</a></li>
+<li><a href="https://hackmd.io/@brozorec/pairings-for-the-rest-of-us-2">Pairings for the rest of us Part 2 -Barakov</a></li>
 <li><a href="https://static1.squarespace.com/static/5fdbb09f31d71c1227082339/t/5ff394720493bd28278889c6/1609798774687/PairingsForBeginners.pdf">Pairings for beginners - Craig Costello</a></li>
 <li><a href="https://medium.com/@VitalikButerin/exploring-elliptic-curve-pairings-c73c1864e627">Pairings - Vitalik Buterin</a></li>
 <li><a href="https://members.loria.fr/AGuillevic/pairing-friendly-curves/">Pairing friendly curves</a></li>
@@ -1772,11 +1777,15 @@ <h2 id="tee-and-confidential-computing"><a class="header" href="#tee-and-confide
 <li><a href="https://github.com/NVIDIA/nvtrust">TEE for CPU and GPU Nvidia</a></li>
 <li><a href="https://www.youtube.com/watch?v=Xq7oWtiwWII">TEE for blockchain applications</a></li>
 </ul>
-<h2 id="niche-tricks"><a class="header" href="#niche-tricks">Niche tricks</a></h2>
+<h2 id="niche-tricks-and-guides"><a class="header" href="#niche-tricks-and-guides">Niche tricks and guides</a></h2>
 <ul>
 <li><a href="https://catonmat.net/wp-content/uploads/2009/07/cacheobliviousalgorithmsanddatastructures.pdf">Cache oblivious algorithms</a></li>
 <li><a href="https://developer.nvidia.com/blog/improving-gpu-performance-by-reducing-instruction-cache-misses/">Cache skipping</a></li>
 <li><a href="http://www.ziti.uni-heidelberg.de/ziti/uploads/ce_group/seminar/2015-Guenther_Schindler.pdf">Techniques for caches in GPUs</a></li>
+<li><a href="https://medium.com/gpgpu/multi-gpu-programming-6768eeb42e2c">Multi GPU programming guide</a></li>
+<li><a href="https://siboehm.com/articles/22/CUDA-MMM">GPU matrix mul</a></li>
+<li><a href="https://medium.com/gpgpu/block-sparse-matrix-vector-multiplication-with-cuda-4e616b30267">Sparse matrix mul</a></li>
+<li><a href="http://eprints.utar.edu.my/2494/1/CS-2017-1401837-1.pdf">Large Integer arithmetic in GPU for cryptography</a></li>
 </ul>
 <h2 id="computer-architectureisas"><a class="header" href="#computer-architectureisas">Computer Architecture/ISAs</a></h2>
 <ul>
@@ -1790,6 +1799,8 @@ <h1 id="discrete-fourier-transforms"><a class="header" href="#discrete-fourier-t
 <h2 id="algorithms-and-methods"><a class="header" href="#algorithms-and-methods">Algorithms and methods</a></h2>
 <ul>
 <li><a href="https://vitalik.eth.limo/general/2019/05/12/fft.html">FFT - Vitalik</a></li>
+<li><a href="https://www.davidhbailey.com/dhbpapers/fftq.pdf">Bailey’s method</a></li>
+<li><a href="https://www.cis.rit.edu/class/simg716/FFT_Fun_Profit.pdf">FFTs for fun and profit - GentleMan Sande</a></li>
 <li><a href="https://ethresear.ch/t/reed-solomon-erasure-code-recovery-in-n-log-2-n-time-with-ffts/3039">Reed-Solomon code: Vitalik</a></li>
 <li><a href="https://www.csee.umbc.edu/~phatak/691a/fft-lnotes/fftnotes.pdf">FFT Notes</a></li>
 <li><a href="https://www.ams.org/journals/mcom/1971-25-114/S0025-5718-1971-0301966-0/S0025-5718-1971-0301966-0.pdf">The Fast Fourier Transform in a Finite Field - Pollard</a></li>
@@ -1818,6 +1829,18 @@ <h2 id="algorithms-and-methods"><a class="header" href="#algorithms-and-methods"
 <li><a href="https://people.maths.ox.ac.uk/trefethen/barycentric.pdf">Barycentric interpolation - Math Oxford</a></li>
 <li><a href="https://solvable.group/posts/walshhadamard-transform/">Walsh Hadamard Transform - Borgeaud</a></li>
 <li><a href="https://t.co/qXTu1Z4OzK">FFT on finite fields intro</a></li>
+<li><a href="https://rje.li/24-07-03-alg-fft.html">Algebraic FFTs - Sage</a></li>
+</ul>
+<h2 id="large-ffts"><a class="header" href="#large-ffts">Large FFTs</a></h2>
+<ul>
+<li><a href="https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=9465154">Large-Scale Discrete Fourier Transform on TPUs</a></li>
+<li><a href="https://www.eecis.udel.edu/~xli/publications/chen2013hybrid.pdf">Hybrid CPU/GPU FFTs - Chen</a>
+<ul>
+<li><a href="https://udspace.udel.edu/server/api/core/bitstreams/3d81b1ab-87da-4379-ab3b-7b3c716b7ba9/content">Thesis</a></li>
+</ul>
+</li>
+<li><a href="https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2022-0297">Large Scale 3d FFT on GPU</a></li>
+<li></li>
 </ul>
 <h2 id="implementations"><a class="header" href="#implementations">Implementations</a></h2>
 <ul>