Puzzle 160 @ 1 Megakeys/s  (10^6):      23171956451847141650870193314248525 years
Puzzle 160 @ 1 Gigakeys/s  (10^9):      23171956451847141650870193314248 years
Puzzle 160 @ 1 Terakeys/s  (10^12):     23171956451847141650870193314 years
Puzzle 160 @ 1 Petakeys/s  (10^15):     23171956451847141650870193 years
Puzzle 160 @ 1 Exakeys/s  (10^18):      23171956451847141650870 years
Puzzle 160 @ 1 Zettakeys/s  (10^21):    23171956451847141650 years
Puzzle 160 @ 1 Yottakeys/s  (10^24):    23171956451847141 years

albertobsd $ cat test.txt
039c069f5b3d1e4ac53e7c93b4b9cbc2a8b520ad25b227ecd5222f5f73e7ef8c92 # 90000000000000000000f000000000
02b33f524226b0db26cb8bcb2b374100bd1b3e07900f0be5402d1277e80d392479 # 90000000000000000000000f000000
028445b96038e322d51c173b19f3def3113e228d948fbaa0d4ebe6fdf1f21f834d # 900000000000000000000f00000000
albertobsd $ ./keyhunt -m bsgs -f test.txt -r 900000000000000000000000000000:900000000000000010000000000000 -k 128 -S -q
[+] Version 0.2.211117 SSE Trick or treat ¡Beta!, developed by AlbertoBSD
[+] K factor 128
[+] Quiet thread output
[+] Mode BSGS secuential
[+] Opening file test.txt
[+] Added 3 points from file
[+] Range
[+] -- from : 0x900000000000000000000000000000
[+] -- to   : 0x900000000000000010000000000000
[+] N = 0x100000000000
[+] Bloom filter for 536870912 elements : 1840.33 MB
[+] Bloom filter for 16777216 elements : 57.51 MB
[+] Bloom filter for 524288 elements : 1.80 MB
[+] Allocating 8.00 MB for 524288 bP Points
[+] Reading bloom filter from file keyhunt_bsgs_4_536870912.blm .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_6_16777216.blm .... Done!
[+] Reading bP Table from file keyhunt_bsgs_2_524288.tbl .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_7_524288.blm .... Done!
[+] Thread Key found privkey 90000000000000000000000f000000
[+] Publickey 02b33f524226b0db26cb8bcb2b374100bd1b3e07900f0be5402d1277e80d392479

End

021fc9e584dc824cb5b566bb7125aef1e31c95fb2fbabc7c315686b3c211d69ed8 # 90000000000000000000f000000001
02df23c15df7b3ba9fdb14fd5a994d7ba4c694f172ddf3f644fb47b4b399e214bb # 90000000000000000000000f000001
03e3a37d2332821cfe5ca644b26d640a707497870298e084c443d94670b00c5552 # 900000000000000000000f00000001

albertobsd $ ./keyhunt -m bsgs -f test1.txt -r 900000000000000000000000000000:900000000000000010000000000000  -S  -k 128 -q
[+] Version 0.2.211117 SSE Trick or treat ¡Beta!, developed by AlbertoBSD
[+] K factor 128
[+] Quiet thread output
[+] Mode BSGS secuential
[+] Opening file test1.txt
[+] Added 3 points from file
[+] Range
[+] -- from : 0x900000000000000000000000000000
[+] -- to   : 0x900000000000000010000000000000
[+] N = 0x100000000000
[+] Bloom filter for 536870912 elements : 1840.33 MB
[+] Bloom filter for 16777216 elements : 57.51 MB
[+] Bloom filter for 524288 elements : 1.80 MB
[+] Allocating 8.00 MB for 524288 bP Points
[+] Reading bloom filter from file keyhunt_bsgs_4_536870912.blm .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_6_16777216.blm .... Done!
[+] Reading bP Table from file keyhunt_bsgs_2_524288.tbl .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_7_524288.blm .... Done!
[+] Thread Key found privkey 90000000000000000000f000000001
[+] Publickey 021fc9e584dc824cb5b566bb7125aef1e31c95fb2fbabc7c315686b3c211d69ed8
[+] Thread Key found privkey 90000000000000000000000f000001
[+] Publickey 02df23c15df7b3ba9fdb14fd5a994d7ba4c694f172ddf3f644fb47b4b399e214bb
[+] Thread Key found privkey 900000000000000000000f00000001
[+] Publickey 03e3a37d2332821cfe5ca644b26d640a707497870298e084c443d94670b00c5552
All points were found

-n 0x40000000 

-n 0x1000000

-n 0x100000000000

/*
  gcc -o k1_solver k1_solver.c -lgmp
*/

#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <gmp.h>
#include <time.h>
#include <string.h>

struct Point {
	mpz_t x;
	mpz_t y;
};

struct Elliptic_Curve {
	mpz_t p;
	mpz_t n;
};

struct Elliptic_Curve EC;
const char *EC_constant_N = "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141";

void calculate_pvk(mpz_t pvk,mpz_t r_inv,mpz_t s,mpz_t z,mpz_t k);

int main()  {
	mpz_t z1,z2,r2,r1,s1,s2,k1,k2;
	mpz_t a,b,c,d,e,f,r1_inv,r2_inv,f_inv;
	mpz_t pvk_calulated;
	
	mpz_init_set_str(EC.n, EC_constant_N, 16);
	/* Set the R S Z values of the first TX */
	mpz_init_set_str(r1,"42c995eb98c38a8f3de7dde0f5ac63a67441a7e96b821f53931495bc6ea64cb0",16);
	mpz_init_set_str(s1,"35a526e609d7022249d46d2392ff7e66b11a303d137204eb909867ae272c24b1",16);
	mpz_init_set_str(z1,"c8d3c14a3b190b6ea53ce4317fdd51ca1cf1a235dffbc3ce566507061f901a5a",16);
	/* Set the R S Z values of the second TX */
	mpz_init_set_str(r2,"4f8bfa709c788b2ed59dd44a16e0c7b22ca7dece56d27144d418577a38b1d0d2",16);
	mpz_init_set_str(s2,"096f65fa2a2c6c054b12981c42b0aece4ac861632a2900ced39070f0dd2e86e1",16);
	mpz_init_set_str(z2,"57b1d4f6111f1dd7b87db91931682bad285aa2587c6239f7d3beb319ff2e0834",16);

	/*Init variables GMP stuff */
	mpz_init(pvk_calulated);
	mpz_init(r1_inv);
	mpz_init(r2_inv);
	mpz_init(a);
	mpz_init(b);
	mpz_init(c);
	mpz_init(d);
	mpz_init(e);
	mpz_init(f);	
	mpz_init(k1);
	mpz_init(k2);
		
	/*This Operations are based in the suposition that k2 = 2 * k1 mod n   */
	/* calcualte the r1 and r2 Invert*/
	mpz_invert(r1_inv,r1,EC.n);	// r1_inv = 1/r1
	mpz_invert(r2_inv,r2,EC.n); // r2_inv = 1/r2
	
	mpz_mul(a,z1,r1_inv);	//	a = z1 * r1_inv
	mpz_mul(b,z2,r2_inv);	//	b = z2 * r2_inv
	mpz_sub(c,a,b);			//	c = a - b
	
	
	mpz_mul(d,r1_inv,s1);	// d = r1_inv * s1

	mpz_mul(e,r2_inv,s2);	// e = r2_inv * s2
	mpz_mul_ui(e,e,2);		// e = 2 * e
	
	mpz_sub(f,d,e);			// f = d - f
	
	mpz_invert(f_inv,f,EC.n);	// f_inv = 1/f
	
	mpz_mul(k1,f_inv,c);	// k1 = f_inv * c
	mpz_mod(k1,k1,EC.n);	// k1 = k1 mod n	
	
	gmp_printf("k1: %Zx\n",k1);
	mpz_mul_ui(k2,k1,2);	// k2 = 2 * k1
	mpz_mod(k2,k2,EC.n);	// k2 = k2 mod n
	gmp_printf("k2: %Zx\n",k2);
	
	/* Calculate the pvk with the set of values of the first TX */
	calculate_pvk(pvk_calulated,r1_inv,s1,z1,k1);
	gmp_printf("pvk_calulated: %Zx\n",pvk_calulated);

	/* Calculate the pvk with the set of values of the second TX */
	calculate_pvk(pvk_calulated,r2_inv,s2,z2,k2);
	gmp_printf("pvk_calulated: %Zx\n",pvk_calulated);
}

void calculate_pvk(mpz_t pvk,mpz_t r_inv,mpz_t s,mpz_t z,mpz_t k)	{
	mpz_t a,b;
	mpz_init(a);
	mpz_init(b);
	mpz_set(a,k);
	mpz_mul(a,a,s);
	mpz_mul(a,a,r_inv);
	mpz_set(b,r_inv);
	mpz_mul(b,b,z);
	mpz_sub(a,a,b);
	mpz_mod(a,a,EC.n);
	mpz_set(pvk,a);
	mpz_clear(a);
	mpz_clear(b);
}

Puzzle 61 @ 1 Megakeys/s  (10^6):       36558 years
Puzzle 61 @ 1 Gigakeys/s  (10^9):       36 years

Puzzle 62 @ 1 Megakeys/s  (10^6):       73117 years
Puzzle 62 @ 1 Gigakeys/s  (10^9):       73 years

Puzzle 63 @ 1 Megakeys/s  (10^6):       146235 years
Puzzle 63 @ 1 Gigakeys/s  (10^9):       146 years

Puzzle 64 @ 1 Megakeys/s  (10^6):       292471 years
Puzzle 64 @ 1 Gigakeys/s  (10^9):       292 years