-
It might be quite interesting to explore SIMD vectorization for elliptic curves and MSMs. This might significantly speed-up:
- Verkle Trees
- KZG
- MSM
without needing a GPU. Ideally the same op…
-
# Observation
Arithmetic operations in rust can panic (overflow, division by zero, etc...)
In release mode, arithmetic operations will act like C, in modular arithmetic
Many alternatives are exposed…
-
翻译 WTF zk 教程前20讲： https://github.com/WTFAcademy/WTF-zk
每人最多认领3讲，需要英语流利，并熟悉zk。
翻译流程：先利用chatgpt机翻，然后人工审核。
任务奖励由zkSync提供
Update:
2024.4.30: machine tranlation已经上传到repo: https://github.com/…
-
### Binary Exponentiation
- Integer version
- Matrix version
- Implementation
- Examples
### Sieve of Eratosthenes
- Finding Prime Numbers
- Implementation
- Examples
### Sieve of Euler
- Ye…
-
M = ∑ i=1 n Ti ⊗ fi
Modular Formula which denotes the "M", It has Tensor properties that represent multi-dimensional data and transformations flexibly and comprehensively. Multilinear maps allow inter…
-
The hazards of unsigned arithmetic in C/C++ are well known, and modern style guides generally discourage their use for anything except bitwise manipulation and cases where the extra bit of positive ra…
-
It seems that for problems involving trigonometric functions like sine and cosine, the sampling interval should be e.g. (0, 2*PI).
But the update interval should be unbounded. And controlled by us…
-
Trigonometry and Modular Arithmetic don't have navigation arrows at the bottom of the page.
syz16 updated
4 years ago
-
I recently started exploring khan-exercises and related stuff, but I could not locate any modular arithmetic based module in /utils.
-
> Beware! `Fin n` is endowed with modular arithmetic. Naively calling `2*i` would multiply `i` by two and perform modulo by `n/2`. We do not want that; we have to get the underlying natural number `i.…