📘 Psy 101 Recap: Consensus, State & Security

This week we explored how Psy tackles value extraction, parallelism, and privacy at scale:

💰 MEV (Maximal Extractable Value) – The value miners/validators extract by reordering or censoring transactions. Psy’s design minimizes harmful MEV through local proving and Realm isolation.

🌳 NCA (Nearest Common Ancestor) – In a tree, the deepest shared ancestor of two nodes. Psy uses NCA proofs in GUTA to merge separate user state transitions efficiently.

🔢 Nonce – A counter in each user’s ULEAF, incremented per session or transaction to prevent replay attacks.

🪜 PARTH (Parallel Ascending Recursive Tree Hierarchy) – Psy’s state structure, enabling massive parallelism by partitioning user-contract state while preserving global verifiability.

🔗 PoUW (Proof of Useful Work) – Consensus mechanism rewarding work that actually benefits the network: ZK aggregation, data availability, etc.

⚒️ Proof Miner – Specialized nodes that generate the heavy ZK proofs to aggregate End Cap proofs and build block proofs.

🔑 Public Key (Psy) – Not a standard ECC key — it’s the hash of the verifier circuit + user-defined parameters, enabling Software Defined Keys unique to each user.

Psy is proving the future of privacy-preserving, scalable consensus — one proof at a time.