== Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED==

[nomachine]

I don't know what I haven't tried because there are so many attempts. I don't remember everything. Years have passed in this.
I started dreaming at night about WIFs ending so....

This  script calculates the common prefixes of the first 42 characters among Bitcoin private keys in a specified range.
It then lists the private keys and prints the top 10 most similar common prefixes in reverse order (longest to shortest).
start = 67079069358943824031
end =  69594534459904217431
Start and end sets the range of private keys (start and end values) and the number of parts to divide the range into (num_parts = 9).
You can adjust these values as you see fit.

Common Prefix: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa5
Part 1 67079069358943824031 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa5Dno9kZYi4bZLVzbZF
Part 2 67358565481272756631 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa5YXcS8wxDr233cNfFe
Part 3 67638061603601689231 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa5sGRiXLMjdSWjJrHgT
Part 4 67917557725930621831 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa6C1EzuimFQrzXCYipU
Part 5 68197053848259554431 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa6Wk4HJ7AmCHUHd6pi7
Part 6 68476549970588487031 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa6qUsZgVaGyhx259cDB
Part 7 68756046092917419631 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa7ADgr4synm8RiEbUHW
Part 8 69035542215246352231 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa7UxW8TGPJYYuQ9jo4j
Part 9 69315038337575284831 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa7ohKQqenpKyP9CM47x

Top 10 Most Similar Prefixes (in reverse order):
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa7
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa7
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa6
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa6
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa5
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa5
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa7ohKQqen

Code:

import secp256k1 as ice

def find_common_prefix(start, end, num_parts):
    part_size = (end - start) // num_parts
    common_prefixes = []

    for i in range(num_parts):
        start_dec = start + i * part_size
        end_dec = start + (i + 1) * part_size - 1

        start_hex = "%064x" % start_dec
        start_wif = ice.btc_pvk_to_wif(start_hex)  # Compressed WIF

        if not common_prefixes:
            common_prefixes.append(start_wif[:42])
        elif start_wif.startswith(common_prefixes[-1]):
            continue
        else:
            # Adjust common_prefixes to match the longest common prefix
            for j in range(42):
                if start_wif[j] != common_prefixes[-1][j]:
                    common_prefixes[-1] = common_prefixes[-1][:j]
                    break
            common_prefixes.append(start_wif[:42])

    return common_prefixes

def calculate_puzzle_parts():
    start = 67079069358943824031
    end =  69594534459904217431
    num_parts = 9

    common_prefixes = find_common_prefix(start, end, num_parts)
    print("Common Prefix:", common_prefixes[0])

    part_size = (end - start) // num_parts
    for i in range(num_parts):
        start_dec = start + i * part_size
        end_dec = start + (i + 1) * part_size - 1

        start_hex = "%064x" % start_dec
        start_wif = ice.btc_pvk_to_wif(start_hex)  # Compressed WIF

        print(f"Part {i + 1}", start_dec, start_wif)

    print("\nTop 10 Most Similar Prefixes (in reverse order):")
    sorted_prefixes = sorted(common_prefixes, key=lambda prefix: len(prefix), reverse=True)
    for i in range(len(sorted_prefixes)-1, len(sorted_prefixes)-num_parts-1, -1):
        print(sorted_prefixes[i])

calculate_puzzle_parts()

[1714637191]

1714637191

[1714637191]

1714637191

[MrlostinBTC]

https://github.com/BTC-HUB-GROUP/PubHunt

Is anyone sure this even works?

When its running it reports bits, every bit the amount of computations double for the next required bit increase. Does this mean when its at 50bit its only scanning in the 50 bit range?

Code seems simple and maybe dare I say fun.

[10:06:53] [GPU: 1538.03 MH/s] [T: 56,831,443,468,288 (46 bit)] [F: 0] 
[23:34:41] [GPU: 1520.21 MH/s] [T: 131,355,736,276,992 (47 bit)] [F: 0] 
[25:18:46] [GPU: 1528.59 MH/s] [T: 140,840,802,451,456 (48 bit)] [F: 0] 
[35:49:31] [GPU: 1540.13 MH/s] [T: 199,668,382,302,208 (48 bit)] [F: 0] 
[57:20:31] [GPU: 1528.60 MH/s] [T: 320,320,640,647,168 (49 bit)] [F: 0] 
[70:41:51] [GPU: 1561.09 MH/s] [T: 394,940,412,592,128 (49 bit)] [F: 0] 
[82:02:23] [GPU: 1568.43 MH/s] [T: 458,789,262,196,736 (49 bit)] [F: 0] 
[96:37:41] [GPU: 1425.79 MH/s] [T: 539,854,018,445,312 (49 bit)] [F: 0] 
[105:48:12] [GPU: 1512.86 MH/s] [T: 591,400,085,225,472 (50 bit)] [F: 0] 
[118:24:29] [GPU: 1517.04 MH/s] [T: 661,610,855,137,280 (50 bit)] [F: 0] 
[144:26:15] [GPU: 1534.88 MH/s] [T: 806,676,613,562,368 (50 bit)] [F: 0] 
[168:04:28] [GPU: 1520.20 MH/s] [T: 939,011,786,932,224 (50 bit)] [F: 0] 
[168:38:10] [GPU: 1510.77 MH/s] [T: 942,101,864,906,752 (50 bit)] [F: 0] 
[191:30:27] [GPU: 1529.64 MH/s] [T: 1,070,122,592,632,832 (50 bit)] [F: 0] 
[191:33:19] [GPU: 1516.01 MH/s] [T: 1,070,385,508,384,768 (50 bit)] [F: 0] 

[momofukku]

well.

what is best for finding  between 63 and 64 bit privatekey when I know public key.

what is the time from start to find?

what is good for cpu and GPU? and can you share link to github?

I mean better pollard or bsgs?

here link how install pollard on vast.ai https://www.youtube.com/watch?v=1BHNer9dZ_M

Howdy y'all I just wanted to thank you all who checked out the youtube video I made last year on using vast.ai
I saw that I had like over 1k views and was surprised there was so much interest. Thank you bitcointalk! I caved after almost decade and finally made an account to share what i've been up to.

Anyways, I was really disgusted with the quality of that video so I went and made a better version that is quite fool proof. Here is the link https://youtu.be/bBOLZnFbEOc

In the video I use an Nvidia H100 and it floats around 3500 mk/s

In order to use the H100 I forked the Jean Luc Pons Kangaroo with a new Makefile that works with newer compiler versions. I am running it on cudcuda:12.0.1-devel-ubuntu20.04. g++4.8 no more. My github is https://github.com/momofukku/Kangaroo2

Yo I saw back early April they 10x'd the prizes! Super cool! Now lets try'n find entropy patterns.

Since its my first post but i've been on this site for ever I must end by shouting out gmaxwell omg dude is a legend! Talk about standing on the shoulder of giants!

~one love

Edit: sorry ripemdhash I forgot to try to answer your question. Pretty sure 63 to 64 was solved last September. I saw it guesstimated you have about a 2^10 higher probability of using pollard rho theory opposed to brute forcing. Idk if thats accurate but i'm convinced brute forcing isn't the way.
The best GPU's going right now are probably the H100 and the RTX6000 ADA. Without the proper mathematics all the computer power in the world is just wasted energy so if your gonna shell out the money to run clusters make sure your math is on point =D Thank you for sharing my video!

[678AFDB0]

Hey,

Thanks for the video, really informative!

In the video I use an Nvidia H100 and it floats around 3500 mk/s

Is that card really that slow ? For 35k USD i expected much more.

Without the proper mathematics all the computer power in the world is just wasted energy so if your gonna shell out the money to run clusters make sure your math is on point =D

Also one other thing not mentioned often, but when you run large clusters, you need to make sure no mistakes can happen, so you either underclock/undervolt the chips/gpus/fpgas/whatever or repeat chunks around, etc. Imagine running whole floor of machines for few months and one machine craps out on the chunk with the winning key ;(

[momofukku]

Hey,

Thanks for the video, really informative!

In the video I use an Nvidia H100 and it floats around 3500 mk/s

Is that card really that slow ? For 35k USD i expected much more.

Without the proper mathematics all the computer power in the world is just wasted energy so if your gonna shell out the money to run clusters make sure your math is on point =D

Also one other thing not mentioned often, but when you run large clusters, you need to make sure no mistakes can happen, so you either underclock/undervolt the chips/gpus/fpgas/whatever or repeat chunks around, etc. Imagine running whole floor of machines for few months and one machine craps out on the chunk with the winning key ;(

Your welcome =D I hope it can help get more people to test the integrity of the blockchain & bring a bit of awareness to how it functions.

I think there are a number of huge optimizations that could be made to increase the mk/s for the H100's but it would require some changes to the .cu files & headers & whatnot which is over my head haha. I'm definitely gonna play around anyways. All of that bandwidth & memory is not being leveraged properly most dolphinately.

So many questions come to my mind when you brought up failures when running clusters. Would you be able to use the save work function to recover? I wonder what types of redundancies could be put in place, like you mentioned underclocking/volting. From what I was just reading when they trained Bloom 176b LLM they had some failure issues too. I was just reading their paper on the model so i'll copy paste what they were saying:

 "During training, we faced issues with hardware failures: on average, 1–2 GPU failures
occurred each week. As backup nodes were available and automatically used, and checkpoints were saved every three hours, this did not affect training throughput significantly."

They were using 384 NVIDIA A100 80GB GPUs (48 nodes) with 32 spare GPUs for about 3 & a half months! Trained on nuclear energy which is awesome too.

[tgfx]

I have other question. I want for fun reduce puzzle key #125 to total of 100 bits. Can anyone tell me the steps? AND tell me if this is actually possible? lol..

I know i will land on tons new pub keys but is there a program that reduce bits ?

you can try fraction-bsgs or fraction-kangaroo it do what you need.
Step1 substruct range begin from public key
Step2 devide G by 2^24, it will be fraction
Step3 devide public key by 2^24, it was first public key to serach in range 1.. 2^100
Step4 substuct fraction from first public key , it wil be second public key to search
Step5 substruct fraction from second public key.......

In simple numbers how it work. For ex. our desired key is 379 that lie in range 2^9
We want search in range 2^6=64,  divisor is 2^3=8
Devide 379/8 = 47,375
fraction = 1/8 = 0,125

Stage 0 search 47,375 in range 2^6 => result negative
Stage 1 subtract from it 0,125 => 47.25, search  in range 2^6 => result negative.
Stage 2 subtract from it 0,125 => 47.125, search  in range 2^6 => result negative.
Stage 3 subtract from it 0,125 => 47, search  in range 2^6 => result positive.
So now we need multiply 47 by divisor 2^3=8 = 376 and add stage number =>376 +3 = 379
Desired key 379 founded in 3 stage of 8

From myself that if you are not lucky, then this is a bad idea, very bad idea.
With kangaroo puzzle#125 need +/- 2^63 op.
With division you will have 2^24 public keys with search range 2^100 that need 2^51 op (maxstep 2) for every pub.
Total 2^24*2^51=2^75 op  and this is not a guarantee that the key will be found due to maxstep.

it still sounds complicated, you can use the example of 130 puzzles to write commands on how to break it into parts, and what command to look for in each part.

[678AFDB0]

Hey,

Thanks for the video, really informative!

In the video I use an Nvidia H100 and it floats around 3500 mk/s

Is that card really that slow ? For 35k USD i expected much more.

Without the proper mathematics all the computer power in the world is just wasted energy so if your gonna shell out the money to run clusters make sure your math is on point =D

Also one other thing not mentioned often, but when you run large clusters, you need to make sure no mistakes can happen, so you either underclock/undervolt the chips/gpus/fpgas/whatever or repeat chunks around, etc. Imagine running whole floor of machines for few months and one machine craps out on the chunk with the winning key ;(

Your welcome =D I hope it can help get more people to test the integrity of the blockchain & bring a bit of awareness to how it functions.

I think there are a number of huge optimizations that could be made to increase the mk/s for the H100's but it would require some changes to the .cu files & headers & whatnot which is over my head haha. I'm definitely gonna play around anyways. All of that bandwidth & memory is not being leveraged properly most dolphinately.

So many questions come to my mind when you brought up failures when running clusters. Would you be able to use the save work function to recover? I wonder what types of redundancies could be put in place, like you mentioned underclocking/volting. From what I was just reading when they trained Bloom 176b LLM they had some failure issues too. I was just reading their paper on the model so i'll copy paste what they were saying:

 "During training, we faced issues with hardware failures: on average, 1–2 GPU failures
occurred each week. As backup nodes were available and automatically used, and checkpoints were saved every three hours, this did not affect training throughput significantly."

They were using 384 NVIDIA A100 80GB GPUs (48 nodes) with 32 spare GPUs for about 3 & a half months! Trained on nuclear energy which is awesome too.

Really crazy what they did with AI and those top end video cards! Still not much changed in the last 15 years - ATI5970, 3200 cores at 800 Mhz,
today top card, only 5-6 times that, with double the frequency, and 20x times the cost. Ok, it has crazy amount of RAM and bandwidth, i am sure
it is important for harvesting people private data, too bad is not much use for us. I honestly believed some 20 years ago when trying to bruteforce
a TEA key(only 8 bytes), that in the future we will be able to flip 64 bits in a second with ease.

The biggest cluster i have personally run was only 20 video cards(10 machines), a friend run like 1500 cards, and that was a nightmare to maintain.

As for scaling up, the only option is to have some kind of server/arbiter/job manager, written in higher language that splits the keyspace into very
small chunks that serve to nodes for crunching, and then verify, barely trust the results. Because hw tricks are simply not enough if you'll be drawing MW from the power grid and pay people to maintain your racks.

[digaran]

Can anyone here write a fast python  script to do the following?

We'd provide it with target public key and then it divides it by 2 but then adds n/2 to the result and divides the result by 2, however we would want to keep all the generated keys keys, nothing should be discarded.

Example of what we want the script do :

Target : p1
0291b418fd1778356ce947a5cbb46539fd29842aea168486fae91fc5317177a575

Divide by 2 = p2
02239883d26ec1fc3a513e5cc1a93975d1e4ea9850271e88a36520cd3e4eaed7d0

Adding n/2 to p2 = p3
02a714beab8015a2cdffddd772360115ddec59aa4ddf0f8fe968afd1723b576744

Dividing p3 by 2 = p4
02df418550bcb5fe3124b38da7d6ea9fe90db627c04bc048a0bba5486917b31f7e

Adding n/2 to p4 = p5
03013a363007c73a9c2fccabb7a193c35d3daaf7b40026110861488e2b2efbbc56

Now what we want is actually dividing all the keys by 2 as many times as we specify but at the same time we would want to add n/2 to each newly generated key and then divide + n/2 them as well.

Easy peasy, right? Just that if we want to drop 40 characters/bits from our target, we'd need to generate and keep 2^40 public keys. This is for educational purposes only, ( yeah right! 😉 ).

[Dexed]

I see puzzles 65, 70, 75, 80 ... 125 are solved. How come?

[digaran]

I see puzzles 65, 70, 75, 80 ... 125 are solved. How come?

It's easier to solve a key if you know the public key, when someone spends from his address, public key associated with that address is revealed, this is what Satoshi did with puzzles every 5 key apart, methods such as kangaroo and BSGS can be used to speed up the search thousands of times faster than brute forcing for unexposed puzzles.

That's why you should never keep your coins on addresses with known public keys.😉 ( not that any time soon they can crack 256 bit keys, so every one is safe for a few decades )

[WenMingHappy]

It has been partly fun but most exhausting running a server in my garage in hope to find one of the puzzles to save me from debt, poverty and help out with illness in my family with unpayable medical bills. Sunday wife and kids are out of town and I will turn off the server and myself. Good luck rest of you!

[digaran]

It has been partly fun but most exhausting running a server in my garage in hope to find one of the puzzles to save me from debt, poverty and help out with illness in my family with unpayable medical bills. Sunday wife and kids are out of town and I will turn off the server and myself. Good luck rest of you!

I see you have chosen the path of cowards, there are so many things in life other than this puzzle.
Find something else, believe in God, because he always provides.

Also there is no such a thing as an off switch for us, we never go off, whatever happens we keep existing.

A wife and kids, you are already blessed, you just don't know it.

[albert0bsd]

It has been partly fun but most exhausting running a server in my garage in hope to find one of the puzzles to save me from debt, poverty and help out with illness in my family with unpayable medical bills. Sunday wife and kids are out of town and I will turn off the server and myself. Good luck rest of you!

I don't have kids yet, i want to have at least one son or a daughter, you don't know but you are actually very blessed

[ManPilot]

It has been partly fun but most exhausting running a server in my garage in hope to find one of the puzzles to save me from debt, poverty and help out with illness in my family with unpayable medical bills. Sunday wife and kids are out of town and I will turn off the server and myself. Good luck rest of you!

I see you have chosen the path of cowards, there are so many things in life other than this puzzle.
Find something else, believe in God, because he always provides.

Also there is no such a thing as an off switch for us, we never go off, whatever happens we keep existing.

A wife and kids, you are already blessed, you just don't know it.

Yes, you know how to "support" a person ...
Most likely you wanted to support a person, but you do it by mixing sugar and salt.
Instead of speaking words of support and consolation, you simply finish off the person with your cruel term "coward".
But you can not call a coward a person who is now hard.

Many of us have moments in life when failure follows failure and it seems that a person no longer has the strength to get out of this black streak.
And at such moments it is very important to find a friend or just any other person who will support and encourage someone who is having a hard time and who is in despair.

But do you really think that calling a desperate person a coward is a productive method that will help him rise and get out of trouble?!
If you think this way and consider it as a friendly participation, then, as they say, with such “friends” you don’t need enemies.

Forgive me for my harsh words, but also understand a simple thing - those who can scold and at the same time continue to look blankly at someone's suffering - the majority around.
To call a person a rude word - anyone can, in this sense, all people are very rich in evil words.

But instead of scolding - try to console!

After all, the God you mentioned has always comforted, healed, helped, and never scolded or judged anyone!
And since you mentioned God, let's try to do the same thing that God does, and if you see a despondent person, it is better to support him, comfort him, and not scold him - and then God Himself will comfort you one day

[ManPilot]

It has been partly fun but most exhausting running a server in my garage in hope to find one of the puzzles to save me from debt, poverty and help out with illness in my family with unpayable medical bills. Sunday wife and kids are out of town and I will turn off the server and myself. Good luck rest of you!

I want to express my support and sympathy to you!
Don't despair, you are not alone!

The sun is still shining, the sky is still beautifully blue!
And most importantly, your loving wife and children are by your side.
And they love you and will love you no matter what, loving you the way you are!

Remember the words of the oath during the wedding, when the newlyweds say to each other the words about how to "love each other in illness, and in sorrow, and in poverty and poverty .."?
Well, this seems to be just such a period in your life.
But please don't despair, friend!
This difficult period will definitely end and God will surely give you a reward for your patience!

Be patient!
In the meantime, go to the temple, or just pray to God.
Reach out to loved ones for support and comfort.
Also try now during this difficult period to be in nature more often, to take walks in the fresh air.

And if you can't make money, try to at least temporarily change jobs - at least you can even just work in a taxi for now. This will distract you from sad thoughts, and at the same time give you at least some income for the first time!

But most importantly, don't despair.
And stop thinking about "turning yourself off"!
In the end, it is better to endure sorrows here on Earth, but then to be in Paradise for enduring these sorrows and failures!

[Nigromante]

Hi I'm new here.
People who want to use BitCrack with a graphical user interface can use PuzzleBTC.
PuzzleBTC contains BitCrack with search ranges for 10 puzzles. It's not used for searches in other ranges.
It's a free application for Windows.
Download from here:
https://www.frikiscape.com/puzzlebtc_eng.html

----------------------------
Personal Web Site: www.frikiscape.com
Donations: 1DonatezZHvUNsR9M36eWMMNvPkLYerwfS
----------------------------

[Dexed]

I see puzzles 65, 70, 75, 80 ... 125 are solved. How come?

It's easier to solve a key if you know the public key, when someone spends from his address, public key associated with that address is revealed, this is what Satoshi did with puzzles every 5 key apart, methods such as kangaroo and BSGS can be used to speed up the search thousands of times faster than brute forcing for unexposed puzzles.

That's why you should never keep your coins on addresses with known public keys.😉 ( not that any time soon they can crack 256 bit keys, so every one is safe for a few decades )

But how can you find public key after making a transaction? Because there is only address and after that you need RIPEMD-160 and SHA-256 hashing to find out public key.

[digaran]

I see puzzles 65, 70, 75, 80 ... 125 are solved. How come?

It's easier to solve a key if you know the public key, when someone spends from his address, public key associated with that address is revealed, this is what Satoshi did with puzzles every 5 key apart, methods such as kangaroo and BSGS can be used to speed up the search thousands of times faster than brute forcing for unexposed puzzles.

That's why you should never keep your coins on addresses with known public keys.😉 ( not that any time soon they can crack 256 bit keys, so every one is safe for a few decades )

But how can you find public key after making a transaction? Because there is only address and after that you need RIPEMD-160 and SHA-256 hashing to find out public key.

When you spend from your address, your public key is revealed to the nodes so they can make sure the actual owner of the coins, the one who is holding the private key is spending those coins, they can only verify that if you sign a transaction with your public key as the proof of private key ownership, then they will process your transaction because it's proven legit.

Here you can convert any address with outputs existing on blockchain to public key, it only works if the address has outgoing transaction.

https://bitcointools.site/tool/address-to-pubkey

If you never spend from your address, then in order to find your public key, one has to reverse engineer rmd160 and sha256 hash functions first and then get to your public key, so they work as some sort of firewalls.

And at such moments it is very important to find a friend or just any other person who will support and encourage someone who is having a hard time and who is in despair.

About that, they should call a hot line, it's specifically for such cases, a brand new account we never interacted before, should I do a lap dance for him to cheer him up? if I knew him, I would though ( probably best to hire a woman for that part ). But out of no where as the first post saying such a thing, I call him a pussy, he is not man enough to get back up and keep fighting. That's the way of pussies.   

How is that for comfort.

This is becoming off topic, continue somewhere else if you'd like to discuss further.

[kalos15btc]

i found this address in substraction of 125
13zb1hQ664XDDhM2LkWLLa23cdbhHwya7c # 19....................
hash 160 : 20d45a6a51bc082aeb4d344be937b1bd4ea1f238

am i close if i search in the range 66 cuz the address looks like its in that range it starts with same 7 digits with 66 puzzle and same 8 first digits of hash160...

02c0643bd28d11d650b24dae3143b1d3578e6a3597a9395f43c25ead8ed2a9298f

who can scan in kangaroo 66 bits in 5 min or less ? if you find this address we will split the 12 btc , of course if it is in that range im not sure im asking you guys ?

└─$ ./keyhunt -m bsgs -f tests/testpubkey.txt -k 1500 -S -t 10 -b 66

• Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
• K factor 1500
• Threads : 10
• Mode BSGS sequential
• Opening file tests/testpubkey.txt
• Added 1 points from file
• Bit Range 66
• -- from : 0x20000000000000000
• -- to   : 0x40000000000000000
• N = 0xfffb4000000
• Bloom filter for 6291456000 elements : 21566.38 MB
• Bloom filter for 196608000 elements : 673.95 MB
• Bloom filter for 6144000 elements : 21.06 MB
• Allocating 93.00 MB for 6144000 bP Points
• processing 6291456000/6291456000 bP points : 100%    
• Making checkums .. ... done
• Sorting 6144000 elements... Done!
• Writing bloom filter to file keyhunt_bsgs_4_6291456000.blm .... Done!
• Writing bloom filter to file keyhunt_bsgs_6_196608000.blm .... Done!
• Writing bP Table to file keyhunt_bsgs_2_6144000.tbl .. Done!
• Writing bloom filter to file keyhunt_bsgs_7_6144000.blm .... Done!
• Total 36893523135430656000 keys in 720 seconds: ~51 Pkeys/s (51241004354764800 keys/s)

End
Your precious key is not in this public key range.
Provide some more let's scan.
We will hit the key soon and share some funds too.

i have news for you bestie, not 7 digits this time 11 same digits  in this post
https://bitcointalk.org/index.php?topic=1306983.msg62736366#msg62736366

[ManPilot]

And at such moments it is very important to find a friend or just any other person who will support and encourage someone who is having a hard time and who is in despair.

About that, they should call a hot line, it's specifically for such cases, a brand new account we never interacted before, should I do a lap dance for him to cheer him up? if I knew him, I would though ( probably best to hire a woman for that part ). But out of no where as the first post saying such a thing, I call him a pussy, he is not man enough to get back up and keep fighting. That's the way of pussies.   

How is that for comfort.

This is becoming off topic, continue somewhere else if you'd like to discuss further.

I won't continue because you're right, this is not a mental health line.
In conclusion, I will only say that it was you who started, and now it is not logical and abrupt that you change your position, saying "continue elsewhere."

If you didn't like the message "WenMingHappy" - you could just keep silent from the very beginning and not respond to the message of this "WenMingHappy".
But since you answered him, you should have acted softer.
That is, the principle is very simple - either do it kindly, or don't do it at all.
I already said that I understand that you probably sincerely wanted to support this person, and I said that since you started doing this, you should have done it softer, trying not to offend the confused person with prickly harsh words.
A truly courageous person is usually also a noble and merciful person and fights without speaking out loud about his bravery.

But it's not for me to judge you.
Just as you should not condemn other people, and you should not say offensive words, which you again allow in your last post.

For my part, I apologize if I offended you.
I did not want to offend anyone, but just wanted to remind people to be kinder and more forgiving towards each other.

In fact, in responding to your post, I addressed everyone, not just you personally.

Well, let's continue the discussion about the methods of finding a solution.
I have been reading this forum thread for a long time.
It's just that I usually don't enter into discussions, limiting myself to reading.