What is preventing me from simply constructing a hash that's lower than the current target? The 2019 Stack Overflow Developer Survey Results Are InWhat values are hashed in the SHA-256 algorithm, and what would be the next iteration until a possible header is found?Why change the nonce instead of just rehashing?How is a block header hash compared to the target (bits)?How does mining process takes Approximately 10 minutes?Why check for multiple nonces despite finding a golden nonce?if a Bitcoin mining nounce is just 32 bits long how come is it increasingly difficult to find the winning hash?With the current hashrate, how does it still take 10min to solve a bitcoin block?Why the nonce is difficult to find in Bitcoin?Calculating the target from the hash leading off bitsWhat is the exact input for the hash function?
Old scifi movie from the 50s or 60s with men in solid red uniforms who interrogate a spy from the past
Falsification in Math vs Science
Kerning for subscripts of sigma?
What is this business jet?
Match Roman Numerals
How do PCB vias affect signal quality?
Cooking pasta in a water boiler
Why can't devices on different VLANs, but on the same subnet, communicate?
How to obtain a position of last non-zero element
Is there a way to generate a uniformly distributed point on a sphere from a fixed amount of random real numbers?
Likelihood that a superbug or lethal virus could come from a landfill
Short story: man watches girlfriend's spaceship entering a 'black hole' (?) forever
What information about me do stores get via my credit card?
What is preventing me from simply constructing a hash that's lower than the current target?
Will it cause any balance problems to have PCs level up and gain the benefits of a long rest mid-fight?
Did Scotland spend $250,000 for the slogan "Welcome to Scotland"?
How to type a long/em dash `—`
Can a flute soloist sit?
Is it safe to harvest rainwater that fell on solar panels?
How to translate "being like"?
Button changing its text & action. Good or terrible?
What do I do when my TA workload is more than expected?
Why “相同意思的词” is called “同义词” instead of "同意词"？
Short story: child made less intelligent and less attractive
What is preventing me from simply constructing a hash that's lower than the current target?
The 2019 Stack Overflow Developer Survey Results Are InWhat values are hashed in the SHA-256 algorithm, and what would be the next iteration until a possible header is found?Why change the nonce instead of just rehashing?How is a block header hash compared to the target (bits)?How does mining process takes Approximately 10 minutes?Why check for multiple nonces despite finding a golden nonce?if a Bitcoin mining nounce is just 32 bits long how come is it increasingly difficult to find the winning hash?With the current hashrate, how does it still take 10min to solve a bitcoin block?Why the nonce is difficult to find in Bitcoin?Calculating the target from the hash leading off bitsWhat is the exact input for the hash function?
I just started learning about Bitcoin, and something I can figure out is why miners have to use a random process (hashing a nonce) to get lower than the target. For example, if the target is
00000000000001ae00000000000000
why not just produce
000000000000000000000000000001
to become the winner? I have no practical experience mining, I'm guessing my ignorance lies in the requirements of how a hash is produced. If so, where can I find about those requirements? Thanks.
EDIT: For clarity, I mean this in the sense of what part of the technology requires me to use a hash function? Rather than in the sense of just constructing something that looks like a valid hash.
mining-theory hash
asked 8 hours ago
ZduffZduff
1135
New contributor
Zduff is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
I just started learning about Bitcoin, and something I can figure out is why miners have to use a random process (hashing a nonce) to get lower than the target. For example, if the target is
00000000000001ae00000000000000
why not just produce
000000000000000000000000000001
to become the winner? I have no practical experience mining, I'm guessing my ignorance lies in the requirements of how a hash is produced. If so, where can I find about those requirements? Thanks.
EDIT: For clarity, I mean this in the sense of what part of the technology requires me to use a hash function? Rather than in the sense of just constructing something that looks like a valid hash.
mining-theory hash
asked 8 hours ago
ZduffZduff
1135
New contributor
Zduff is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
I just started learning about Bitcoin, and something I can figure out is why miners have to use a random process (hashing a nonce) to get lower than the target. For example, if the target is
00000000000001ae00000000000000
why not just produce
000000000000000000000000000001
to become the winner? I have no practical experience mining, I'm guessing my ignorance lies in the requirements of how a hash is produced. If so, where can I find about those requirements? Thanks.
EDIT: For clarity, I mean this in the sense of what part of the technology requires me to use a hash function? Rather than in the sense of just constructing something that looks like a valid hash.
mining-theory hash
asked 8 hours ago
ZduffZduff
1135
New contributor
Zduff is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
I just started learning about Bitcoin, and something I can figure out is why miners have to use a random process (hashing a nonce) to get lower than the target. For example, if the target is
00000000000001ae00000000000000
why not just produce
000000000000000000000000000001
to become the winner? I have no practical experience mining, I'm guessing my ignorance lies in the requirements of how a hash is produced. If so, where can I find about those requirements? Thanks.
EDIT: For clarity, I mean this in the sense of what part of the technology requires me to use a hash function? Rather than in the sense of just constructing something that looks like a valid hash.
mining-theory hash
mining-theory hash
asked 8 hours ago
ZduffZduff
1135
New contributor
Zduff is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 8 hours ago
ZduffZduff
1135
New contributor
Zduff is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 1 hour ago
Zduff
asked 8 hours ago
ZduffZduff
1135
New contributor
Zduff is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 8 hours ago
ZduffZduff
1135
asked 8 hours ago
ZduffZduff
1135
1135
New contributor
Zduff is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Zduff is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Zduff is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
EDIT: For clarity, I mean this in the sense of what part of the technology requires me to use a hash function? As opposed, to just constructing something that looks like a valid hash.
When determining whether or not a block is valid, each and every bitcoin node on the network will take the header of that block, and run it through a hashing algorithm to see what the output is. If the output is lower than the target value, then the block is valid (assuming that the rest of the block is also valid, of course).
Notice something important: the hash value itself is not explicitly stored in the block. So you cannot just append some fabricated value that falls below the target value onto the block in lieu of a valid PoW. To create a valid block, you must construct it such that all other network nodes can independently verify it as being valid, and to do so, they use a hash function.
As Pieter mentioned, hash functions are unpredictable 'one-way' functions. The only way to find a valid output is by trying a huge number of possible inputs, and 'getting lucky', so to speak.
answered 7 hours ago
chytrikchytrik
7,4022628
It's not quite that simple. The hash needs to be resistant to pre-image attacks.
– jpmc26
3 hours ago
@jpmc26 Any useful cryptographic hash function should be.
– immibis
41 mins ago
add a comment |
Hash functions are unpredictable.
You can't simply find an input to the hash function that produces such an output. The only way to accomplish that is by trying lots and lots of candidate blocks as input. If the target is 1000 times smaller, it requires 1000 times as many tries.
answered 8 hours ago
Pieter WuillePieter Wuille
48.2k3100162
Deleted comment. Please see edit to question.
– Zduff
8 hours ago
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "308"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Zduff is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fbitcoin.stackexchange.com%2fquestions%2f85994%2fwhat-is-preventing-me-from-simply-constructing-a-hash-thats-lower-than-the-curr%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
EDIT: For clarity, I mean this in the sense of what part of the technology requires me to use a hash function? As opposed, to just constructing something that looks like a valid hash.
When determining whether or not a block is valid, each and every bitcoin node on the network will take the header of that block, and run it through a hashing algorithm to see what the output is. If the output is lower than the target value, then the block is valid (assuming that the rest of the block is also valid, of course).
Notice something important: the hash value itself is not explicitly stored in the block. So you cannot just append some fabricated value that falls below the target value onto the block in lieu of a valid PoW. To create a valid block, you must construct it such that all other network nodes can independently verify it as being valid, and to do so, they use a hash function.
As Pieter mentioned, hash functions are unpredictable 'one-way' functions. The only way to find a valid output is by trying a huge number of possible inputs, and 'getting lucky', so to speak.
answered 7 hours ago
chytrikchytrik
7,4022628
It's not quite that simple. The hash needs to be resistant to pre-image attacks.
– jpmc26
3 hours ago
@jpmc26 Any useful cryptographic hash function should be.
– immibis
41 mins ago
add a comment |
EDIT: For clarity, I mean this in the sense of what part of the technology requires me to use a hash function? As opposed, to just constructing something that looks like a valid hash.
When determining whether or not a block is valid, each and every bitcoin node on the network will take the header of that block, and run it through a hashing algorithm to see what the output is. If the output is lower than the target value, then the block is valid (assuming that the rest of the block is also valid, of course).
Notice something important: the hash value itself is not explicitly stored in the block. So you cannot just append some fabricated value that falls below the target value onto the block in lieu of a valid PoW. To create a valid block, you must construct it such that all other network nodes can independently verify it as being valid, and to do so, they use a hash function.
As Pieter mentioned, hash functions are unpredictable 'one-way' functions. The only way to find a valid output is by trying a huge number of possible inputs, and 'getting lucky', so to speak.
answered 7 hours ago
chytrikchytrik
7,4022628
It's not quite that simple. The hash needs to be resistant to pre-image attacks.
– jpmc26
3 hours ago
@jpmc26 Any useful cryptographic hash function should be.
– immibis
41 mins ago
add a comment |
EDIT: For clarity, I mean this in the sense of what part of the technology requires me to use a hash function? As opposed, to just constructing something that looks like a valid hash.
When determining whether or not a block is valid, each and every bitcoin node on the network will take the header of that block, and run it through a hashing algorithm to see what the output is. If the output is lower than the target value, then the block is valid (assuming that the rest of the block is also valid, of course).
Notice something important: the hash value itself is not explicitly stored in the block. So you cannot just append some fabricated value that falls below the target value onto the block in lieu of a valid PoW. To create a valid block, you must construct it such that all other network nodes can independently verify it as being valid, and to do so, they use a hash function.
As Pieter mentioned, hash functions are unpredictable 'one-way' functions. The only way to find a valid output is by trying a huge number of possible inputs, and 'getting lucky', so to speak.
answered 7 hours ago
chytrikchytrik
7,4022628
EDIT: For clarity, I mean this in the sense of what part of the technology requires me to use a hash function? As opposed, to just constructing something that looks like a valid hash.
When determining whether or not a block is valid, each and every bitcoin node on the network will take the header of that block, and run it through a hashing algorithm to see what the output is. If the output is lower than the target value, then the block is valid (assuming that the rest of the block is also valid, of course).
Notice something important: the hash value itself is not explicitly stored in the block. So you cannot just append some fabricated value that falls below the target value onto the block in lieu of a valid PoW. To create a valid block, you must construct it such that all other network nodes can independently verify it as being valid, and to do so, they use a hash function.
As Pieter mentioned, hash functions are unpredictable 'one-way' functions. The only way to find a valid output is by trying a huge number of possible inputs, and 'getting lucky', so to speak.
answered 7 hours ago
chytrikchytrik
7,4022628
answered 7 hours ago
chytrikchytrik
7,4022628
answered 7 hours ago
chytrikchytrik
7,4022628
answered 7 hours ago
chytrikchytrik
7,4022628
7,4022628
It's not quite that simple. The hash needs to be resistant to pre-image attacks.
– jpmc26
3 hours ago
@jpmc26 Any useful cryptographic hash function should be.
– immibis
41 mins ago
add a comment |
It's not quite that simple. The hash needs to be resistant to pre-image attacks.
– jpmc26
3 hours ago
@jpmc26 Any useful cryptographic hash function should be.
– immibis
41 mins ago
It's not quite that simple. The hash needs to be resistant to pre-image attacks.
– jpmc26
3 hours ago
It's not quite that simple. The hash needs to be resistant to pre-image attacks.
– jpmc26
3 hours ago
@jpmc26 Any useful cryptographic hash function should be.
– immibis
41 mins ago
@jpmc26 Any useful cryptographic hash function should be.
– immibis
41 mins ago
add a comment |
Hash functions are unpredictable.
You can't simply find an input to the hash function that produces such an output. The only way to accomplish that is by trying lots and lots of candidate blocks as input. If the target is 1000 times smaller, it requires 1000 times as many tries.
answered 8 hours ago
Pieter WuillePieter Wuille
48.2k3100162
Deleted comment. Please see edit to question.
– Zduff
8 hours ago
add a comment |
Hash functions are unpredictable.
You can't simply find an input to the hash function that produces such an output. The only way to accomplish that is by trying lots and lots of candidate blocks as input. If the target is 1000 times smaller, it requires 1000 times as many tries.
answered 8 hours ago
Pieter WuillePieter Wuille
48.2k3100162
Deleted comment. Please see edit to question.
– Zduff
8 hours ago
add a comment |
Hash functions are unpredictable.
You can't simply find an input to the hash function that produces such an output. The only way to accomplish that is by trying lots and lots of candidate blocks as input. If the target is 1000 times smaller, it requires 1000 times as many tries.
answered 8 hours ago
Pieter WuillePieter Wuille
48.2k3100162
Hash functions are unpredictable.
You can't simply find an input to the hash function that produces such an output. The only way to accomplish that is by trying lots and lots of candidate blocks as input. If the target is 1000 times smaller, it requires 1000 times as many tries.
answered 8 hours ago
Pieter WuillePieter Wuille
48.2k3100162
answered 8 hours ago
Pieter WuillePieter Wuille
48.2k3100162
answered 8 hours ago
Pieter WuillePieter Wuille
48.2k3100162
answered 8 hours ago
Pieter WuillePieter Wuille
48.2k3100162
48.2k3100162
Deleted comment. Please see edit to question.
– Zduff
8 hours ago
add a comment |
Deleted comment. Please see edit to question.
– Zduff
8 hours ago
Deleted comment. Please see edit to question.
– Zduff
8 hours ago
Deleted comment. Please see edit to question.
– Zduff
8 hours ago
add a comment |
Zduff is a new contributor. Be nice, and check out our Code of Conduct.
Zduff is a new contributor. Be nice, and check out our Code of Conduct.
Zduff is a new contributor. Be nice, and check out our Code of Conduct.
Zduff is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Bitcoin Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fbitcoin.stackexchange.com%2fquestions%2f85994%2fwhat-is-preventing-me-from-simply-constructing-a-hash-thats-lower-than-the-curr%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
