From dd39f9ebae2ba880a6b442e201c02f9dc2f1ab9e Mon Sep 17 00:00:00 2001 From: Refael Jan Date: Thu, 22 Feb 2024 12:32:11 +0200 Subject: [PATCH 1/2] Update ch06_transactions.adoc small fix for the description of how output scripts in old nodes can spent segwit output script (anyone-can-spend script). The way is by using input script containing OP_TRUE command, as described in the first mention of "anyone-can-spend" in this chapter, and not by using empty input script --- ch06_transactions.adoc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ch06_transactions.adoc b/ch06_transactions.adoc index db25c8f3..1b1af64d 100644 --- a/ch06_transactions.adoc +++ b/ch06_transactions.adoc @@ -952,7 +952,7 @@ program_. It's also possible to wrap the segwit template in a P2SH commitment, but we won't deal with that in this chapter. From the perspective of old nodes, these output script templates can be -spent with an empty input script. From the perspective of a new node that +spent with an input script containing just OP_TRUE. From the perspective of a new node that is aware of the new segwit rules, any payment to a segwit output script template must only be spent with an empty input script. Notice the difference here: old nodes _allow_ an empty input script; new nodes From afdc6a6a6b870d27415e09e83540a6776a401e1d Mon Sep 17 00:00:00 2001 From: Rafael Jan Date: Fri, 19 Jul 2024 14:09:23 +0300 Subject: [PATCH 2/2] Update ch07_authorization-authentication.adoc 1. Remove unneeded "the" 2. Make MAST Versus MAST a header --- ch07_authorization-authentication.adoc | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/ch07_authorization-authentication.adoc b/ch07_authorization-authentication.adoc index 69bdf972..c69771ec 100644 --- a/ch07_authorization-authentication.adoc +++ b/ch07_authorization-authentication.adoc @@ -1670,7 +1670,7 @@ exceeds the number of conditions that all the computers in the world could create. It's commonly the case that not every authorization condition is equally -as likely to be used. In the our example case, we expect Mohammed and +as likely to be used. In our example case, we expect Mohammed and his partners to spend their money frequently; the time delayed conditions only exist in case something goes wrong. We can restructure our tree with this knowledge as shown in <>. @@ -1698,8 +1698,8 @@ Except for increasing the complexity of Bitcoin slightly, there are no significant downsides of MAST for Bitcoin and there were two solid proposals for it, BIP114 and BIP116, before an improved approach was discovered, which we'll see in <>. - -.MAST Versus MAST +[[mast_versus_mast]] +=== MAST Versus MAST **** The earliest((("abstract syntax trees (AST)")))((("AST (abstract syntax trees)"))) idea for what we now know as _MAST_ in Bitcoin was _merklized abstract syntax trees_. In an abstract syntax tree (AST),