• bitcoinjs-lib 哈希交易之多笔交易合并。


    • 转账的时候需要手动寻找每一笔未花费记录实在太费时。
    • 比特币转账需要提取或合并所有未花费的交易中的比特币,才能实现交易。
    import * as bitcoin from 'bitcoinjs-lib';
    import fetch, { Response } from 'node-fetch';
    
    const quantitySat = 0.0001 * 1e8;
    const feeSat = 0.0001 * 1e8;
    
    (async () => {
      try {
        let NETWORK = bitcoin.networks.testnet;
        const keyPair = bitcoin.ECPair.fromWIF(from_pvtkey, NETWORK);
        const p2pkh = bitcoin.payments.p2pkh({ pubkey: keyPair.publicKey, network: NETWORK });
        let from = p2pkh.address;
        const utxoResponse: Response = await fetch(`https://api.blockcypher.com/v1/btc/test3/addrs/${from}`);
        const json = await utxoResponse.json();
        console.log(json);
        let balance = json.balance;
        let unspentList: Array<any> = [];
        // 过滤掉已经被花费了的交易和未确认的交易,以及自己不在接收列表的交易
        const txrefs = json.txrefs;
        const unconfirmed_txrefs = json.unconfirmed_txrefs;
        if (unconfirmed_txrefs && unconfirmed_txrefs.length > 0) {
          // 要把未确认的余额给去掉
          balance += json.unconfirmed_balance;
          unspentList = unspentList.concat(unconfirmed_txrefs.filter((item: any) => !item.spent_by && item.tx_output_n !== -1));
        }
        if (txrefs.length > 0) {
          unspentList = unspentList.concat(txrefs.filter((item: any) => !item.spent_by && item.tx_output_n !== -1));
        }
    
        // 构建交易对象
        let txb = new bitcoin.TransactionBuilder(NETWORK);
    
        // 批量插入未花费交易
        unspentList.forEach((item: any) => txb.addInput(item.tx_hash, item.tx_output_n));
        // 转出账户
        txb.addOutput(to, quantitySat);
        // 预留手续费
        txb.addOutput(from, balance - quantitySat - feeSat);
        // 批量签名,根据索引即可
        unspentList.forEach((item: any, index: any) => { txb.sign(index, keyPair) });
        // 序列化交易
        let tx = txb.build();
        console.log(tx.getHash().toString('hex'));
    
        // 在一个测试链的节点把交易广布出去
        const result = await fetch('https://api.blockcypher.com/v1/btc/test3/txs/push',{
          method:'post',
          headers:{'Content-Type':'application/json'},
          body:JSON.stringify({tx: tx.toHex()})
        });
    
    
      } catch (error) {
        console.error(error);
      }
    })();
    
  • 相关阅读:
    [leetcode] Best Time to Buy and Sell Stock II
    [leetcode] Best Time to Buy and Sell Stock
    [leetcode] Binary Tree Maximum Path Sum
    [leetcode] Triangle
    [leetcode] Populating Next Right Pointers in Each Node II
    [leetcode] Pascal's Triangle II
    [leetcode] Pascal's Triangle
    第三周周总结
    基础DP
    第二周周总结
  • 原文地址:https://www.cnblogs.com/flying_bat/p/11587133.html
Copyright © 2020-2023  润新知