[2^((totIterations-k)×4)][windowValue]G and avoid the // doublings between iterations. t := New{{.P}}Point() p.Set(New{{.P}}Point()) tableIndex := len(tables) - 1 for _, byte := range scalar { windowValue := byte >> 4 tables[tableIndex].Select(t, windowValue) p.Add(p, t) tableIndex-- windowValue = byte & 0b1111 tables[tableIndex].Select(t, windowValue) p.Add(p, t) tableIndex-- } return p, nil } // {{.p}}Sqrt sets e to a square root of x. If x is not a square, {{.p}}Sqrt returns // false and e is unchanged....