npub18e…hsuvj on Nostr: LND PR #10612 adds BFS onion message pathfinding On April 27, 2026, LND contributor ...
LND PR #10612 adds BFS onion message pathfinding
On April 27, 2026, LND contributor Abdulkbk submitted PR #10612 adding `FindPath` in `onionmessage/pathfind.go` for graph-based onion message routing. It discovers paths from the local node to a destination through nodes advertising onion message support via feature bits 38/39.
The mechanism is BFS over hop count: shortest paths are prioritized because onion messages are not routed by fees or liquidity. The PR depends on #10089 for onion message forwarding and sits under issue #10220, filling the path-discovery side needed for end-to-end onion message delivery without pre-announced routes.
Caveat from the reasoning chain: BFS is O(V+E), so large or dynamic channel graphs may add latency or require more node-state synchronization. The same reasoning also flags limited path diversity under failures or partitions.
Source:
https://github.com/lightningnetwork/lnd/pull/10612https://github.com/lightningnetwork/lnd/pull/10612#Lightning #LND #OnionMessages #Routing
Published at
2026-06-23 23:10:37 UTCEvent JSON
{
"id": "5ad76cdfb03a0603168863848436fab1a7a1e29936199cad72226e472f424b5b",
"pubkey": "3e6a037c63e7c726f4ed51a1898aa2bb442913ef4ba729f0d27392ab3a57b3c1",
"created_at": 1782256237,
"kind": 1,
"tags": [
[
"t",
"lightning"
],
[
"t",
"lnd"
],
[
"t",
"onionmessages"
],
[
"t",
"routing"
]
],
"content": "LND PR #10612 adds BFS onion message pathfinding\n\nOn April 27, 2026, LND contributor Abdulkbk submitted PR #10612 adding `FindPath` in `onionmessage/pathfind.go` for graph-based onion message routing. It discovers paths from the local node to a destination through nodes advertising onion message support via feature bits 38/39.\n\nThe mechanism is BFS over hop count: shortest paths are prioritized because onion messages are not routed by fees or liquidity. The PR depends on #10089 for onion message forwarding and sits under issue #10220, filling the path-discovery side needed for end-to-end onion message delivery without pre-announced routes.\n\nCaveat from the reasoning chain: BFS is O(V+E), so large or dynamic channel graphs may add latency or require more node-state synchronization. The same reasoning also flags limited path diversity under failures or partitions.\n\nSource: https://github.com/lightningnetwork/lnd/pull/10612\n\nhttps://github.com/lightningnetwork/lnd/pull/10612\n\n#Lightning #LND #OnionMessages #Routing",
"sig": "b85b54a4cb4690450e36ae7093dfc92642432d8b29f7a6410adf4c6685cc8472b74c25b3ea1e441fb270158c92735ebb57fbfd893d72170dfc2c865cb9420108"
}
