Pollard's kangaroo ECDLP solver

[fxsniper]

I pushed my little public key gathering script to github if anybody wants it!

https://github.com/GonzoTheDev/BitcoinPublicKeyGrabber

Could you help to write script to save output to csv collect?

Can blockchain.info use for get data massive over 100k address without get ban ip address?

[MeBender]

I pushed my little public key gathering script to github if anybody wants it!

https://github.com/GonzoTheDev/BitcoinPublicKeyGrabber

Could you help to write script to save output to csv collect?

Can blockchain.info use for get data massive over 100k address without get ban ip address?

Yep I updated my program so that it saves all the public keys to a txt file

And I've been running it all day with no limits from blockchain.com so I think for that specific api call there are no limits, but I could be wrong!

[fxsniper]

Yep I updated my program so that it saves all the public keys to a txt file

And I've been running it all day with no limits from blockchain.com so I think for that specific api call there are no limits, but I could be wrong!

Thank you

Script it is work as well, I try already.

problem  Pollard's kangaroo ECDLP solver can use with only public key
and public key have only bitcoin address that have transaction

people know about this already, people smart to move bitcoin to new address that not have any transaction
and use new bitcoin address (segwit) not show public key , it have legacy only show public key

[MeBender]

Yep I updated my program so that it saves all the public keys to a txt file

And I've been running it all day with no limits from blockchain.com so I think for that specific api call there are no limits, but I could be wrong!

Thank you

Script it is work as well, I try already.

problem  Pollard's kangaroo ECDLP solver can use with only public key
and public key have only bitcoin address that have transaction

people know about this already, people smart to move bitcoin to new address that not have any transaction
and use new bitcoin address (segwit) not show public key , it have legacy only show public key

I dunno man, so far I've gathered about 20,000 pubkeys to addresses that still have over 6 btc on them. I'm going to run them in the pollard kangaroo program in the keyspace 1 - 2^69 ( ͡° ͜ʖ ͡°) and possibly will find a private key in the low bit range! But the chances that anyone is legitimately using a private key in a keyspace less than 2^128 is pretty slim..

[NotATether]

I dunno man, so far I've gathered about 20,000 pubkeys to addresses that still have over 6 btc on them. I'm going to run them in the pollard kangaroo program in the keyspace 1 - 2^69 ( ͡° ͜ʖ ͡°) and possibly will find a private key in the low bit range! But the chances that anyone is legitimately using a private key in a keyspace less than 2^128 is pretty slim..

If you still want to go along with this then I suggest not letting it run for more than a day, because you're looking for private keys with 59 leading zero bits in them. Chances are if these addresses have a seed phrase associated with them, neither it's master private key or any of its child keys were derived in a way such that there are several zero bits at the beginning.

Maybe use a random prefix that has a mixture of 1s and 0s which is more likely to hit than all zeros.

[MeBender]

I dunno man, so far I've gathered about 20,000 pubkeys to addresses that still have over 6 btc on them. I'm going to run them in the pollard kangaroo program in the keyspace 1 - 2^69 ( ͡° ͜ʖ ͡°) and possibly will find a private key in the low bit range! But the chances that anyone is legitimately using a private key in a keyspace less than 2^128 is pretty slim..

If you still want to go along with this then I suggest not letting it run for more than a day, because you're looking for private keys with 59 leading zero bits in them. Chances are if these addresses have a seed phrase associated with them, neither it's master private key or any of its child keys were derived in a way such that there are several zero bits at the beginning.

Maybe use a random prefix that has a mixture of 1s and 0s which is more likely to hit than all zeros.

Yeah I gave up on that after an hour lol

Here's an interesting random fact about puzzle address #120, in one whole day a Tesla V100 GPU can search 0.00000001% of the keyspace using the pollard kangaroo software. That is equal to approx. 2^93..

[fxsniper]

Yeah I gave up on that after an hour lol

Here's an interesting random fact about puzzle address #120, in one whole day a Tesla V100 GPU can search 0.00000001% of the keyspace using the pollard kangaroo software. That is equal to approx. 2^93..

How long need for puzzle #120 address?
I will try you method tonight with 8 hour for check result test

[fxsniper]

I think only puzzle that easy to crack because puzzle create by using low bit with allow to crack

Reference bitcoin version 0.1 or alpha version start to use key 256 bit from first-time
That possible to not easy to crack it

[bigvito19]

Y'all already know all the other keys are in 2^128, thinking otherwise is a waste of time.

[fxsniper]

Y'all already know all the other keys are in 2^128, thinking otherwise is a waste of time.

I think human create bitcoin. (bitcoin create by human, not god) so human can possible crack bitcoin. possible in future (but now for now)

science, research project will be not give up (if can solve bitcoin, they will be got bit-name and famous right) PhD etc.
some part will be continue crack bitcoin and give some news to surprise when crack it done
it not waste of time.

I believe bitcoin just starter and on early stats or just proof of concept on first generation. (so next generation bitcoin will be perfect and powerful more than now)

money can not destroy bitcoin and bitcoin value never zero
only way can destroy bitcoin is crack private key
some government possible to try crack bitcoin (may be)

I think future bitcoin original will be upgrade or change network when quantum computer is coming
of Course bitcoin may be change to quantum bitcoin or gigabit bitcoin or high enough can not crack for 50 year

sorry for of topic

may be can see Pollard's kangaroo ECDLP solver + plus new technic or mix other algorithm to solve brute-forcing better

[bigvito19]

Y'all already know all the other keys are in 2^128, thinking otherwise is a waste of time.

may be can see Pollard's kangaroo ECDLP solver + plus new technic or mix other algorithm to solve brute-forcing better

That would be the next step then.

[WanderingPhilospher]

I dunno man, so far I've gathered about 20,000 pubkeys to addresses that still have over 6 btc on them. I'm going to run them in the pollard kangaroo program in the keyspace 1 - 2^69 ( ͡° ͜ʖ ͡°) and possibly will find a private key in the low bit range! But the chances that anyone is legitimately using a private key in a keyspace less than 2^128 is pretty slim..

If you still want to go along with this then I suggest not letting it run for more than a day, because you're looking for private keys with 59 leading zero bits in them. Chances are if these addresses have a seed phrase associated with them, neither it's master private key or any of its child keys were derived in a way such that there are several zero bits at the beginning.

Maybe use a random prefix that has a mixture of 1s and 0s which is more likely to hit than all zeros.

Yeah I gave up on that after an hour lol

Here's an interesting random fact about puzzle address #120, in one whole day a Tesla V100 GPU can search 0.00000001% of the keyspace using the pollard kangaroo software. That is equal to approx. 2^93..

How did you come up with that math?  I came up with .0000000000000000000000021% for percentage. (but it's early and I may be off)

But here is match for V100; it checks (by jumping) 138,240,000,000,000 points(keys) for a distinguished bit, per day. 1600 Mkey/s * 60*60*24 .
2^93 = 9,903,520,314,283,042,199,192,993,792

[WanderingPhilospher]

Yeah I gave up on that after an hour lol

Here's an interesting random fact about puzzle address #120, in one whole day a Tesla V100 GPU can search 0.00000001% of the keyspace using the pollard kangaroo software. That is equal to approx. 2^93..

How long need for puzzle #120 address?
I will try you method tonight with 8 hour for check result test

Expected time: ~2 months running 256 Tesla V100s, 24 hours/7 days a week.

[MeBender]

I dunno man, so far I've gathered about 20,000 pubkeys to addresses that still have over 6 btc on them. I'm going to run them in the pollard kangaroo program in the keyspace 1 - 2^69 ( ͡° ͜ʖ ͡°) and possibly will find a private key in the low bit range! But the chances that anyone is legitimately using a private key in a keyspace less than 2^128 is pretty slim..

If you still want to go along with this then I suggest not letting it run for more than a day, because you're looking for private keys with 59 leading zero bits in them. Chances are if these addresses have a seed phrase associated with them, neither it's master private key or any of its child keys were derived in a way such that there are several zero bits at the beginning.

Maybe use a random prefix that has a mixture of 1s and 0s which is more likely to hit than all zeros.

Yeah I gave up on that after an hour lol

Here's an interesting random fact about puzzle address #120, in one whole day a Tesla V100 GPU can search 0.00000001% of the keyspace using the pollard kangaroo software. That is equal to approx. 2^93..

How did you come up with that math?  I came up with .0000000000000000000000021% for percentage. (but it's early and I may be off)

But here is match for V100; it checks (by jumping) 138,240,000,000,000 points(keys) for a distinguished bit, per day. 1600 Mkey/s * 60*60*24 .
2^93 = 9,903,520,314,283,042,199,192,993,792

Oh it says what the keyspace size is when you start the program but it must be wrong, I didn't actually calculate it myself

[WanderingPhilospher]

Oh it says what the keyspace size is when you start the program but it must be wrong, I didn't actually calculate it myself

It does tell you the range width (keyspace search size) and the expected operations. The range width is spot on, the expected operations is a guesstimated "expected" amount of operations to perform to solve the key.

[MeBender]

Look: https://i.imgur.com/6aC3Rw8.png

[fxsniper]

Look: https://i.imgur.com/6aC3Rw8.png

https://i.imgur.com/vEUcFv8l.jpg

How expensive for buy one?

Are you AI. research or AI. Developer?
most people use high-end CUDA card work on AI. Training

buy one for use personal?

[MeBender]

Look: https://i.imgur.com/6aC3Rw8.png

https://i.imgur.com/vEUcFv8l.jpg

How expensive for buy one?

Are you AI. research or AI. Developer?
most people use high-end CUDA card work on AI. Training

buy one for use personal?

Google cloud gave me €200 free credit and 1 GPU to try, I'm only in 1st year of computer science though so not a researcher or anything

[WanderingPhilospher]

Look: https://i.imgur.com/6aC3Rw8.png

What am I looking at? That is the correct range.

A 120 range, or really, the search range is 2^119 would be 800000000000000000000000000000:FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF

The range you have entered in your input file is a 2^93 range. The first 6 characters are the same in your start and stop range; C3F250. They basically zero each other out. And your next characters are a 2 in the start and a 3 in the stop. All that together equals a 2^93 search range.

Edit: Also, by searching a subrange of 2^93, you may get lucky, but to search entire 2^119 via 2^93 range searches, you will have to search 2^26 (67,108,864) ranges to have searched the entire 2^119 range.

[mamuu]

Hi, Everyone

Test function in this main.cpp file
The file is running with CPU.
How can I run it with the GPU?

Code:

/*
 * This file is part of the BSGS distribution (https://github.com/JeanLucPons/Kangaroo).
 * Copyright (c) 2020 Jean Luc PONS.
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, version 3.
 *
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <iostream>
#include "Kangaroo.h"
#include "Timer.h"
#include "SECPK1/SECP256k1.h"
#include "GPU/GPUEngine.h"
#include <fstream>
#include <string>
#include <string.h>
#include <stdexcept>
#include <sstream>

#include <thread>
using namespace std;

#define CHECKARG(opt,n) if(a>=argc-1) {::printf(opt " missing argument #%d\n",n);exit(0);} else {a++;}


int getInt(string name, char* v) {

    int r;

    try {

        r = std::stoi(string(v));

    }
    catch (std::invalid_argument&) {

        printf("Invalid %s argument, number expected\n", name.c_str());
        exit(-1);

    }

    return r;

}

double getDouble(string name, char* v) {

    double r;

    try {

        r = std::stod(string(v));

    }
    catch (std::invalid_argument&) {

        printf("Invalid %s argument, number expected\n", name.c_str());
        exit(-1);

    }

    return r;

}

// ------------------------------------------------------------------------------------------

void getInts(string name, vector<int>& tokens, const string& text, char sep) {

    size_t start = 0, end = 0;
    tokens.clear();
    int item;

    try {

        while ((end = text.find(sep, start)) != string::npos) {
            item = std::stoi(text.substr(start, end - start));
            tokens.push_back(item);
            start = end + 1;
        }

        item = std::stoi(text.substr(start));
        tokens.push_back(item);

    }
    catch (std::invalid_argument&) {

        printf("Invalid %s argument, number expected\n", name.c_str());
        exit(-1);

    }

}
// ------------------------------------------------------------------------------------------

// Default params
static int dp = -1;
static int nbCPUThread;
static string configFile = "";
static bool checkFlag = false;
static bool gpuEnable = false;
static vector<int> gpuId = { 0 };
static vector<int> gridSize;
static string workFile = "";
static string checkWorkFile = "";
static string iWorkFile = "";
static uint32_t savePeriod = 60;
static bool saveKangaroo = false;
static bool saveKangarooByServer = false;
static string merge1 = "";
static string merge2 = "";
static string mergeDest = "";
static string mergeDir = "";
static string infoFile = "";
static double maxStep = 0.0;
static int wtimeout = 3000;
static int ntimeout = 3000;
static int port = 17403;
static bool serverMode = false;
static string serverIP = "";
static string outputFile = "";
static bool splitWorkFile = false;

//Mamu
Secp256K1 secp256k1;
int nbGPUThread;
uint64_t totalRW;
uint64_t counters[256];
int CPU_GRP_SIZE = 1024;

void TestFunc(string ScalarInput)
{

    Int i;
    char* c = const_cast<char*>(ScalarInput.c_str()); //*****************************************************************************************************
    i.SetBase10(c);

    while (true)
    {
        i.AddOne();
        Point aa = secp256k1.ComputePublicKey(&i);

        string PointaX = aa.x.GetBase10();
        string PointaY = aa.y.GetBase10();

        Int s(secp256k1.order);
        s.Sub(&i);
        Point bb = secp256k1.ComputePublicKey(&s);

        string PointbX = bb.x.GetBase10();
        string PointbY = bb.y.GetBase10();

        string num1 = i.GetBase10();
        string num2 = s.GetBase10();

        string Result1 = num1 + " = " + PointaX + " : " + PointaY + "\n";
        string Result2 = num2 + " = " + PointbX + " : " + PointbY + "\n";

        cout << Result1 << "\n";
        cout << Result2 << "\n";




    }
}

void main()
{
    secp256k1.Init();
    cout << "Working..." << "\n";

    string ScalarInput;
    printf("\n\tStart Number : ");

    cin >> ScalarInput;
    TestFunc(ScalarInput);




}