Difference between revisions of "Catch-Up Package"
From Internet Computer Wiki
| Line 1: | Line 1: | ||
= This Page is Still Work in Progress = | = This Page is Still Work in Progress = | ||
| − | A CUP is a special message (not on the blockchain) that has (mostly) everything a replica needs to begin working in a given epoch, without knowing anything about previous epochs. It consists of the following data fields: | + | A Catch-Up Package (CUP) is a special message (not on the blockchain) that has (mostly) everything a replica needs to begin working in a given epoch, without knowing anything about previous epochs. It consists of the following data fields: |
* The root of a Merkle hash tree for the entire replicated state (as opposed to the partial, per-round certified state). | * The root of a Merkle hash tree for the entire replicated state (as opposed to the partial, per-round certified state). | ||
* The summary block for the epoch. | * The summary block for the epoch. | ||
* The random beacon for the first round of the epoch. | * The random beacon for the first round of the epoch. | ||
* A signature on the above fields under the (n − f)-out-of-n threshold signing key for the subnet. | * A signature on the above fields under the (n − f)-out-of-n threshold signing key for the subnet. | ||
Revision as of 15:15, 23 November 2022
This Page is Still Work in Progress
A Catch-Up Package (CUP) is a special message (not on the blockchain) that has (mostly) everything a replica needs to begin working in a given epoch, without knowing anything about previous epochs. It consists of the following data fields:
- The root of a Merkle hash tree for the entire replicated state (as opposed to the partial, per-round certified state).
- The summary block for the epoch.
- The random beacon for the first round of the epoch.
- A signature on the above fields under the (n − f)-out-of-n threshold signing key for the subnet.