2021-03-04 01:25:12 +00:00
|
|
|
//! Utilities for managing database schema changes.
|
Refactor op pool for speed and correctness (#3312)
## Proposed Changes
This PR has two aims: to speed up attestation packing in the op pool, and to fix bugs in the verification of attester slashings, proposer slashings and voluntary exits. The changes are bundled into a single database schema upgrade (v12).
Attestation packing is sped up by removing several inefficiencies:
- No more recalculation of `attesting_indices` during packing.
- No (unnecessary) examination of the `ParticipationFlags`: a bitfield suffices. See `RewardCache`.
- No re-checking of attestation validity during packing: the `AttestationMap` provides attestations which are "correct by construction" (I have checked this using Hydra).
- No SSZ re-serialization for the clunky `AttestationId` type (it can be removed in a future release).
So far the speed-up seems to be roughly 2-10x, from 500ms down to 50-100ms.
Verification of attester slashings, proposer slashings and voluntary exits is fixed by:
- Tracking the `ForkVersion`s that were used to verify each message inside the `SigVerifiedOp`. This allows us to quickly re-verify that they match the head state's opinion of what the `ForkVersion` should be at the epoch(s) relevant to the message.
- Storing the `SigVerifiedOp` on disk rather than the raw operation. This allows us to continue track the fork versions after a reboot.
This is mostly contained in this commit 52bb1840ae5c4356a8fc3a51e5df23ed65ed2c7f.
## Additional Info
The schema upgrade uses the justified state to re-verify attestations and compute `attesting_indices` for them. It will drop any attestations that fail to verify, by the logic that attestations are most valuable in the few slots after they're observed, and are probably stale and useless by the time a node restarts. Exits and proposer slashings and similarly re-verified to obtain `SigVerifiedOp`s.
This PR contains a runtime killswitch `--paranoid-block-proposal` which opts out of all the optimisations in favour of closely verifying every included message. Although I'm quite sure that the optimisations are correct this flag could be useful in the event of an unforeseen emergency.
Finally, you might notice that the `RewardCache` appears quite useless in its current form because it is only updated on the hot-path immediately before proposal. My hope is that in future we can shift calls to `RewardCache::update` into the background, e.g. while performing the state advance. It is also forward-looking to `tree-states` compatibility, where iterating and indexing `state.{previous,current}_epoch_participation` is expensive and needs to be minimised.
2022-08-29 09:10:26 +00:00
|
|
|
mod migration_schema_v12;
|
2022-10-30 04:04:24 +00:00
|
|
|
mod migration_schema_v13;
|
2023-01-09 01:38:02 +00:00
|
|
|
mod migration_schema_v14;
|
2023-02-07 06:13:49 +00:00
|
|
|
mod migration_schema_v15;
|
2021-12-13 20:43:22 +00:00
|
|
|
|
2022-12-03 20:05:25 +00:00
|
|
|
use crate::beacon_chain::{BeaconChainTypes, ETH1_CACHE_DB_KEY};
|
2022-10-30 04:04:24 +00:00
|
|
|
use crate::eth1_chain::SszEth1;
|
Use async code when interacting with EL (#3244)
## Overview
This rather extensive PR achieves two primary goals:
1. Uses the finalized/justified checkpoints of fork choice (FC), rather than that of the head state.
2. Refactors fork choice, block production and block processing to `async` functions.
Additionally, it achieves:
- Concurrent forkchoice updates to the EL and cache pruning after a new head is selected.
- Concurrent "block packing" (attestations, etc) and execution payload retrieval during block production.
- Concurrent per-block-processing and execution payload verification during block processing.
- The `Arc`-ification of `SignedBeaconBlock` during block processing (it's never mutated, so why not?):
- I had to do this to deal with sending blocks into spawned tasks.
- Previously we were cloning the beacon block at least 2 times during each block processing, these clones are either removed or turned into cheaper `Arc` clones.
- We were also `Box`-ing and un-`Box`-ing beacon blocks as they moved throughout the networking crate. This is not a big deal, but it's nice to avoid shifting things between the stack and heap.
- Avoids cloning *all the blocks* in *every chain segment* during sync.
- It also has the potential to clean up our code where we need to pass an *owned* block around so we can send it back in the case of an error (I didn't do much of this, my PR is already big enough :sweat_smile:)
- The `BeaconChain::HeadSafetyStatus` struct was removed. It was an old relic from prior merge specs.
For motivation for this change, see https://github.com/sigp/lighthouse/pull/3244#issuecomment-1160963273
## Changes to `canonical_head` and `fork_choice`
Previously, the `BeaconChain` had two separate fields:
```
canonical_head: RwLock<Snapshot>,
fork_choice: RwLock<BeaconForkChoice>
```
Now, we have grouped these values under a single struct:
```
canonical_head: CanonicalHead {
cached_head: RwLock<Arc<Snapshot>>,
fork_choice: RwLock<BeaconForkChoice>
}
```
Apart from ergonomics, the only *actual* change here is wrapping the canonical head snapshot in an `Arc`. This means that we no longer need to hold the `cached_head` (`canonical_head`, in old terms) lock when we want to pull some values from it. This was done to avoid deadlock risks by preventing functions from acquiring (and holding) the `cached_head` and `fork_choice` locks simultaneously.
## Breaking Changes
### The `state` (root) field in the `finalized_checkpoint` SSE event
Consider the scenario where epoch `n` is just finalized, but `start_slot(n)` is skipped. There are two state roots we might in the `finalized_checkpoint` SSE event:
1. The state root of the finalized block, which is `get_block(finalized_checkpoint.root).state_root`.
4. The state root at slot of `start_slot(n)`, which would be the state from (1), but "skipped forward" through any skip slots.
Previously, Lighthouse would choose (2). However, we can see that when [Teku generates that event](https://github.com/ConsenSys/teku/blob/de2b2801c89ef5abf983d6bf37867c37fc47121f/data/beaconrestapi/src/main/java/tech/pegasys/teku/beaconrestapi/handlers/v1/events/EventSubscriptionManager.java#L171-L182) it uses [`getStateRootFromBlockRoot`](https://github.com/ConsenSys/teku/blob/de2b2801c89ef5abf983d6bf37867c37fc47121f/data/provider/src/main/java/tech/pegasys/teku/api/ChainDataProvider.java#L336-L341) which uses (1).
I have switched Lighthouse from (2) to (1). I think it's a somewhat arbitrary choice between the two, where (1) is easier to compute and is consistent with Teku.
## Notes for Reviewers
I've renamed `BeaconChain::fork_choice` to `BeaconChain::recompute_head`. Doing this helped ensure I broke all previous uses of fork choice and I also find it more descriptive. It describes an action and can't be confused with trying to get a reference to the `ForkChoice` struct.
I've changed the ordering of SSE events when a block is received. It used to be `[block, finalized, head]` and now it's `[block, head, finalized]`. It was easier this way and I don't think we were making any promises about SSE event ordering so it's not "breaking".
I've made it so fork choice will run when it's first constructed. I did this because I wanted to have a cached version of the last call to `get_head`. Ensuring `get_head` has been run *at least once* means that the cached values doesn't need to wrapped in an `Option`. This was fairly simple, it just involved passing a `slot` to the constructor so it knows *when* it's being run. When loading a fork choice from the store and a slot clock isn't handy I've just used the `slot` that was saved in the `fork_choice_store`. That seems like it would be a faithful representation of the slot when we saved it.
I added the `genesis_time: u64` to the `BeaconChain`. It's small, constant and nice to have around.
Since we're using FC for the fin/just checkpoints, we no longer get the `0x00..00` roots at genesis. You can see I had to remove a work-around in `ef-tests` here: b56be3bc2. I can't find any reason why this would be an issue, if anything I think it'll be better since the genesis-alias has caught us out a few times (0x00..00 isn't actually a real root). Edit: I did find a case where the `network` expected the 0x00..00 alias and patched it here: 3f26ac3e2.
You'll notice a lot of changes in tests. Generally, tests should be functionally equivalent. Here are the things creating the most diff-noise in tests:
- Changing tests to be `tokio::async` tests.
- Adding `.await` to fork choice, block processing and block production functions.
- Refactor of the `canonical_head` "API" provided by the `BeaconChain`. E.g., `chain.canonical_head.cached_head()` instead of `chain.canonical_head.read()`.
- Wrapping `SignedBeaconBlock` in an `Arc`.
- In the `beacon_chain/tests/block_verification`, we can't use the `lazy_static` `CHAIN_SEGMENT` variable anymore since it's generated with an async function. We just generate it in each test, not so efficient but hopefully insignificant.
I had to disable `rayon` concurrent tests in the `fork_choice` tests. This is because the use of `rayon` and `block_on` was causing a panic.
Co-authored-by: Mac L <mjladson@pm.me>
2022-07-03 05:36:50 +00:00
|
|
|
use crate::types::ChainSpec;
|
2021-12-13 20:43:22 +00:00
|
|
|
use slog::{warn, Logger};
|
2021-03-04 01:25:12 +00:00
|
|
|
use std::sync::Arc;
|
|
|
|
use store::hot_cold_store::{HotColdDB, HotColdDBError};
|
2022-05-17 04:54:39 +00:00
|
|
|
use store::metadata::{SchemaVersion, CURRENT_SCHEMA_VERSION};
|
|
|
|
use store::{Error as StoreError, StoreItem};
|
2021-03-04 01:25:12 +00:00
|
|
|
|
|
|
|
/// Migrate the database from one schema version to another, applying all requisite mutations.
|
2022-12-03 20:05:25 +00:00
|
|
|
#[allow(clippy::only_used_in_recursion)] // spec is not used but likely to be used in future
|
2021-03-04 01:25:12 +00:00
|
|
|
pub fn migrate_schema<T: BeaconChainTypes>(
|
|
|
|
db: Arc<HotColdDB<T::EthSpec, T::HotStore, T::ColdStore>>,
|
2022-10-30 04:04:24 +00:00
|
|
|
deposit_contract_deploy_block: u64,
|
2021-03-04 01:25:12 +00:00
|
|
|
from: SchemaVersion,
|
|
|
|
to: SchemaVersion,
|
2021-12-13 20:43:22 +00:00
|
|
|
log: Logger,
|
Use async code when interacting with EL (#3244)
## Overview
This rather extensive PR achieves two primary goals:
1. Uses the finalized/justified checkpoints of fork choice (FC), rather than that of the head state.
2. Refactors fork choice, block production and block processing to `async` functions.
Additionally, it achieves:
- Concurrent forkchoice updates to the EL and cache pruning after a new head is selected.
- Concurrent "block packing" (attestations, etc) and execution payload retrieval during block production.
- Concurrent per-block-processing and execution payload verification during block processing.
- The `Arc`-ification of `SignedBeaconBlock` during block processing (it's never mutated, so why not?):
- I had to do this to deal with sending blocks into spawned tasks.
- Previously we were cloning the beacon block at least 2 times during each block processing, these clones are either removed or turned into cheaper `Arc` clones.
- We were also `Box`-ing and un-`Box`-ing beacon blocks as they moved throughout the networking crate. This is not a big deal, but it's nice to avoid shifting things between the stack and heap.
- Avoids cloning *all the blocks* in *every chain segment* during sync.
- It also has the potential to clean up our code where we need to pass an *owned* block around so we can send it back in the case of an error (I didn't do much of this, my PR is already big enough :sweat_smile:)
- The `BeaconChain::HeadSafetyStatus` struct was removed. It was an old relic from prior merge specs.
For motivation for this change, see https://github.com/sigp/lighthouse/pull/3244#issuecomment-1160963273
## Changes to `canonical_head` and `fork_choice`
Previously, the `BeaconChain` had two separate fields:
```
canonical_head: RwLock<Snapshot>,
fork_choice: RwLock<BeaconForkChoice>
```
Now, we have grouped these values under a single struct:
```
canonical_head: CanonicalHead {
cached_head: RwLock<Arc<Snapshot>>,
fork_choice: RwLock<BeaconForkChoice>
}
```
Apart from ergonomics, the only *actual* change here is wrapping the canonical head snapshot in an `Arc`. This means that we no longer need to hold the `cached_head` (`canonical_head`, in old terms) lock when we want to pull some values from it. This was done to avoid deadlock risks by preventing functions from acquiring (and holding) the `cached_head` and `fork_choice` locks simultaneously.
## Breaking Changes
### The `state` (root) field in the `finalized_checkpoint` SSE event
Consider the scenario where epoch `n` is just finalized, but `start_slot(n)` is skipped. There are two state roots we might in the `finalized_checkpoint` SSE event:
1. The state root of the finalized block, which is `get_block(finalized_checkpoint.root).state_root`.
4. The state root at slot of `start_slot(n)`, which would be the state from (1), but "skipped forward" through any skip slots.
Previously, Lighthouse would choose (2). However, we can see that when [Teku generates that event](https://github.com/ConsenSys/teku/blob/de2b2801c89ef5abf983d6bf37867c37fc47121f/data/beaconrestapi/src/main/java/tech/pegasys/teku/beaconrestapi/handlers/v1/events/EventSubscriptionManager.java#L171-L182) it uses [`getStateRootFromBlockRoot`](https://github.com/ConsenSys/teku/blob/de2b2801c89ef5abf983d6bf37867c37fc47121f/data/provider/src/main/java/tech/pegasys/teku/api/ChainDataProvider.java#L336-L341) which uses (1).
I have switched Lighthouse from (2) to (1). I think it's a somewhat arbitrary choice between the two, where (1) is easier to compute and is consistent with Teku.
## Notes for Reviewers
I've renamed `BeaconChain::fork_choice` to `BeaconChain::recompute_head`. Doing this helped ensure I broke all previous uses of fork choice and I also find it more descriptive. It describes an action and can't be confused with trying to get a reference to the `ForkChoice` struct.
I've changed the ordering of SSE events when a block is received. It used to be `[block, finalized, head]` and now it's `[block, head, finalized]`. It was easier this way and I don't think we were making any promises about SSE event ordering so it's not "breaking".
I've made it so fork choice will run when it's first constructed. I did this because I wanted to have a cached version of the last call to `get_head`. Ensuring `get_head` has been run *at least once* means that the cached values doesn't need to wrapped in an `Option`. This was fairly simple, it just involved passing a `slot` to the constructor so it knows *when* it's being run. When loading a fork choice from the store and a slot clock isn't handy I've just used the `slot` that was saved in the `fork_choice_store`. That seems like it would be a faithful representation of the slot when we saved it.
I added the `genesis_time: u64` to the `BeaconChain`. It's small, constant and nice to have around.
Since we're using FC for the fin/just checkpoints, we no longer get the `0x00..00` roots at genesis. You can see I had to remove a work-around in `ef-tests` here: b56be3bc2. I can't find any reason why this would be an issue, if anything I think it'll be better since the genesis-alias has caught us out a few times (0x00..00 isn't actually a real root). Edit: I did find a case where the `network` expected the 0x00..00 alias and patched it here: 3f26ac3e2.
You'll notice a lot of changes in tests. Generally, tests should be functionally equivalent. Here are the things creating the most diff-noise in tests:
- Changing tests to be `tokio::async` tests.
- Adding `.await` to fork choice, block processing and block production functions.
- Refactor of the `canonical_head` "API" provided by the `BeaconChain`. E.g., `chain.canonical_head.cached_head()` instead of `chain.canonical_head.read()`.
- Wrapping `SignedBeaconBlock` in an `Arc`.
- In the `beacon_chain/tests/block_verification`, we can't use the `lazy_static` `CHAIN_SEGMENT` variable anymore since it's generated with an async function. We just generate it in each test, not so efficient but hopefully insignificant.
I had to disable `rayon` concurrent tests in the `fork_choice` tests. This is because the use of `rayon` and `block_on` was causing a panic.
Co-authored-by: Mac L <mjladson@pm.me>
2022-07-03 05:36:50 +00:00
|
|
|
spec: &ChainSpec,
|
2021-03-04 01:25:12 +00:00
|
|
|
) -> Result<(), StoreError> {
|
|
|
|
match (from, to) {
|
2022-10-30 04:04:24 +00:00
|
|
|
// Migrating from the current schema version to itself is always OK, a no-op.
|
2021-03-04 01:25:12 +00:00
|
|
|
(_, _) if from == to && to == CURRENT_SCHEMA_VERSION => Ok(()),
|
Separate execution payloads in the DB (#3157)
## Proposed Changes
Reduce post-merge disk usage by not storing finalized execution payloads in Lighthouse's database.
:warning: **This is achieved in a backwards-incompatible way for networks that have already merged** :warning:. Kiln users and shadow fork enjoyers will be unable to downgrade after running the code from this PR. The upgrade migration may take several minutes to run, and can't be aborted after it begins.
The main changes are:
- New column in the database called `ExecPayload`, keyed by beacon block root.
- The `BeaconBlock` column now stores blinded blocks only.
- Lots of places that previously used full blocks now use blinded blocks, e.g. analytics APIs, block replay in the DB, etc.
- On finalization:
- `prune_abanonded_forks` deletes non-canonical payloads whilst deleting non-canonical blocks.
- `migrate_db` deletes finalized canonical payloads whilst deleting finalized states.
- Conversions between blinded and full blocks are implemented in a compositional way, duplicating some work from Sean's PR #3134.
- The execution layer has a new `get_payload_by_block_hash` method that reconstructs a payload using the EE's `eth_getBlockByHash` call.
- I've tested manually that it works on Kiln, using Geth and Nethermind.
- This isn't necessarily the most efficient method, and new engine APIs are being discussed to improve this: https://github.com/ethereum/execution-apis/pull/146.
- We're depending on the `ethers` master branch, due to lots of recent changes. We're also using a workaround for https://github.com/gakonst/ethers-rs/issues/1134.
- Payload reconstruction is used in the HTTP API via `BeaconChain::get_block`, which is now `async`. Due to the `async` fn, the `blocking_json` wrapper has been removed.
- Payload reconstruction is used in network RPC to serve blocks-by-{root,range} responses. Here the `async` adjustment is messier, although I think I've managed to come up with a reasonable compromise: the handlers take the `SendOnDrop` by value so that they can drop it on _task completion_ (after the `fn` returns). Still, this is introducing disk reads onto core executor threads, which may have a negative performance impact (thoughts appreciated).
## Additional Info
- [x] For performance it would be great to remove the cloning of full blocks when converting them to blinded blocks to write to disk. I'm going to experiment with a `put_block` API that takes the block by value, breaks it into a blinded block and a payload, stores the blinded block, and then re-assembles the full block for the caller.
- [x] We should measure the latency of blocks-by-root and blocks-by-range responses.
- [x] We should add integration tests that stress the payload reconstruction (basic tests done, issue for more extensive tests: https://github.com/sigp/lighthouse/issues/3159)
- [x] We should (manually) test the schema v9 migration from several prior versions, particularly as blocks have changed on disk and some migrations rely on being able to load blocks.
Co-authored-by: Paul Hauner <paul@paulhauner.com>
2022-05-12 00:42:17 +00:00
|
|
|
// Upgrade across multiple versions by recursively migrating one step at a time.
|
2021-03-04 01:25:12 +00:00
|
|
|
(_, _) if from.as_u64() + 1 < to.as_u64() => {
|
|
|
|
let next = SchemaVersion(from.as_u64() + 1);
|
2022-10-30 04:04:24 +00:00
|
|
|
migrate_schema::<T>(
|
|
|
|
db.clone(),
|
|
|
|
deposit_contract_deploy_block,
|
|
|
|
from,
|
|
|
|
next,
|
|
|
|
log.clone(),
|
|
|
|
spec,
|
|
|
|
)?;
|
2022-11-04 07:43:43 +00:00
|
|
|
migrate_schema::<T>(db, deposit_contract_deploy_block, next, to, log, spec)
|
2021-03-04 01:25:12 +00:00
|
|
|
}
|
2022-07-28 09:43:41 +00:00
|
|
|
// Downgrade across multiple versions by recursively migrating one step at a time.
|
|
|
|
(_, _) if to.as_u64() + 1 < from.as_u64() => {
|
|
|
|
let next = SchemaVersion(from.as_u64() - 1);
|
2022-10-30 04:04:24 +00:00
|
|
|
migrate_schema::<T>(
|
|
|
|
db.clone(),
|
|
|
|
deposit_contract_deploy_block,
|
|
|
|
from,
|
|
|
|
next,
|
|
|
|
log.clone(),
|
|
|
|
spec,
|
|
|
|
)?;
|
2022-11-04 07:43:43 +00:00
|
|
|
migrate_schema::<T>(db, deposit_contract_deploy_block, next, to, log, spec)
|
2022-07-28 09:43:41 +00:00
|
|
|
}
|
2021-07-15 00:52:02 +00:00
|
|
|
|
2022-05-17 04:54:39 +00:00
|
|
|
//
|
2022-12-03 20:05:25 +00:00
|
|
|
// Migrations from before SchemaVersion(11) are deprecated.
|
2022-05-17 04:54:39 +00:00
|
|
|
//
|
2021-09-22 00:37:28 +00:00
|
|
|
|
Refactor op pool for speed and correctness (#3312)
## Proposed Changes
This PR has two aims: to speed up attestation packing in the op pool, and to fix bugs in the verification of attester slashings, proposer slashings and voluntary exits. The changes are bundled into a single database schema upgrade (v12).
Attestation packing is sped up by removing several inefficiencies:
- No more recalculation of `attesting_indices` during packing.
- No (unnecessary) examination of the `ParticipationFlags`: a bitfield suffices. See `RewardCache`.
- No re-checking of attestation validity during packing: the `AttestationMap` provides attestations which are "correct by construction" (I have checked this using Hydra).
- No SSZ re-serialization for the clunky `AttestationId` type (it can be removed in a future release).
So far the speed-up seems to be roughly 2-10x, from 500ms down to 50-100ms.
Verification of attester slashings, proposer slashings and voluntary exits is fixed by:
- Tracking the `ForkVersion`s that were used to verify each message inside the `SigVerifiedOp`. This allows us to quickly re-verify that they match the head state's opinion of what the `ForkVersion` should be at the epoch(s) relevant to the message.
- Storing the `SigVerifiedOp` on disk rather than the raw operation. This allows us to continue track the fork versions after a reboot.
This is mostly contained in this commit 52bb1840ae5c4356a8fc3a51e5df23ed65ed2c7f.
## Additional Info
The schema upgrade uses the justified state to re-verify attestations and compute `attesting_indices` for them. It will drop any attestations that fail to verify, by the logic that attestations are most valuable in the few slots after they're observed, and are probably stale and useless by the time a node restarts. Exits and proposer slashings and similarly re-verified to obtain `SigVerifiedOp`s.
This PR contains a runtime killswitch `--paranoid-block-proposal` which opts out of all the optimisations in favour of closely verifying every included message. Although I'm quite sure that the optimisations are correct this flag could be useful in the event of an unforeseen emergency.
Finally, you might notice that the `RewardCache` appears quite useless in its current form because it is only updated on the hot-path immediately before proposal. My hope is that in future we can shift calls to `RewardCache::update` into the background, e.g. while performing the state advance. It is also forward-looking to `tree-states` compatibility, where iterating and indexing `state.{previous,current}_epoch_participation` is expensive and needs to be minimised.
2022-08-29 09:10:26 +00:00
|
|
|
// Upgrade from v11 to v12 to store richer metadata in the attestation op pool.
|
|
|
|
(SchemaVersion(11), SchemaVersion(12)) => {
|
|
|
|
let ops = migration_schema_v12::upgrade_to_v12::<T>(db.clone(), log)?;
|
|
|
|
db.store_schema_version_atomically(to, ops)
|
|
|
|
}
|
|
|
|
// Downgrade from v12 to v11 to drop richer metadata from the attestation op pool.
|
|
|
|
(SchemaVersion(12), SchemaVersion(11)) => {
|
|
|
|
let ops = migration_schema_v12::downgrade_from_v12::<T>(db.clone(), log)?;
|
|
|
|
db.store_schema_version_atomically(to, ops)
|
|
|
|
}
|
2022-10-30 04:04:24 +00:00
|
|
|
(SchemaVersion(12), SchemaVersion(13)) => {
|
|
|
|
let mut ops = vec![];
|
|
|
|
if let Some(persisted_eth1_v1) = db.get_item::<SszEth1>(Ð1_CACHE_DB_KEY)? {
|
|
|
|
let upgraded_eth1_cache =
|
|
|
|
match migration_schema_v13::update_eth1_cache(persisted_eth1_v1) {
|
|
|
|
Ok(upgraded_eth1) => upgraded_eth1,
|
|
|
|
Err(e) => {
|
|
|
|
warn!(log, "Failed to deserialize SszEth1CacheV1"; "error" => ?e);
|
|
|
|
warn!(log, "Reinitializing eth1 cache");
|
|
|
|
migration_schema_v13::reinitialized_eth1_cache_v13(
|
|
|
|
deposit_contract_deploy_block,
|
|
|
|
)
|
|
|
|
}
|
|
|
|
};
|
|
|
|
ops.push(upgraded_eth1_cache.as_kv_store_op(ETH1_CACHE_DB_KEY));
|
|
|
|
}
|
|
|
|
|
|
|
|
db.store_schema_version_atomically(to, ops)?;
|
|
|
|
|
|
|
|
Ok(())
|
|
|
|
}
|
|
|
|
(SchemaVersion(13), SchemaVersion(12)) => {
|
|
|
|
let mut ops = vec![];
|
|
|
|
if let Some(persisted_eth1_v13) = db.get_item::<SszEth1>(Ð1_CACHE_DB_KEY)? {
|
|
|
|
let downgraded_eth1_cache = match migration_schema_v13::downgrade_eth1_cache(
|
|
|
|
persisted_eth1_v13,
|
|
|
|
) {
|
|
|
|
Ok(Some(downgraded_eth1)) => downgraded_eth1,
|
|
|
|
Ok(None) => {
|
|
|
|
warn!(log, "Unable to downgrade eth1 cache from newer version: reinitializing eth1 cache");
|
|
|
|
migration_schema_v13::reinitialized_eth1_cache_v1(
|
|
|
|
deposit_contract_deploy_block,
|
|
|
|
)
|
|
|
|
}
|
|
|
|
Err(e) => {
|
|
|
|
warn!(log, "Unable to downgrade eth1 cache from newer version: failed to deserialize SszEth1CacheV13"; "error" => ?e);
|
|
|
|
warn!(log, "Reinitializing eth1 cache");
|
|
|
|
migration_schema_v13::reinitialized_eth1_cache_v1(
|
|
|
|
deposit_contract_deploy_block,
|
|
|
|
)
|
|
|
|
}
|
|
|
|
};
|
|
|
|
ops.push(downgraded_eth1_cache.as_kv_store_op(ETH1_CACHE_DB_KEY));
|
|
|
|
}
|
|
|
|
|
|
|
|
db.store_schema_version_atomically(to, ops)?;
|
|
|
|
|
|
|
|
Ok(())
|
|
|
|
}
|
2023-01-09 01:38:02 +00:00
|
|
|
(SchemaVersion(13), SchemaVersion(14)) => {
|
|
|
|
let ops = migration_schema_v14::upgrade_to_v14::<T>(db.clone(), log)?;
|
|
|
|
db.store_schema_version_atomically(to, ops)
|
|
|
|
}
|
|
|
|
(SchemaVersion(14), SchemaVersion(13)) => {
|
|
|
|
let ops = migration_schema_v14::downgrade_from_v14::<T>(db.clone(), log)?;
|
|
|
|
db.store_schema_version_atomically(to, ops)
|
|
|
|
}
|
2023-02-07 06:13:49 +00:00
|
|
|
(SchemaVersion(14), SchemaVersion(15)) => {
|
|
|
|
let ops = migration_schema_v15::upgrade_to_v15::<T>(db.clone(), log)?;
|
|
|
|
db.store_schema_version_atomically(to, ops)
|
|
|
|
}
|
|
|
|
(SchemaVersion(15), SchemaVersion(14)) => {
|
|
|
|
let ops = migration_schema_v15::downgrade_from_v15::<T>(db.clone(), log)?;
|
|
|
|
db.store_schema_version_atomically(to, ops)
|
|
|
|
}
|
2021-03-04 01:25:12 +00:00
|
|
|
// Anything else is an error.
|
|
|
|
(_, _) => Err(HotColdDBError::UnsupportedSchemaVersion {
|
|
|
|
target_version: to,
|
|
|
|
current_version: from,
|
|
|
|
}
|
|
|
|
.into()),
|
|
|
|
}
|
|
|
|
}
|