arno/bitcoinbook
1
0
Fork 0
mirror of https://github.com/bitcoinbook/bitcoinbook synced 2024-11-26 01:50:42 +00:00
Code Issues Releases Wiki Activity

Edited ch06_transactions.adoc with Atlas code editor

Browse Source
This commit is contained in:
clenser 2023-10-19 19:33:02 +00:00
parent fccc481a8e
commit 6876dbe543
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
ch06_transactions.adoc
View File

@ -931,12 +931,12 @@ a txid is called _segregated witness_ (segwit).
The obvious method for implementing segwit requires a The obvious method for implementing segwit requires a
change to Bitcoin's consensus rules that would not be compatible with change to Bitcoin's consensus rules that would not be compatible with
older full nodes, also ((("hard forks")))((("forks", "hard")))called older full nodes, also ((("hard forks")))((("forks", "hard forks")))called
a _hard fork_. Hard forks come with a lot of challenges, as we'll a _hard fork_. Hard forks come with a lot of challenges, as we'll
discuss further in <<hard_forks>>. discuss further in <<hard_forks>>.
An alternative approach to segwit was described in late 2015. This An alternative approach to segwit was described in late 2015. This
would use a backward-compatible change to the consensus rules, ((("soft forks")))((("forks", "soft")))called a would use a backward-compatible change to the consensus rules, ((("soft forks")))((("forks", "soft forks")))called a
_soft fork_. Backward compatible means that full nodes implementing _soft fork_. Backward compatible means that full nodes implementing
the change must not accept any blocks that full nodes without the change the change must not accept any blocks that full nodes without the change
would consider invalid. As long as they obey that rule, newer full would consider invalid. As long as they obey that rule, newer full