mirror of
https://github.com/kaspanet/kaspad.git
synced 2025-11-29 00:23:14 +00:00
* Pruning headers p2p basic structure * Remove headers-first * Fix consensus tests except TestValidateAndInsertPruningPointWithSideBlocks and TestValidateAndInsertImportedPruningPoint * Add virtual genesis * Implement PruningPointAndItsAnticoneWithMetaData * Start fixing TestValidateAndInsertImportedPruningPoint * Fix TestValidateAndInsertImportedPruningPoint * Fix BlockWindow * Update p2p and gRPC * Fix all tests except TestHandleRelayInvs * Delete TestHandleRelayInvs parts that cover the old IBD flow * Fix lint errors * Add p2p_request_ibd_blocks.go * Clean code * Make MsgBlockWithMetaData implement its own representation * Remove redundant check if highest share block is below the pruning point * Fix TestCheckLockTimeVerifyConditionedByAbsoluteTimeWithWrongLockTime * Fix comments, errors ane names * Fix window size to the real value * Check reindex root after each block at TestUpdateReindexRoot * Remove irrelevant check * Renames and comments * Remove redundant argument from sendGetBlockLocator * Don't delete staging on non-recoverable errors * Renames and comments * Remove redundant code * Commit changes inside ResolveVirtual * Add comment to IsRecoverableError * Remove blocksWithMetaDataGHOSTDAGDataStore * Increase windows pagefile * Move DeleteStagingConsensus outside of defer * Get rid of mustAccepted in receiveBlockWithMetaData * Ban on invalid pruning point * Rename interface_datastructures_daawindowstore.go to interface_datastructures_blocks_with_meta_data_daa_window_store.go * * Change GetVirtualSelectedParentChainFromBlockResponseMessage and VirtualSelectedParentChainChangedNotificationMessage to show only added block hashes * Remove ResolveVirtual * Use externalapi.ConsensusWrapper inside MiningManager * Fix pruningmanager.blockwithmetadata * Set pruning point selected child when importing the pruning point UTXO set * Change virtual genesis hash * replace the selected parent with virtual genesis on removePrunedBlocksFromGHOSTDAGData * Get rid of low hash in block locators * Remove +1 from everywhere we use difficultyAdjustmentWindowSize and increase the default value by one * Add comments about consensus wrapper * Don't use separate staging area when resolving resolveBlockStatus * Fix netsync stability test * Fix checkResolveVirtual * Rename ConsensusWrapper->ConsensusReference * Get rid of blockHeapNode * Add comment to defaultDifficultyAdjustmentWindowSize * Add SelectedChild to DAGTraversalManager * Remove redundant copy * Rename blockWindowHeap->calculateBlockWindowHeap * Move isVirtualGenesisOnlyParent to utils * Change BlockWithMetaData->BlockWithTrustedData * Get rid of maxReasonLength * Split IBD to 100 blocks each time * Fix a bug in calculateBlockWindowHeap * Switch to trusted data when encountering virtual genesis in blockWithTrustedData * Move ConsensusReference to domain * Update ConsensusReference comment * Add comment * Rename shouldNotAddGenesis->skipAddingGenesis
127 lines
4.0 KiB
Go
127 lines
4.0 KiB
Go
package dagtraversalmanager
|
|
|
|
import (
|
|
"github.com/kaspanet/kaspad/domain/consensus/model"
|
|
"github.com/kaspanet/kaspad/domain/consensus/model/externalapi"
|
|
"github.com/kaspanet/kaspad/infrastructure/db/database"
|
|
)
|
|
|
|
// BlockWindow returns a blockWindow of the given size that contains the
|
|
// blocks in the past of highHash, the sorting is unspecified.
|
|
// If the number of blocks in the past of startingNode is less then windowSize,
|
|
func (dtm *dagTraversalManager) BlockWindow(stagingArea *model.StagingArea, highHash *externalapi.DomainHash,
|
|
windowSize int) ([]*externalapi.DomainHash, error) {
|
|
|
|
windowHeap, err := dtm.calculateBlockWindowHeap(stagingArea, highHash, windowSize)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
window := make([]*externalapi.DomainHash, 0, len(windowHeap.impl.slice))
|
|
for _, b := range windowHeap.impl.slice {
|
|
window = append(window, b.Hash)
|
|
}
|
|
return window, nil
|
|
}
|
|
|
|
func (dtm *dagTraversalManager) BlockWindowWithGHOSTDAGData(stagingArea *model.StagingArea,
|
|
highHash *externalapi.DomainHash, windowSize int) ([]*externalapi.BlockGHOSTDAGDataHashPair, error) {
|
|
|
|
windowHeap, err := dtm.calculateBlockWindowHeap(stagingArea, highHash, windowSize)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
return windowHeap.impl.slice, nil
|
|
}
|
|
|
|
func (dtm *dagTraversalManager) calculateBlockWindowHeap(stagingArea *model.StagingArea, highHash *externalapi.DomainHash, windowSize int) (*sizedUpBlockHeap, error) {
|
|
|
|
windowHeap := dtm.newSizedUpHeap(stagingArea, windowSize)
|
|
if highHash.Equal(dtm.genesisHash) {
|
|
return windowHeap, nil
|
|
}
|
|
|
|
current := highHash
|
|
currentGHOSTDAGData, err := dtm.ghostdagDataStore.Get(dtm.databaseContext, stagingArea, highHash, false)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
for {
|
|
if currentGHOSTDAGData.SelectedParent().Equal(dtm.genesisHash) {
|
|
break
|
|
}
|
|
|
|
if currentGHOSTDAGData.SelectedParent().Equal(model.VirtualGenesisBlockHash) {
|
|
for i := uint64(0); ; i++ {
|
|
daaBlock, err := dtm.daaWindowStore.DAAWindowBlock(dtm.databaseContext, stagingArea, current, i)
|
|
if database.IsNotFoundError(err) {
|
|
break
|
|
}
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
_, err = windowHeap.tryPushWithGHOSTDAGData(daaBlock.Hash, daaBlock.GHOSTDAGData)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
// Right now we go over all of the window of `current` and filter blocks on the fly.
|
|
// We can optimize it if we make sure that daaWindowStore stores sorted windows, and
|
|
// then return from this function once one block was not added to the heap.
|
|
}
|
|
break
|
|
}
|
|
|
|
selectedParentGHOSTDAGData, err := dtm.ghostdagDataStore.Get(
|
|
dtm.databaseContext, stagingArea, currentGHOSTDAGData.SelectedParent(), false)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
added, err := windowHeap.tryPushWithGHOSTDAGData(currentGHOSTDAGData.SelectedParent(), selectedParentGHOSTDAGData)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
// If the window is full and the selected parent is less than the minimum then we break
|
|
// because this means that there cannot be any more blocks in the past with higher blueWork
|
|
if !added {
|
|
break
|
|
}
|
|
|
|
// Now we go over the merge set.
|
|
// Remove the SP from the blue merge set because we already added it.
|
|
mergeSetBlues := currentGHOSTDAGData.MergeSetBlues()[1:]
|
|
// Go over the merge set in reverse because it's ordered in reverse by blueWork.
|
|
for i := len(mergeSetBlues) - 1; i >= 0; i-- {
|
|
added, err := windowHeap.tryPush(mergeSetBlues[i])
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
// If it's smaller than minimum then we won't be able to add the rest because they're even smaller.
|
|
if !added {
|
|
break
|
|
}
|
|
}
|
|
|
|
mergeSetReds := currentGHOSTDAGData.MergeSetReds()
|
|
for i := len(mergeSetReds) - 1; i >= 0; i-- {
|
|
added, err := windowHeap.tryPush(mergeSetReds[i])
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
// If it's smaller than minimum then we won't be able to add the rest because they're even smaller.
|
|
if !added {
|
|
break
|
|
}
|
|
}
|
|
|
|
current = currentGHOSTDAGData.SelectedParent()
|
|
currentGHOSTDAGData = selectedParentGHOSTDAGData
|
|
}
|
|
|
|
return windowHeap, nil
|
|
}
|