2F46          ; mapped                 ; 65E0          # 3.0  KANGXI RADICAL NOT
2F47          ; mapped                 ; 65E5          # 3.0  KANGXI RADICAL SUN
2F48          ; mapped                 ; 66F0          # 3.0  KANGXI RADICAL SAY
2F49          ; mapped                 ; 6708          # 3.0  KANGXI RADICAL MOON
2F4A          ; mapped                 ; 6728          # 3.0  KANGXI RADICAL TREE

var productTable [16]gcmFieldElement // We precompute 16 multiples of H. However, when we do lookups // into this table we'll be using bits from a field element and // therefore the bits will be in the reverse order. So normally one // would expect, say, 4*H to be in index 4 of the table but due to // this bit ordering it will actually be in index 0010 (base 2) = 2. x := gcmFieldElement{ byteorder.BEUint64(H[:8]), byteorder.BEUint64(H[8:]), } productTable[reverseBits(1)] = x for i := 2; i < 16; i +=...

var productTable [16]gcmFieldElement // We precompute 16 multiples of H. However, when we do lookups // into this table we'll be using bits from a field element and // therefore the bits will be in the reverse order. So normally one // would expect, say, 4*H to be in index 4 of the table but due to // this bit ordering it will actually be in index 0010 (base 2) = 2. x := gcmFieldElement{ byteorder.BEUint64(H[:8]), byteorder.BEUint64(H[8:]), } productTable[reverseBits(1)] = x for i := 2; i < 16; i +=...