mirror of
https://github.com/kaspanet/kaspad.git
synced 2025-09-14 05:20:11 +00:00

* Mine JSON * [Reindex tests] add test_params and validate_mining flag to test_consensus * Rename file and extend tests * Ignore local test datasets * Use spaces over tabs * Reindex algorithm - full algorithm, initial commit, some tests fail * Reindex algorithm - a few critical fixes * Reindex algorithm - move reindex struct and all related operations to new file * Reindex algorithm - added a validateIntervals method and modified tests to use it (instead of exact comparisons) * Reindex algorithm - modified reindexIntervals to receive the new child as argument and fixed an important related bug * Reindex attack tests - move logic to helper function and add stretch test * Reindex algorithm - variable names and some comments * Reindex algorithm - minor changes * Reindex algorithm - minor changes 2 * Reindex algorithm - extended stretch test * Reindex algorithm - small fix to validate function * Reindex tests - move tests and add DAG files * go format fixes * TestParams doc comment * Reindex tests - exact comparisons are not needed * Update to version 0.8.6 * Remove TestParams and use AddUTXOInvalidHeader instead * Use gzipeed test files * This unintended change somehow slipped in through branch merges * Rename test * Move interval increase/decrease methods to reachability interval file * Addressing a bunch of minor review comments * Addressed a few more minor review comments * Make code of offsetSiblingsBefore and offsetSiblingsAfter symmetric * Optimize reindex logic in cases where reorg occurs + reorg test * Do not change reindex root too fast (on reorg) * Some comments * A few more comments * Addressing review comments * Remove TestNoAttackAlternateReorg and assert chain attack * Minor Co-authored-by: Elichai Turkel <elichai.turkel@gmail.com> Co-authored-by: Mike Zak <feanorr@gmail.com> Co-authored-by: Ori Newman <orinewman1@gmail.com>
200 lines
7.0 KiB
Go
200 lines
7.0 KiB
Go
package dagtopologymanager
|
|
|
|
import (
|
|
"github.com/kaspanet/kaspad/domain/consensus/model"
|
|
"github.com/kaspanet/kaspad/domain/consensus/model/externalapi"
|
|
"github.com/pkg/errors"
|
|
)
|
|
|
|
// dagTopologyManager exposes methods for querying relationships
|
|
// between blocks in the DAG
|
|
type dagTopologyManager struct {
|
|
reachabilityManager model.ReachabilityManager
|
|
blockRelationStore model.BlockRelationStore
|
|
ghostdagStore model.GHOSTDAGDataStore
|
|
databaseContext model.DBReader
|
|
}
|
|
|
|
// New instantiates a new DAGTopologyManager
|
|
func New(
|
|
databaseContext model.DBReader,
|
|
reachabilityManager model.ReachabilityManager,
|
|
blockRelationStore model.BlockRelationStore,
|
|
ghostdagStore model.GHOSTDAGDataStore) model.DAGTopologyManager {
|
|
|
|
return &dagTopologyManager{
|
|
databaseContext: databaseContext,
|
|
reachabilityManager: reachabilityManager,
|
|
blockRelationStore: blockRelationStore,
|
|
ghostdagStore: ghostdagStore,
|
|
}
|
|
}
|
|
|
|
// Parents returns the DAG parents of the given blockHash
|
|
func (dtm *dagTopologyManager) Parents(blockHash *externalapi.DomainHash) ([]*externalapi.DomainHash, error) {
|
|
blockRelations, err := dtm.blockRelationStore.BlockRelation(dtm.databaseContext, blockHash)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return blockRelations.Parents, nil
|
|
}
|
|
|
|
// Children returns the DAG children of the given blockHash
|
|
func (dtm *dagTopologyManager) Children(blockHash *externalapi.DomainHash) ([]*externalapi.DomainHash, error) {
|
|
blockRelations, err := dtm.blockRelationStore.BlockRelation(dtm.databaseContext, blockHash)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return blockRelations.Children, nil
|
|
}
|
|
|
|
// IsParentOf returns true if blockHashA is a direct DAG parent of blockHashB
|
|
func (dtm *dagTopologyManager) IsParentOf(blockHashA *externalapi.DomainHash, blockHashB *externalapi.DomainHash) (bool, error) {
|
|
blockRelations, err := dtm.blockRelationStore.BlockRelation(dtm.databaseContext, blockHashB)
|
|
if err != nil {
|
|
return false, err
|
|
}
|
|
return isHashInSlice(blockHashA, blockRelations.Parents), nil
|
|
}
|
|
|
|
// IsChildOf returns true if blockHashA is a direct DAG child of blockHashB
|
|
func (dtm *dagTopologyManager) IsChildOf(blockHashA *externalapi.DomainHash, blockHashB *externalapi.DomainHash) (bool, error) {
|
|
blockRelations, err := dtm.blockRelationStore.BlockRelation(dtm.databaseContext, blockHashB)
|
|
if err != nil {
|
|
return false, err
|
|
}
|
|
return isHashInSlice(blockHashA, blockRelations.Children), nil
|
|
}
|
|
|
|
// IsAncestorOf returns true if blockHashA is a DAG ancestor of blockHashB
|
|
func (dtm *dagTopologyManager) IsAncestorOf(blockHashA *externalapi.DomainHash, blockHashB *externalapi.DomainHash) (bool, error) {
|
|
return dtm.reachabilityManager.IsDAGAncestorOf(blockHashA, blockHashB)
|
|
}
|
|
|
|
// IsDescendantOf returns true if blockHashA is a DAG descendant of blockHashB
|
|
func (dtm *dagTopologyManager) IsDescendantOf(blockHashA *externalapi.DomainHash, blockHashB *externalapi.DomainHash) (bool, error) {
|
|
return dtm.reachabilityManager.IsDAGAncestorOf(blockHashB, blockHashA)
|
|
}
|
|
|
|
// IsAncestorOfAny returns true if `blockHash` is an ancestor of at least one of `potentialDescendants`
|
|
func (dtm *dagTopologyManager) IsAncestorOfAny(blockHash *externalapi.DomainHash, potentialDescendants []*externalapi.DomainHash) (bool, error) {
|
|
for _, potentialDescendant := range potentialDescendants {
|
|
isAncestorOf, err := dtm.IsAncestorOf(blockHash, potentialDescendant)
|
|
if err != nil {
|
|
return false, err
|
|
}
|
|
|
|
if isAncestorOf {
|
|
return true, nil
|
|
}
|
|
}
|
|
|
|
return false, nil
|
|
}
|
|
|
|
// IsInSelectedParentChainOf returns true if blockHashA is in the selected parent chain of blockHashB
|
|
func (dtm *dagTopologyManager) IsInSelectedParentChainOf(blockHashA *externalapi.DomainHash, blockHashB *externalapi.DomainHash) (bool, error) {
|
|
return dtm.reachabilityManager.IsReachabilityTreeAncestorOf(blockHashA, blockHashB)
|
|
}
|
|
|
|
func isHashInSlice(hash *externalapi.DomainHash, hashes []*externalapi.DomainHash) bool {
|
|
for _, h := range hashes {
|
|
if h.Equal(hash) {
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|
|
|
|
func (dtm *dagTopologyManager) SetParents(blockHash *externalapi.DomainHash, parentHashes []*externalapi.DomainHash) error {
|
|
hasRelations, err := dtm.blockRelationStore.Has(dtm.databaseContext, blockHash)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
|
|
if hasRelations {
|
|
// Go over the block's current relations (if they exist), and remove the block from all its current parents
|
|
// Note: In theory we should also remove the block from all its children, however, in practice no block
|
|
// ever has its relations updated after getting any children, therefore we skip this step
|
|
|
|
currentRelations, err := dtm.blockRelationStore.BlockRelation(dtm.databaseContext, blockHash)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
|
|
for _, currentParent := range currentRelations.Parents {
|
|
parentRelations, err := dtm.blockRelationStore.BlockRelation(dtm.databaseContext, currentParent)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
for i, parentChild := range parentRelations.Children {
|
|
if parentChild.Equal(blockHash) {
|
|
parentRelations.Children = append(parentRelations.Children[:i], parentRelations.Children[i+1:]...)
|
|
dtm.blockRelationStore.StageBlockRelation(currentParent, parentRelations)
|
|
break
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// Go over all new parents and add block as their child
|
|
for _, parent := range parentHashes {
|
|
parentRelations, err := dtm.blockRelationStore.BlockRelation(dtm.databaseContext, parent)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
isBlockAlreadyInChildren := false
|
|
for _, parentChild := range parentRelations.Children {
|
|
if parentChild.Equal(blockHash) {
|
|
isBlockAlreadyInChildren = true
|
|
break
|
|
}
|
|
}
|
|
if !isBlockAlreadyInChildren {
|
|
parentRelations.Children = append(parentRelations.Children, blockHash)
|
|
dtm.blockRelationStore.StageBlockRelation(parent, parentRelations)
|
|
}
|
|
}
|
|
|
|
// Finally - create the relations for the block itself
|
|
dtm.blockRelationStore.StageBlockRelation(blockHash, &model.BlockRelations{
|
|
Parents: parentHashes,
|
|
Children: []*externalapi.DomainHash{},
|
|
})
|
|
|
|
return nil
|
|
}
|
|
|
|
// ChildInSelectedParentChainOf returns the child of `context` that is in the selected-parent-chain of `highHash`
|
|
func (dtm *dagTopologyManager) ChildInSelectedParentChainOf(
|
|
blockHash, highHash *externalapi.DomainHash) (*externalapi.DomainHash, error) {
|
|
|
|
// Virtual doesn't have reachability data, therefore, it should be treated as a special case -
|
|
// use it's selected parent as highHash.
|
|
specifiedHighHash := highHash
|
|
if highHash == model.VirtualBlockHash {
|
|
ghostdagData, err := dtm.ghostdagStore.Get(dtm.databaseContext, highHash)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
selectedParent := ghostdagData.SelectedParent()
|
|
|
|
// In case where `blockHash` is an immediate parent of `highHash`
|
|
if blockHash.Equal(selectedParent) {
|
|
return highHash, nil
|
|
}
|
|
highHash = selectedParent
|
|
}
|
|
|
|
isInSelectedParentChain, err := dtm.IsInSelectedParentChainOf(blockHash, highHash)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
if !isInSelectedParentChain {
|
|
return nil, errors.Errorf("blockHash(%s) is not in the selected-parent-chain of highHash(%s)",
|
|
blockHash, specifiedHighHash)
|
|
}
|
|
|
|
return dtm.reachabilityManager.FindNextAncestor(highHash, blockHash)
|
|
}
|