When a Known Answer Test fails on a crypto primitive, the cause is often byte-ordering or padding. Pasting that raw hex plus the ACVP JSON into a chat window works once, but it does not scale to large vector files. A credible baseline stays manual: run the KAT binary locally, copy only the failing vector ID and byte offset into the prompt, fix, and re-run. For a single algorithm and a small file, that loop is sufficient and easier to audit than adding server code. The gap appears with massive ACVP payloads and repeated re-runs. One method is to put the runner behind Model Context Protocol over stdio: * tool `run_crypto_kat(target, algorithm)` returning structured status, failing case ID, and diff window * tool `load_acvp_vectors(path)` with filtering or paging instead of dumping the whole file * resources for expected schema layout and tail of the latest log Keep tool outputs small and typed: verdict, file, case, expected vs actual slice, and next command. Let the agent request more context explicitly rather than pushing the whole file by default. What workaround do you use today to keep large KAT vectors out of the prompt while still giving the agent enough to fix the byte-level bug?

A cryptographic module written entirely in Rust — no C, no FFI into legacy cryptographic libraries. 64,000+ test cases across 20 algorithm families graded as passing on NIST's ACVP demo server. On the...