Search content
Sort by

Showing 14 of 14 results by Niekko
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Niekko
on 09/05/2025, 11:33:04 UTC
I feel very sorry for k*G; he’s at war against a group of flat‑Earthers.
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Niekko
on 15/04/2025, 19:37:53 UTC
... if we continue like this, it would be advisable to open a 'Puzzle Prefix Marketplace' thread, at a fixed rate per quintal.


Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Niekko
on 12/04/2025, 20:02:54 UTC
Honestly, something like that would require manipulating time and space—basically applying the principles of teleportation, but for digital files. It's incredibly difficult to pull off unless you already know the recipient, the exact time and place of delivery, and a bunch of other variables.  Tongue


Interestingly, I was discussing this very topic a few days ago with an expert in quantum mechanics—specifically, how the past influences the future, yet our actions are not entirely free, since theoretically everything should be immutable.

During that conversation, I posed a provocative question, which I'll bring up here as well: what if, instead of the past influencing the future, it is actually the future that, for reasons of equilibrium, guides our choices in the past? After all, in the future, we might "remember" crucial moments of our lives and "connect" with them to bring us precisely to where we stand.

If this were true, then you would already know if you're destined to win or lose this puzzle, and you would make choices accordingly—either to reach victory or, conversely, to avoid it altogether.


Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Niekko
on 09/04/2025, 17:08:52 UTC
But how do you implicate Elon Musk in anything? for now he's in a big hole where he's lost billions.


Elon is the creator  Grin
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Niekko
on 03/04/2025, 21:03:08 UTC
I DO IT FOR FUN!!!111

Code:
#!/usr/bin/env python3

from multiprocessing import Pool
import datetime
import ecdsa
import hashlib
import os
import random
import sys
import time
import secp256k1 as ice

def log(t):
d = datetime.datetime.now().strftime("%Y-%m-%d %H:%M:%S")
print(f'{d} {t}', flush=True, end='')
l=open('log.txt','a')
l.write(f'{d} {str(t)}')
l.flush()
l.close()

def go(pvk):
h=ice.privatekey_to_h160(0, True, pvk) # type = 0 [p2pkh],  1 [p2sh],  2 [bech32] ; compressed?
if h==target_hash:
print()
log(f'Found pvk: {hex(pvk)[2:]}  |  WIF: {ice.btc_pvk_to_wif(pvk, False)}\a\n')
print('\a', end='', file=sys.stderr)

range_start = 0x80000000000000000
range_end   = 0xfffffffffffffffff
r           = 262144
target_hash = bytes.fromhex('e0b8a2baee1b77fc703455f39d51477451fc8cfc')
th = 24
cnt=10000
# seed=0

def main():
try:
os.system('cls||clear')
print("Puzzle 68 random scanner")
print("Scanning random addresses in an infinite loop. Press Ctrl+C to stop.\n")

keys_checked = 0
start_time = time.time()
# random.seed(seed)

while True:
rnd = random.randint(range_start, range_end+1)

rng = range(rnd, rnd+r)

with Pool(processes=th) as p:
for result in p.imap(go, rng):
keys_checked += 1
if keys_checked % cnt == 0:
elapsed = time.time() - start_time
rate = keys_checked / elapsed
print(f"\rKeys checked: {keys_checked:,} | Rate: {rate:.2f} keys/sec | Range: {hex(rnd)[2:]}-{hex(rnd+r)[2:]}", end="", flush=True)

except KeyboardInterrupt:
print("\n\nScanning stopped by user.")
print(f"Total keys checked: {keys_checked:,}")

if __name__ == "__main__":
main()

~43200 keys/sec @ 24 threads with 9950X


Code:
#!/usr/bin/env python3

import datetime
import os
import random
import sys
import time
from multiprocessing import Pool
import secp256k1 as ice

# Configurazioni
RANGE_START = 0x80000000000000000
RANGE_END   = 0xfffffffffffffffff
RANGE_SIZE  = 262144
TARGET_HASH = bytes.fromhex('e0b8a2baee1b77fc703455f39d51477451fc8cfc')
NUM_PROCESSES = 24
PROGRESS_COUNT = 10000
CHUNK_SIZE = 1024

def log(message):
    timestamp = datetime.datetime.now().strftime("%Y-%m-%d %H:%M:%S")
    formatted = f"{timestamp} {message}"
    print(formatted, flush=True, end='')
    with open('log.txt', 'a') as logfile:
        logfile.write(formatted)
        logfile.flush()

def check_key(pvk):
    h = ice.privatekey_to_h160(0, True, pvk)
    if h == TARGET_HASH:
        message = f"Found pvk: {hex(pvk)[2:]}  |  WIF: {ice.btc_pvk_to_wif(pvk, False)}\a\n"
        print()
        log(message)
        print('\a', end='', file=sys.stderr)
    return 1

def main():
    os.system('cls||clear')
    print("Puzzle 68 random scanner")
    print("Scanning random addresses in an infinite loop. Press Ctrl+C to stop.\n")

    keys_checked = 0
    start_time = time.time()

    try:
        with Pool(processes=NUM_PROCESSES) as pool:
            while True:
                start_range = random.randint(RANGE_START, RANGE_END - RANGE_SIZE)
                end_range = start_range + RANGE_SIZE
                current_range_str = f"{hex(start_range)[2:]}-{hex(end_range)[2:]}"
               
                for _ in pool.imap_unordered(check_key, range(start_range, end_range), chunksize=CHUNK_SIZE):
                    keys_checked += 1
                    if keys_checked % PROGRESS_COUNT == 0:
                        elapsed = time.time() - start_time
                        rate = keys_checked / elapsed if elapsed > 0 else 0
                        print(f"\rKeys checked: {keys_checked:,} | Rate: {rate:.2f} keys/sec | Range: {current_range_str}", end="", flush=True)
    except KeyboardInterrupt:
        print("\n\nScanning stopped by user.")
        print(f"Total keys checked: {keys_checked:,}")

if __name__ == "__main__":
    main()

a little better, just for fun ;-)


Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Niekko
on 16/03/2025, 23:04:10 UTC
Here is the Git repository from my folder:
https://github.com/NoMachine1/Cyclone.git

I think you cannot do it that way. You should fork the original code and then push your changes in order to respect the user's contribution and the license.
https://github.com/Dookoo2/Cyclone/blob/main/LICENSE
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Niekko
on 14/03/2025, 06:22:03 UTC
Yes, the internet's natural law: for every thoughtful post, there must arise a freshly minted account, ready to deliver the hottest of takes with the chilliest of evidence.

It's like clockwork—or maybe performance art.  Grin



Keep in mind that you and I have been enrolled since the same year; I simply prefer reading over writing.
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Niekko
on 14/03/2025, 06:07:04 UTC
Okay, I’ve been away for a few days and I find pages and pages of nothing, hahaha  Grin
I suggest exploring other solutions.

Glad you could grace us with your cryptographic wisdom. You're absolutely right. Uniform distribution and lack of patterns are so basic, it’s almost like we’re not even trying. But hey, while you’re here, maybe you could enlighten us with your groundbreaking solution? Or is this just the 'I’m smarter than everyone' tour?  Tongue

Here’s one groundbreaking solution : scan all keys, in any order you prefer. Realise that there is no silver bullet or statistical bias. Find the key and profit.
If you want to work on better strategies I suggest you work on 135. At least there is room for improvement there.


I totally agree
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Niekko
on 14/03/2025, 05:57:04 UTC
Okay, I’ve been away for a few days and I find pages and pages of nothing, hahaha  Grin
I suggest exploring other solutions.

Glad you could grace us with your cryptographic wisdom. You're absolutely right. Uniform distribution and lack of patterns are so basic, it’s almost like we’re not even trying. But hey, while you’re here, maybe you could enlighten us with your groundbreaking solution? Or is this just the 'I’m smarter than everyone' tour?  Tongue

absolutely not, I'm not a professional magician
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Niekko
on 14/03/2025, 05:33:51 UTC
Okay, I’ve been away for a few days and I find pages and pages of nothing, hahaha  Grin. What is this festival of incompetence? I’m glad I didn’t show up then.

Anyone with a basic understanding of cryptography would know you’re wasting time searching for nothing.

We’re talking cryptography, not math; it’s based on uniform distribution and the absence of any patterns, so two 'similar' hashes have absolutely no relation. And it’s not an opinion, it’s a fact.

I suggest exploring other solutions.
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Niekko
on 25/02/2025, 12:52:35 UTC
Let's recap the main methods:

1. Magic-based

- Adobe Illustrator number horoscopes, misc. font sizes, arrows everywhere
- magic number patterns in hexagons, squares, rectangles;
- adding "hex" numbers left and right, maybe mix in decimals as well, so that we can fit somehow solutions


2. Random methods

- sliders to choose hex digits, maybe we get lucky by clicking the mouse!
- Python scripts that sit idle in background (we all like quiet environment, right?)
- pick random ranges, or random keys - ignore completely that testing 2/3/4/5/6/...N times the same keys or ranges becomes inevitable really, really quick, why care?!

3. Probabilities

- backward statistics: if something is probable, and it happens, than it can still be analyzed as if it was just probable, right? Sure.
- uniform distribution: if something is totally random, then it matters what values it ended up with (and also when), and hence we can predict where & when it's not likely to be repeated
- the keys must not look "not random": very low chances that the solution is key 0x1, or key 32768, 16777216, and so on. Because too many zero or one bits in a row. Even better, do the same with base-10 digits, or upgrade to using hex char strings. Also, invent some alphabet where hex digits are case-sensitive, and let everyone else figure out WTF you smoked.

4. Mystical

- hashes are broken; NSA has the backdoor to SHA256
- there is a hidden relation between secp256k1 formula and RIPEMD160 bits: this makes all sorts of statistical theories to not apply
- neural networks can be trained to predict the keys, because they are really so intelligent that they can predict the future.

5. A shitload of computing power, scanning the ranges just once by splitting the work. Keep some proof of work for each range, like keys for a fixed number of leading zeros. Laugh thinking that some people may interpret this as proof of backward statistics (maybe combined with mystical key-to-hash relationship) as the main reason of why the correct key was eventually found after around 50% checked keys.


... you forgot the improbable mathematical solutions.  Grin


Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Niekko
on 24/02/2025, 01:15:57 UTC
That's what I did, I created a lock with rbf completely disabled and it's not pocibel boot or anything superimposed I said that and everyone here laughed in my face and told me to prove it.. why prove it if I already knew.. lol

LOL indeed. So literally, 3 posts above I replaced a TX that had RBF disabled. So unless you want to actually repeat this test, everyone is entitled to laugh their ass off about all of that utopian RBF explanations. No miner will care as long as you replace with a higher fee.

I really hope that ChatGPT will be the all-know-around basis for all future solvers! I encourage you to continue trusting everything AI spits out as pure truth, fuck actual evidence or tests.



But hasn't anyone read Satoshi's whitepaper on double spending?


Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Niekko
on 23/02/2025, 10:17:17 UTC
To be able to use keyhunt's bsgs mode to scan and solve puzzle 135 as fast as possible, how many CPU threads and RAM are needed at the same time? How long does it take to scan the range 4000000000000000000000000000000000:4ffffffffffffffffffffffffffffffffffff?

Puzzle 135 range size: 2134

BSGS requirements:

1. Fast memory baby table: sqrt(N) items = 267 items
Item size: 256 bits in full; let's assume we only need the first 67 bits and ignore hash collision overhead

Total memory required: 267 * 67 bits = somewhere between 273 to 274 bits

The total amount of data stored on Earth in 2018 was 33 zettabytes. That is, 278 bits.

Estimates for 2025 are around 175 zettabytes. That s, all of the hard drives that exist on Earth have some total capacity of around 280 bits.

The amount of RAM is less than a fraction of all that (if you don't believe this, check any PC: what's the ratio between RAM and storage capacity?)

2. How many threads?

EC operations required at most: sqrt(N) for baby steps + sqrt(N) for giant steps = 2 * sqrt(N) steps

That is, 268 elliptic curve group operations.

A high-end CPU can do around 15 to 20 Mo/s per thread. However, we also need to check the table after every giant step. I will ignore this and assume it is a no-op (it's not).

Total threads needed to solve in one second: 268 / 20.000.000 = 14,757,395,258,968

In summary:

RAM: 1 to 2 zettabytes
CPU threads: 14.8 trillion (for 1 second of total work)


Mathematics is like sex... if you go too fast, you miss the best part.  Grin
Post
Topic
Board Bitcoin Discussion
Re: == Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED==
by
Niekko
on 12/08/2024, 11:37:32 UTC
This thread going to a very ethical things, congratulations. Now teaching how stolen coins. Even the developers talk about their bots....

The world is truly going in the wrong direction