# M02-L05 — Interview

**Q1. What problem does Nonce and replay protection solve?**  
A: Signed transfers must not replay. Explain the trust boundary and show one concrete failure of the naive approach.

**Q2. How would you implement and verify it?**  
A: Validate sequential nonce and chain ID; prove it with tests where duplicate nonce or wrong chain rejected.

**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.
