What is preventing me from simply constructing a hash that's lower than the current target? The 2019 Stack Overflow Developer Survey Results Are InHow do the clients agree on the target to hash for?How is a block header hash compared to the target (bits)?How does mining process takes Approximately 10 minutes?if a Bitcoin mining nounce is just 32 bits long how come is it increasingly difficult to find the winning hash?What is #Hash in bitcoin from a layman's perspective?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?What is a good resource to learn about bitcoinMining: what is the lowest possible target? Could it be a block hash of all zeros?
What information about me do stores get via my credit card?
Why was M87 targeted for the Event Horizon Telescope instead of Sagittarius A*?
Why not take a picture of a closer black hole?
Ubuntu Server install with full GUI
Deal with toxic manager when you can't quit
What do these terms in Caesar's Gallic wars mean?
If I can cast sorceries at instant speed, can I use sorcery-speed activated abilities at instant speed?
How to support a colleague who finds meetings extremely tiring?
Is it correct to say the Neural Networks are an alternative way of performing Maximum Likelihood Estimation? if not, why?
Geography at the pixel level
Is Cinnamon a desktop environment or a window manager? (Or both?)
Cooking pasta in a water boiler
Can we generate random numbers using irrational numbers like π and e?
Can there be female White Walkers?
I am an eight letter word. What am I?
For what reasons would an animal species NOT cross a *horizontal* land bridge?
If a sorcerer casts the Banishment spell on a PC while in Avernus, does the PC return to their home plane?
What is the most efficient way to store a numeric range?
Is an up-to-date browser secure on an out-of-date OS?
Pokemon Turn Based battle (Python)
The phrase "to the numbers born"?
Why doesn't UInt have a toDouble()?
Will it cause any balance problems to have PCs level up and gain the benefits of a long rest mid-fight?
What to do when moving next to a bird sanctuary with a loosely-domesticated cat?
What is preventing me from simply constructing a hash that's lower than the current target?
The 2019 Stack Overflow Developer Survey Results Are InHow do the clients agree on the target to hash for?How is a block header hash compared to the target (bits)?How does mining process takes Approximately 10 minutes?if a Bitcoin mining nounce is just 32 bits long how come is it increasingly difficult to find the winning hash?What is #Hash in bitcoin from a layman's perspective?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?What is a good resource to learn about bitcoinMining: what is the lowest possible target? Could it be a block hash of all zeros?
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 found 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? As opposed, to just constructing something that looks like a valid hash.
mining-theory hash
asked 4 hours ago
ZduffZduff
1085
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 found 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? As opposed, to just constructing something that looks like a valid hash.
mining-theory hash
asked 4 hours ago
ZduffZduff
1085
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 found 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? As opposed, to just constructing something that looks like a valid hash.
mining-theory hash
asked 4 hours ago
ZduffZduff
1085
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 found 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? As opposed, to just constructing something that looks like a valid hash.
mining-theory hash
mining-theory hash
asked 4 hours ago
ZduffZduff
1085
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 4 hours ago
ZduffZduff
1085
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 4 hours ago
Zduff
asked 4 hours ago
ZduffZduff
1085
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 4 hours ago
ZduffZduff
1085
asked 4 hours ago
ZduffZduff
1085
1085
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 3 hours ago
chytrikchytrik
7,3822628
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 4 hours ago
Pieter WuillePieter Wuille
48.2k3100162
Deleted comment. Please see edit to question.
– Zduff
4 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');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
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 3 hours ago
chytrikchytrik
7,3822628
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 3 hours ago
chytrikchytrik
7,3822628
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 3 hours ago
chytrikchytrik
7,3822628
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 3 hours ago
chytrikchytrik
7,3822628
answered 3 hours ago
chytrikchytrik
7,3822628
answered 3 hours ago
chytrikchytrik
7,3822628
answered 3 hours ago
chytrikchytrik
7,3822628
7,3822628
add a comment |
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 4 hours ago
Pieter WuillePieter Wuille
48.2k3100162
Deleted comment. Please see edit to question.
– Zduff
4 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 4 hours ago
Pieter WuillePieter Wuille
48.2k3100162
Deleted comment. Please see edit to question.
– Zduff
4 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 4 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 4 hours ago
Pieter WuillePieter Wuille
48.2k3100162
answered 4 hours ago
Pieter WuillePieter Wuille
48.2k3100162
answered 4 hours ago
Pieter WuillePieter Wuille
48.2k3100162
answered 4 hours ago
Pieter WuillePieter Wuille
48.2k3100162
48.2k3100162
Deleted comment. Please see edit to question.
– Zduff
4 hours ago
add a comment |
Deleted comment. Please see edit to question.
– Zduff
4 hours ago
Deleted comment. Please see edit to question.
– Zduff
4 hours ago
Deleted comment. Please see edit to question.
– Zduff
4 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');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
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');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
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');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
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');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
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
