Multiply, then add
You will learn
What a multiply-accumulate does with two signed products, and how the swap from lesson 12 breaks it.
A neuron sums products of weights and inputs, and on_comb in gft_signed_mac.t27 is such a sum with two terms: smul(a1, b1) plus smul(a2, b2). Here smul sets the sign with XOR and has no zero guard. The native t27c runs 4 tests and all pass; one of them, zero_clause, expects 0 x 1 + 0 x 1 to give 512, which is 2^-39, not 0, and its comment calls that the designed behaviour. The browser skips its tests because its runner does not know assert_eq yet. The recording runs t27c test-report, then repeats the bug of lesson 12 with a one-line sed that swaps XOR for OR, and runs t27c test-report again. Exactly one test fails, pp: (-1.0) x (-1.0) now comes out negative, so the sum is 0 instead of 2.0. git checkout puts the line back, and sha256sum prints the same hash as before the edit. Every byte in the recording was printed by the command; only the typing is staged.