prysm-pulse/beacon-chain/core/helpers/eth1data.go
terence tsao 1b5b8a57e0 Remove unused proto schemas (#3005)
* Update io_kubernetes_build commit hash to 1246899

* Update dependency build_bazel_rules_nodejs to v0.33.1

* Update dependency com_github_hashicorp_golang_lru to v0.5.1

* Update libp2p

* Update io_bazel_rules_k8s commit hash to e68d5d7

* Starting to remove old protos

* Bazel build proto passes

* Fixing pb version

* Cleaned up core package

* Fixing tests

* 6 tests failing

* Update proto bugs

* Fixed incorrect validator ordering proto

* Sync with master

* Update go-ssz commit

* Removed bad copies from v1alpha1 folder

* add json spec json to pb handler

* add nested proto example

* proto/testing test works

* fix refactoring build failures

* use merged ssz

* push latest changes

* used forked json encoding

* used forked json encoding

* fix warning

* fix build issues

* fix test and lint

* fix build

* lint
2019-07-22 10:03:57 -04:00

62 lines
1.8 KiB
Go

package helpers
import (
"fmt"
"math/big"
"github.com/prysmaticlabs/go-ssz"
ethpb "github.com/prysmaticlabs/prysm/proto/eth/v1alpha1"
)
// VoteHierarchyMap struct that holds all the relevant data in order to count and
// choose the best vote.
type VoteHierarchyMap struct {
BestVote *ethpb.Eth1Data
bestVoteHeight *big.Int
mostVotes uint64
voteCountMap map[string]voteHierarchy
}
// voteHierarchy is a structure we use in order to count deposit votes and
// break ties between similarly voted deposits
type voteHierarchy struct {
votes uint64
height *big.Int
eth1Data *ethpb.Eth1Data
}
// EmptyVoteHierarchyMap creates and returns an empty VoteHierarchyMap.
func EmptyVoteHierarchyMap() *VoteHierarchyMap {
vm := &VoteHierarchyMap{}
vm.voteCountMap = make(map[string]voteHierarchy)
return vm
}
// CountVote takes a votecount map and adds the given vote to it in the relevant
// position while updating the best vote, most votes and best vote hash.
func CountVote(voteMap *VoteHierarchyMap, vote *ethpb.Eth1Data, blockHeight *big.Int) (*VoteHierarchyMap, error) {
he, err := ssz.HashedEncoding(vote)
if err != nil {
return &VoteHierarchyMap{}, fmt.Errorf("could not get encoded hash of eth1data object: %v", err)
}
v, ok := voteMap.voteCountMap[string(he[:])]
if !ok {
v = voteHierarchy{votes: 1, height: blockHeight, eth1Data: vote}
voteMap.voteCountMap[string(he[:])] = v
} else {
v.votes = v.votes + 1
voteMap.voteCountMap[string(he[:])] = v
}
if v.votes > voteMap.mostVotes {
voteMap.mostVotes = v.votes
voteMap.BestVote = vote
voteMap.bestVoteHeight = blockHeight
} else if v.votes == voteMap.mostVotes && v.height.Cmp(voteMap.bestVoteHeight) == 1 {
//breaking ties by favoring votes with higher block height.
voteMap.BestVote = vote
voteMap.bestVoteHeight = v.height
}
return voteMap, nil
}