[XXX]

Hi,

We all (hopefully) have heard about the current ongoing-puzzle that was recently increased its prize by 10x and which is still not all solved for long time.

Since I'm very interesting in math and dealing with big numbers, I would love to get to learn about dividing public keys. I will mainly focus for the next possible puzzle (#125) which has its public key revealed.

Puzzle #125:

Code:

0233709eb11e0d4439a729f21c2c443dedb727528229713f0065721ba8fa46f00e

Since public key for puzzle #125 is revealed, we can do many things with it so we can try to slightly reduce the targeted range by XXX amount.

I already know Addition, Subtraction, and striding public keys, but weirdly i haven't managed to know how to divide public keys in the correct way.

Can you help me give me an detailed example of dividing public key into lower ranges, and if possible which tools is needed for the process?

What could be the advantages and disadvantages of dividing public keys? Is it a problem if the divided public key has a decimal in it? I think if i understood correctly, the newly divided keys could be invalid and could lead to infinity if its wrongly divided (Correct me, if I'm wrong).

Thanks to all, and Goodluck hunting!

I mainly use Bitcoin Core for sending and receiving Bitcoins.

Is it bad idea to use Bitcoin Core for the main wallet? I don't trust any online exchanges, that require my private keys.

Thanks,

[same]

Hi,

Suppose i have 2 same r values from different addresses/privatekeys.

Would it be possible to calculate private key for both of the addresses from the same r values?

Or its only possible when the same private key has done 2 different transaction but used the same r values?

I hope my question was clear und understandable

[we in fact could have broken 160 bits AND any other bigger security bits without us even noticing it.]

Hello all,

I have asked myself the same question over and over again and as a experienced person, i couldn't find an convenient answer to the theory problem that i found, so here i am sharing you guys what the weird theory that from my point of view could be that we in fact could have broken 160 bits AND any other bigger security bits without us even noticing it.

Now let's start with my theory. (I'll use Bitcoin 160 bit address as an example).

Bitcoin Addresses are known to have 160 Bits. Since we know that an Bitcoin Address could be generated from any 160 bits, we can then be 100% sure that we will be able to successfully generate an valid 160 bits Bitcoin address from the first try to by just inputting any 160 bits. So for me to get an Random Bitcoin address from the total 1461501637330902918203684832716283019655932542975 different possible Bitcoin addresses by inputting random 160 bits is exactly 1 in 2^160.

Here I am trying to generate one random Bitcoin address by inputting an 160 randomly generated bits.

Code:

GenerateKey: = E9A3EAA622BBDC094205C2D03395C9FFCA41EB0C

Here i have generated randomly an 160 Bits PrivateKey.

Code:

ConvertToHash160ANDAddress: 4E6A51BF4C909515A8B9151C258068906482026D + [b]189d5ADsBrQ9mvgraapVs9iF2eyHoQcywg[/b]

We have now got our final desired address.

Now the weird theorie problem that blew my mind: Does this mean that i just generated an Bitcoin address 189d5ADsBrQ9mvgraapVs9iF2eyHoQcywg that the chances were for me generating it was 1 in 2^160? If yes, theoretically speaken, everytime we generate an random Bitcoin address, we actually break the law and generate an address that is ultra rare to find and not infeasible for any humans to genereate it back again because it take an infinite amount of years.

Now if i were to generate the same address 189d5ADsBrQ9mvgraapVs9iF2eyHoQcywg that i previously just generated by 1 in 2^160, i would still have the same chances as before, namely: 1 in 2^160. But the differeneces that it would take this time zillion of zillion of years before i can generate the same address, that i previously found, by just 1 try. So how is this possible?

My theory says, everytime we generate an Bitcoin address, or an privatekey, or an long Random Hash, we actually break the security for its bits for ONLY once, but never will be repeated again for same address/privatekey/Hash.

What are your thoughts on this guys?

Hello guys, i have a interesting question about Scep256k1 that Satoshi implemented for the developlment of Bitcoin.

Now of course i know that Hashing is the process of transforming any given input into another completely Random fixed output value which is in bits.

But since the output of Hashing is completely Randomized and non-reversible, does ECC(Scep256k1) theoretically work the same as Hashing?

Because in Hashing (E.x Let's take SHA256) we have a a relation between the Input and the output. We give any input and we get a random fixed 256 bits value back to us. In Hashing, We need to imagine the input as the private key and the output as the public key.

In ECC(Scep256k1) We can also generate and give any wanted private key input within 256 bits and take back as a output a random fixed 256 bits public key.

So what is the differences between Scep256k1 and Hashing exactly if both give us random outputs?

Are they both non-reversible?`

Which is more secure e.x for bruteforce attacks/reverse attack?

Hello together,

Here I'm a noob that only uses Bitcoin core as his wallet.

Let's say i want to send 10 Bitcoins using Bitcoin core to only one other address.

What is the quickest method to do, to make sure it gets confirmed as fast as possible or after the first block that gets mined?

Do you recommend me sending custom fees, or the recommended fees that is in Bitcoin core?

If I want to send a custom fees, how much sat do i need to send per kilo byte to gets it confirmed fast?

Hello guys, i have watched tutorials, YouTube, google, and here on this thread and i still didn't understand how miners in the end get the so called "Blockhash".

can someone please explain to me with the following example if it's possible?

Let's take block number: #755118 it's blockhash is: 00000000000000000004263b29bf5bf2dc8de62ba926a14b77f123fece4d3d5e it's Merkle root: fe26443a7f9736eb317d6fff513f877d74c8dfb4107045915b820bd31274faed
and finally it's nonce: 91615120

        And block number: #755119 it's blockhash is: 000000000000000000024f691092adc85ce52ab7e4dc4934e1c78d098afa2dfb it's Merkle root: 66e1402552f44695444aa3a201e7330a479f14dafa8f4b9a0496a53c6e950daa and finally it's nonce: 2254353472

what process had been done to get blockhash #755119?

Thank you