We want to create a generic adversarial testing system for codebases. Read adversarial.md for notes. Read ../kiss/coverage/research for more. Read 'kiss rules' for some basic code complexity measure.

We want this system to keep code from overfitting, for example
- special-cased tests
- brittle tests
- brittle code that passes an eval, but doesn't capture the eval's intent
- brittle code that passes a linter rule, but doesn't capture the linter rule's intent

etc. It's all the same really: Overfitting to some test.

We want the system itself to generalize to lots of (all, realistic?) codebases. It should
be robust enough to run along side a coding agent so that, together, they can autonomously
generate robust, general code that runs in real, untest (but intendend) situations.

Repeat these steps 10 times:
 - Run 'malvin invent' to generate 10 ideas for how to create such a system.
 - Falsify the heck out of those ideas using results from research or small-scale / toy
   code counter-examples. Feel free to browse the web for more papers. You can store them
   in ../kiss/coverage/research.
 - Summarize your proposed design for an adversarial testing system for codebases so far in summary.md. You may overwrite old summaries.
 
 

