Is verification of a blockchain computationally cheaper than recreating it?What exactly is Mining?What is the Merkle root?can I use elements of the blockchain to protect the integrity of a leaderboard without central servers?How scalable is a Blockchain-based system?Exchange Transaction versus Blockchain VerificationHow Blockchain transaction verification takes place?Can a Blockchain be Built Like This?How do you get Sibling Hashed Values in a Merkle Proof?Blockchain and anonymous data inside the chainHow and why we need to validate a transaction?Why do we need to chain the blocks (creating blockchain) in a permissioned blockchain?
Need help identifying how to open this bolt/screw
Export economy of Mars
Being told my "network" isn't PCI Complaint. I don't even have a server! Do I have to comply?
In Haskell, when using the XStrict language extension, is if short-circuiting?
Is Norway in the Single Market?
Why are sugars in whole fruits not digested the same way sugars in juice are?
Reasons for using monsters as bioweapons
How to power down external drive safely
Why are Star Wars Rebel Alliance ships named after letters from the Latin alphabet?
Ernie and the Superconducting Boxes
How do I respond appropriately to an overseas company that obtained a visa for me without hiring me?
Skipping same old introductions
Transistor design with beta variation
How do I solve such questions on paramagnetism and ferromagnetism?
HackerRank Implement Queue using two stacks Solution
What do the screens say after you are set free?
How do you say 3 ↑↑↑ 3?
Why interlaced CRT scanning wasn't done back and forth?
Deploy custom Lightning App Home Page assignment using SalesforceDX
Does the use of a new concept require a prior definition?
Can it be useful for a player block with a hanging piece in a back rank mate situation?
Why do we need a voltage divider when we get the same voltage at the output as the input?
Map vs. Table for index-specific operations on 2D arrays
UX writing: When to use "we"?
Is verification of a blockchain computationally cheaper than recreating it?
What exactly is Mining?What is the Merkle root?can I use elements of the blockchain to protect the integrity of a leaderboard without central servers?How scalable is a Blockchain-based system?Exchange Transaction versus Blockchain VerificationHow Blockchain transaction verification takes place?Can a Blockchain be Built Like This?How do you get Sibling Hashed Values in a Merkle Proof?Blockchain and anonymous data inside the chainHow and why we need to validate a transaction?Why do we need to chain the blocks (creating blockchain) in a permissioned blockchain?
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
One of the advantages of cryptocurrencies like Bitcoin that is often repeated is how hard it should be to manipulate past transactions. The reason that is often stated is that you would have to re-calculate all the headers with all the hash values of the whole chain which is practically un-doable.
My question is: How do you verify the blockchain integrity? Don't you also have to recalculate all the values to see whether they are valid? Or is the complexity class of verification different from creating a new chain? In other words is there some asymmetry at work here and if yes how does it work?
blockchain hash transaction-verification algorithms theory
asked 8 hours ago
vonjdvonjd
1085 bronze badges
New contributor
vonjd 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 |
One of the advantages of cryptocurrencies like Bitcoin that is often repeated is how hard it should be to manipulate past transactions. The reason that is often stated is that you would have to re-calculate all the headers with all the hash values of the whole chain which is practically un-doable.
My question is: How do you verify the blockchain integrity? Don't you also have to recalculate all the values to see whether they are valid? Or is the complexity class of verification different from creating a new chain? In other words is there some asymmetry at work here and if yes how does it work?
blockchain hash transaction-verification algorithms theory
asked 8 hours ago
vonjdvonjd
1085 bronze badges
New contributor
vonjd 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 |
One of the advantages of cryptocurrencies like Bitcoin that is often repeated is how hard it should be to manipulate past transactions. The reason that is often stated is that you would have to re-calculate all the headers with all the hash values of the whole chain which is practically un-doable.
My question is: How do you verify the blockchain integrity? Don't you also have to recalculate all the values to see whether they are valid? Or is the complexity class of verification different from creating a new chain? In other words is there some asymmetry at work here and if yes how does it work?
blockchain hash transaction-verification algorithms theory
asked 8 hours ago
vonjdvonjd
1085 bronze badges
New contributor
vonjd is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
One of the advantages of cryptocurrencies like Bitcoin that is often repeated is how hard it should be to manipulate past transactions. The reason that is often stated is that you would have to re-calculate all the headers with all the hash values of the whole chain which is practically un-doable.
My question is: How do you verify the blockchain integrity? Don't you also have to recalculate all the values to see whether they are valid? Or is the complexity class of verification different from creating a new chain? In other words is there some asymmetry at work here and if yes how does it work?
blockchain hash transaction-verification algorithms theory
blockchain hash transaction-verification algorithms theory
asked 8 hours ago
vonjdvonjd
1085 bronze badges
New contributor
vonjd 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
vonjdvonjd
1085 bronze badges
New contributor
vonjd is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 6 hours ago
vonjd
asked 8 hours ago
vonjdvonjd
1085 bronze badges
New contributor
vonjd 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
vonjdvonjd
1085 bronze badges
asked 8 hours ago
vonjdvonjd
1085 bronze badges
1085 bronze badges
New contributor
vonjd is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
vonjd 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
Is verification of blockchain computationally cheaper than recreating it?
Yes, far easier
How do you verify the blockchain integrity? Don't you also have to recalculate all the values to see whether they are valid?
No.
The miner has to find a value for parts of the block they can choose a value for, such that a hash of the block has a certain number of leading zeroes. This is impossible to predict without actually calculating the hash. So miners have to try a very large number of different choices before finding one that produces the hash with the required number of leading zeroes.
The verifier only has to recalculate that hash once because they don't need to vary any part of the block.
(note, the above is a simplification but the principles apply)
Reference:
- Nonce
- What exactly is Mining?
answered 8 hours ago
RedGrittyBrickRedGrittyBrick
3,6081 gold badge10 silver badges22 bronze badges
add a comment |
The reason that is often stated is that you would have to re-calculate all the headers with all the hash values of the whole chain which is practically un-doable.
It's not the mere recalculation of new headers: miners currently create about 8×10^19 block candidates every second. However, at current difficulty levels, it takes about 4.8×10^22 block candidates until a valid block is found. E.g. to change the history five blocks back, you have to find six blocks (approximately 2.9×10^23 block candidates) before the whole network together finds one more block.
answered 8 hours ago
Murch♦Murch
35.9k27 gold badges119 silver badges350 bronze badges
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
);
);
vonjd 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%2f89573%2fis-verification-of-a-blockchain-computationally-cheaper-than-recreating-it%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
Is verification of blockchain computationally cheaper than recreating it?
Yes, far easier
How do you verify the blockchain integrity? Don't you also have to recalculate all the values to see whether they are valid?
No.
The miner has to find a value for parts of the block they can choose a value for, such that a hash of the block has a certain number of leading zeroes. This is impossible to predict without actually calculating the hash. So miners have to try a very large number of different choices before finding one that produces the hash with the required number of leading zeroes.
The verifier only has to recalculate that hash once because they don't need to vary any part of the block.
(note, the above is a simplification but the principles apply)
Reference:
- Nonce
- What exactly is Mining?
answered 8 hours ago
RedGrittyBrickRedGrittyBrick
3,6081 gold badge10 silver badges22 bronze badges
add a comment |
Is verification of blockchain computationally cheaper than recreating it?
Yes, far easier
How do you verify the blockchain integrity? Don't you also have to recalculate all the values to see whether they are valid?
No.
The miner has to find a value for parts of the block they can choose a value for, such that a hash of the block has a certain number of leading zeroes. This is impossible to predict without actually calculating the hash. So miners have to try a very large number of different choices before finding one that produces the hash with the required number of leading zeroes.
The verifier only has to recalculate that hash once because they don't need to vary any part of the block.
(note, the above is a simplification but the principles apply)
Reference:
- Nonce
- What exactly is Mining?
answered 8 hours ago
RedGrittyBrickRedGrittyBrick
3,6081 gold badge10 silver badges22 bronze badges
add a comment |
Is verification of blockchain computationally cheaper than recreating it?
Yes, far easier
How do you verify the blockchain integrity? Don't you also have to recalculate all the values to see whether they are valid?
No.
The miner has to find a value for parts of the block they can choose a value for, such that a hash of the block has a certain number of leading zeroes. This is impossible to predict without actually calculating the hash. So miners have to try a very large number of different choices before finding one that produces the hash with the required number of leading zeroes.
The verifier only has to recalculate that hash once because they don't need to vary any part of the block.
(note, the above is a simplification but the principles apply)
Reference:
- Nonce
- What exactly is Mining?
answered 8 hours ago
RedGrittyBrickRedGrittyBrick
3,6081 gold badge10 silver badges22 bronze badges
Is verification of blockchain computationally cheaper than recreating it?
Yes, far easier
How do you verify the blockchain integrity? Don't you also have to recalculate all the values to see whether they are valid?
No.
The miner has to find a value for parts of the block they can choose a value for, such that a hash of the block has a certain number of leading zeroes. This is impossible to predict without actually calculating the hash. So miners have to try a very large number of different choices before finding one that produces the hash with the required number of leading zeroes.
The verifier only has to recalculate that hash once because they don't need to vary any part of the block.
(note, the above is a simplification but the principles apply)
Reference:
- Nonce
- What exactly is Mining?
answered 8 hours ago
RedGrittyBrickRedGrittyBrick
3,6081 gold badge10 silver badges22 bronze badges
edited 8 hours ago
answered 8 hours ago
RedGrittyBrickRedGrittyBrick
3,6081 gold badge10 silver badges22 bronze badges
answered 8 hours ago
RedGrittyBrickRedGrittyBrick
3,6081 gold badge10 silver badges22 bronze badges
answered 8 hours ago
RedGrittyBrickRedGrittyBrick
3,6081 gold badge10 silver badges22 bronze badges
3,6081 gold badge10 silver badges22 bronze badges
add a comment |
add a comment |
The reason that is often stated is that you would have to re-calculate all the headers with all the hash values of the whole chain which is practically un-doable.
It's not the mere recalculation of new headers: miners currently create about 8×10^19 block candidates every second. However, at current difficulty levels, it takes about 4.8×10^22 block candidates until a valid block is found. E.g. to change the history five blocks back, you have to find six blocks (approximately 2.9×10^23 block candidates) before the whole network together finds one more block.
answered 8 hours ago
Murch♦Murch
35.9k27 gold badges119 silver badges350 bronze badges
add a comment |
The reason that is often stated is that you would have to re-calculate all the headers with all the hash values of the whole chain which is practically un-doable.
It's not the mere recalculation of new headers: miners currently create about 8×10^19 block candidates every second. However, at current difficulty levels, it takes about 4.8×10^22 block candidates until a valid block is found. E.g. to change the history five blocks back, you have to find six blocks (approximately 2.9×10^23 block candidates) before the whole network together finds one more block.
answered 8 hours ago
Murch♦Murch
35.9k27 gold badges119 silver badges350 bronze badges
add a comment |
The reason that is often stated is that you would have to re-calculate all the headers with all the hash values of the whole chain which is practically un-doable.
It's not the mere recalculation of new headers: miners currently create about 8×10^19 block candidates every second. However, at current difficulty levels, it takes about 4.8×10^22 block candidates until a valid block is found. E.g. to change the history five blocks back, you have to find six blocks (approximately 2.9×10^23 block candidates) before the whole network together finds one more block.
answered 8 hours ago
Murch♦Murch
35.9k27 gold badges119 silver badges350 bronze badges
The reason that is often stated is that you would have to re-calculate all the headers with all the hash values of the whole chain which is practically un-doable.
It's not the mere recalculation of new headers: miners currently create about 8×10^19 block candidates every second. However, at current difficulty levels, it takes about 4.8×10^22 block candidates until a valid block is found. E.g. to change the history five blocks back, you have to find six blocks (approximately 2.9×10^23 block candidates) before the whole network together finds one more block.
answered 8 hours ago
Murch♦Murch
35.9k27 gold badges119 silver badges350 bronze badges
answered 8 hours ago
Murch♦Murch
35.9k27 gold badges119 silver badges350 bronze badges
answered 8 hours ago
Murch♦Murch
35.9k27 gold badges119 silver badges350 bronze badges
answered 8 hours ago
Murch♦Murch
35.9k27 gold badges119 silver badges350 bronze badges
35.9k27 gold badges119 silver badges350 bronze badges
add a comment |
add a comment |
vonjd is a new contributor. Be nice, and check out our Code of Conduct.
vonjd is a new contributor. Be nice, and check out our Code of Conduct.
vonjd is a new contributor. Be nice, and check out our Code of Conduct.
vonjd 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%2f89573%2fis-verification-of-a-blockchain-computationally-cheaper-than-recreating-it%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
