The core protocol of WoopChain
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
woop/staking/availability/measure.go

238 lines
5.8 KiB

package availability
import (
"math/big"
"github.com/ethereum/go-ethereum/common"
"github.com/harmony-one/harmony/block"
"github.com/harmony-one/harmony/core/state"
bls2 "github.com/harmony-one/harmony/crypto/bls"
"github.com/harmony-one/harmony/internal/utils"
"github.com/harmony-one/harmony/numeric"
"github.com/harmony-one/harmony/shard"
"github.com/harmony-one/harmony/staking/effective"
staking "github.com/harmony-one/harmony/staking/types"
"github.com/pkg/errors"
)
var (
measure = numeric.NewDec(2).Quo(numeric.NewDec(3))
// ErrDivByZero ..
ErrDivByZero = errors.New("toSign of availability cannot be 0, mistake in protocol")
)
// BlockSigners ..
func BlockSigners(
bitmap []byte, parentCommittee *shard.Committee,
) (shard.SlotList, shard.SlotList, error) {
committerKeys, err := parentCommittee.BLSPublicKeys()
if err != nil {
return nil, nil, err
}
mask, err := bls2.NewMask(committerKeys, nil)
if err != nil {
return nil, nil, err
}
if err := mask.SetMask(bitmap); err != nil {
return nil, nil, err
}
payable, missing := shard.SlotList{}, shard.SlotList{}
for idx, member := range parentCommittee.Slots {
switch signed, err := mask.IndexEnabled(idx); true {
case err != nil:
return nil, nil, err
case signed:
payable = append(payable, member)
default:
missing = append(missing, member)
}
}
return payable, missing, nil
}
// BallotResult returns
// (parentCommittee.Slots, payable, missing, err)
func BallotResult(
parentHeader, header *block.Header, parentShardState *shard.State, shardID uint32,
) (shard.SlotList, shard.SlotList, shard.SlotList, error) {
parentCommittee, err := parentShardState.FindCommitteeByID(shardID)
if err != nil {
return nil, nil, nil, errors.Errorf(
"cannot find shard in the shard state %d %d",
parentHeader.Number(),
parentHeader.ShardID(),
)
}
payable, missing, err := BlockSigners(
header.LastCommitBitmap(), parentCommittee,
)
return parentCommittee.Slots, payable, missing, err
}
type signerKind struct {
didSign bool
committee shard.SlotList
}
func bumpCount(
bc Reader,
state *state.DB,
signers []signerKind,
stakedAddrSet map[common.Address]struct{},
) error {
for _, subset := range signers {
for i := range subset.committee {
addr := subset.committee[i].EcdsaAddress
// NOTE if the signer address is not part of the staked addrs,
// then it must be a harmony operated node running,
// hence keep on going
if _, isAddrForStaked := stakedAddrSet[addr]; !isAddrForStaked {
continue
}
wrapper, err := state.ValidatorWrapper(addr)
if err != nil {
return err
}
wrapper.Counters.NumBlocksToSign.Add(
wrapper.Counters.NumBlocksToSign, common.Big1,
)
if subset.didSign {
wrapper.Counters.NumBlocksSigned.Add(
wrapper.Counters.NumBlocksSigned, common.Big1,
)
}
if err := state.UpdateValidatorWrapper(
addr, wrapper,
); err != nil {
return err
}
}
}
return nil
}
// IncrementValidatorSigningCounts ..
func IncrementValidatorSigningCounts(
bc Reader,
staked *shard.StakedSlots,
state *state.DB,
signers, missing shard.SlotList,
) error {
return bumpCount(
bc, state, []signerKind{{false, missing}, {true, signers}},
staked.LookupSet,
)
}
// Reader ..
type Reader interface {
ReadValidatorSnapshot(
addr common.Address,
) (*staking.ValidatorWrapper, error)
}
// ComputeCurrentSigning returns (signed, toSign, quotient, error)
func ComputeCurrentSigning(
snapshot, wrapper *staking.ValidatorWrapper,
) *staking.Computed {
statsNow, snapSigned, snapToSign :=
wrapper.Counters,
snapshot.Counters.NumBlocksSigned,
snapshot.Counters.NumBlocksToSign
signed, toSign :=
new(big.Int).Sub(statsNow.NumBlocksSigned, snapSigned),
new(big.Int).Sub(statsNow.NumBlocksToSign, snapToSign)
computed := staking.NewComputed(
signed, toSign, 0, numeric.ZeroDec(), true,
)
if toSign.Cmp(common.Big0) == 0 {
utils.Logger().Info().
Msg("toSign is 0, perhaps did not receive crosslink proving signing")
return computed
}
if signed.Sign() == -1 {
// Shouldn't happen
utils.Logger().Error().Msg("negative number of signed blocks")
}
if toSign.Sign() == -1 {
// Shouldn't happen
utils.Logger().Error().Msg("negative number of blocks to sign")
}
s1, s2 := numeric.NewDecFromBigInt(signed), numeric.NewDecFromBigInt(toSign)
computed.Percentage = s1.Quo(s2)
computed.IsBelowThreshold = IsBelowSigningThreshold(computed.Percentage)
return computed
}
// IsBelowSigningThreshold ..
func IsBelowSigningThreshold(quotient numeric.Dec) bool {
return quotient.LTE(measure)
}
// ComputeAndMutateEPOSStatus sets the validator to
// inactive and thereby keeping it out of
// consideration in the pool of validators for
// whenever committee selection happens in future, the
// signing threshold is 66%
func ComputeAndMutateEPOSStatus(
bc Reader,
state *state.DB,
addr common.Address,
) error {
utils.Logger().Info().Msg("begin compute for availability")
wrapper, err := state.ValidatorWrapper(addr)
if err != nil {
return err
}
if wrapper.Status == effective.Banned {
utils.Logger().Debug().Msg("Can't update EPoS status on a banned validator")
return nil
}
snapshot, err := bc.ReadValidatorSnapshot(wrapper.Address)
if err != nil {
return err
}
computed := ComputeCurrentSigning(snapshot, wrapper)
utils.Logger().
Info().Msg("check if signing percent is meeting required threshold")
const missedTooManyBlocks = true
switch computed.IsBelowThreshold {
case missedTooManyBlocks:
wrapper.Status = effective.Inactive
utils.Logger().Info().
Str("threshold", measure.String()).
Msg("validator failed availability threshold, set to inactive")
default:
// Default is no-op so validator who wants
// to leave the committee can actually leave.
}
if err := state.UpdateValidatorWrapper(
addr, wrapper,
); err != nil {
return err
}
return nil
}