Cryptography, Blockchain, Ethereum, Loopring, Learning.
values for (a2,a1,a0) where a1, a2 or a0 can only ever be 0 or 1. (a2, a1, a0) (0, 0, 0) = 0 (0, 0, 1) = 1 (0, 1, 0) = x (1, 0, 0) = x² (0, 1, 1) = x+1 (1, 1, 0) = x²+x (1, 0, 1) = x²+1 (1, 1, 1) = x²+x+1 Putting it all together, GF(2^3) = {0, 1, x, x², x+1, x²+x, x²+1, x²+x+1} Although this form