-
Notifications
You must be signed in to change notification settings - Fork 2
/
rebalance.go
533 lines (455 loc) · 12.7 KB
/
rebalance.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
// Copyright 2019 Bonsai Software, Inc. All Rights Reserved.
package main
import (
"context"
"crypto/rand"
"encoding/hex"
"fmt"
"strconv"
"time"
"github.com/lightningnetwork/lnd/lnrpc"
"github.com/lightningnetwork/lnd/lnrpc/routerrpc"
)
var ignoreBadEdges = true // Ignore bad edges on subsequent QueryRoutes
func hopPolicy(chanId uint64, dstNode string) *lnrpc.RoutingPolicy {
chanInfo, err :=
gClient.GetChanInfo(gCtx, &lnrpc.ChanInfoRequest{ChanId: chanId})
if err != nil {
panic(fmt.Sprintf("last GetChanInfo failed:", err))
}
if chanInfo.Node1Pub == dstNode {
return chanInfo.Node2Policy
} else {
return chanInfo.Node1Policy
}
}
func dumpRoute(info *lnrpc.GetInfoResponse, route *lnrpc.Route) {
fmt.Println("ChanId Capacity Amt AmtMsat Fee FeeMsat Dlt PubKey FB FR Dlt Alias")
fmt.Printf("%29s %7d %10d %12s %4d %s %18s %s\n",
"",
route.TotalAmt,
route.TotalAmtMsat,
"",
route.TotalTimeLock-info.BlockHeight,
info.IdentityPubkey,
"",
info.Alias,
)
// Make an array of the policies, one for each hop.
policies := []*lnrpc.RoutingPolicy{}
for _, hop := range route.Hops {
policies = append(policies,
hopPolicy(hop.ChanId, hop.PubKey))
}
for ndx, hop := range route.Hops {
nodeInfo, err := gClient.GetNodeInfo(gCtx, &lnrpc.NodeInfoRequest{
PubKey: hop.PubKey,
})
if err != nil {
panic(fmt.Sprintf("GetNodeInfo failed[1]:", err))
}
alias := nodeInfo.Node.Alias
// The policy information comes from the next hop.
pstr := ""
if ndx < len(route.Hops)-1 {
pstr = fmt.Sprintf("%7d %4d %4d",
policies[ndx+1].FeeBaseMsat,
policies[ndx+1].FeeRateMilliMsat,
policies[ndx+1].TimeLockDelta,
)
} else {
pstr = fmt.Sprintf("%7d %4d %4d",
0,
0,
0,
)
}
fmt.Printf("%d %10d %7d %10d %4d %7d %4d %s %18s %s\n",
hop.ChanId,
hop.ChanCapacity,
hop.AmtToForward,
hop.AmtToForwardMsat,
hop.Fee,
hop.FeeMsat,
hop.Expiry-info.BlockHeight,
hop.PubKey,
pstr,
alias,
)
}
// Print fee totals.
fmt.Printf("%48s %4d %7d\n",
"",
route.TotalFees,
route.TotalFeesMsat,
)
fmt.Println()
}
func repriceRoute(info *lnrpc.GetInfoResponse, route *lnrpc.Route, amt int64) {
ll := len(route.Hops)
sumDelta := gCfg.Rebalance.FinalCLTVDelta
lastDelta := uint32(0)
sumFeeMsat := int64(0)
lastFeeMsat := int64(0)
amtToFwdMsat := amt * 1000
for ndx := ll - 1; ndx >= 0; ndx-- {
hop := route.Hops[ndx]
sndPolicy := hopPolicy(hop.ChanId, hop.PubKey)
hop.Expiry = info.BlockHeight + sumDelta
if ndx != ll-1 {
sumDelta += lastDelta
}
lastDelta = sndPolicy.TimeLockDelta
hop.FeeMsat = lastFeeMsat
hop.Fee = lastFeeMsat / 1000
hop.AmtToForwardMsat = amtToFwdMsat
hop.AmtToForward = amtToFwdMsat / 1000
amtToFwdMsat += lastFeeMsat
sumFeeMsat += lastFeeMsat
lastFeeMsat =
sndPolicy.FeeBaseMsat +
(hop.AmtToForwardMsat*sndPolicy.FeeRateMilliMsat)/1000000
}
route.TotalTimeLock = info.BlockHeight + sumDelta
route.TotalFeesMsat = sumFeeMsat
route.TotalFees = sumFeeMsat / 1000
route.TotalAmtMsat = (amt * 1000) + sumFeeMsat
route.TotalAmt = ((amt * 1000) + sumFeeMsat) / 1000
}
func checkRoute(info *lnrpc.GetInfoResponse, route *lnrpc.Route) {
ll := len(route.Hops)
sumDelta := gCfg.Rebalance.FinalCLTVDelta
lastDelta := uint32(0)
sumFeeMsat := int64(0)
lastFeeMsat := int64(0)
for ndx := ll - 1; ndx >= 0; ndx-- {
hop := route.Hops[ndx]
sndPolicy := hopPolicy(hop.ChanId, hop.PubKey)
if hop.Expiry-info.BlockHeight != sumDelta {
panic(fmt.Sprintf("bad expiry on hop %d", ndx))
}
if ndx != ll-1 {
sumDelta += lastDelta
}
lastDelta = sndPolicy.TimeLockDelta
if hop.FeeMsat != lastFeeMsat {
panic(fmt.Sprintf("bad fee on hop %d, saw %d, expected %d",
ndx, lastFeeMsat, hop.FeeMsat))
}
sumFeeMsat += lastFeeMsat
lastFeeMsat =
sndPolicy.FeeBaseMsat +
(hop.AmtToForwardMsat*sndPolicy.FeeRateMilliMsat)/1000000
}
if route.TotalTimeLock-info.BlockHeight != sumDelta {
panic(fmt.Sprintf("bad route total"))
}
if route.TotalFeesMsat != sumFeeMsat {
panic(fmt.Sprintf("bad fee total"))
}
}
func rebalance(args []string) {
amti, err := strconv.Atoi(args[0])
if err != nil {
panic(fmt.Sprintf("failed to parse amount:", err))
}
amt := int64(amti)
srcChanIdI, err := strconv.Atoi(args[1])
if err != nil {
panic(fmt.Sprintf("failed to parse srcChanId:", err))
}
srcChanId := uint64(srcChanIdI)
dstChanIdI, err := strconv.Atoi(args[2])
if err != nil {
panic(fmt.Sprintf("failed to parse dstChanId:", err))
}
dstChanId := uint64(dstChanIdI)
doRebalance(amt, srcChanId, dstChanId)
}
func doRebalance(amt int64, srcChanId, dstChanId uint64) bool {
// What is our own PubKey?
info, err := gClient.GetInfo(gCtx, &lnrpc.GetInfoRequest{})
if err != nil {
panic(fmt.Sprintf("GetInfo failed[1]:", err))
}
ourPubKey := info.IdentityPubkey
// What is the src pub key?
srcChanInfo, err := gClient.GetChanInfo(gCtx, &lnrpc.ChanInfoRequest{
ChanId: srcChanId,
})
if err != nil {
panic(fmt.Sprintf("src GetChanInfo failed:", err))
}
var srcPubKey string
if srcChanInfo.Node1Pub == ourPubKey {
srcPubKey = srcChanInfo.Node2Pub
} else {
srcPubKey = srcChanInfo.Node1Pub
}
srcNodeInfo, err := gClient.GetNodeInfo(gCtx, &lnrpc.NodeInfoRequest{
PubKey: srcPubKey,
})
if err != nil {
panic(fmt.Sprint("src GetNodeInfo failed:", err))
}
// What is the dst pub key?
dstChanInfo, err := gClient.GetChanInfo(gCtx, &lnrpc.ChanInfoRequest{
ChanId: dstChanId,
})
if err != nil {
panic(fmt.Sprintf("dst GetChanInfo failed:", err))
}
var dstPubKey string
if dstChanInfo.Node1Pub == ourPubKey {
dstPubKey = dstChanInfo.Node2Pub
} else {
dstPubKey = dstChanInfo.Node1Pub
}
dstNodeInfo, err := gClient.GetNodeInfo(gCtx, &lnrpc.NodeInfoRequest{
PubKey: dstPubKey,
})
if err != nil {
panic(fmt.Sprint("dst GetNodeInfo failed:", err))
}
feeLimitPercent := gCfg.Rebalance.FeeLimitRate * 100
feeLimitFixed := int64(float64(amt) * (feeLimitPercent / 100))
if gCfg.Verbose {
fmt.Printf("limit fee rate to %f, %d sat\n",
gCfg.Rebalance.FeeLimitRate, feeLimitFixed)
}
// Defer creating invoice until we get far enough to need one.
var invoiceRsp *lnrpc.AddInvoiceResponse = nil
ourNode, err := hex.DecodeString(ourPubKey)
if err != nil {
panic(fmt.Sprintf("hex.DecodeString failed:", err))
}
for {
RetryQuery:
badEdges := []*lnrpc.EdgeLocator{}
if ignoreBadEdges {
// Reject all edges that are known to fail at this amount.
for edge, limitAmount := range edgeLimit {
if amt >= limitAmount {
badEdges = append(badEdges, edge)
}
}
}
srcAlias := srcNodeInfo.Node.Alias
if len(srcAlias) > 26 {
srcAlias = srcAlias[:26]
}
dstAlias := dstNodeInfo.Node.Alias
if len(dstAlias) > 26 {
dstAlias = dstAlias[:26]
}
fmt.Printf("%d %26s -> %-26s %d %7d: ",
srcChanId, srcAlias, dstAlias, dstChanId, amt)
if gCfg.Verbose {
fmt.Println()
fmt.Printf(
"querying possible routes, fee limit %d sat, ignoring %d edges\n",
feeLimitFixed, len(badEdges))
}
// FIXME - Looks like there is a new argument to QueryRoutes:
// https://api.lightning.community/#grpc-request-queryroutesrequest
// Consider removing badEdges and trying use_mission_control
// instead ...
rsp, err := gClient.QueryRoutes(gCtx, &lnrpc.QueryRoutesRequest{
PubKey: dstPubKey,
Amt: amt,
FeeLimit: &lnrpc.FeeLimit{
Limit: &lnrpc.FeeLimit_Fixed{
Fixed: feeLimitFixed,
},
},
SourcePubKey: srcPubKey,
FinalCltvDelta: int32(gCfg.Rebalance.FinalCLTVDelta),
IgnoredEdges: badEdges,
IgnoredNodes: [][]byte{ourNode},
})
if err != nil {
fmt.Println("no routes found at this fee limit")
insertLoopAttempt(NewLoopAttempt(
time.Now().Unix(),
srcChanId, srcPubKey,
dstChanId, dstPubKey,
amt, gCfg.Rebalance.FeeLimitRate,
LoopAttemptNoRoutes,
))
return false
}
// Only get one route, only consider the first slot.
route := rsp.Routes[0]
// Prepend the initial hop from us through the src channel
hop0 := &lnrpc.Hop{
ChanId: srcChanId,
ChanCapacity: srcChanInfo.Capacity,
AmtToForward: amt,
PubKey: srcPubKey,
// We will set all of these when we "reprice" the route.
// Fee:
// Expiry:
// AmtToForwardMsat:
// FeeMSat:
}
route.Hops = append([]*lnrpc.Hop{hop0}, route.Hops...)
// Append the final hop back to us through the dst channel
hopN := &lnrpc.Hop{
ChanId: dstChanId,
ChanCapacity: dstChanInfo.Capacity,
AmtToForward: amt,
PubKey: ourPubKey,
// We will set all of these when we "reprice" the route.
// Fee:
// Expiry:
// AmtToForwardMsat:
// FeeMSat:
}
route.Hops = append(route.Hops, hopN)
repriceRoute(info, route, amt)
if gCfg.Verbose {
dumpRoute(info, route)
}
checkRoute(info, route)
if (route.TotalFeesMsat / 1000) > feeLimitFixed {
fmt.Println("route exceeds fee limit")
insertLoopAttempt(NewLoopAttempt(
time.Now().Unix(),
srcChanId, srcPubKey,
dstChanId, dstPubKey,
amt, gCfg.Rebalance.FeeLimitRate,
LoopAttemptNoRoutes,
))
return false
}
ctxt, _ :=
context.WithTimeout(context.Background(), time.Second*60)
if invoiceRsp == nil {
if gCfg.Verbose {
fmt.Println("generating invoice")
}
// Generate an invoice.
preimage := make([]byte, 32)
_, err = rand.Read(preimage)
if err != nil {
panic(fmt.Sprintf("unable to generate preimage:", err))
}
invoice := &lnrpc.Invoice{
Memo: fmt.Sprintf("rebalance %d %d %d",
amt, srcChanId, dstChanId),
RPreimage: preimage,
Value: amt,
}
invoiceRsp, err = gClient.AddInvoice(ctxt, invoice)
if err != nil {
panic(fmt.Sprintf("unable to add invoice:", err))
}
}
if gCfg.Verbose {
fmt.Println("sending to route")
}
sendRsp, err := gRouter.SendToRoute(ctxt, &routerrpc.SendToRouteRequest{
PaymentHash: invoiceRsp.RHash,
Route: route,
})
if err != nil {
fmt.Printf("router.SendToRoute failed: %v\n", err)
goto FailedToRoute
}
if sendRsp.Failure != nil {
// errNdx is the node reporting the error.
// errNdx == 0 means self node.
// the hopNdx == errNdx is the failed hop.
//
errNdx := sendRsp.Failure.GetFailureSourceIndex()
// If we are reporting the error let's bail on this
// route altogether since the first hop doesn't work.
//
if errNdx == 0 {
goto FailedToRoute
}
// This is the pubKey of the node reporting the
// error. We want to reject the next hop ...
//
pubKey := route.Hops[errNdx-1].PubKey
// fmt.Printf("errNdx %d\n", errNdx)
// for ndx, hop := range route.Hops {
// fmt.Printf("%d: %s\n", ndx, hop.PubKey)
// }
// Get info about the node reporting the error.
nodeInfo0, err := gClient.GetNodeInfo(gCtx,
&lnrpc.NodeInfoRequest{
PubKey: pubKey,
})
if err != nil {
panic(fmt.Sprintf("GetNodeInfo failed[1]:", err))
}
alias0 := nodeInfo0.Node.Alias
// Get info about the target node of the failed hop.
nodeInfo1, err := gClient.GetNodeInfo(gCtx,
&lnrpc.NodeInfoRequest{
PubKey: route.Hops[errNdx].PubKey,
})
if err != nil {
panic(fmt.Sprintf("GetNodeInfo2 failed[1]:", err))
}
alias1 := nodeInfo1.Node.Alias
fmt.Printf("%s -> %s: %s\n",
alias0,
alias1,
sendRsp.Failure.Code.String())
// Is this the last hop? If the last hop fails this route
// is done because we are forcing the last hop back to us ...
//
if int(errNdx) == len(route.Hops)-1 {
fmt.Println("can't ignore last hop")
goto FailedToRoute
}
chanId := route.Hops[errNdx].ChanId
nextChanInfo, err :=
gClient.GetChanInfo(gCtx, &lnrpc.ChanInfoRequest{
ChanId: chanId,
})
if err != nil {
panic(fmt.Sprintf("hop GetChanInfo failed:", err))
}
reverse := nextChanInfo.Node2Pub == pubKey
if ignoreBadEdges {
// Append this edge to the ignoredEdges and re-route.
badEdge := &lnrpc.EdgeLocator{
ChannelId: chanId,
DirectionReverse: reverse,
}
if gCfg.Verbose {
fmt.Printf("ignoring %v\n", badEdge)
}
if edgeLimit[badEdge] == 0 || amt < edgeLimit[badEdge] {
edgeLimit[badEdge] = amt
}
}
if gCfg.Verbose {
fmt.Println()
}
goto RetryQuery
} else {
fmt.Printf("PREIMAGE: %s\n", hex.EncodeToString(sendRsp.Preimage))
insertLoopAttempt(NewLoopAttempt(
time.Now().Unix(),
srcChanId, srcPubKey,
dstChanId, dstPubKey,
amt, gCfg.Rebalance.FeeLimitRate,
LoopAttemptSuccess,
))
return true
}
}
FailedToRoute:
insertLoopAttempt(NewLoopAttempt(
time.Now().Unix(),
srcChanId, srcPubKey,
dstChanId, dstPubKey,
amt, gCfg.Rebalance.FeeLimitRate,
LoopAttemptFailure,
))
return false
}