scalar-field.md

expander PCS the Goldilocks field|Goldilocks polynomial commitment scheme. commits via expander-graph linear codes. opens via recursive tensor decomposition. zero Merkle trees. O(N) commit. O(log N + λ) proof. one hemera call for binding. implements the pcs|PCS trait for $\mathbb{F}_p$. encoding…