Recognition-cut and Fold-and-Look review evidence

recognition_fold_review.py is a dependency-free exact checker for the two reviewed result units. It covers:

• every Boolean function on binary words through total length four, including future-row equivalence, canonical adjacent transitions, exact protocol partitions, endpoint cuts, and constant slices;
• exact generalized-Dyck midpoint row counts in the small hostile cases;
• the exact 2^n midpoint-row theorem for every matching permutation through n = 6;
• mismatch and parity DNF resource counts, plus finite packing checks for the material–precision inequality; and
• a legal two-fold, three-layer fibre showing that the former same-orientation reflection lemma is false after Boolean constants are removed from the fibre term.

Run python recognition_fold_review.py. The script writes its JSON result to standard output; independent-output.json is the committed transcript. The finite audit supports the unrestricted written arguments but does not replace them.