An interactive concept flow for store password verifiers, not recoverable passwords, from its assumptions through the main operation and boundary checks.
trace / request.md
readyPassword storage should make a stolen database expensive to search. A password hashing function is intentionally slow and memory-intensive compared with a general-purpose hash. Each password needs a unique random salt so equal passwords do not produce equal stored verifiers.
Use the stages in order to explain store password verifiers, not recoverable passwords. Each stage makes one assumption visible: what the operation promises, what representation it uses, how state changes, which boundary can invalidate a shortcut, and what evidence confirms the result.
For a worked explanation, continue to the topic article and execution trace.
Not started
Sign in to save your learning progress.