2019-02-19 23:35:02 +00:00
|
|
|
# beacon_chain
|
2021-01-22 13:29:04 +00:00
|
|
|
# Copyright (c) 2018-2021 Status Research & Development GmbH
|
2019-02-19 23:35:02 +00:00
|
|
|
# Licensed and distributed under either of
|
2019-11-25 15:30:02 +00:00
|
|
|
# * MIT license (license terms in the root directory or at https://opensource.org/licenses/MIT).
|
|
|
|
# * Apache v2 license (license terms in the root directory or at https://www.apache.org/licenses/LICENSE-2.0).
|
2019-02-19 23:35:02 +00:00
|
|
|
# at your option. This file may not be copied, modified, or distributed except according to those terms.
|
|
|
|
|
2019-11-14 10:47:55 +00:00
|
|
|
{.used.}
|
|
|
|
|
2019-02-19 23:35:02 +00:00
|
|
|
import
|
2021-04-12 20:25:09 +00:00
|
|
|
std/sequtils,
|
2021-01-25 18:45:48 +00:00
|
|
|
# Status lib
|
2021-04-12 20:25:09 +00:00
|
|
|
unittest2,
|
2020-08-27 07:34:12 +00:00
|
|
|
chronicles, chronos,
|
2020-04-29 11:44:07 +00:00
|
|
|
stew/byteutils,
|
2021-01-25 18:45:48 +00:00
|
|
|
eth/keys,
|
|
|
|
# Internal
|
2021-04-26 20:39:44 +00:00
|
|
|
../beacon_chain/[beacon_node_types, extras],
|
|
|
|
../beacon_chain/gossip_processing/[gossip_validation],
|
2020-07-30 19:18:17 +00:00
|
|
|
../beacon_chain/fork_choice/[fork_choice_types, fork_choice],
|
2021-04-12 20:25:09 +00:00
|
|
|
../beacon_chain/consensus_object_pools/[
|
|
|
|
block_quarantine, blockchain_dag, block_clearance, attestation_pool],
|
|
|
|
../beacon_chain/ssz/merkleization,
|
|
|
|
../beacon_chain/spec/[crypto, datatypes, digest, validator, state_transition,
|
2021-04-26 20:39:44 +00:00
|
|
|
helpers, beaconstate, presets],
|
2021-01-25 18:45:48 +00:00
|
|
|
# Test utilities
|
2021-04-28 16:41:02 +00:00
|
|
|
./testutil, ./testdbutil, ./testblockutil
|
2020-07-09 09:29:32 +00:00
|
|
|
|
2021-01-22 13:29:04 +00:00
|
|
|
func combine(tgt: var Attestation, src: Attestation) =
|
2020-08-15 17:33:58 +00:00
|
|
|
## Combine the signature and participation bitfield, with the assumption that
|
|
|
|
## the same data is being signed - if the signatures overlap, they are not
|
|
|
|
## combined.
|
|
|
|
|
|
|
|
doAssert tgt.data == src.data
|
|
|
|
|
|
|
|
# In a BLS aggregate signature, one needs to count how many times a
|
|
|
|
# particular public key has been added - since we use a single bit per key, we
|
|
|
|
# can only it once, thus we can never combine signatures that overlap already!
|
2021-04-12 20:25:09 +00:00
|
|
|
doAssert not tgt.aggregation_bits.overlaps(src.aggregation_bits)
|
2020-08-15 17:33:58 +00:00
|
|
|
|
2021-04-12 20:25:09 +00:00
|
|
|
tgt.aggregation_bits.incl(src.aggregation_bits)
|
|
|
|
|
|
|
|
var agg {.noInit.}: AggregateSignature
|
2021-04-26 20:39:44 +00:00
|
|
|
agg.init(tgt.signature.load().get())
|
|
|
|
agg.aggregate(src.signature.load.get())
|
|
|
|
tgt.signature = agg.finish().toValidatorSig()
|
2020-08-15 17:33:58 +00:00
|
|
|
|
2021-04-09 12:59:24 +00:00
|
|
|
func loadSig(a: Attestation): CookedSig =
|
2021-04-26 20:39:44 +00:00
|
|
|
a.signature.load.get()
|
2021-04-09 12:59:24 +00:00
|
|
|
|
2021-03-09 14:36:17 +00:00
|
|
|
proc pruneAtFinalization(dag: ChainDAGRef, attPool: AttestationPool) =
|
|
|
|
if dag.needStateCachesAndForkChoicePruning():
|
|
|
|
dag.pruneStateCachesDAG()
|
|
|
|
# pool[].prune() # We test logic without attestation pool / fork choice pruning
|
|
|
|
|
2021-04-28 16:41:02 +00:00
|
|
|
suite "Attestation pool processing" & preset():
|
2020-04-29 11:44:07 +00:00
|
|
|
## For now just test that we can compile and execute block processing with
|
|
|
|
## mock data.
|
2019-12-19 14:13:35 +00:00
|
|
|
|
2020-04-29 11:44:07 +00:00
|
|
|
setup:
|
2021-04-12 20:25:09 +00:00
|
|
|
# Genesis state that results in 6 members per committee
|
2020-04-29 11:44:07 +00:00
|
|
|
var
|
2021-04-12 20:25:09 +00:00
|
|
|
chainDag = init(ChainDAGRef, defaultRuntimePreset, makeTestDB(SLOTS_PER_EPOCH * 6))
|
2021-01-25 18:45:48 +00:00
|
|
|
quarantine = QuarantineRef.init(keys.newRng())
|
2020-07-31 14:49:06 +00:00
|
|
|
pool = newClone(AttestationPool.init(chainDag, quarantine))
|
2020-08-27 07:34:12 +00:00
|
|
|
state = newClone(chainDag.headState)
|
2020-09-07 15:04:33 +00:00
|
|
|
cache = StateCache()
|
2021-05-07 11:36:21 +00:00
|
|
|
rewards: RewardInfo
|
2020-04-29 11:44:07 +00:00
|
|
|
# Slot 0 is a finalized slot - won't be making attestations for it..
|
2020-05-19 15:46:29 +00:00
|
|
|
check:
|
2021-05-07 11:36:21 +00:00
|
|
|
process_slots(state.data, getStateField(state, slot) + 1, cache, rewards)
|
2020-04-29 11:44:07 +00:00
|
|
|
|
2021-04-28 16:41:02 +00:00
|
|
|
test "Can add and retrieve simple attestations" & preset():
|
2020-04-29 11:44:07 +00:00
|
|
|
let
|
|
|
|
# Create an attestation for slot 1!
|
2021-04-12 20:25:09 +00:00
|
|
|
bc0 = get_beacon_committee(
|
2021-04-16 08:49:37 +00:00
|
|
|
state.data.data, getStateField(state, slot), 0.CommitteeIndex, cache)
|
2020-04-29 11:44:07 +00:00
|
|
|
attestation = makeAttestation(
|
2021-04-12 20:25:09 +00:00
|
|
|
state.data.data, state.blck.root, bc0[0], cache)
|
2020-04-29 11:44:07 +00:00
|
|
|
|
2020-08-27 07:34:12 +00:00
|
|
|
pool[].addAttestation(
|
2021-04-12 20:25:09 +00:00
|
|
|
attestation, @[bc0[0]], attestation.loadSig,
|
2021-04-09 12:59:24 +00:00
|
|
|
attestation.data.slot)
|
2019-12-19 14:13:35 +00:00
|
|
|
|
2020-05-19 15:46:29 +00:00
|
|
|
check:
|
2021-04-12 20:25:09 +00:00
|
|
|
# Added attestation, should get it back
|
|
|
|
toSeq(pool[].attestations(none(Slot), none(CommitteeIndex))) ==
|
|
|
|
@[attestation]
|
|
|
|
toSeq(pool[].attestations(
|
|
|
|
some(attestation.data.slot), none(CommitteeIndex))) == @[attestation]
|
|
|
|
toSeq(pool[].attestations(
|
|
|
|
some(attestation.data.slot), some(attestation.data.index.CommitteeIndex))) ==
|
|
|
|
@[attestation]
|
|
|
|
toSeq(pool[].attestations(none(Slot), some(attestation.data.index.CommitteeIndex))) ==
|
|
|
|
@[attestation]
|
|
|
|
toSeq(pool[].attestations(some(
|
|
|
|
attestation.data.slot + 1), none(CommitteeIndex))) == []
|
|
|
|
toSeq(pool[].attestations(
|
|
|
|
none(Slot), some(CommitteeIndex(attestation.data.index + 1)))) == []
|
|
|
|
|
|
|
|
process_slots(
|
2021-04-16 08:49:37 +00:00
|
|
|
state.data,
|
2021-05-07 11:36:21 +00:00
|
|
|
getStateField(state, slot) + MIN_ATTESTATION_INCLUSION_DELAY, cache,
|
|
|
|
rewards)
|
2020-04-29 11:44:07 +00:00
|
|
|
|
2020-09-14 14:50:03 +00:00
|
|
|
let attestations = pool[].getAttestationsForBlock(state.data.data, cache)
|
2019-12-19 14:13:35 +00:00
|
|
|
|
2020-04-29 11:44:07 +00:00
|
|
|
check:
|
|
|
|
attestations.len == 1
|
2021-04-12 20:25:09 +00:00
|
|
|
pool[].getAggregatedAttestation(1.Slot, 0.CommitteeIndex).isSome()
|
|
|
|
|
|
|
|
let
|
|
|
|
root1 = addTestBlock(
|
|
|
|
state.data, state.blck.root,
|
|
|
|
cache, attestations = attestations, nextSlot = false).root
|
|
|
|
bc1 = get_beacon_committee(
|
2021-04-16 08:49:37 +00:00
|
|
|
state.data.data, getStateField(state, slot), 0.CommitteeIndex, cache)
|
2021-04-12 20:25:09 +00:00
|
|
|
att1 = makeAttestation(
|
|
|
|
state.data.data, root1, bc1[0], cache)
|
2020-04-29 11:44:07 +00:00
|
|
|
|
2021-04-12 20:25:09 +00:00
|
|
|
check:
|
|
|
|
process_slots(
|
2021-04-16 08:49:37 +00:00
|
|
|
state.data,
|
2021-05-07 11:36:21 +00:00
|
|
|
getStateField(state, slot) + MIN_ATTESTATION_INCLUSION_DELAY, cache,
|
|
|
|
rewards)
|
2021-04-12 20:25:09 +00:00
|
|
|
|
|
|
|
check:
|
|
|
|
# shouldn't include already-included attestations
|
|
|
|
pool[].getAttestationsForBlock(state.data.data, cache) == []
|
|
|
|
|
|
|
|
pool[].addAttestation(
|
|
|
|
att1, @[bc1[0]], att1.loadSig, att1.data.slot)
|
|
|
|
|
|
|
|
check:
|
|
|
|
# but new ones should go in
|
|
|
|
pool[].getAttestationsForBlock(state.data.data, cache).len() == 1
|
|
|
|
|
|
|
|
let
|
|
|
|
att2 = makeAttestation(
|
|
|
|
state.data.data, root1, bc1[1], cache)
|
|
|
|
pool[].addAttestation(
|
|
|
|
att2, @[bc1[1]], att2.loadSig, att2.data.slot)
|
|
|
|
|
|
|
|
let
|
|
|
|
combined = pool[].getAttestationsForBlock(state.data.data, cache)
|
|
|
|
|
|
|
|
check:
|
|
|
|
# New attestations should be combined with old attestations
|
|
|
|
combined.len() == 1
|
|
|
|
combined[0].aggregation_bits.countOnes() == 2
|
|
|
|
|
|
|
|
pool[].addAttestation(
|
|
|
|
combined[0], @[bc1[1], bc1[0]], combined[0].loadSig, combined[0].data.slot)
|
|
|
|
|
|
|
|
check:
|
|
|
|
# readding the combined attestation shouldn't have an effect
|
|
|
|
pool[].getAttestationsForBlock(state.data.data, cache).len() == 1
|
|
|
|
|
|
|
|
let
|
|
|
|
# Someone votes for a different root
|
|
|
|
att3 = makeAttestation(state.data.data, Eth2Digest(), bc1[2], cache)
|
|
|
|
pool[].addAttestation(
|
|
|
|
att3, @[bc1[2]], att3.loadSig, att3.data.slot)
|
|
|
|
|
|
|
|
check:
|
|
|
|
# We should now get both attestations for the block, but the aggregate
|
|
|
|
# should be the one with the most votes
|
|
|
|
pool[].getAttestationsForBlock(state.data.data, cache).len() == 2
|
|
|
|
pool[].getAggregatedAttestation(2.Slot, 0.CommitteeIndex).
|
|
|
|
get().aggregation_bits.countOnes() == 2
|
|
|
|
pool[].getAggregatedAttestation(2.Slot, hash_tree_root(att2.data)).
|
|
|
|
get().aggregation_bits.countOnes() == 2
|
|
|
|
|
|
|
|
let
|
|
|
|
# Someone votes for a different root
|
|
|
|
att4 = makeAttestation(state.data.data, Eth2Digest(), bc1[2], cache)
|
|
|
|
pool[].addAttestation(
|
|
|
|
att4, @[bc1[2]], att3.loadSig, att3.data.slot)
|
|
|
|
|
2021-04-28 16:41:02 +00:00
|
|
|
test "Working with aggregates" & preset():
|
2021-04-12 20:25:09 +00:00
|
|
|
let
|
|
|
|
# Create an attestation for slot 1!
|
|
|
|
bc0 = get_beacon_committee(
|
2021-04-16 08:49:37 +00:00
|
|
|
state.data.data, getStateField(state, slot), 0.CommitteeIndex, cache)
|
2021-04-12 20:25:09 +00:00
|
|
|
|
|
|
|
var
|
|
|
|
att0 = makeAttestation(state.data.data, state.blck.root, bc0[0], cache)
|
|
|
|
att0x = att0
|
|
|
|
att1 = makeAttestation(state.data.data, state.blck.root, bc0[1], cache)
|
|
|
|
att2 = makeAttestation(state.data.data, state.blck.root, bc0[2], cache)
|
|
|
|
att3 = makeAttestation(state.data.data, state.blck.root, bc0[3], cache)
|
|
|
|
|
|
|
|
# Both attestations include member 2 but neither is a subset of the other
|
|
|
|
att0.combine(att2)
|
|
|
|
att1.combine(att2)
|
|
|
|
|
|
|
|
pool[].addAttestation(att0, @[bc0[0], bc0[2]], att0.loadSig, att0.data.slot)
|
|
|
|
pool[].addAttestation(att1, @[bc0[1], bc0[2]], att1.loadSig, att1.data.slot)
|
|
|
|
|
|
|
|
check:
|
|
|
|
process_slots(
|
2021-04-16 08:49:37 +00:00
|
|
|
state.data,
|
2021-05-07 11:36:21 +00:00
|
|
|
getStateField(state, slot) + MIN_ATTESTATION_INCLUSION_DELAY, cache,
|
|
|
|
rewards)
|
2021-04-12 20:25:09 +00:00
|
|
|
|
|
|
|
check:
|
|
|
|
pool[].getAttestationsForBlock(state.data.data, cache).len() == 2
|
|
|
|
# Can get either aggregate here, random!
|
|
|
|
pool[].getAggregatedAttestation(1.Slot, 0.CommitteeIndex).isSome()
|
|
|
|
|
|
|
|
# Add in attestation 3 - both aggregates should now have it added
|
|
|
|
pool[].addAttestation(att3, @[bc0[3]], att3.loadSig, att3.data.slot)
|
|
|
|
|
|
|
|
block:
|
|
|
|
let attestations = pool[].getAttestationsForBlock(state.data.data, cache)
|
|
|
|
check:
|
|
|
|
attestations.len() == 2
|
|
|
|
attestations[0].aggregation_bits.countOnes() == 3
|
|
|
|
# Can get either aggregate here, random!
|
|
|
|
pool[].getAggregatedAttestation(1.Slot, 0.CommitteeIndex).isSome()
|
|
|
|
|
|
|
|
# Add in attestation 0 as single - attestation 1 is now a superset of the
|
|
|
|
# aggregates in the pool, so everything else should be removed
|
|
|
|
pool[].addAttestation(att0x, @[bc0[0]], att0x.loadSig, att0x.data.slot)
|
|
|
|
|
|
|
|
block:
|
|
|
|
let attestations = pool[].getAttestationsForBlock(state.data.data, cache)
|
|
|
|
check:
|
|
|
|
attestations.len() == 1
|
|
|
|
attestations[0].aggregation_bits.countOnes() == 4
|
|
|
|
pool[].getAggregatedAttestation(1.Slot, 0.CommitteeIndex).isSome()
|
|
|
|
|
2021-04-28 16:41:02 +00:00
|
|
|
test "Everyone voting for something different" & preset():
|
2021-04-12 20:25:09 +00:00
|
|
|
var attestations: int
|
|
|
|
for i in 0..<SLOTS_PER_EPOCH:
|
|
|
|
var root: Eth2Digest
|
|
|
|
root.data[0..<8] = toBytesBE(i.uint64)
|
|
|
|
let
|
|
|
|
bc0 = get_beacon_committee(
|
2021-04-16 08:49:37 +00:00
|
|
|
state.data.data, getStateField(state, slot), 0.CommitteeIndex, cache)
|
2021-04-12 20:25:09 +00:00
|
|
|
|
|
|
|
for j in 0..<bc0.len():
|
|
|
|
root.data[8..<16] = toBytesBE(j.uint64)
|
|
|
|
var att = makeAttestation(state.data.data, root, bc0[j], cache)
|
|
|
|
pool[].addAttestation(att, @[bc0[j]], att.loadSig, att.data.slot)
|
|
|
|
inc attestations
|
|
|
|
|
|
|
|
check:
|
2021-05-07 11:36:21 +00:00
|
|
|
process_slots(state.data, getStateField(state, slot) + 1, cache,
|
|
|
|
rewards)
|
2021-04-12 20:25:09 +00:00
|
|
|
|
|
|
|
doAssert attestations.uint64 > MAX_ATTESTATIONS,
|
|
|
|
"6*SLOTS_PER_EPOCH validators > 128 mainnet MAX_ATTESTATIONS"
|
|
|
|
check:
|
|
|
|
# Fill block with attestations
|
|
|
|
pool[].getAttestationsForBlock(state.data.data, cache).lenu64() ==
|
|
|
|
MAX_ATTESTATIONS
|
2021-04-16 08:49:37 +00:00
|
|
|
pool[].getAggregatedAttestation(
|
|
|
|
getStateField(state, slot) - 1, 0.CommitteeIndex).isSome()
|
2021-04-12 20:25:09 +00:00
|
|
|
|
2021-04-28 16:41:02 +00:00
|
|
|
test "Attestations may arrive in any order" & preset():
|
2020-07-15 10:44:18 +00:00
|
|
|
var cache = StateCache()
|
2020-04-29 11:44:07 +00:00
|
|
|
let
|
|
|
|
# Create an attestation for slot 1!
|
|
|
|
bc0 = get_beacon_committee(
|
2021-04-16 08:49:37 +00:00
|
|
|
state.data.data, getStateField(state, slot), 0.CommitteeIndex, cache)
|
2020-04-29 11:44:07 +00:00
|
|
|
attestation0 = makeAttestation(
|
|
|
|
state.data.data, state.blck.root, bc0[0], cache)
|
|
|
|
|
2020-05-19 15:46:29 +00:00
|
|
|
check:
|
2021-05-07 11:36:21 +00:00
|
|
|
process_slots(state.data, getStateField(state, slot) + 1, cache, rewards)
|
2020-04-29 11:44:07 +00:00
|
|
|
|
|
|
|
let
|
|
|
|
bc1 = get_beacon_committee(state.data.data,
|
2021-04-16 08:49:37 +00:00
|
|
|
getStateField(state, slot), 0.CommitteeIndex, cache)
|
2020-04-29 11:44:07 +00:00
|
|
|
attestation1 = makeAttestation(
|
|
|
|
state.data.data, state.blck.root, bc1[0], cache)
|
|
|
|
|
|
|
|
# test reverse order
|
2021-04-09 12:59:24 +00:00
|
|
|
pool[].addAttestation(
|
|
|
|
attestation1, @[bc1[0]], attestation1.loadSig, attestation1.data.slot)
|
|
|
|
pool[].addAttestation(
|
2021-04-12 20:25:09 +00:00
|
|
|
attestation0, @[bc0[0]], attestation0.loadSig, attestation0.data.slot)
|
2020-04-29 11:44:07 +00:00
|
|
|
|
2020-09-07 15:04:33 +00:00
|
|
|
discard process_slots(
|
2021-05-07 11:36:21 +00:00
|
|
|
state.data, MIN_ATTESTATION_INCLUSION_DELAY.Slot + 1, cache, rewards)
|
2020-04-29 11:44:07 +00:00
|
|
|
|
2020-09-14 14:50:03 +00:00
|
|
|
let attestations = pool[].getAttestationsForBlock(state.data.data, cache)
|
2020-04-29 11:44:07 +00:00
|
|
|
|
|
|
|
check:
|
|
|
|
attestations.len == 1
|
|
|
|
|
2021-04-28 16:41:02 +00:00
|
|
|
test "Attestations should be combined" & preset():
|
2020-07-15 10:44:18 +00:00
|
|
|
var cache = StateCache()
|
2020-04-29 11:44:07 +00:00
|
|
|
let
|
|
|
|
# Create an attestation for slot 1!
|
|
|
|
bc0 = get_beacon_committee(
|
2021-04-16 08:49:37 +00:00
|
|
|
state.data.data, getStateField(state, slot), 0.CommitteeIndex, cache)
|
2020-04-29 11:44:07 +00:00
|
|
|
attestation0 = makeAttestation(
|
|
|
|
state.data.data, state.blck.root, bc0[0], cache)
|
|
|
|
attestation1 = makeAttestation(
|
|
|
|
state.data.data, state.blck.root, bc0[1], cache)
|
|
|
|
|
2021-04-09 12:59:24 +00:00
|
|
|
pool[].addAttestation(
|
|
|
|
attestation0, @[bc0[0]], attestation0.loadSig, attestation0.data.slot)
|
|
|
|
pool[].addAttestation(
|
|
|
|
attestation1, @[bc0[1]], attestation1.loadSig, attestation1.data.slot)
|
2020-04-29 11:44:07 +00:00
|
|
|
|
2020-05-19 15:46:29 +00:00
|
|
|
check:
|
2021-05-07 11:36:21 +00:00
|
|
|
process_slots(
|
|
|
|
state.data, MIN_ATTESTATION_INCLUSION_DELAY.Slot + 1, cache, rewards)
|
2020-04-29 11:44:07 +00:00
|
|
|
|
2020-09-14 14:50:03 +00:00
|
|
|
let attestations = pool[].getAttestationsForBlock(state.data.data, cache)
|
2020-04-29 11:44:07 +00:00
|
|
|
|
|
|
|
check:
|
|
|
|
attestations.len == 1
|
|
|
|
|
2021-04-28 16:41:02 +00:00
|
|
|
test "Attestations may overlap, bigger first" & preset():
|
2020-07-15 10:44:18 +00:00
|
|
|
var cache = StateCache()
|
2020-04-29 11:44:07 +00:00
|
|
|
|
|
|
|
var
|
|
|
|
# Create an attestation for slot 1!
|
|
|
|
bc0 = get_beacon_committee(
|
2021-04-16 08:49:37 +00:00
|
|
|
state.data.data, getStateField(state, slot), 0.CommitteeIndex, cache)
|
2020-04-29 11:44:07 +00:00
|
|
|
attestation0 = makeAttestation(
|
|
|
|
state.data.data, state.blck.root, bc0[0], cache)
|
|
|
|
attestation1 = makeAttestation(
|
|
|
|
state.data.data, state.blck.root, bc0[1], cache)
|
2019-12-19 14:13:35 +00:00
|
|
|
|
2021-01-22 13:29:04 +00:00
|
|
|
attestation0.combine(attestation1)
|
2020-04-29 11:44:07 +00:00
|
|
|
|
2021-04-09 12:59:24 +00:00
|
|
|
pool[].addAttestation(
|
|
|
|
attestation0, @[bc0[0]], attestation0.loadSig, attestation0.data.slot)
|
|
|
|
pool[].addAttestation(
|
|
|
|
attestation1, @[bc0[1]], attestation1.loadSig, attestation1.data.slot)
|
2019-12-19 13:02:28 +00:00
|
|
|
|
2020-05-19 15:46:29 +00:00
|
|
|
check:
|
2021-05-07 11:36:21 +00:00
|
|
|
process_slots(
|
|
|
|
state.data, MIN_ATTESTATION_INCLUSION_DELAY.Slot + 1, cache, rewards)
|
2019-12-19 13:02:28 +00:00
|
|
|
|
2020-09-14 14:50:03 +00:00
|
|
|
let attestations = pool[].getAttestationsForBlock(state.data.data, cache)
|
2019-12-19 13:02:28 +00:00
|
|
|
|
2020-04-29 11:44:07 +00:00
|
|
|
check:
|
|
|
|
attestations.len == 1
|
2019-12-19 13:02:28 +00:00
|
|
|
|
2021-04-28 16:41:02 +00:00
|
|
|
test "Attestations may overlap, smaller first" & preset():
|
2020-07-15 10:44:18 +00:00
|
|
|
var cache = StateCache()
|
2020-04-29 11:44:07 +00:00
|
|
|
var
|
|
|
|
# Create an attestation for slot 1!
|
|
|
|
bc0 = get_beacon_committee(state.data.data,
|
2021-04-16 08:49:37 +00:00
|
|
|
getStateField(state, slot), 0.CommitteeIndex, cache)
|
2020-04-29 11:44:07 +00:00
|
|
|
attestation0 = makeAttestation(
|
|
|
|
state.data.data, state.blck.root, bc0[0], cache)
|
|
|
|
attestation1 = makeAttestation(
|
|
|
|
state.data.data, state.blck.root, bc0[1], cache)
|
2019-12-19 13:02:28 +00:00
|
|
|
|
2021-01-22 13:29:04 +00:00
|
|
|
attestation0.combine(attestation1)
|
2019-12-19 14:13:35 +00:00
|
|
|
|
2021-04-09 12:59:24 +00:00
|
|
|
pool[].addAttestation(
|
|
|
|
attestation1, @[bc0[1]], attestation1.loadSig, attestation1.data.slot)
|
|
|
|
pool[].addAttestation(
|
|
|
|
attestation0, @[bc0[0]], attestation0.loadSig, attestation0.data.slot)
|
2019-12-19 13:02:28 +00:00
|
|
|
|
2020-05-19 15:46:29 +00:00
|
|
|
check:
|
2021-05-07 11:36:21 +00:00
|
|
|
process_slots(
|
|
|
|
state.data, MIN_ATTESTATION_INCLUSION_DELAY.Slot + 1, cache, rewards)
|
2019-12-19 13:02:28 +00:00
|
|
|
|
2020-09-14 14:50:03 +00:00
|
|
|
let attestations = pool[].getAttestationsForBlock(state.data.data, cache)
|
2019-12-19 13:02:28 +00:00
|
|
|
|
2020-04-29 11:44:07 +00:00
|
|
|
check:
|
|
|
|
attestations.len == 1
|
2019-12-19 13:02:28 +00:00
|
|
|
|
2021-04-28 16:41:02 +00:00
|
|
|
test "Fork choice returns latest block with no attestations":
|
2020-07-15 10:44:18 +00:00
|
|
|
var cache = StateCache()
|
2020-04-29 11:44:07 +00:00
|
|
|
let
|
2020-07-30 19:18:17 +00:00
|
|
|
b1 = addTestBlock(state.data, chainDag.tail.root, cache)
|
2020-07-31 14:49:06 +00:00
|
|
|
b1Add = chainDag.addRawBlock(quarantine, b1) do (
|
2021-01-25 18:45:48 +00:00
|
|
|
blckRef: BlockRef, signedBlock: TrustedSignedBeaconBlock,
|
2020-08-18 20:29:33 +00:00
|
|
|
epochRef: EpochRef, state: HashedBeaconState):
|
2020-07-22 09:42:55 +00:00
|
|
|
# Callback add to fork choice if valid
|
2020-08-03 18:39:43 +00:00
|
|
|
pool[].addForkChoice(epochRef, blckRef, signedBlock.message, blckRef.slot)
|
2020-07-22 09:42:55 +00:00
|
|
|
|
2020-07-25 19:41:12 +00:00
|
|
|
let head = pool[].selectHead(b1Add[].slot)
|
2019-12-19 14:13:35 +00:00
|
|
|
|
2020-04-29 11:44:07 +00:00
|
|
|
check:
|
2020-07-09 09:29:32 +00:00
|
|
|
head == b1Add[]
|
2019-12-19 14:13:35 +00:00
|
|
|
|
2020-04-29 11:44:07 +00:00
|
|
|
let
|
2020-07-16 13:16:51 +00:00
|
|
|
b2 = addTestBlock(state.data, b1.root, cache)
|
2020-07-31 14:49:06 +00:00
|
|
|
b2Add = chainDag.addRawBlock(quarantine, b2) do (
|
2021-01-25 18:45:48 +00:00
|
|
|
blckRef: BlockRef, signedBlock: TrustedSignedBeaconBlock,
|
2020-08-18 20:29:33 +00:00
|
|
|
epochRef: EpochRef, state: HashedBeaconState):
|
2020-07-22 09:42:55 +00:00
|
|
|
# Callback add to fork choice if valid
|
2020-08-03 18:39:43 +00:00
|
|
|
pool[].addForkChoice(epochRef, blckRef, signedBlock.message, blckRef.slot)
|
2020-06-10 06:58:12 +00:00
|
|
|
|
2020-07-25 19:41:12 +00:00
|
|
|
let head2 = pool[].selectHead(b2Add[].slot)
|
2019-12-19 13:02:28 +00:00
|
|
|
|
2020-04-29 11:44:07 +00:00
|
|
|
check:
|
2020-07-09 09:29:32 +00:00
|
|
|
head2 == b2Add[]
|
2019-12-19 13:02:28 +00:00
|
|
|
|
2021-04-28 16:41:02 +00:00
|
|
|
test "Fork choice returns block with attestation":
|
2020-07-15 10:44:18 +00:00
|
|
|
var cache = StateCache()
|
2020-04-29 11:44:07 +00:00
|
|
|
let
|
2020-07-30 19:18:17 +00:00
|
|
|
b10 = makeTestBlock(state.data, chainDag.tail.root, cache)
|
2020-07-31 14:49:06 +00:00
|
|
|
b10Add = chainDag.addRawBlock(quarantine, b10) do (
|
2021-01-25 18:45:48 +00:00
|
|
|
blckRef: BlockRef, signedBlock: TrustedSignedBeaconBlock,
|
2020-08-18 20:29:33 +00:00
|
|
|
epochRef: EpochRef, state: HashedBeaconState):
|
2020-07-22 09:42:55 +00:00
|
|
|
# Callback add to fork choice if valid
|
2020-08-03 18:39:43 +00:00
|
|
|
pool[].addForkChoice(epochRef, blckRef, signedBlock.message, blckRef.slot)
|
2020-06-10 06:58:12 +00:00
|
|
|
|
2020-07-25 19:41:12 +00:00
|
|
|
let head = pool[].selectHead(b10Add[].slot)
|
2019-12-19 13:02:28 +00:00
|
|
|
|
2020-04-29 11:44:07 +00:00
|
|
|
check:
|
2020-07-09 09:29:32 +00:00
|
|
|
head == b10Add[]
|
2019-12-19 13:02:28 +00:00
|
|
|
|
2020-04-29 11:44:07 +00:00
|
|
|
let
|
2020-07-30 19:18:17 +00:00
|
|
|
b11 = makeTestBlock(state.data, chainDag.tail.root, cache,
|
2020-06-29 17:30:19 +00:00
|
|
|
graffiti = GraffitiBytes [1'u8, 0, 0, 0 ,0 ,0 ,0 ,0 ,0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
|
2020-04-29 11:44:07 +00:00
|
|
|
)
|
2020-07-31 14:49:06 +00:00
|
|
|
b11Add = chainDag.addRawBlock(quarantine, b11) do (
|
2021-01-25 18:45:48 +00:00
|
|
|
blckRef: BlockRef, signedBlock: TrustedSignedBeaconBlock,
|
2020-08-18 20:29:33 +00:00
|
|
|
epochRef: EpochRef, state: HashedBeaconState):
|
2020-07-22 09:42:55 +00:00
|
|
|
# Callback add to fork choice if valid
|
2020-08-03 18:39:43 +00:00
|
|
|
pool[].addForkChoice(epochRef, blckRef, signedBlock.message, blckRef.slot)
|
2019-12-19 13:02:28 +00:00
|
|
|
|
2020-04-29 11:44:07 +00:00
|
|
|
bc1 = get_beacon_committee(
|
2021-04-16 08:49:37 +00:00
|
|
|
state.data.data, getStateField(state, slot) - 1, 1.CommitteeIndex, cache)
|
2020-07-16 13:16:51 +00:00
|
|
|
attestation0 = makeAttestation(state.data.data, b10.root, bc1[0], cache)
|
2019-06-03 08:26:38 +00:00
|
|
|
|
2021-04-09 12:59:24 +00:00
|
|
|
pool[].addAttestation(
|
|
|
|
attestation0, @[bc1[0]], attestation0.loadSig, attestation0.data.slot)
|
2019-06-03 08:26:38 +00:00
|
|
|
|
2020-07-25 19:41:12 +00:00
|
|
|
let head2 = pool[].selectHead(b10Add[].slot)
|
2019-06-03 08:26:38 +00:00
|
|
|
|
2020-04-29 11:44:07 +00:00
|
|
|
check:
|
|
|
|
# Single vote for b10 and no votes for b11
|
2020-07-09 09:29:32 +00:00
|
|
|
head2 == b10Add[]
|
2019-06-03 08:26:38 +00:00
|
|
|
|
2020-04-29 11:44:07 +00:00
|
|
|
let
|
2020-07-16 13:16:51 +00:00
|
|
|
attestation1 = makeAttestation(state.data.data, b11.root, bc1[1], cache)
|
|
|
|
attestation2 = makeAttestation(state.data.data, b11.root, bc1[2], cache)
|
2021-04-09 12:59:24 +00:00
|
|
|
pool[].addAttestation(
|
|
|
|
attestation1, @[bc1[1]], attestation1.loadSig, attestation1.data.slot)
|
2019-06-03 08:26:38 +00:00
|
|
|
|
2020-07-25 19:41:12 +00:00
|
|
|
let head3 = pool[].selectHead(b10Add[].slot)
|
|
|
|
let bigger = if b11.root.data < b10.root.data: b10Add else: b11Add
|
2020-04-29 11:44:07 +00:00
|
|
|
|
|
|
|
check:
|
2020-06-10 06:58:12 +00:00
|
|
|
# Ties broken lexicographically in spec -> ?
|
2020-07-25 19:41:12 +00:00
|
|
|
head3 == bigger[]
|
2020-04-29 11:44:07 +00:00
|
|
|
|
2021-04-09 12:59:24 +00:00
|
|
|
pool[].addAttestation(
|
|
|
|
attestation2, @[bc1[2]], attestation2.loadSig, attestation2.data.slot)
|
2020-04-29 11:44:07 +00:00
|
|
|
|
2020-07-25 19:41:12 +00:00
|
|
|
let head4 = pool[].selectHead(b11Add[].slot)
|
2020-04-29 11:44:07 +00:00
|
|
|
|
|
|
|
check:
|
|
|
|
# Two votes for b11
|
2020-07-09 09:29:32 +00:00
|
|
|
head4 == b11Add[]
|
|
|
|
|
2021-04-28 16:41:02 +00:00
|
|
|
test "Trying to add a block twice tags the second as an error":
|
2020-07-15 10:44:18 +00:00
|
|
|
var cache = StateCache()
|
2020-07-09 09:29:32 +00:00
|
|
|
let
|
2020-07-30 19:18:17 +00:00
|
|
|
b10 = makeTestBlock(state.data, chainDag.tail.root, cache)
|
2020-07-31 14:49:06 +00:00
|
|
|
b10Add = chainDag.addRawBlock(quarantine, b10) do (
|
2021-01-25 18:45:48 +00:00
|
|
|
blckRef: BlockRef, signedBlock: TrustedSignedBeaconBlock,
|
2020-08-18 20:29:33 +00:00
|
|
|
epochRef: EpochRef, state: HashedBeaconState):
|
2020-07-22 09:42:55 +00:00
|
|
|
# Callback add to fork choice if valid
|
2020-08-03 18:39:43 +00:00
|
|
|
pool[].addForkChoice(epochRef, blckRef, signedBlock.message, blckRef.slot)
|
2020-07-09 09:29:32 +00:00
|
|
|
|
2020-07-25 19:41:12 +00:00
|
|
|
let head = pool[].selectHead(b10Add[].slot)
|
2020-07-09 09:29:32 +00:00
|
|
|
|
|
|
|
check:
|
|
|
|
head == b10Add[]
|
|
|
|
|
|
|
|
# -------------------------------------------------------------
|
|
|
|
# Add back the old block to ensure we have a duplicate error
|
|
|
|
let b10_clone = b10 # Assumes deep copy
|
2020-07-31 14:49:06 +00:00
|
|
|
let b10Add_clone = chainDag.addRawBlock(quarantine, b10_clone) do (
|
2021-01-25 18:45:48 +00:00
|
|
|
blckRef: BlockRef, signedBlock: TrustedSignedBeaconBlock,
|
2020-08-18 20:29:33 +00:00
|
|
|
epochRef: EpochRef, state: HashedBeaconState):
|
2020-07-22 09:42:55 +00:00
|
|
|
# Callback add to fork choice if valid
|
2020-08-03 18:39:43 +00:00
|
|
|
pool[].addForkChoice(epochRef, blckRef, signedBlock.message, blckRef.slot)
|
2020-07-22 09:42:55 +00:00
|
|
|
|
2020-10-20 12:31:20 +00:00
|
|
|
doAssert: b10Add_clone.error == (ValidationResult.Ignore, Duplicate)
|
2020-07-09 09:29:32 +00:00
|
|
|
|
2021-04-28 16:41:02 +00:00
|
|
|
test "Trying to add a duplicate block from an old pruned epoch is tagged as an error":
|
2020-08-26 15:23:34 +00:00
|
|
|
# Note: very sensitive to stack usage
|
|
|
|
|
2020-07-30 19:18:17 +00:00
|
|
|
chainDag.updateFlags.incl {skipBLSValidation}
|
2020-07-23 17:01:07 +00:00
|
|
|
var cache = StateCache()
|
2020-07-09 09:29:32 +00:00
|
|
|
let
|
2020-08-27 07:34:12 +00:00
|
|
|
b10 = addTestBlock(state.data, chainDag.tail.root, cache)
|
|
|
|
b10Add = chainDag.addRawBlock(quarantine, b10) do (
|
2021-01-25 18:45:48 +00:00
|
|
|
blckRef: BlockRef, signedBlock: TrustedSignedBeaconBlock,
|
2020-08-18 20:29:33 +00:00
|
|
|
epochRef: EpochRef, state: HashedBeaconState):
|
2020-07-22 09:42:55 +00:00
|
|
|
# Callback add to fork choice if valid
|
2020-08-03 18:39:43 +00:00
|
|
|
pool[].addForkChoice(epochRef, blckRef, signedBlock.message, blckRef.slot)
|
2020-07-09 09:29:32 +00:00
|
|
|
|
2020-07-25 19:41:12 +00:00
|
|
|
let head = pool[].selectHead(b10Add[].slot)
|
2020-07-09 09:29:32 +00:00
|
|
|
|
|
|
|
doAssert: head == b10Add[]
|
|
|
|
|
|
|
|
# -------------------------------------------------------------
|
|
|
|
let b10_clone = b10 # Assumes deep copy
|
|
|
|
|
|
|
|
# -------------------------------------------------------------
|
|
|
|
# Pass an epoch
|
2020-07-16 13:16:51 +00:00
|
|
|
var block_root = b10.root
|
2020-07-09 09:29:32 +00:00
|
|
|
|
|
|
|
var attestations: seq[Attestation]
|
|
|
|
|
|
|
|
for epoch in 0 ..< 5:
|
|
|
|
let start_slot = compute_start_slot_at_epoch(Epoch epoch)
|
2020-07-25 19:41:12 +00:00
|
|
|
let committees_per_slot =
|
2020-07-27 10:59:57 +00:00
|
|
|
get_committee_count_per_slot(state.data.data, Epoch epoch, cache)
|
2020-07-09 09:29:32 +00:00
|
|
|
for slot in start_slot ..< start_slot + SLOTS_PER_EPOCH:
|
2020-08-27 07:34:12 +00:00
|
|
|
let new_block = addTestBlock(
|
|
|
|
state.data, block_root, cache, attestations = attestations)
|
2020-07-09 09:29:32 +00:00
|
|
|
|
2020-07-16 13:16:51 +00:00
|
|
|
block_root = new_block.root
|
2020-08-27 07:34:12 +00:00
|
|
|
let blockRef = chainDag.addRawBlock(quarantine, new_block) do (
|
2021-01-25 18:45:48 +00:00
|
|
|
blckRef: BlockRef, signedBlock: TrustedSignedBeaconBlock,
|
2020-08-18 20:29:33 +00:00
|
|
|
epochRef: EpochRef, state: HashedBeaconState):
|
2020-07-22 09:42:55 +00:00
|
|
|
# Callback add to fork choice if valid
|
2020-08-03 18:39:43 +00:00
|
|
|
pool[].addForkChoice(epochRef, blckRef, signedBlock.message, blckRef.slot)
|
2020-07-09 09:29:32 +00:00
|
|
|
|
2020-07-25 19:41:12 +00:00
|
|
|
let head = pool[].selectHead(blockRef[].slot)
|
2021-04-12 20:25:09 +00:00
|
|
|
doAssert: head == blockRef[]
|
2020-08-31 09:00:38 +00:00
|
|
|
chainDag.updateHead(head, quarantine)
|
2021-03-09 14:36:17 +00:00
|
|
|
pruneAtFinalization(chainDag, pool[])
|
2020-07-09 09:29:32 +00:00
|
|
|
|
|
|
|
attestations.setlen(0)
|
2020-07-25 19:41:12 +00:00
|
|
|
for index in 0'u64 ..< committees_per_slot:
|
2020-07-09 09:29:32 +00:00
|
|
|
let committee = get_beacon_committee(
|
2021-04-16 08:49:37 +00:00
|
|
|
state.data.data, getStateField(state, slot), index.CommitteeIndex,
|
|
|
|
cache)
|
2020-07-09 09:29:32 +00:00
|
|
|
|
|
|
|
# Create a bitfield filled with the given count per attestation,
|
|
|
|
# exactly on the right-most part of the committee field.
|
|
|
|
var aggregation_bits = init(CommitteeValidatorsBits, committee.len)
|
|
|
|
for v in 0 ..< committee.len * 2 div 3 + 1:
|
|
|
|
aggregation_bits[v] = true
|
|
|
|
|
|
|
|
attestations.add Attestation(
|
|
|
|
aggregation_bits: aggregation_bits,
|
|
|
|
data: makeAttestationData(
|
2021-04-16 08:49:37 +00:00
|
|
|
state.data.data, getStateField(state, slot),
|
2020-11-04 21:52:47 +00:00
|
|
|
index.CommitteeIndex, blockroot)
|
2020-07-09 09:29:32 +00:00
|
|
|
# signature: ValidatorSig()
|
|
|
|
)
|
|
|
|
|
2020-07-15 10:44:18 +00:00
|
|
|
cache = StateCache()
|
2020-07-09 09:29:32 +00:00
|
|
|
|
|
|
|
# -------------------------------------------------------------
|
|
|
|
# Prune
|
|
|
|
|
2020-07-30 19:18:17 +00:00
|
|
|
doAssert: chainDag.finalizedHead.slot != 0
|
2020-07-09 09:29:32 +00:00
|
|
|
|
2020-07-25 19:41:12 +00:00
|
|
|
pool[].prune()
|
2020-08-27 07:34:12 +00:00
|
|
|
doAssert: b10.root notin pool.forkChoice.backend
|
2020-07-09 09:29:32 +00:00
|
|
|
|
|
|
|
# Add back the old block to ensure we have a duplicate error
|
2020-08-27 07:34:12 +00:00
|
|
|
let b10Add_clone = chainDag.addRawBlock(quarantine, b10_clone) do (
|
2021-01-25 18:45:48 +00:00
|
|
|
blckRef: BlockRef, signedBlock: TrustedSignedBeaconBlock,
|
2020-08-18 20:29:33 +00:00
|
|
|
epochRef: EpochRef, state: HashedBeaconState):
|
2020-07-22 09:42:55 +00:00
|
|
|
# Callback add to fork choice if valid
|
2020-08-03 18:39:43 +00:00
|
|
|
pool[].addForkChoice(epochRef, blckRef, signedBlock.message, blckRef.slot)
|
2020-07-22 09:42:55 +00:00
|
|
|
|
2020-10-20 12:31:20 +00:00
|
|
|
doAssert: b10Add_clone.error == (ValidationResult.Ignore, Duplicate)
|