# M02-L02 — Interview

**Q1. What problem does Key pairs and addresses solve?**  
A: Prove account control without sharing secrets. Explain the trust boundary and show one concrete failure of the naive approach.

**Q2. How would you implement and verify it?**  
A: Generate secp256k1 keypair and derive EVM address; prove it with tests where address derives consistently from public key.

**Q3. What breaks under retries or concurrent execution?**  
A: Analyze duplicate requests, ordering, idempotency and whether state is on-chain or off-chain. State which cases are applicable.

**Q4. What would change in production?**  
A: Add security review, finality/reorg handling, key management, monitoring, explicit RPC failure semantics, and deployment controls as applicable.

**Follow-up:** Draw the state machine, identify one invariant, and defend a trade-off.