|
|
|
@ -1675,6 +1675,7 @@ our tree with this knowledge as shown in <<diagram_mast3>>.
|
|
|
|
|
.A MAST with the most-expected script in the best position
|
|
|
|
|
image::images/mbc3_0707.png["A MAST with the most-expected script in the best position"]
|
|
|
|
|
|
|
|
|
|
[role="less_space pagebreak-before"]
|
|
|
|
|
Now we only need to provide two commitments for the common case (saving 32
|
|
|
|
|
bytes), although we still need three commitments for the less common cases.
|
|
|
|
|
If you know (or can guess) the probabilities of
|
|
|
|
|