Ok, here's a 1BTC puzzle.

[blockladder]

Ok, here's a 1BTC puzzle.

The question is the following:

WhyTheCombOfNatashaOtomoskiHas21Teeth?.txt

The solution is a 32 characters long plain-text (the private key).

Hint: 8 camel case english words, no special symbols

Happy puzzling!

G/cbms/K/DNzcRin5v2B03iXdbpdVoZbTebt7KG95j3FUqnJvcP9rDYcGpSV27RLspR7SlPjqma4h0tDAMwovIo=

txid 39ae730abf9190f1985a3600e35b6451efc51bfb885bc9d1c3b91d502de3907d

[1715033262]

1715033262

[1715033262]

1715033262

[1715033262]

1715033262

[1715033262]

1715033262

[1715033262]

1715033262

[1715033262]

1715033262

[watashi-kokoto]

Obviously she isn't him, but

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
S A T O S H I N A  K  A  M  O  T  O

8 2 3 9 1 6 11 4 14 13 12 15 5 10 7
N A T A S H  A O  T  O  M  O S  K I

who do you all think is she anyways?

[Flame.Exchange]

How many bit and what algorithm?

[watashi-kokoto]

How many bit and what algorithm?

cracking algo is ecdsa multiplication, I obtained the ecdsa public key.. the OP message was signed with address 179sxfh6rw6bHSo5wVUhLP96k46QaEzVP

maybe large bitcoin collider can crack it 

brute force attack cost:

8 top 10000 words ... 107 bits
8 top 50000 words ... 124 bits
8 top 100000 words ... 133 bits

But what I believe when we exclude certain words we can bruteforce the answer faster.

[pooya87]

How many bit and what algorithm?

cracking algo is ecdsa multiplication, I obtained the ecdsa public key.. the OP message was signed with address 179sxfh6rw6bHSo5wVUhLP96k46QaEzVP

maybe large bitcoin collider can crack it 

brute force attack cost:

8 top 10000 words ... 107 bits
8 top 50000 words ... 124 bits
8 top 100000 words ... 133 bits

But what I believe when we exclude certain words we can bruteforce the answer faster.

having the public key is not going to do you any good. and the "collider" thing is a joke, it can't help you if the private key is big enough. it is only searching the small area in the beginning of the numbers that are private keys.

as for brute forcing the answer you have to have some base to work with, i can't understand what your previous post even means!  the word is obviously the "jumble" of Satoshi Nakamoto but because there are repetitive characters in the name you can't find any kind of pattern in it. and it all seems like a random jumble not a meaningful key.

[Kakmakr]

Are you going to place the 1BTC into escrow or do you have a signed message that you own the 1 BTC for this prize? The address 179sxfh6rw6bHSo5wVUhLP96k46QaEzVP might have 1 BTC, but who says you own it and that it is accessible by you and that you know the Private key for that Bitcoin address?

Let's have a signed message from that address please, showing that you own that address and that you know the Private key, before we put the effort into this. 

[Shary]

can you please sign that address to prove your ownership ? and if its not yours, at least link us with the original topic. thnx

[nutildah]

8 camel case words is so easy to find but fitting it in 32 characters long is too hard.  Lol
 By the way i don't want to waste my time on this puzzle.  Kindly show first your proofs that you own that address .such sign message like what kakmakr said.!  

By the way, why would you bother mentioning you don't want to waste your time? Given by the profile's unusual post history, I would venture to guess there's at least a 50% chance this is legitimate.

Fitting it in 32 characters isn't too hard, see?

It Has One Tooth For Every Million Btcs

That's my best guess, and that's not it. I'll let some new people find this thread and work on it with this incidental bump.

[LoyceV]

The solution is a 32 characters long plain-text (the private key).

As far as I know, there is no 32 character private key. A mini private key would have 30 characters.

[nutildah]

The solution is a 32 characters long plain-text (the private key).

As far as I know, there is no 32 character private key. A mini private key would have 30 characters.

I can only guess he means it is a brainwallet mnemonic. Don't mind giving additional hints, I've given up guessing... A couple parts that threw me was the anagram of Satoshi Nakamoto and the fact that it ends with ".txt"...

"WhyTheCombOfNatashaOtomoskiHas21" itself is 32 characters long and consists of 8 words... Hmm...

[watashi-kokoto]

Natasha Otomoski Got The Comb At A Shop

It Is A Love Gift From Satoshi Nakamoto

 

[Shary]

i cant solve this ! its hard

[cissrawk]

My guess,
So based on this thread, Natasha Otomoski probably Satoshi Nakamoto, number 21 probably max supply of btc, based on coinmarketcap max btc supply is 21,000,000 which is have 21 too.
It is possible to turn the question into "Why Satoshi Nakamoto Create bitcoin with 21 million supply?", Its pretty similar tho, "Why The Comb Of Natasha Otomoski Has 21 Teeth?" , but idk, just guessing.

[watashi-kokoto]

this may be bullshit, but out of curiosity i entered "hal finney comb" into google and got one hit:

> On Sat, Aug 1, 2009 at 8:40 AM, Hal Finney<hal.finney@...> wrote:
...
>> non-working BIOS. So clearly there is no point in going over those
>> tables with a fine tooth comb to figure out what SINIT doesn't like
>> about them. Something else must be different. I'd say the SINIT error
...

However fine tooth comb is not one with 21 teeth on it

Unfortunately I can't be puzzling for much longer because I go to work tomorrow.

[watashi-kokoto]

Every puzzle needs an art piece so I shooped something hope you like it.

EDIT: fail. 20 teeth not 21 I'm tired

EDIT2: fixed

[clonely]

Obviously I'm not sure how serious this offer is. At the end of the day someone gets the Bitcoin in his wallet, saying that I've done it.

How do we know that the person who opened the thread didn't do it to collect appreciation?

[pooya87]

The solution is a 32 characters long plain-text (the private key).

As far as I know, there is no 32 character private key. A mini private key would have 30 characters.

usually every character is represented as 1 byte and considering a private key is 32 bytes you can simply convert a 32 char long string to a 32 byte long byte array and use it as a private key.
for instance this sentence ("Hi this is satoshi nakamoto comb") is 32 byte long and can be represented as "48692074686973206973207361746f736869206e616b616d6f746f20636f6d62" in base16 or "KyeU5gX2cQJvtJkSGLetfHPmZaBJpauf3D6yDuP6tDAdzjCrAHnL" in base58 WIF.

[runlola]

The solution is a 32 characters long plain-text (the private key).

As far as I know, there is no 32 character private key. A mini private key would have 30 characters.

usually every character is represented as 1 byte and considering a private key is 32 bytes you can simply convert a 32 char long string to a 32 byte long byte array and use it as a private key.
for instance this sentence ("Hi this is satoshi nakamoto comb") is 32 byte long and can be represented as "10f0c810a0c56a1282574ce4bf9d3e843afc5be688c277ab75e6da1e6f95d756" in base16 or "Kwne8vNfRRiq8d6CB6YpCtbK6EKCRyoCjPGomLshKgubBWwiDQWD" in base58 WIF.

That's called a brainwallet: https://brainwalletx.github.io/

[watashi-kokoto]

for instance this sentence ("Hi this is satoshi nakamoto comb") is 32 byte long and can be represented as "10f0c810a0c56a1282574ce4bf9d3e843afc5be688c277ab75e6da1e6f95d756" in base16 or "Kwne8vNfRRiq8d6CB6YpCtbK6EKCRyoCjPGomLshKgubBWwiDQWD" in base58 WIF.

Code:

private_key_static = binascii.hexlify("Hi this is satoshi nakamoto comb")
print (private_key_static)

Hex should be: 48692074686973206973207361746f736869206e616b616d6f746f20636f6d62

extended_key = "80"+private_key_static
# Step 3: first SHA-256
first_sha256 = hashlib.sha256(binascii.unhexlify(extended_key)).hexdigest()
# Step 4: second SHA-256
second_sha256 = hashlib.sha256(binascii.unhexlify(first_sha256)).hexdigest()
# Step 5-6: add checksum to end of extended key
final_key = extended_key+second_sha256[:8]
# Step 7: finally the Wallet Import Format is the base 58 encode of final_key
WIF = b58encode(binascii.unhexlify(final_key))
print (WIF)

Hi this is satoshi nakamoto comb - 5JNBDPYj437L1JAPVQ2ngwTuh1GUboCUef5yh5cpYzauLTTTHAL

[bitfocus]

I am no code-breaker, but I will watch th thread to see who wins, good luck all!