16177692143

Committed 09 Jul 2025 06:49PM UTC coverage: 55.317% (-2.3%) from 57.611%

Build # 16177692143

Build Type

Pull #10060

github

Committed by

web-flow

Commit Message

Merge 4aec413e3 into 0e830da9d

Pull Request Pull Request #10060: sweep: fix expected spending events being missed

Run Details

9 of 25 new or added lines in 1 file covered. (36.0%)

23713 existing lines in 281 files now uncovered.

108499 of 196142 relevant lines covered (55.32%)

22331.52 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

0.0

/lncfg/routing.go

package lncfg

import "fmt"

// Routing holds the configuration options for routing.
//
//nolint:ll
type Routing struct {
        AssumeChannelValid bool `long:"assumechanvalid" description:"DEPRECATED: Skip checking channel spentness during graph validation. This speedup comes at the risk of using an unvalidated view of the network for routing. (default: false)" hidden:"true"`

        StrictZombiePruning bool `long:"strictgraphpruning" description:"If true, then the graph will be pruned more aggressively for zombies. In practice this means that edges with a single stale edge will be considered a zombie."`

        BlindedPaths BlindedPaths `group:"blinding" namespace:"blinding"`
}

// BlindedPaths holds the configuration options for blinded path construction.
//
//nolint:ll
type BlindedPaths struct {
        MinNumRealHops           uint8   `long:"min-num-real-hops" description:"The minimum number of real hops to include in a blinded path. This doesn't include our node, so if the minimum is 1, then the path will contain at minimum our node along with an introduction node hop. If it is zero then the shortest path will use our node as an introduction node."`
        NumHops                  uint8   `long:"num-hops" description:"The number of hops to include in a blinded path. This doesn't include our node, so if it is 1, then the path will contain our node along with an introduction node or dummy node hop. If paths shorter than NumHops is found, then they will be padded using dummy hops."`
        MaxNumPaths              uint8   `long:"max-num-paths" description:"The maximum number of blinded paths to select and add to an invoice."`
        PolicyIncreaseMultiplier float64 `long:"policy-increase-multiplier" description:"The amount by which to increase certain policy values of hops on a blinded path in order to add a probing buffer."`
        PolicyDecreaseMultiplier float64 `long:"policy-decrease-multiplier" description:"The amount by which to decrease certain policy values of hops on a blinded path in order to add a probing buffer."`
}

// Validate checks that the various routing config options are sane.
//
// NOTE: this is part of the Validator interface.
func (r *Routing) Validate() error {
        if r.BlindedPaths.MinNumRealHops > r.BlindedPaths.NumHops {
                return fmt.Errorf("the minimum number of real hops in a " +
                        "blinded path must be smaller than or equal to the " +
                        "number of hops expected to be included in each path")
        }

        if r.BlindedPaths.MaxNumPaths == 0 {
                return fmt.Errorf("blinded max num paths cannot be 0")
        }

        if r.BlindedPaths.PolicyIncreaseMultiplier < 1 {
                return fmt.Errorf("the blinded route policy increase " +
                        "multiplier must be greater than or equal to 1")
        }

        if r.BlindedPaths.PolicyDecreaseMultiplier > 1 ||
                r.BlindedPaths.PolicyDecreaseMultiplier < 0 {

                return fmt.Errorf("the blinded route policy decrease " +
                        "multiplier must be in the range (0,1]")
        }

        return nil
}

1	package lncfg
2
3	import "fmt"
4
5	// Routing holds the configuration options for routing.
6	//
7	//nolint:ll
8	type Routing struct {
9	AssumeChannelValid bool `long:"assumechanvalid" description:"DEPRECATED: Skip checking channel spentness during graph validation. This speedup comes at the risk of using an unvalidated view of the network for routing. (default: false)" hidden:"true"`
10
11	StrictZombiePruning bool `long:"strictgraphpruning" description:"If true, then the graph will be pruned more aggressively for zombies. In practice this means that edges with a single stale edge will be considered a zombie."`
12
13	BlindedPaths BlindedPaths `group:"blinding" namespace:"blinding"`
14	}
15
16	// BlindedPaths holds the configuration options for blinded path construction.
17	//
18	//nolint:ll
19	type BlindedPaths struct {
20	MinNumRealHops uint8 `long:"min-num-real-hops" description:"The minimum number of real hops to include in a blinded path. This doesn't include our node, so if the minimum is 1, then the path will contain at minimum our node along with an introduction node hop. If it is zero then the shortest path will use our node as an introduction node."`
21	NumHops uint8 `long:"num-hops" description:"The number of hops to include in a blinded path. This doesn't include our node, so if it is 1, then the path will contain our node along with an introduction node or dummy node hop. If paths shorter than NumHops is found, then they will be padded using dummy hops."`
22	MaxNumPaths uint8 `long:"max-num-paths" description:"The maximum number of blinded paths to select and add to an invoice."`
23	PolicyIncreaseMultiplier float64 `long:"policy-increase-multiplier" description:"The amount by which to increase certain policy values of hops on a blinded path in order to add a probing buffer."`
24	PolicyDecreaseMultiplier float64 `long:"policy-decrease-multiplier" description:"The amount by which to decrease certain policy values of hops on a blinded path in order to add a probing buffer."`
25	}
26
27	// Validate checks that the various routing config options are sane.
28	//
29	// NOTE: this is part of the Validator interface.
UNCOV 30	func (r *Routing) Validate() error {	×
UNCOV 31	if r.BlindedPaths.MinNumRealHops > r.BlindedPaths.NumHops {	×
32	return fmt.Errorf("the minimum number of real hops in a " +	×
33	"blinded path must be smaller than or equal to the " +	×
34	"number of hops expected to be included in each path")	×
35	}	×
36
UNCOV 37	if r.BlindedPaths.MaxNumPaths == 0 {	×
38	return fmt.Errorf("blinded max num paths cannot be 0")	×
39	}	×
40
UNCOV 41	if r.BlindedPaths.PolicyIncreaseMultiplier < 1 {	×
42	return fmt.Errorf("the blinded route policy increase " +	×
43	"multiplier must be greater than or equal to 1")	×
44	}	×
45
UNCOV 46	if r.BlindedPaths.PolicyDecreaseMultiplier > 1 \|\|	×
UNCOV 47	r.BlindedPaths.PolicyDecreaseMultiplier < 0 {	×
48		×
49	return fmt.Errorf("the blinded route policy decrease " +	×
50	"multiplier must be in the range (0,1]")	×
51	}	×
52
UNCOV 53	return nil	×
54	}

lightningnetwork / lnd / 16177692143

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous