Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 175. (Read 230740 times)

Is it possible to make it possible to specify an unlimited number in num?

If set num = 1000000000
That throws an error:

Traceback (most recent call last):
   File "D :\PubSub\PubSub.py", line 8, in
     res= ice.point_loop_subtraction(num, target, sustract_pub).hex()
   File "D :\PubSub\secp256k1.py", line 504, in point_loop_subtraction
     res = _point_loop_subtraction(num, pubkey1_bytes, pubkey2_bytes)
   File "D :\PubSub\secp256k1.py", line 497, in _point_loop_subtraction
     res = (b'\x00') * (65 * num)
MemoryError

is there any C++ open source script ( CPU or GPU ) to join you in this journey ? Thank you in advance

Skipping the keys or searching n times is not the same as changing the curve.

Sure it will, if you add an odd key to another odd key ( our 2^256 key is odd ) you'll get an even key and all you have to do is to subtract the following key from the result :
But why bother if you could add or subtract 1G from your odd key and divide it without having to do what I said.

You can always divide an odd key, if by 2, you'd have to add n/2 to the result, if by 3, adding n/3 etc to get your actual and correct result.

It is a pity that such an operation will not work with an odd key))

So basically, you talk about stride option in already existing tools.

increase the search speed of the Pubkeys, dividing the search range.

First of all, let me make it clear that this script is slow and basic, I did it like this in order to explain the range division method.

If you want to apply it quickly, modify keyhunt or other c++ code before compiling to make it work with this method.

The method consists in changing the parameters of the curve by x,y of a higher point (for the script I used pk#100).
by default the curve uses pubkey #1
what works in sequence 1,2,3,4....
pubkey #100
which works in sequence 100,200,300,400....

if we want to find pk# 3922
in a range of 2000:6000
in the traditional way we would need to advance +1900 pubkeys
In this method we will only need 19 pubkeys (1900/100).

the database is done by subtracting 1 consecutively from the target pubkey (in my case I need to subtract( 1), 100 times because I chose pubkey pk# 100 as divisor.

The trick is in your ability to use fast databases, the more pubkey you store in the database, the higher the divisor will be, therefore the search range is smaller.

I currently don't have what it takes to code in C++ using the quick search methods, my resources are limited to the basics.
I currently don't have an up-to-date pc to do the relevant tests (the disadvantages of the third world).

However, later I will share faster methods, ECC tricks.