mirror of
https://github.com/kaspanet/kaspad.git
synced 2026-02-26 05:10:02 +00:00
Compare commits
3 Commits
min-fee-pa
...
ghostdagRe
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
16a83f9bac | ||
|
|
7d20ee6b58 | ||
|
|
1ab05c3fbc |
@@ -1,9 +1,8 @@
|
|||||||
package ghostdag2
|
package ghostdag2
|
||||||
|
|
||||||
import (
|
import (
|
||||||
"sort"
|
|
||||||
|
|
||||||
"github.com/kaspanet/kaspad/util/difficulty"
|
"github.com/kaspanet/kaspad/util/difficulty"
|
||||||
|
"sort"
|
||||||
|
|
||||||
"math/big"
|
"math/big"
|
||||||
|
|
||||||
@@ -19,7 +18,7 @@ type ghostdagHelper struct {
|
|||||||
headerStore model.BlockHeaderStore
|
headerStore model.BlockHeaderStore
|
||||||
}
|
}
|
||||||
|
|
||||||
// New creates a new instance of this alternative ghostdag impl
|
// New creates a new instance of this alternative GHOSTDAG impl
|
||||||
func New(
|
func New(
|
||||||
databaseContext model.DBReader,
|
databaseContext model.DBReader,
|
||||||
dagTopologyManager model.DAGTopologyManager,
|
dagTopologyManager model.DAGTopologyManager,
|
||||||
@@ -36,53 +35,60 @@ func New(
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/* --------------------------------------------- */
|
|
||||||
|
|
||||||
func (gh *ghostdagHelper) GHOSTDAG(stagingArea *model.StagingArea, blockCandidate *externalapi.DomainHash) error {
|
func (gh *ghostdagHelper) GHOSTDAG(stagingArea *model.StagingArea, blockCandidate *externalapi.DomainHash) error {
|
||||||
myWork := new(big.Int)
|
var blueScore uint64 = 0
|
||||||
maxWork := new(big.Int)
|
var blueWork = new(big.Int)
|
||||||
var myScore uint64
|
blueWork.SetUint64(0)
|
||||||
var spScore uint64
|
var selectedParent *externalapi.DomainHash = nil
|
||||||
/* find the selectedParent */
|
var mergeSetBlues = make([]*externalapi.DomainHash, 0)
|
||||||
blockParents, err := gh.dagTopologyManager.Parents(stagingArea, blockCandidate)
|
var mergeSetReds = make([]*externalapi.DomainHash, 0)
|
||||||
|
|
||||||
|
parents, err := gh.dagTopologyManager.Parents(stagingArea, blockCandidate)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
var selectedParent = blockParents[0]
|
// If genesis:
|
||||||
for _, parent := range blockParents {
|
if len(parents) == 0 {
|
||||||
blockData, err := gh.dataStore.Get(gh.dbAccess, stagingArea, parent)
|
blockGHOSTDAGData := model.NewBlockGHOSTDAGData(blueScore, blueWork, selectedParent, mergeSetBlues, mergeSetReds, nil)
|
||||||
|
gh.dataStore.Stage(stagingArea, blockCandidate, blockGHOSTDAGData)
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
|
||||||
|
maxBlueWork := new(big.Int)
|
||||||
|
maxBlueWork.SetUint64(0)
|
||||||
|
maxBlueScore := uint64(0)
|
||||||
|
selectedParent = parents[0]
|
||||||
|
// Find the selected parent.
|
||||||
|
for _, parent := range parents {
|
||||||
|
parentBlockData, err := gh.dataStore.Get(gh.dbAccess, stagingArea, parent)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
blockWork := blockData.BlueWork()
|
parentBlueWork := parentBlockData.BlueWork()
|
||||||
blockScore := blockData.BlueScore()
|
switch parentBlueWork.Cmp(maxBlueWork) {
|
||||||
if blockWork.Cmp(maxWork) == 1 {
|
case 0:
|
||||||
|
if isMoreHash(parent, selectedParent) {
|
||||||
|
selectedParent = parent
|
||||||
|
maxBlueWork = parentBlueWork
|
||||||
|
maxBlueScore = parentBlockData.BlueScore()
|
||||||
|
}
|
||||||
|
case 1:
|
||||||
selectedParent = parent
|
selectedParent = parent
|
||||||
maxWork = blockWork
|
maxBlueWork = parentBlueWork
|
||||||
spScore = blockScore
|
maxBlueScore = parentBlockData.BlueScore()
|
||||||
}
|
|
||||||
if blockWork.Cmp(maxWork) == 0 && ismoreHash(parent, selectedParent) {
|
|
||||||
selectedParent = parent
|
|
||||||
maxWork = blockWork
|
|
||||||
spScore = blockScore
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
myWork.Set(maxWork)
|
blueWork.Set(maxBlueWork)
|
||||||
myScore = spScore
|
blueScore = maxBlueScore
|
||||||
|
|
||||||
/* Goal: iterate blockCandidate's mergeSet and divide it to : blue, blues, reds. */
|
|
||||||
var mergeSetBlues = make([]*externalapi.DomainHash, 0)
|
|
||||||
var mergeSetReds = make([]*externalapi.DomainHash, 0)
|
|
||||||
var blueSet = make([]*externalapi.DomainHash, 0)
|
|
||||||
|
|
||||||
|
blueSet := make([]*externalapi.DomainHash, 0)
|
||||||
|
blueSet = append(blueSet, selectedParent)
|
||||||
mergeSetBlues = append(mergeSetBlues, selectedParent)
|
mergeSetBlues = append(mergeSetBlues, selectedParent)
|
||||||
|
mergeSet, err := gh.findMergeSet(stagingArea, parents, selectedParent)
|
||||||
mergeSetArr, err := gh.findMergeSet(stagingArea, blockParents, selectedParent)
|
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
|
err = gh.sortByBlueWork(stagingArea, mergeSet)
|
||||||
err = gh.sortByBlueWork(stagingArea, mergeSetArr)
|
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
@@ -90,41 +96,36 @@ func (gh *ghostdagHelper) GHOSTDAG(stagingArea *model.StagingArea, blockCandidat
|
|||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
|
// Iterate on mergeSet and divide it to mergeSetBlues and mergeSetReds.
|
||||||
for _, mergeSetBlock := range mergeSetArr {
|
for _, mergeSetBlock := range mergeSet {
|
||||||
if mergeSetBlock.Equal(selectedParent) {
|
if mergeSetBlock.Equal(selectedParent) {
|
||||||
if !contains(selectedParent, mergeSetBlues) {
|
|
||||||
mergeSetBlues = append(mergeSetBlues, selectedParent)
|
|
||||||
blueSet = append(blueSet, selectedParent)
|
|
||||||
}
|
|
||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
err := gh.divideBlueRed(stagingArea, selectedParent, mergeSetBlock, &mergeSetBlues, &mergeSetReds, &blueSet)
|
err := gh.divideToBlueAndRed(stagingArea, mergeSetBlock, &mergeSetBlues, &mergeSetReds, &blueSet)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
myScore += uint64(len(mergeSetBlues))
|
blueScore += uint64(len(mergeSetBlues))
|
||||||
|
|
||||||
// We add up all the *work*(not blueWork) that all our blues and selected parent did
|
// Calculation of blue work
|
||||||
for _, blue := range mergeSetBlues {
|
for _, blue := range mergeSetBlues {
|
||||||
header, err := gh.headerStore.BlockHeader(gh.dbAccess, stagingArea, blue)
|
header, err := gh.headerStore.BlockHeader(gh.dbAccess, stagingArea, blue)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
myWork.Add(myWork, difficulty.CalcWork(header.Bits()))
|
blueWork.Add(blueWork, difficulty.CalcWork(header.Bits()))
|
||||||
}
|
}
|
||||||
|
|
||||||
e := model.NewBlockGHOSTDAGData(myScore, myWork, selectedParent, mergeSetBlues, mergeSetReds, nil)
|
blockGHOSTDAGData := model.NewBlockGHOSTDAGData(blueScore, blueWork, selectedParent, mergeSetBlues, mergeSetReds, nil)
|
||||||
gh.dataStore.Stage(stagingArea, blockCandidate, e)
|
gh.dataStore.Stage(stagingArea, blockCandidate, blockGHOSTDAGData)
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
/* --------isMoreHash(w, selectedParent)----------------*/
|
func isMoreHash(parent *externalapi.DomainHash, selectedParent *externalapi.DomainHash) bool {
|
||||||
func ismoreHash(parent *externalapi.DomainHash, selectedParent *externalapi.DomainHash) bool {
|
|
||||||
parentByteArray := parent.ByteArray()
|
parentByteArray := parent.ByteArray()
|
||||||
selectedParentByteArray := selectedParent.ByteArray()
|
selectedParentByteArray := selectedParent.ByteArray()
|
||||||
//Check if parentHash is more then selectedParentHash
|
|
||||||
for i := 0; i < len(parentByteArray); i++ {
|
for i := 0; i < len(parentByteArray); i++ {
|
||||||
switch {
|
switch {
|
||||||
case parentByteArray[i] < selectedParentByteArray[i]:
|
case parentByteArray[i] < selectedParentByteArray[i]:
|
||||||
@@ -136,46 +137,39 @@ func ismoreHash(parent *externalapi.DomainHash, selectedParent *externalapi.Doma
|
|||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
/* 1. blue = selectedParent.blue + blues
|
func (gh *ghostdagHelper) divideToBlueAndRed(stagingArea *model.StagingArea, blockToCheck *externalapi.DomainHash,
|
||||||
2. not connected to at most K blocks (from the blue group)
|
|
||||||
3. for each block at blue , check if not destroy
|
|
||||||
*/
|
|
||||||
|
|
||||||
/* ---------------divideBluesReds--------------------- */
|
|
||||||
func (gh *ghostdagHelper) divideBlueRed(stagingArea *model.StagingArea,
|
|
||||||
selectedParent *externalapi.DomainHash, desiredBlock *externalapi.DomainHash,
|
|
||||||
blues *[]*externalapi.DomainHash, reds *[]*externalapi.DomainHash, blueSet *[]*externalapi.DomainHash) error {
|
blues *[]*externalapi.DomainHash, reds *[]*externalapi.DomainHash, blueSet *[]*externalapi.DomainHash) error {
|
||||||
|
|
||||||
var k = int(gh.k)
|
var k = int(gh.k)
|
||||||
counter := 0
|
anticoneBlocksCounter := 0
|
||||||
|
anticoneBlues := make([]*externalapi.DomainHash, 0)
|
||||||
var suspectsBlues = make([]*externalapi.DomainHash, 0)
|
|
||||||
isMergeBlue := true
|
isMergeBlue := true
|
||||||
|
|
||||||
//check that not-connected to at most k.
|
//check that not-connected to at most k.
|
||||||
for _, block := range *blueSet {
|
for _, blueblock := range *blueSet {
|
||||||
isAnticone, err := gh.isAnticone(stagingArea, block, desiredBlock)
|
isAnticone, err := gh.isAnticone(stagingArea, blueblock, blockToCheck)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
if isAnticone {
|
if isAnticone {
|
||||||
counter++
|
anticoneBlocksCounter++
|
||||||
suspectsBlues = append(suspectsBlues, block)
|
anticoneBlues = append(anticoneBlues, blueblock)
|
||||||
}
|
}
|
||||||
if counter > k {
|
if anticoneBlocksCounter > k {
|
||||||
isMergeBlue = false
|
isMergeBlue = false
|
||||||
break
|
break
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
if !isMergeBlue {
|
if !isMergeBlue {
|
||||||
if !contains(desiredBlock, *reds) {
|
if !contains(blockToCheck, *reds) {
|
||||||
*reds = append(*reds, desiredBlock)
|
*reds = append(*reds, blockToCheck)
|
||||||
}
|
}
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
// check that the k-cluster of each blue is still valid.
|
// check that the k-cluster of each anticone blue block is still valid.
|
||||||
for _, blue := range suspectsBlues {
|
for _, blueBlock := range anticoneBlues {
|
||||||
isDestroyed, err := gh.checkIfDestroy(stagingArea, blue, blueSet)
|
isDestroyed, err := gh.checkIfDestroy(stagingArea, blueBlock, blueSet)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
@@ -185,39 +179,37 @@ func (gh *ghostdagHelper) divideBlueRed(stagingArea *model.StagingArea,
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
if !isMergeBlue {
|
if !isMergeBlue {
|
||||||
if !contains(desiredBlock, *reds) {
|
if !contains(blockToCheck, *reds) {
|
||||||
*reds = append(*reds, desiredBlock)
|
*reds = append(*reds, blockToCheck)
|
||||||
}
|
}
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
if !contains(desiredBlock, *blues) {
|
if !contains(blockToCheck, *blues) {
|
||||||
*blues = append(*blues, desiredBlock)
|
*blues = append(*blues, blockToCheck)
|
||||||
}
|
}
|
||||||
if !contains(desiredBlock, *blueSet) {
|
if !contains(blockToCheck, *blueSet) {
|
||||||
*blueSet = append(*blueSet, desiredBlock)
|
*blueSet = append(*blueSet, blockToCheck)
|
||||||
}
|
}
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
/* ---------------isAnticone-------------------------- */
|
|
||||||
func (gh *ghostdagHelper) isAnticone(stagingArea *model.StagingArea, blockA, blockB *externalapi.DomainHash) (bool, error) {
|
func (gh *ghostdagHelper) isAnticone(stagingArea *model.StagingArea, blockA, blockB *externalapi.DomainHash) (bool, error) {
|
||||||
isAAncestorOfAB, err := gh.dagTopologyManager.IsAncestorOf(stagingArea, blockA, blockB)
|
isBlockAAncestorOfBlockB, err := gh.dagTopologyManager.IsAncestorOf(stagingArea, blockA, blockB)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return false, err
|
return false, err
|
||||||
}
|
}
|
||||||
isBAncestorOfA, err := gh.dagTopologyManager.IsAncestorOf(stagingArea, blockB, blockA)
|
isBlockBAncestorOfBlockA, err := gh.dagTopologyManager.IsAncestorOf(stagingArea, blockB, blockA)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return false, err
|
return false, err
|
||||||
}
|
}
|
||||||
return !isAAncestorOfAB && !isBAncestorOfA, nil
|
|
||||||
|
|
||||||
|
return !isBlockAAncestorOfBlockB && !isBlockBAncestorOfBlockA, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
/* ----------------validateKCluster------------------- */
|
func (gh *ghostdagHelper) validateKCluster(stagingArea *model.StagingArea, chain *externalapi.DomainHash, checkedBlock *externalapi.DomainHash,
|
||||||
func (gh *ghostdagHelper) validateKCluster(stagingArea *model.StagingArea, chain *externalapi.DomainHash,
|
counter *int, blueSet *[]*externalapi.DomainHash) (bool, error) {
|
||||||
checkedBlock *externalapi.DomainHash, counter *int, blueSet *[]*externalapi.DomainHash) (bool, error) {
|
|
||||||
|
|
||||||
var k = int(gh.k)
|
k := int(gh.k)
|
||||||
isAnticone, err := gh.isAnticone(stagingArea, chain, checkedBlock)
|
isAnticone, err := gh.isAnticone(stagingArea, chain, checkedBlock)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return false, err
|
return false, err
|
||||||
@@ -236,6 +228,7 @@ func (gh *ghostdagHelper) validateKCluster(stagingArea *model.StagingArea, chain
|
|||||||
*counter++
|
*counter++
|
||||||
return true, nil
|
return true, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
isAncestorOf, err := gh.dagTopologyManager.IsAncestorOf(stagingArea, checkedBlock, chain)
|
isAncestorOf, err := gh.dagTopologyManager.IsAncestorOf(stagingArea, checkedBlock, chain)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return false, err
|
return false, err
|
||||||
@@ -251,27 +244,24 @@ func (gh *ghostdagHelper) validateKCluster(stagingArea *model.StagingArea, chain
|
|||||||
} else {
|
} else {
|
||||||
return true, nil
|
return true, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
return false, nil
|
return false, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
/*----------------contains-------------------------- */
|
func contains(desiredItem *externalapi.DomainHash, items []*externalapi.DomainHash) bool {
|
||||||
func contains(item *externalapi.DomainHash, items []*externalapi.DomainHash) bool {
|
for _, item := range items {
|
||||||
for _, r := range items {
|
if item.Equal(desiredItem) {
|
||||||
if r.Equal(item) {
|
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
/* ----------------checkIfDestroy------------------- */
|
// find number of not-connected in blueSet
|
||||||
/* find number of not-connected in his blue*/
|
|
||||||
func (gh *ghostdagHelper) checkIfDestroy(stagingArea *model.StagingArea, blockBlue *externalapi.DomainHash,
|
func (gh *ghostdagHelper) checkIfDestroy(stagingArea *model.StagingArea, blockBlue *externalapi.DomainHash,
|
||||||
blueSet *[]*externalapi.DomainHash) (bool, error) {
|
blueSet *[]*externalapi.DomainHash) (bool, error) {
|
||||||
|
|
||||||
// Goal: check that the K-cluster of each block in the blueSet is not destroyed when adding the block to the mergeSet.
|
// check that the K-cluster of each block in the blueSet is not destroyed when adding the block to the mergeSet.
|
||||||
var k = int(gh.k)
|
k := int(gh.k)
|
||||||
counter := 0
|
counter := 0
|
||||||
for _, blue := range *blueSet {
|
for _, blue := range *blueSet {
|
||||||
isAnticone, err := gh.isAnticone(stagingArea, blue, blockBlue)
|
isAnticone, err := gh.isAnticone(stagingArea, blue, blockBlue)
|
||||||
@@ -288,51 +278,45 @@ func (gh *ghostdagHelper) checkIfDestroy(stagingArea *model.StagingArea, blockBl
|
|||||||
return false, nil
|
return false, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
/* ----------------findMergeSet------------------- */
|
|
||||||
func (gh *ghostdagHelper) findMergeSet(stagingArea *model.StagingArea, parents []*externalapi.DomainHash,
|
func (gh *ghostdagHelper) findMergeSet(stagingArea *model.StagingArea, parents []*externalapi.DomainHash,
|
||||||
selectedParent *externalapi.DomainHash) ([]*externalapi.DomainHash, error) {
|
selectedParent *externalapi.DomainHash) ([]*externalapi.DomainHash, error) {
|
||||||
|
|
||||||
allMergeSet := make([]*externalapi.DomainHash, 0)
|
mergeSet := make([]*externalapi.DomainHash, 0)
|
||||||
blockQueue := make([]*externalapi.DomainHash, 0)
|
blocksQueue := make([]*externalapi.DomainHash, 0)
|
||||||
for _, parent := range parents {
|
for _, parent := range parents {
|
||||||
if !contains(parent, blockQueue) {
|
if !contains(parent, blocksQueue) {
|
||||||
blockQueue = append(blockQueue, parent)
|
blocksQueue = append(blocksQueue, parent)
|
||||||
}
|
}
|
||||||
|
|
||||||
}
|
}
|
||||||
for len(blockQueue) > 0 {
|
for len(blocksQueue) > 0 {
|
||||||
block := blockQueue[0]
|
block := blocksQueue[0]
|
||||||
blockQueue = blockQueue[1:]
|
blocksQueue = blocksQueue[1:]
|
||||||
if selectedParent.Equal(block) {
|
if selectedParent.Equal(block) {
|
||||||
if !contains(block, allMergeSet) {
|
if !contains(block, mergeSet) {
|
||||||
allMergeSet = append(allMergeSet, block)
|
mergeSet = append(mergeSet, block)
|
||||||
}
|
}
|
||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
isancestorOf, err := gh.dagTopologyManager.IsAncestorOf(stagingArea, block, selectedParent)
|
isAncestorOf, err := gh.dagTopologyManager.IsAncestorOf(stagingArea, block, selectedParent)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return nil, err
|
return nil, err
|
||||||
}
|
}
|
||||||
if isancestorOf {
|
if isAncestorOf {
|
||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
if !contains(block, allMergeSet) {
|
if !contains(block, mergeSet) {
|
||||||
allMergeSet = append(allMergeSet, block)
|
mergeSet = append(mergeSet, block)
|
||||||
}
|
}
|
||||||
err = gh.insertParent(stagingArea, block, &blockQueue)
|
err = gh.insertParent(stagingArea, block, &blocksQueue)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return nil, err
|
return nil, err
|
||||||
}
|
}
|
||||||
|
|
||||||
}
|
}
|
||||||
return allMergeSet, nil
|
return mergeSet, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
/* ----------------insertParent------------------- */
|
// Insert all parents to the queue
|
||||||
/* Insert all parents to the queue*/
|
func (gh *ghostdagHelper) insertParent(stagingArea *model.StagingArea, child *externalapi.DomainHash, queue *[]*externalapi.DomainHash) error {
|
||||||
func (gh *ghostdagHelper) insertParent(stagingArea *model.StagingArea, child *externalapi.DomainHash,
|
|
||||||
queue *[]*externalapi.DomainHash) error {
|
|
||||||
|
|
||||||
parents, err := gh.dagTopologyManager.Parents(stagingArea, child)
|
parents, err := gh.dagTopologyManager.Parents(stagingArea, child)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
@@ -346,8 +330,9 @@ func (gh *ghostdagHelper) insertParent(stagingArea *model.StagingArea, child *ex
|
|||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
/* ----------------findBlueSet------------------- */
|
func (gh *ghostdagHelper) findBlueSet(stagingArea *model.StagingArea, blueSet *[]*externalapi.DomainHash,
|
||||||
func (gh *ghostdagHelper) findBlueSet(stagingArea *model.StagingArea, blueSet *[]*externalapi.DomainHash, selectedParent *externalapi.DomainHash) error {
|
selectedParent *externalapi.DomainHash) error {
|
||||||
|
|
||||||
for selectedParent != nil {
|
for selectedParent != nil {
|
||||||
if !contains(selectedParent, *blueSet) {
|
if !contains(selectedParent, *blueSet) {
|
||||||
*blueSet = append(*blueSet, selectedParent)
|
*blueSet = append(*blueSet, selectedParent)
|
||||||
@@ -368,44 +353,41 @@ func (gh *ghostdagHelper) findBlueSet(stagingArea *model.StagingArea, blueSet *[
|
|||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
/* ----------------sortByBlueScore------------------- */
|
|
||||||
func (gh *ghostdagHelper) sortByBlueWork(stagingArea *model.StagingArea, arr []*externalapi.DomainHash) error {
|
func (gh *ghostdagHelper) sortByBlueWork(stagingArea *model.StagingArea, arr []*externalapi.DomainHash) error {
|
||||||
|
var err error
|
||||||
var err error = nil
|
|
||||||
sort.Slice(arr, func(i, j int) bool {
|
sort.Slice(arr, func(i, j int) bool {
|
||||||
|
|
||||||
blockLeft, error := gh.dataStore.Get(gh.dbAccess, stagingArea, arr[i])
|
blockLeft, err := gh.dataStore.Get(gh.dbAccess, stagingArea, arr[i])
|
||||||
if error != nil {
|
if err != nil {
|
||||||
err = error
|
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
blockRight, err := gh.dataStore.Get(gh.dbAccess, stagingArea, arr[j])
|
||||||
blockRight, error := gh.dataStore.Get(gh.dbAccess, stagingArea, arr[j])
|
if err != nil {
|
||||||
if error != nil {
|
|
||||||
err = error
|
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
if blockLeft.BlueWork().Cmp(blockRight.BlueWork()) == -1 {
|
if blockLeft.BlueWork().Cmp(blockRight.BlueWork()) == -1 {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
if blockLeft.BlueWork().Cmp(blockRight.BlueWork()) == 0 {
|
if blockLeft.BlueWork().Cmp(blockRight.BlueWork()) == 0 {
|
||||||
return ismoreHash(arr[j], arr[i])
|
return isMoreHash(arr[j], arr[i])
|
||||||
}
|
}
|
||||||
return false
|
return false
|
||||||
})
|
})
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
|
|
||||||
/* --------------------------------------------- */
|
|
||||||
|
|
||||||
func (gh *ghostdagHelper) BlockData(stagingArea *model.StagingArea, blockHash *externalapi.DomainHash) (*model.BlockGHOSTDAGData, error) {
|
func (gh *ghostdagHelper) BlockData(stagingArea *model.StagingArea, blockHash *externalapi.DomainHash) (*model.BlockGHOSTDAGData, error) {
|
||||||
return gh.dataStore.Get(gh.dbAccess, stagingArea, blockHash)
|
return gh.dataStore.Get(gh.dbAccess, stagingArea, blockHash)
|
||||||
}
|
}
|
||||||
func (gh *ghostdagHelper) ChooseSelectedParent(stagingArea *model.StagingArea, blockHashes ...*externalapi.DomainHash) (*externalapi.DomainHash, error) {
|
|
||||||
|
func (gh *ghostdagHelper) ChooseSelectedParent(*model.StagingArea, ...*externalapi.DomainHash) (*externalapi.DomainHash, error) {
|
||||||
panic("implement me")
|
panic("implement me")
|
||||||
}
|
}
|
||||||
|
|
||||||
func (gh *ghostdagHelper) Less(blockHashA *externalapi.DomainHash, ghostdagDataA *model.BlockGHOSTDAGData, blockHashB *externalapi.DomainHash, ghostdagDataB *model.BlockGHOSTDAGData) bool {
|
func (gh *ghostdagHelper) Less(*externalapi.DomainHash, *model.BlockGHOSTDAGData, *externalapi.DomainHash, *model.BlockGHOSTDAGData) bool {
|
||||||
|
panic("implement me")
|
||||||
|
}
|
||||||
|
|
||||||
|
func (gh *ghostdagHelper) GetSortedMergeSet(*model.StagingArea, *externalapi.DomainHash) ([]*externalapi.DomainHash, error) {
|
||||||
panic("implement me")
|
panic("implement me")
|
||||||
}
|
}
|
||||||
|
|||||||
Reference in New Issue
Block a user