Checking Even or Odd Points

To check a number N, you require N+2 addition or subtraction operations. Wouldn't it be simpler to just go through all the points from 1 to N instead?

How can knowledge of an even or odd point help in hacking secp256k1?

Yeah, except the points are in random order so you have no way of knowing how far from the median the point is - which would imply that the computation would be faster. This is still going to be prohibitively expensive for large N. It is O(n). Any method with a runtime greater than O(log N) is not going to be practical in cryptography.

Alexander, can u explain how you arrive to a sequence of 46 values of power of 2 with a bloomfilter of size 2^30 for puzzle 120? Thanks

Ok maybe I understand. 46 is the average length of the power of 2 sequence? that's right?

Hi Alexander, off topic, but do you know how to return the original value without mod n? Thanks

Ok.

How long finding the parity of a public key vs finding its private key? I tried the running program it is same speed if not slower than bsgs.