SwiftSync alleviates both of these limitations, allowing for IBD with assume-valid assumptions in as fast as 66 minutes.
Having only a benchmark for the assume-valid variant is optimistic; should add both or not mention at all. The i/o and utxo lookup elimination benefit remains a strong motivation.
$Agg = H_{salt}(Coin_{0}) + ... + H_{salt}(Coin_{i})$
Should add the modulo:
$Agg = H_{salt}(Coin_{0}) + ... + H_{salt}(Coin_{i}) \bmod 2^{256}$
If you want to be more formal, replace "salt" with the tweakable hash formalism:
$H : \mathcal{T} \times \mathcal{M} \to {0,1}^{256}$, where each client sample t from the Tweak space randomly
Using the undo data, validate the block
What do you mean by validate the block here? You should be explicit here to mention all the block validation done; if we do everything except validating whether inputs are spending unspent transaction outputs, mention that.
Having only a benchmark for the assume-valid variant is optimistic; should add both or not mention at all. The i/o and utxo lookup elimination benefit remains a strong motivation.
Should add the modulo:
$Agg = H_{salt}(Coin_{0}) + ... + H_{salt}(Coin_{i}) \bmod 2^{256}$
If you want to be more formal, replace "salt" with the tweakable hash formalism:
$H : \mathcal{T} \times \mathcal{M} \to {0,1}^{256}$ , where each client sample t from the Tweak space randomly
What do you mean by validate the block here? You should be explicit here to mention all the block validation done; if we do everything except validating whether inputs are spending unspent transaction outputs, mention that.