VeriLLM
ML JOURNEY / FULL WALKTHROUGH

VeriLLM

Wrap cached GPT inference in Merkle commitments and spot checks, then simulate a decentralized committee with rewards and slashing.

8 parts57 individual lessons4.8 estimated hours285 XP available
VeriLLM project artwork
0%0 of 57 complete
Start walkthrough
No compressed chapters.

Every source step is its own lesson with intuition, concepts, correctly rendered MathJax mathematics, implementation, tests, mistakes, and a checkpoint.

02
PART 2

Embeddings and Causal Self-Attention with KV Cache

Implement token and positional embeddings, the linear projection primitive, and a single-head causal self-attention module that reads and writes a KV cache.

0/13
004embed tokens+5 XP005add positional embeddings+5 XP006linear projection+5 XP007compute attention scores+5 XP008scale attention scores+5 XP009apply causal mask+5 XP010softmax attention weights+5 XP011weighted value sum+5 XP012project qkv+5 XP013append kv cache+5 XP014scaled dot product attention with cache+5 XP015apply output projection+5 XP016single head causal self attention+5 XP
08
PART 8

Decentralized Committee, Incentives, and End-to-End Evaluation

Sample verifier committees, aggregate votes by majority, implement rewards and slashing, and run honest and malicious rounds reporting end-to-end verification cost.

0/9
049sample verifier committee+5 XP050collect verifier votes+5 XP051aggregate votes majority+5 XP052reward honest participants+5 XP053slash worker+5 XP054assign dual role+5 XP055run honest round+5 XP056run malicious round+5 XP057report end to end verification cost+5 XP