Datasets:
rgb-protocol
/
rgb-protocol-on-bitcoin

Dataset card Data Studio Files
xet
 Community
1
text
stringlengths
0
1.08k
* `w=8` for every node in the tree.
{% code fullWidth="true" %}
```
+--------------------------+
mpc:Root | th_MPC(tHABCD || tHEFGH) |
+-----------^---------^----+
| |
+------------------------------------------------+ +--------------------------------------------+
| |
+-------------+---------------+ +-------------+---------------+
| tH_MPC_BRANCH(tHAB || tHCD) | | tH_MPC_BRANCH(tHEF || tHGH) |
+----------------^--------^---+ +-----------------+--------+--+
| | | |
+---------------------------+ +--------------+ +------------------<---------+ +------------+
| | | |
+-------------+-------------+ +-------------+-------------+ +-------------+-------------+ +-------------+-------------+
| tH_MPC_BRANCH(tHA || tHB) | | tH_MPC_BRANCH(tHC || tHD) | | tH_MPC_BRANCH(tHE || tHF) | | tH_MPC_BRANCH(tHG || tHH) |
+----------------^------^---+ +----------------^------^---+ +----------------^------^---+ +----------------^------^---+
| | | | | | | |
+--------------+ +-----+ +--------------+ +- ---+ +--------------+ + ----+ +--------------+ +-----+
| | | | | | | |
+-------+--------+ +---------+------+ +-------+--------+ +---------+------+ +-------+--------+ +---------+------+ +------+---------+ +--------+-------+
| tH_MPC_LEAF(A) | | tH_MPC_LEAF(B) | | tH_MPC_LEAF(C) | | tH_MPC_LEAF(D) | | tH_MPC_LEAF(E) | | tH_MPC_LEAF(F) | | tH_MPC_LEAF(G) | | tH_MPC_LEAF(H) |
+-------------^--+ +-------------^--+ +-------------^--+ +-------------^--+ +-------------^--+ +-------------^--+ +-------------^--+ +-------------^--+
| | | | | | | |
+--------------+-------+ +--------------+-------+ +--------------+----------+ +-----------+---------+ +------------+------------+ +---------+------------+ +---------+------------+ +---------+---------------+
| 0x11 || entropy || 0 | | 0x11 || entropy || 1 | | 0x10 || c_2 || BUNDLE_2 | | 0x11 | entropy || 3 | | 0x10 || c_1 || BUNDLE_1 | | 0x11 || entropy || 5 | | 0x11 || entropy || 6 | | 0x10 || c_0 || BUNDLE_0 |
+----------------------+ +----------------------+ +-------------------------+ +---------------------+ +-------------------------+ +----------------------+ +----------------------+ +-------------------------+
```
{% endcode %}
### MPC Tree Verification
From a verifier's perspective, in order to prove the presence of client-side validated data related to some contract `c_i` collected in `BUNDLE_i`, **only a Merkle Proof pointing at it inside the tree is needed**. Because of this, different verifiers of different contracts don't need to have the full view of the Merkle...
{% code fullWidth="true" %}
```
+-------------------------------+
| tH_MPC_ROOT(tHABCD || tHEFGH) |
+----------------^---------^----+
| |
+-----------------------------------------------------+ +---------------------------------------+
| |
+-------------+---------------+ +-------------+---------------+
| tH_MPC_BRANCH(tHAB || tHCD) | | tH_MPC_BRANCH(tHEF || tHGH) |
+----------------^--------^---+ +-----------------------------+
| |
+---------------------------+ +--------------+
| |
+-------------+-------------+ +-------------+-------------+
| tH_MPC_BRANCH(tHA || tHB) | | tH_MPC_BRANCH(tHC || tHD) |
+---------------------------+ +----------------^------^---+
| |
+--------------+ +- ---+
| |
+-------+--------+ +---------+------+
| tH_MPC_LEAF(C) | | tH_MPC_LEAF(D) |
+-------------^--+ +-------------^--+
|
+-------------------------+
| 0x10 || c_2 || BUNDLE_2 |
+-------------------------+
```
{% endcode %}
So the Merkle Proof provided to verify the existence and uniqueness of contract commitment in the tree is: `tH_MPC_LEAF(D)`, `tH_MPC_BRANCH(tHA || tHB)` and `tH_MPC_BRANCH(tHEF || tHGH)`. These are enough to recompute the tree root and, together with `pos(c_2)` and `cofacor`, reproduce the MPC commitment to be compared...
# Anchors
Anchors are the client-side validated structures that summarize all the data needed to validate contract commitments, which were described in the previous section. They are composed of the following ordered fields:
* `Txid`
* `MPC Proof`
* `Extra Transaction Proof ETP`
Where:
## TxId
`Txid` is the 32-byte ID of the transaction containing the Opret / Tapret commitment. Note that `TxId` could theoretically be reconstructed from the off-chain data of [state transitions](https://docs.rgb.info/annexes/glossary#state-transition) pointing to each [witness transaction](https://docs.rgb.info/annexes/glossar...
## MPC Proof
The `MPC Proof` of the contract `c_i` consists of `depth`, `cofactor` and `Merkle Proof` which were described [previously](https://docs.rgb.info/multi-protocol-commitments-mpc#mpc-tree-construction).
## Extra Transaction Proof - ETP
If an [Opret](https://docs.rgb.info/commitment-layer/deterministic-bitcoin-commitments-dbc/opret) commitment is used, no additional proof is provided in this field, since, as described in [the previous section](https://docs.rgb.info/commitment-layer/deterministic-bitcoin-commitments-dbc/opret), the verifier inspects th...
If a [Tapret](https://docs.rgb.info/commitment-layer/deterministic-bitcoin-commitments-dbc/tapret) commitment is used, a so called **Extra Transaction Proof - ETP** must be provided, which consists of:
* Internal Public Key `P` of the Taproot output used.
* Partner node(s) of the [Taproot](https://docs.rgb.info/annexes/glossary#taproot) `Script Path Spend` which is either:
* The top left branch (in the [example](https://docs.rgb.info/deterministic-bitcoin-commitments-dbc/tapret#tapret-incorporation-in-pre-existing-script-path-spend): `tHABC`) if the `Tapret` commitment is on the right side of the tree.