**R to @adam3us: i later found another incremental optimisation where you can drop one of the r values (fix r_0 to 0) and still compute and verify, reducing space for r, and n values to k*(n-1)+1 (of 256-bit = 32byte numbers) plus some public keys etc.**

i later found another incremental optimisation where you can drop one of the r values (fix r_0 to 0) and still compute and verify, reducing space for r, and n values to k*(n-1)+1 (of 256-bit = 32byte numbers) plus some public keys etc.**R to @adam3us: i later found another incremental optimisation where you can drop one of the r values (fix r_0 to 0) and still compute and verify, reducing space for r, and n values to k*(n-1)+1 (of 256-bit = 32byte numbers) plus some public keys e…