Add study log for 2026-03-20: Lecture 1 skimmed

Co-authored-by: han <han@noreply.fbrns.co>

README.md

@@ -14,8 +14,13 @@ Study system combining:
 - **graph-theory/** — Graphs, trees, algorithms
 - **algorithms/** — Complexity, sorting, searching
 - **cryptography-prep/** — Building blocks for crypto (once foundation is solid)
+- **lectures/** — Course-specific lecture notes (see below)
 - **lecture-notes/** — Raw notes from lectures before organizing
 
+## Lectures
+
+- [Ethereum Cryptography 2026](./lectures/ethereum-crypto-2026/) — EPF course
+
 ## Study Flow
 
 1. Watch lecture → save raw notes to `lecture-notes/`

lectures/ethereum-crypto-2026/00-preface.md

@@ -0,0 +1,11 @@
+**Ethereum Cryptography — 2026**
+
+Lecture notes and references for the cryptography course.
+
+Main resource: https://drive.google.com/file/d/14ZOhQr4t-6Idd_ljeMCUexFQvCmd72cp/view
+
+Course page: https://study.epf.wiki/course/view.php?id=3
+
+---
+
+(TODO: dump intro notes, preliminary content, and any supplementary materials here)

lectures/ethereum-crypto-2026/01-finite-groups-fields.md

@@ -0,0 +1,7 @@
+**Lecture 1 — Finite Groups & Fields**
+
+Main resource: https://drive.google.com/file/d/14ZOhQr4t-6Idd_ljeMCUexFQvCmd72cp/view
+
+---
+
+(TODO: notes)

lectures/ethereum-crypto-2026/02-discrete-fourier-transform.md

@@ -0,0 +1,7 @@
+**Lecture 2 — Discrete Fourier Transform**
+
+Main resource: https://drive.google.com/file/d/14ZOhQr4t-6Idd_ljeMCUexFQvCmd72cp/view
+
+---
+
+(TODO: notes)

lectures/ethereum-crypto-2026/03-elliptic-curves-pairings.md

@@ -0,0 +1,7 @@
+**Lecture 3 — Elliptic Curves & Pairings**
+
+Main resource: https://drive.google.com/file/d/14ZOhQr4t-6Idd_ljeMCUexFQvCmd72cp/view
+
+---
+
+(TODO: notes)

lectures/ethereum-crypto-2026/04-bls-signatures.md

@@ -0,0 +1,7 @@
+**Lecture 4 — BLS Signatures**
+
+Main resource: https://drive.google.com/file/d/14ZOhQr4t-6Idd_ljeMCUexFQvCmd72cp/view
+
+---
+
+(TODO: notes)

lectures/ethereum-crypto-2026/05-proof-systems.md

@@ -0,0 +1,7 @@
+**Lecture 5 — Proof Systems**
+
+Main resource: https://drive.google.com/file/d/14ZOhQr4t-6Idd_ljeMCUexFQvCmd72cp/view
+
+---
+
+(TODO: notes)

preface.md

@@ -14,6 +14,7 @@ Since doing this alone, we couldn't cross-reference with anyone else. So this pr
 **Lectures & Courses**
 - [Khan Academy](https://www.khanacademy.org/)
 - [MIT OpenCourseWare: Linear Algebra](https://ocw.mit.edu/courses/18-06sc-linear-algebra-fall-2011/)
+- [Introduction to Higher Mathematics](https://www.whitman.edu/mathematics/higher_math_online/) (free online course)
 - [Start Learning Mathematics (playlist)](https://www.youtube.com/playlist?list=PLBh2i93oe2qtbygdXz4u6Mkh7c_hMLBA8)
 
 **Books & Textbooks**

study-log.md

@@ -0,0 +1,51 @@
+**Study Log**
+
+Format: Date (title + optional link) → Notes → Questions
+Sorted newest first.
+
+---
+
+**Example**
+
+**2026-03-18**
+- Math Major Guide: Nonstandard Advice — https://www.youtube.com/watch?v=EE7KpcReYw4
+
+Notes:
+- Math isn't about speed or memorization — it's about understanding structure
+- The "right" way to study math is different from other subjects
+
+Questions:
+- How do I know when I've truly understood a concept vs just memorized it?
+
+---
+
+**Log** (newest first)
+
+**2026-03-20**
+- Lecture 1 — Intro to Cryptography (skimmed notes, pages 2–15)
+
+Notes:
+- Base and recursive construction of natural numbers — the "stepper function" (forgot exact term)
+
+Questions:
+- Most of the content is still unclear. Rather than forcing comprehension, treating this as a "gap survey" — noting what foundational topics I need before this clicks: groups, fields, modular arithmetic, cyclic structures.
+
+Comment:
+- Smart approach. Skim + attend lecture + log gaps = right strategy at this level. Don't fight it — just map the territory.
+
+---
+
+**2026-03-19**
+- Khan Academy: Sets & Their Representations (110 minutes) — https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:sets-ncert-new/x0419e5b3b578592a:sets-and-their-representations/v/what-are-sets
+
+Notes:
+- Roster form: lists all elements explicitly, e.g. {1, 2, 3, ...}
+- Set-builder form: describes elements by a rule, e.g. {x: x is an odd number less than 10}
+- Sets can be empty, finite, or infinite
+
+Questions:
+- Still unclear on terminology: positive integer, real number, integral number, etc. — these are number classification names, not strictly a set concept. Looking for a reference to solidify these.
+- Reference: https://mathmonks.com/sets/number-sets
+
+Comment:
+- Notes are solid. The number classification question is actually about "number systems" — you'll encounter these more in the lecture notes when they talk about fields and groups. For now, just know that N = natural numbers, Z = integers, R = real numbers. Check out the reference above for a simple breakdown of number sets.