forked from abduramann/go-incognito-sdk-v2
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtx_history_worker.go
685 lines (601 loc) · 18.3 KB
/
tx_history_worker.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
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
package incclient
import (
"fmt"
"log"
"sort"
"strings"
"sync"
"time"
"github.com/incognitochain/go-incognito-sdk-v2/coin"
"github.com/incognitochain/go-incognito-sdk-v2/common"
"github.com/incognitochain/go-incognito-sdk-v2/common/base58"
"github.com/incognitochain/go-incognito-sdk-v2/key"
"github.com/incognitochain/go-incognito-sdk-v2/metadata"
"github.com/incognitochain/go-incognito-sdk-v2/wallet"
)
// TxHistoryProcessor implements a processor for retrieving transaction history in a parallel manner.
//
// Each TxHistoryProcessor consists of several TxHistoryWorker's that help retrieve transaction history faster.
type TxHistoryProcessor struct {
client *IncClient
mtx *sync.RWMutex
history map[string]*TxHistory
errChan chan error
txChan chan TxHistory
workers []*TxHistoryWorker
cachedTxs map[string]metadata.Transaction
}
// NewTxHistoryProcessor creates a TxHistoryProcess with a number of TxHistoryWorker's.
func NewTxHistoryProcessor(client *IncClient, numWorkers int) *TxHistoryProcessor {
mtx := new(sync.RWMutex)
errChan := make(chan error, numWorkers)
txChan := make(chan TxHistory, numWorkers)
workers := make([]*TxHistoryWorker, 0)
history := make(map[string]*TxHistory)
for i := 0; i < numWorkers; i++ {
worker := NewTxHistoryWorker(i, client)
workers = append(workers, worker)
}
return &TxHistoryProcessor{
client: client,
mtx: mtx,
history: history,
errChan: errChan,
txChan: txChan,
workers: workers,
}
}
func (p *TxHistoryProcessor) addHistory(history TxHistory, tokenIDStr string) {
p.mtx.Lock()
h, ok := p.history[tokenIDStr]
if !ok {
h = new(TxHistory)
h.TxInList = make([]TxIn, 0)
h.TxOutList = make([]TxOut, 0)
}
mapTxIns := make(map[string]bool)
for _, txIn := range h.TxInList {
mapTxIns[txIn.TxHash] = true
}
mapTxOuts := make(map[string]bool)
for _, txOut := range h.TxOutList {
mapTxOuts[txOut.TxHash] = true
}
for _, txIn := range history.TxInList {
if mapTxIns[txIn.TxHash] {
continue
}
h.TxInList = append(h.TxInList, txIn)
}
for _, txOut := range history.TxOutList {
if mapTxOuts[txOut.TxHash] {
continue
}
h.TxOutList = append(h.TxOutList, txOut)
}
Logger.Printf("Added %v TxsIn, %v TxsOut\n", len(history.TxInList), len(history.TxOutList))
Logger.Printf("Current history: #TxsIn = %v, #TxsOut = %v\n", len(h.TxInList), len(h.TxOutList))
p.history[tokenIDStr] = h
p.mtx.Unlock()
}
// GetTxsIn returns the list of in-coming transactions in a parallel manner.
func (p *TxHistoryProcessor) GetTxsIn(privateKey string, tokenIDStr string, version int8) ([]TxIn, error) {
kWallet, err := wallet.Base58CheckDeserialize(privateKey)
if err != nil {
return nil, fmt.Errorf("cannot deserialize private key %v: %v", privateKey, err)
}
addrStr := PrivateKeyToPaymentAddress(privateKey, -1)
listDecryptedCoins, err := p.client.GetListDecryptedOutCoin(privateKey, tokenIDStr, 0)
if err != nil {
return nil, err
}
numWorkers := 0
if version == 1 {
txList, err := p.client.GetTransactionHashesByReceiver(addrStr)
if err != nil {
return nil, err
}
if len(txList) < len(p.workers) {
numWorkers = 1
go p.workers[0].getTxsInV1(&kWallet.KeySet, listDecryptedCoins,
txList, tokenIDStr, p.txChan, p.errChan)
} else {
numWorkers = len(p.workers)
//calculate the number of txs each worker has to handle
numForEach := len(txList) / len(p.workers)
//call each worker to retrieve history
for i := 0; i < len(p.workers); i++ {
start := i * numForEach
end := (i + 1) * numForEach
if i == len(p.workers)-1 {
end = len(txList)
}
go p.workers[i].getTxsInV1(&kWallet.KeySet, listDecryptedCoins,
txList[start:end], tokenIDStr, p.txChan, p.errChan)
}
}
} else if version == 2 {
pubKeys := make([]string, 0)
for _, outCoin := range listDecryptedCoins {
pubKeys = append(pubKeys, base58.Base58Check{}.Encode(outCoin.GetPublicKey().ToBytesS(), 0))
}
if len(pubKeys) < len(p.workers) {
numWorkers = 1
go p.workers[0].getTxsInV2(&kWallet.KeySet, listDecryptedCoins,
pubKeys, tokenIDStr, p.txChan, p.errChan)
} else {
numWorkers = len(p.workers)
//calculate the number of txs each worker has to handle
numForEach := len(pubKeys) / len(p.workers)
//call each worker to retrieve history
for i := 0; i < len(p.workers); i++ {
start := i * numForEach
end := (i + 1) * numForEach
if i == len(p.workers)-1 {
end = len(pubKeys)
}
go p.workers[i].getTxsInV2(&kWallet.KeySet, listDecryptedCoins,
pubKeys[start:end], tokenIDStr, p.txChan, p.errChan)
}
}
}
numSuccess := 0
for {
select {
case err := <-p.errChan:
h := p.history[tokenIDStr]
if h == nil {
return nil, err
}
return p.history[tokenIDStr].TxInList, err
case txHistory := <-p.txChan:
numSuccess++
p.addHistory(txHistory, tokenIDStr)
if numSuccess == numWorkers {
h := p.history[tokenIDStr]
sort.Slice(h.TxInList, func(i, j int) bool {
return h.TxInList[i].LockTime > h.TxInList[j].LockTime
})
return h.TxInList, nil
}
Logger.Printf("Receive new data, numSuccess = %v/%v\n", numSuccess, numWorkers)
}
}
}
// GetTxsOut returns the list of out-going transactions in a parallel manner.
func (p *TxHistoryProcessor) GetTxsOut(privateKey string, tokenIDStr string, version int8) ([]TxOut, error) {
kWallet, err := wallet.Base58CheckDeserialize(privateKey)
if err != nil {
return nil, fmt.Errorf("cannot deserialize private key %v: %v", privateKey, err)
}
listSpentCoins, _, err := p.client.GetSpentOutputCoins(privateKey, tokenIDStr, 0)
if err != nil {
return nil, err
}
// Create a map from serial numbers to coins
mapSpentCoins := make(map[string]coin.PlainCoin)
snList := make([]string, 0)
for _, spentCoin := range listSpentCoins {
if spentCoin.GetVersion() == uint8(version) {
snStr := base58.Base58Check{}.Encode(spentCoin.GetKeyImage().ToBytesS(), common.ZeroByte)
mapSpentCoins[snStr] = spentCoin
snList = append(snList, snStr)
}
}
if len(snList) == 0 {
return nil, nil
}
Logger.Printf("len(snList) = %v\n", len(snList))
numWorkers := 0
if len(snList) < len(p.workers) {
numWorkers = 1
go p.workers[0].getTxsOut(&kWallet.KeySet, mapSpentCoins,
snList, tokenIDStr, p.txChan, p.errChan)
} else {
numWorkers = len(p.workers)
//calculate the number of txs each worker has to handle
numForEach := len(snList) / len(p.workers)
//call each worker to retrieve history
for i := 0; i < len(p.workers); i++ {
start := i * numForEach
end := (i + 1) * numForEach
if i == len(p.workers)-1 {
end = len(snList)
}
go p.workers[i].getTxsOut(&kWallet.KeySet, mapSpentCoins,
snList[start:end], tokenIDStr, p.txChan, p.errChan)
}
}
numSuccess := 0
for {
select {
case err := <-p.errChan:
h := p.history[tokenIDStr]
if h == nil {
return nil, err
}
return p.history[tokenIDStr].TxOutList, err
case txHistory := <-p.txChan:
numSuccess++
p.addHistory(txHistory, tokenIDStr)
if numSuccess == numWorkers {
h := p.history[tokenIDStr]
sort.Slice(h.TxOutList, func(i, j int) bool {
return h.TxOutList[i].LockTime > h.TxOutList[j].LockTime
})
return h.TxOutList, nil
}
Logger.Printf("Receive new data, numSuccess = %v\n", numSuccess)
}
}
}
// GetTokenHistory returns the history of a private key w.r.t a tokenID in a parallel manner.
func (p *TxHistoryProcessor) GetTokenHistory(privateKey string, tokenIDStr string) (*TxHistory, error) {
Logger.Printf("GETTING in-coming v1 txs for token %v\n", tokenIDStr)
txsInV1, err := p.GetTxsIn(privateKey, tokenIDStr, 1)
if err != nil {
return nil, err
}
Logger.Printf("FINISHED in-coming v1 txs for token %v\n\n", tokenIDStr)
Logger.Printf("GETTING out-going v1 txs for token %v\n", tokenIDStr)
txsOutV1, err := p.GetTxsOut(privateKey, tokenIDStr, 1)
if err != nil {
return nil, err
}
Logger.Printf("FINISHED out-going v1 txs for token %v\n\n", tokenIDStr)
Logger.Printf("GETTING in-coming v2 txs for token %v\n", tokenIDStr)
txsInV2, err := p.GetTxsIn(privateKey, tokenIDStr, 2)
if err != nil {
return nil, err
}
Logger.Printf("FINISHED in-coming v2 txs for token %v\n\n", tokenIDStr)
Logger.Printf("GETTING out-going v2 txs for token %v\n", tokenIDStr)
txsOutV2, err := p.GetTxsOut(privateKey, tokenIDStr, 2)
if err != nil {
return nil, err
}
Logger.Printf("FINISHED out-going v2 txs for token %v\n\n", tokenIDStr)
addedTxsIn := make(map[string]interface{})
txsInRes := make([]TxIn, 0)
for _, txIn := range txsInV1 {
if _, ok := addedTxsIn[txIn.TxHash]; ok {
continue
}
txsInRes = append(txsInRes, txIn)
addedTxsIn[txIn.TxHash] = true
}
for _, txIn := range txsInV2 {
if _, ok := addedTxsIn[txIn.TxHash]; ok {
continue
}
txsInRes = append(txsInRes, txIn)
addedTxsIn[txIn.TxHash] = true
}
sort.Slice(txsInRes, func(i, j int) bool {
return txsInRes[i].LockTime > txsInRes[j].LockTime
})
addedTxsOut := make(map[string]interface{})
txsOutRes := make([]TxOut, 0)
for _, txOut := range txsOutV1 {
if _, ok := addedTxsOut[txOut.TxHash]; ok {
continue
}
txsOutRes = append(txsOutRes, txOut)
addedTxsOut[txOut.TxHash] = true
}
for _, txOut := range txsOutV2 {
if _, ok := addedTxsOut[txOut.TxHash]; ok {
continue
}
txsOutRes = append(txsOutRes, txOut)
addedTxsOut[txOut.TxHash] = true
}
sort.Slice(txsOutRes, func(i, j int) bool {
return txsOutRes[i].LockTime > txsOutRes[j].LockTime
})
return &TxHistory{
TxInList: txsInRes,
TxOutList: txsOutRes,
}, nil
}
// GetAllHistory returns all the history of an account in a parallel manner.
func (p *TxHistoryProcessor) GetAllHistory(privateKeyStr string) (map[string]*TxHistory, error) {
prefix := "[GetAllHistory]"
log.Printf("%v STARTING...\n", prefix)
res := make(map[string]*TxHistory)
tokenIDs, err := p.client.getAllTokens(privateKeyStr)
if err != nil {
return nil, err
}
log.Printf("%v #TokenIDs: %v\n", prefix, len(tokenIDs))
finishedCount := 0
for _, tokenID := range tokenIDs {
if tokenID == common.PRVIDStr {
continue
}
res[tokenID], err = p.GetTokenHistory(privateKeyStr, tokenID)
if err != nil {
return nil, err
}
finishedCount++
log.Printf("%v Finished token %v, count: %v/%v\n", prefix, tokenID, finishedCount, len(tokenIDs))
}
res[common.PRVIDStr], err = p.GetTokenHistory(privateKeyStr, common.PRVIDStr)
if err != nil {
return nil, err
}
finishedCount++
log.Printf("%v Finished token %v, count: %v/%v\n", prefix, common.PRVIDStr, finishedCount, len(tokenIDs))
log.Printf("%v FINISHED ALL\n\n", prefix)
return res, nil
}
// TxHistoryWorker implements a worker for retrieving transaction history.
type TxHistoryWorker struct {
id int
client *IncClient
cachedTxs map[string]metadata.Transaction
}
// NewTxHistoryWorker creates a new TxHistoryWorker.
func NewTxHistoryWorker(id int, client *IncClient) *TxHistoryWorker {
return &TxHistoryWorker{
id: id,
client: client,
}
}
// getListTxs returns a list of transactions (in object) on input a list of transaction hashes.
func (worker TxHistoryWorker) getListTxs(txList []string) (map[string]metadata.Transaction, error) {
count := 0
start := time.Now()
res := make(map[string]metadata.Transaction)
for current := 0; current < len(txList); current += pageSize {
next := current + pageSize
if next > len(txList) {
next = len(txList)
}
txMap, err := worker.client.GetTxs(txList[current:next])
if err != nil {
return nil, err
}
for txHash, tx := range txMap {
res[txHash] = tx
}
count += len(txMap)
Logger.Printf("[WORKER %v], count %v, timeElapsed %v\n", worker.id, count, time.Since(start).Seconds())
}
return res, nil
}
// getTxsInV1 returns the list of in-coming transactions of version 1.
//
// It only returns the list of transactions whose value is greater than 0.
func (worker TxHistoryWorker) getTxsInV1(keySet *key.KeySet, listDecryptedCoins map[string]coin.PlainCoin, txList []string, tokenIDStr string, txChan chan TxHistory, errChan chan error) {
Logger.Printf("[WORKER %v] getTxsInV1, #TXS: %v\n", worker.id, len(txList))
mapCmt := makeMapCMToPlainCoin(listDecryptedCoins)
//retrieve transactions in object
txMap, err := worker.getListTxs(txList)
if err != nil {
errChan <- err
return
}
res := make([]TxIn, 0)
for txHash, tx := range txMap {
if isOut, err := isTxOut(tx, tokenIDStr, listDecryptedCoins); err != nil {
errChan <- err
return
} else if isOut {
continue
}
outCoins, err := getTxOutputCoinsByKeySet(tx, tokenIDStr, keySet)
if err != nil {
errChan <- err
return
}
amount := uint64(0)
for cmtStr := range outCoins {
if outCoin, ok := mapCmt[cmtStr]; ok {
amount += outCoin.GetValue()
continue
}
}
if amount > 0 {
note := txMetadataNote[tx.GetMetadataType()]
if tx.GetType() == "cv" || tx.GetType() == "tcv" {
note = "Conversion"
}
newTxIn := TxIn{
Version: tx.GetVersion(),
LockTime: tx.GetLockTime(),
TxHash: txHash,
TokenID: tx.GetTokenID().String(),
Metadata: tx.GetMetadata(),
Note: note,
}
newTxIn.Amount = amount
res = append(res, newTxIn)
}
}
sort.Slice(res, func(i, j int) bool {
return res[i].LockTime > res[j].LockTime
})
txChan <- TxHistory{
TxInList: res,
TxOutList: nil,
}
Logger.Printf("[WORKER %v] FINISHED getTxsInV1, #TXS: %v!!\n\n", worker.id, len(res))
}
// getTxsInV2 returns the list of in-coming transactions of version 2.
//
// It only returns the list of transactions whose value is greater than 0.
func (worker TxHistoryWorker) getTxsInV2(keySet *key.KeySet, listDecryptedCoins map[string]coin.PlainCoin, publicKeys []string, tokenIDStr string, txChan chan TxHistory, errChan chan error) {
res := make([]TxIn, 0)
if worker.client.version != 2 {
txChan <- TxHistory{
TxInList: res,
TxOutList: nil,
}
}
Logger.Printf("[WORKER %v] getTxsInV2, #No: %v\n", worker.id, len(publicKeys))
mapCmt := makeMapCMToPlainCoin(listDecryptedCoins)
//retrieve transactions in object
txMap, err := worker.client.GetTransactionsByPublicKeys(publicKeys)
if err != nil {
errChan <- err
return
}
mapRes := make(map[string]TxIn)
for _, tmpTxMap := range txMap {
for txHash, tx := range tmpTxMap {
if _, ok := mapRes[txHash]; ok {
continue
}
if isOut, err := isTxOut(tx, tokenIDStr, listDecryptedCoins); err != nil {
errChan <- err
return
} else if isOut {
continue
}
outCoins, err := getTxOutputCoinsByKeySet(tx, tokenIDStr, keySet)
if err != nil {
errChan <- err
return
}
pubKeys := make(map[string]uint64)
amount := uint64(0)
for cmtStr := range outCoins {
if outCoin, ok := mapCmt[cmtStr]; ok {
amount += outCoin.GetValue()
pubKeys[base58.Base58Check{}.Encode(outCoin.GetPublicKey().ToBytesS(), 0)] = outCoin.GetValue()
continue
}
}
if amount > 0 {
note := txMetadataNote[tx.GetMetadataType()]
if tx.GetType() == "cv" || tx.GetType() == "tcv" {
note = "Conversion"
}
newTxIn := TxIn{
Version: tx.GetVersion(),
LockTime: tx.GetLockTime(),
OutCoins: pubKeys,
TxHash: txHash,
TokenID: tokenIDStr,
Amount: amount,
Metadata: tx.GetMetadata(),
Note: note,
}
mapRes[txHash] = newTxIn
}
}
}
for _, txIn := range mapRes {
res = append(res, txIn)
}
sort.Slice(res, func(i, j int) bool {
return res[i].LockTime > res[j].LockTime
})
txChan <- TxHistory{
TxInList: res,
TxOutList: nil,
}
Logger.Printf("[WORKER %v] FINISHED getTxsInV2, #TXS: %v!!\n\n", worker.id, len(res))
}
// getTxsOut returns the list of out-going transactions of version 1.
//
// It only returns the list of transactions whose value is greater than 0.
func (worker TxHistoryWorker) getTxsOut(keySet *key.KeySet, mapSpentCoins map[string]coin.PlainCoin, snList []string, tokenIDStr string, txChan chan TxHistory, errChan chan error) {
Logger.Printf("[WORKER %v] getTxsOut, #No: %v\n", worker.id, len(snList))
shardID := common.GetShardIDFromLastByte(keySet.PaymentAddress.Pk[len(keySet.PaymentAddress.Pk)-1])
// Retrieve the list of transactions which spent these coins
mapSpentTxs, err := worker.client.GetTxHashBySerialNumbers(snList, tokenIDStr, shardID)
if err != nil {
if strings.Contains(err.Error(), "Method not found") {
errChan <- fmt.Errorf("method not supported by the remote node configurations")
}
errChan <- err
return
}
// Create a list of txs
txHashList := make([]string, 0)
for _, txHash := range mapSpentTxs {
txHashList = append(txHashList, txHash)
}
// Get txs from hashes
txs, err := worker.getListTxs(txHashList)
if err != nil {
errChan <- err
return
}
mapRes := make(map[string]TxOut)
res := make([]TxOut, 0)
var ok bool
for _, txHash := range mapSpentTxs {
// check if the txHash has been processed
if _, ok = mapRes[txHash]; ok {
continue
}
var tx metadata.Transaction
tx, ok = txs[txHash]
if !ok {
errChan <- fmt.Errorf("tx %v not found", txHash)
return
}
//get transaction fee
fee, isPRVFee := getTxFeeBy(tx)
//calculate transaction's amount
inputAmount, spentCoins, err := getTxInputAmount(tx, tokenIDStr, mapSpentCoins)
if err != nil {
errChan <- err
return
}
outputAmount, err := getTxOutputAmountByKeySet(tx, tokenIDStr, keySet)
if err != nil {
errChan <- err
return
}
amount := inputAmount - outputAmount
if isPRVFee && tokenIDStr == common.PRVIDStr {
amount -= fee
}
if !isPRVFee && tokenIDStr != common.PRVIDStr {
amount -= fee
}
//get list of receivers' public keys
receivers, err := getTxReceivers(tx, tokenIDStr)
if err != nil {
errChan <- err
return
}
if amount > 0 || tokenIDStr == common.PRVIDStr {
note := txMetadataNote[tx.GetMetadataType()]
if tokenIDStr == common.PRVIDStr && amount == 0 {
note += " (Tx Fee)"
}
note = strings.TrimSpace(note)
newTxOut := TxOut{
Version: tx.GetVersion(),
LockTime: tx.GetLockTime(),
TxHash: txHash,
TokenID: tokenIDStr,
SpentCoins: spentCoins,
Receivers: receivers,
Amount: amount,
Metadata: tx.GetMetadata(),
PRVFee: fee,
Note: note,
}
if !isPRVFee {
newTxOut.PRVFee = 0
newTxOut.TokenFee = fee
}
mapRes[txHash] = newTxOut
res = append(res, newTxOut)
}
}
sort.Slice(res, func(i, j int) bool {
return res[i].LockTime > res[j].LockTime
})
txChan <- TxHistory{
TxInList: nil,
TxOutList: res,
}
Logger.Printf("[WORKER %v] FINISHED getTxsOut, #TXS: %v!!\n\n", worker.id, len(res))
}