Hacktoberfest 2026: los issues que los mantenedores marcaron para octubre, abiertos y aptos para principiantes. Explorar issues de Hacktoberfest

Allow specifying a max fee for static Loop In to force splitting across multiple channels to the last hop

Abierto
#1,208 1 comentario 0 reacciones 0 asignados Ver en GitHub

Los mantenedores suelen responder en 7 días

Nadie ha tomado este issue todavía.

Evaluación

Dificultad
4/5
Tiempo estimado
3-5 días
Aptitud para principiantes
50/100
Tipo de issue
Nueva funcionalidad
Claridad
Bastante claro
Estado de actividad
Activo
Stack tecnológico
go

Línea de trabajo

Comienza por el comando estático de Loop In y el procesamiento de solicitudes, siguiendo los argumentos existentes de la comisión máxima del swap hasta la llamada de enrutamiento del pago y la LND payment API. Compara los límites de comisión de enrutamiento propuestos con el comportamiento existente de MPP; se considera terminado cuando se acepta y verifica un límite de comisión de enrutamiento distinto para Loop In, de modo que se impida una ruta single-HTLC que de otro modo sería elegible cuando el límite requiera dividirla.

Escrito por el modelo de indexación a partir del texto del issue.

Descripción

Is your feature request related to a problem? Please describe.
When using static Loop In (loop static in ... --last_hop <pubkey>) with more than one channel open to the same last-hop peer, there's currently no way to force the payment to split across those channels. LND's pathfinding only attempts to shard a payment when no single route/channel can carry the full HTLC — if one channel happens to be big enough on its own, LND will always prefer the single-HTLC route, even if the user would rather spread liquidity across both channels.

This matters for users actively managing inbound liquidity across multiple channels to the same peer (e.g. Loop's own routing node) — right now the only way to force a split is to manually shrink the swap amount below the capacity of any single channel, which isn't practical for larger swaps or automated tooling.

Describe the solution you'd like

Add a max-fee argument to the loop-in request (e.g. --max_fee_sat / --max_fee_ppm at the routing/HTLC level, distinct from the existing --max_swap_fee_sat / --max_swap_fee_ppm which caps Loop's service fee).

Setting a low-enough max routing fee would eliminate the single-HTLC route from consideration (a single larger HTLC generally costs more in routing fees than an equivalent smaller shard), forcing the payment to split across the available channels as a side effect — without needing to build new explicit splitting/shard-count logic.

An alternative would be an explicit shard-count argument on the loop-in request, but the max-fee approach seems simpler since it reuses a lever that already exists conceptually in LND's payment API rather than requiring new splitting logic.

(Note for maintainers: in LND terms this means the payment falls back to its existing MPP shard-splitting behavior once the single-HTLC route is priced out of consideration.)

Describe alternatives you've considered

MPP?

Additional context
Static Loop In user with 2 channels open to the Loop peer, wanting a large loop-in swap (static or normal) to route inbound liquidity across both channels rather than concentrating it on whichever single channel happens to have enough capacity.

Lenguaje dominante
Go
Estrellas
593
Forks
138
Merge medio
5 d 10 h
PR fusionados (30 d)
12

Preparar el entorno

  • Incluye un Dockerfile o un archivo de Docker Compose
  • Tiene una plantilla de pull request
  • Sin guía de contribución

Primeros pasos

  1. Lee el issue completo y luego la guía de contribución del proyecto.
  2. Comenta en el issue que vas a ocuparte — evita que dos personas hagan lo mismo.
  3. Haz un fork del repositorio y trabaja en una rama.
  4. Abre un pull request que haga referencia al número del issue.

Más de lightninglabs/loop

Todos los issues de lightninglabs/loop

Issues similares

Más issues de Go

Recibe los nuevos issues en tu correo

Un resumen breve de issues de GitHub para principiantes.