Practical overview
When it fits
Use it as a structured study path when you want to progress from mathematical prerequisites toward zero-knowledge proof concepts, or as a reference for individual topics in the sequence.
Who it is for
- Learners beginning zero-knowledge proofs with a high-school mathematics background.
- Developers who want to study the mathematics behind cryptographic algorithms through Python examples.
Documented uses
- Study number theory and modular arithmetic used in cryptography.
- Build mathematical foundations in abstract algebra, elliptic curves and computational complexity.
- Explore selected cryptographic algorithms and zero-knowledge proof topics through tutorials and notebooks.
Requirements & limits
The repository is public and licensed under MIT. Tutorial material is available in English and Chinese.
- The course begins with number theory and proceeds through abstract algebra, elliptic curves and computational complexity, so learners can follow prerequisites in sequence.
- Python is needed to reproduce the algorithms; not every listed lesson has a notebook, as some are provided as written tutorials.
- The material is educational, with examples and lessons rather than a documented deployed proving service.
Check current requirements in the official documentation. Source-based guidance does not mean OpenViST has run or independently tested this project.
Study introductory number theory with WTF-zk
Work through the repository’s introductory number-theory lessons and their associated Python algorithm examples.
Before you start
- High-school-level mathematics is the stated target background.
- Python is needed to reproduce the algorithms.
- The lessons link to written tutorials and Jupyter notebooks.
Steps
Open the repository’s README and go to Chapter 1, “Introduction to Number Theory.”
Start with the Integer Arithmetic lesson and use its linked tutorial and notebook.
Continue through the Prime Numbers and Euclidean Algorithm lessons using their linked tutorials and notebooks.
Proceed to later listed topics such as Extended Euclidean Algorithm and Modular Arithmetic as desired.
Expected outcome
A structured introduction to number theory concepts used in the repository’s zero-knowledge-proof learning path, with linked Python notebook examples for the listed lessons.
Guide limitations
- The repository describes itself as an introductory tutorial and says Python is needed for algorithm reproductions.
- The README lists further topics, but this guide does not establish notebook execution setup or verify that examples run.
Sources & review
Source record details
- Source availability
- Active
- Sources checked
- 13 October 2026
- Original website title
- WTFAcademy/WTF-zk · Official homepage title · retained in its source language

