Bitcoin puzzle transaction ~32 BTC prize to who solves it

[jpyao78]

define  MEM_SIZE    31

Segmentation fault

your PC memory is not enough
try:
#define  MEM_SIZE    30

[1714904466]

1714904466

[1714904466]

1714904466

[1714904466]

1714904466

[1714904466]

1714904466

[mrxtraf]

define  MEM_SIZE    31

Segmentation fault

your PC memory is not enough
try:
#define  MEM_SIZE    30

64 (62.8)GB and plus 8GB swap.

[Bajula]

define  MEM_SIZE    31

Segmentation fault

your PC memory is not enough
try:
#define  MEM_SIZE    30

64 (62.8)GB and plus 8GB swap.

Think that through a moment.

-bad analogy but close enough-
A: my backpack won't hold this.
B: try this (insert advice)...
A: Nah man I got a 64# backpack (which holds 62.8#) plus a fanny pack that holds 8# (why can't I put this 64# block in my backpack?!?!)

C: "Try the advice."


Just as an aside the reason my "8gb" doesn't do gstep 28 (using uint64 on hash entries) is apparently a built in video card is sharing some memory so it has 7.something gb so I can only go to 27 gstep.  - have an 8gb swap as well - the comp just looks at me and says explative please.

[Nnuego]

You expect us to solve this? Fine and good, the answer is on the way. Big kudos to whosever that solved it cos am getting confused while trying to put the keys together for the answer

[supika]

define  MEM_SIZE    31

Segmentation fault

your PC memory is not enough
try:
#define  MEM_SIZE    30

What would be MEM_SIZE values for using 128/256/512 GB of ram?

[Bajula]

define  MEM_SIZE    31

Segmentation fault

your PC memory is not enough
try:
#define  MEM_SIZE    30

What would be MEM_SIZE values for using 128/256/512 GB of ram?

32/33/34 (read back a bit each increase doubles the memory requirement)
and as we have seen if the 512 does not have 512 of actual usable ram you need to go down one
(i.e. if it really has say 500 available then 33 it is.. but will only use 256gb)

[PietCoin97]

Ok i have this problem

when i do this

Code:

#define  MEM_SIZE    34  //for512GB
HASH_SIZEone_table_bytes>>34

i got ony 24 GB

when i do this

#define  MEM_SIZE    34  //for512GB
HASH_SIZEone_table_bytes>>30

i got 384 gb

and the process works only until it reach 51 GB MEM size in process

so how can i use the whole 640 GB i have ?

it looks like that

[mrxtraf]

Somthing wrong in algoritms

Added show debug outputs.

Code:

./break-short-low-mem-2
Check bit = 90 only, pubkey is:
035c38bd9ae4b10e8a250857006f3cfd98ab15a6196d9f4dfd25bc7ecc77d788d5
Build Hash, MEM size = 12GB
2:51:13 Start generate 1000000 from 536870912, 0% 
2:51:19 Start generate 2000000 from 536870912, 0% 
2:51:25 Start generate 3000000 from 536870912, 0% 
2:51:30 Start generate 4000000 from 536870912, 0% 
2:51:34 Start generate 5000000 from 536870912, 0% 
2:51:39 Start generate 6000000 from 536870912, 1% 
2:51:43 Start generate 7000000 from 536870912, 1% 
......
..........
......
3:25:14 Start generate 529000000 from 536870912, 98% 
3:25:18 Start generate 530000000 from 536870912, 98% 
3:25:22 Start generate 531000000 from 536870912, 98% 
3:25:26 Start generate 532000000 from 536870912, 99% 
3:25:30 Start generate 533000000 from 536870912, 99% 
3:25:34 Start generate 534000000 from 536870912, 99% 
3:25:38 Start generate 535000000 from 536870912, 99% 
3:25:42 Start generate 536000000 from 536870912, 99% 
Search bits = 90
Search Keys....  from 20000000000000000000000 to 3ffffffffffffffffffffff
3:26:14 Search in 576460752310000000 from start 576460752303423488 end 1152921504606846976, real_i:6576512       i3:6585646      real_diff:576460752303423488   percent 0% 
3:26:57 Search in 576460752320000000 from start 576460752303423488 end 1152921504606846976, real_i:16576512      i3:16586748     real_diff:576460752303423488   percent 0% 
3:27:41 Search in 576460752330000000 from start 576460752303423488 end 1152921504606846976, real_i:26576512      i3:26585539     real_diff:576460752303423488   percent 0% 
576460752330000000      1 Count 536870912. Percent 0% 
3:28:25 Search in 576460752340000000 from start 576460752303423488 end 1152921504606846976, real_i:36576512      i3:36588420     real_diff:576460752303423488   percent 0% 
576460752340000000      1 Count 536870912. Percent 0% 
3:29:8 Search in 576460752350000000 from start 576460752303423488 end 1152921504606846976, real_i:46576512       i3:46589427     real_diff:576460752303423488   percent 0% 
576460752350000000      1 Count 536870912. Percent 0% 
3:29:51 Search in 576460752360000000 from start 576460752303423488 end 1152921504606846976, real_i:56576512      i3:56588769     real_diff:576460752303423488   percent 0% 
576460752360000000      1 Count 536870912. Percent 0% 
3:30:35 Search in 576460752370000000 from start 576460752303423488 end 1152921504606846976, real_i:66576512      i3:66591219     real_diff:576460752303423488   percent 0% 
576460752370000000      1 Count 536870912. Percent 0% 
576460752370000000      2 Count 536870912. Percent 0% 
3:31:19 Search in 576460752380000000 from start 576460752303423488 end 1152921504606846976, real_i:76576512      i3:76596094     real_diff:576460752303423488   percent 0% 
576460752380000000      1 Count 536870912. Percent 0% 
3:32:2 Search in 576460752390000000 from start 576460752303423488 end 1152921504606846976, real_i:86576512       i3:86588708     real_diff:576460752303423488   percent 0% 
576460752390000000      1 Count 536870912. Percent 0% 
3:32:45 Search in 576460752400000000 from start 576460752303423488 end 1152921504606846976, real_i:96576512      i3:96583765     real_diff:576460752303423488   percent 0% 
576460752400000000      1 Count 536870912. Percent 0% 
576460752400000000      2 Count 536870912. Percent 0% 
576460752400000000      3 Count 536870912. Percent 0% 
3:33:29 Search in 576460752410000000 from start 576460752303423488 end 1152921504606846976, real_i:106576512     i3:106577746    real_diff:576460752303423488   percent 0%
........
........................................................
........
576460760310000000      1 Count 536870912. Percent 0% 
576460760310000000      2 Count 536870912. Percent 0% 
13:20:11 Search in 576460760320000000 from start 576460752303423488 end 1152921504606846976, real_i:8016576512   i3:8016708349   real_diff:576460752303423488   percent 0% 
576460760320000000      1 Count 536870912. Percent 0% 
13:21:6 Search in 576460760330000000 from start 576460752303423488 end 1152921504606846976, real_i:8026576512    i3:8026710610   real_diff:576460752303423488   percent 0% 
13:21:57 Search in 576460760340000000 from start 576460752303423488 end 1152921504606846976, real_i:8036576512   i3:8036710758   real_diff:576460752303423488   percent 0% 
576460760340000000      1 Count 536870912. Percent 0% 
13:22:46 Search in 576460760350000000 from start 576460752303423488 end 1152921504606846976, real_i:8046576512   i3:8046712472   real_diff:576460752303423488   percent 0% 
13:23:33 Search in 576460760360000000 from start 576460752303423488 end 1152921504606846976, real_i:8056576512   i3:8056715636   real_diff:576460752303423488   percent 0% 
576460760360000000      1 Count 536870912. Percent 0% 
13:24:22 Search in 576460760370000000 from start 576460752303423488 end 1152921504606846976, real_i:8066576512   i3:8066714095   real_diff:576460752303423488   percent 0% 

10 hours and still 0%  from 576460752303423488 to 1152921504606846976
This is real speead? Previos algoritm fast checked in generated arrays.


But algoritm not searched in block

printf("Search Keys....  from %lx%016lx to %lx%016lx\n",start_hi,start_lo, end_hi,end_lo);
printf("Start i from %zu to %zu\n",skip, g_max);
uint64_t i3 = 0;
for (uint64_t i = skip; i < g_max; i++) {
        if(i%10000000==0){
           
            time_t tt = time(NULL);
            tim = localtime(&tt);
            uint64_t real_i = i - skip;
            uint64_t real_diff = g_max - skip;
            printf("%d:%d:%d Search in %zu from start %zu end %zu, real_i:%zu \t i3:%zu \t real_diff:%zu \tpercent %g%% \n", tim->tm_hour, tim->tm_min, tim->tm_sec, i, skip, g_max, real_i, i3, real_diff, (double)(real_i/(real_diff/100)));
        }
        .......
        ...........
        .......
        secp256k1_gej_add_ge_var(&pt, &pt, &ptgstep, NULL);
}

if CHECK_BITS biggest at 95.
Example

./break-short-low-mem-2
Check bit = 100 only, pubkey is:
03d2063d40402f030d4cc71331468827aa41a8a09bd6fd801ba77fb64f8e67e617
Build Hash, MEM size = 1GB
13:31:35 Start generate 1000000 from 67108864, 1%
13:31:39 Start generate 2000000 from 67108864, 2%
13:31:44 Start generate 3000000 from 67108864, 4%
.................................
13:36:10 Start generate 66000000 from 67108864, 98%
13:36:15 Start generate 67000000 from 67108864, 99%
Search bits = 100
Search Keys....  from 00000000000000000 to ffffffffffffffffffffffffffffffff
Start i from 0 to 0
END!!!!!!!!!!!

-----------------
Start i from 0 to 0
-----------------

Code:

uint64_t skip;
uint64_t g_max;
skip  = (uint64_t)0x1 << skip_bits; 
g_max = ((uint64_t)0x1 << shift_gmax)* (uint64_t)(GSTEP);
......
printf("Start i from %zu to %zu\n",skip, g_max);
[b]for (uint64_t i = skip; i < g_max; i++) {[/b]

-----------------
May be nead used not 64, and 128 or long long long in skip and g_max?

[Adriano2010]

Who can help me install the software need for windows OS? I will pay on bitcoin for help and a reward if i can solve the puzzle, but i have only 16 GB RAM.

[mrxtraf]

Who can help me install the software need for windows OS? I will pay on bitcoin for help and a reward if i can solve the puzzle, but i have only 16 GB RAM.

[BurtW]

If someone will please solve this puzzle for me then I will give you some of the profits I make.

Please let me know when you have a solution for me.  I am willing to pay up to 10% of all profits to you just for solving the puzzle for me.

Thanks.   

[Adriano2010]

Who can help me install the software need for windows OS? I will pay on bitcoin for help and a reward if i can solve the puzzle, but i have only 16 GB RAM.

I will pay on bitcoin after program is running, even if i not solve puzzle, i forget to put a, and extra word

[virus-cyber]

Adriano2010


https://gist.github.com/jhoenicke/2e39b3c6c49b1d7b216b8626197e4b89

[AndreuSmetanin]

Who can help me install the software need for windows OS? I will pay on bitcoin for help and a reward if i can solve the puzzle, but i have only 16 GB RAM.

I will pay on bitcoin after program is running, even if i not solve puzzle, i forget to put a, and extra word

Depending on what method you want to solve it???
There is 1 way to this  simple brute force and you need to study here is this https://github.com/pikachunakapika/BitCrack
Is method 2 is a baby-step-giant-step http://andrea.corbellini.name/2015/06/08/elliptic-curve-cryptography-breaking-security-and-a-comparison-with-rsa/
 https://gist.github.com/jhoenicke/2e39b3c6c49b1d7b216b8626197e4b89
Reply but it is not suitable for people who do not have Linux and who are not familiar with the basics of programming ,C, C+
Yes, and my wallet 12gyE8EKXsePJVDFECRda8vxRQvVoWpsEB  

[zielar]

On first machine (600GB RAM):

Code:

Check bit = 90 only, pubkey is:
035c38bd9ae4b10e8a250857006f3cfd98ab15a6196d9f4dfd25bc7ecc77d788d5
Build Hash, MEM size = 384GB

On second machine (80GB RAM):

Code:

Check bit = 90 only, pubkey is:
035c38bd9ae4b10e8a250857006f3cfd98ab15a6196d9f4dfd25bc7ecc77d788d5
Build Hash, MEM size = 64GB
Search bits = 90
Search Keys....  from 20000000000000000000000 to 3ffffffffffffffffffffff

... and nothing changes from two days on both machines.
Something is wrong?
Am I to understand that no more changes are expected in these processes?

Can someone modify the code in such a way that the process is visible (along with the percentage)?

[AndreuSmetanin]

On first machine (600GB RAM):

Code:

Check bit = 90 only, pubkey is:
035c38bd9ae4b10e8a250857006f3cfd98ab15a6196d9f4dfd25bc7ecc77d788d5
Build Hash, MEM size = 384GB

On second machine (80GB RAM):

Code:

Check bit = 90 only, pubkey is:
035c38bd9ae4b10e8a250857006f3cfd98ab15a6196d9f4dfd25bc7ecc77d788d5
Build Hash, MEM size = 64GB
Search bits = 90
Search Keys....  from 20000000000000000000000 to 3ffffffffffffffffffffff

... and nothing changes from two days on both machines.
Something is wrong?
Am I to understand that no more changes are expected in these processes?

Can someone modify the code in such a way that the process is visible (along with the percentage)?

Probably nothing will happen because for the puzzle number 90 you need at least 10 terabytes of RAM ,and this amount is not in the world in one place!

[PietCoin97]

so this code is useless but it should work anyway

i have the same problem with my 600 GB machine

[BurtW]

Probably nothing will happen because for the puzzle number 90 you need at least 10 terabytes of RAM ,and this amount is not in the world in one place!

From 2017:  160 terabytes in a single system, so 10 terabytes should be easy (expensive but it can be done).

https://www.forbes.com/sites/aarontilley/2017/05/16/hpe-160-terabytes-memory/#4cca67c6383f

[AndreuSmetanin]

Probably nothing will happen because for the puzzle number 90 you need at least 10 terabytes of RAM ,and this amount is not in the world in one place!

From 2017:  160 terabytes in a single system, so 10 terabytes should be easy (expensive but it can be done).

https://www.forbes.com/sites/aarontilley/2017/05/16/hpe-160-terabytes-memory/#4cca67c6383f

I'm sorry, friend, but this is a pool of many identical matrices ,not one, so it's not gonna work.

[mrxtraf]

On first machine (600GB RAM):

Code:

Check bit = 90 only, pubkey is:
035c38bd9ae4b10e8a250857006f3cfd98ab15a6196d9f4dfd25bc7ecc77d788d5
Build Hash, MEM size = 384GB

On second machine (80GB RAM):

Code:

Check bit = 90 only, pubkey is:
035c38bd9ae4b10e8a250857006f3cfd98ab15a6196d9f4dfd25bc7ecc77d788d5
Build Hash, MEM size = 64GB
Search bits = 90
Search Keys....  from 20000000000000000000000 to 3ffffffffffffffffffffff

... and nothing changes from two days on both machines.
Something is wrong?
Am I to understand that no more changes are expected in these processes?

Can someone modify the code in such a way that the process is visible (along with the percentage)?

After string

Code:

for (uint64_t i = 1; i < GSTEP; i++) {

insert

Code:

if(i%1000000==0){
     time_t tt = time(NULL);
     tim = localtime(&tt);
     printf("%d:%d:%d Loop generate %zu from %zu, %g%% \n", tim->tm_hour, tim->tm_min, tim->tm_sec, i, GSTEP, (double)(i/(GSTEP/100)));
}

showed percentage at generated array. Where 1000000 each showed. May changed.

After string

Code:

for (uint64_t i = skip; i < g_max; i++) {

Insert

Code:

if(i%10000000==0){
            
            time_t tt = time(NULL);
            tim = localtime(&tt);
            uint64_t real_i = i - skip;
            uint64_t real_diff = g_max - skip;
            printf("%d:%d:%d Search in %zu from start %zu end %zu, real_i:%zu \t \t real_diff:%zu \tPercent %g%% \n", tim->tm_hour, tim->tm_min, tim->tm_sec, i, skip, g_max, real_i, real_diff, (double)(real_i/(real_diff/100)));
        }

showed percentage each 10000000 try searched.