use https://api.dcousens.cloud reg-test server instead of testnet
This commit is contained in:
parent
f3cc30de87
commit
4ca6bf4e81
8 changed files with 303 additions and 315 deletions
test/integration
|
@ -1,115 +1,69 @@
|
|||
/* global describe, it */
|
||||
|
||||
var assert = require('assert')
|
||||
var async = require('async')
|
||||
var bigi = require('bigi')
|
||||
var bitcoin = require('../../')
|
||||
var mainnet = require('./_mainnet')
|
||||
var crypto = require('crypto')
|
||||
|
||||
var ecurve = require('ecurve')
|
||||
var secp256k1 = ecurve.getCurveByName('secp256k1')
|
||||
|
||||
describe('bitcoinjs-lib (crypto)', function () {
|
||||
it('can recover a private key from duplicate R values', function (done) {
|
||||
it('can recover a private key from duplicate R values', function () {
|
||||
this.timeout(30000)
|
||||
|
||||
var inputs = [
|
||||
{
|
||||
txId: 'f4c16475f2a6e9c602e4a287f9db3040e319eb9ece74761a4b84bc820fbeef50',
|
||||
vout: 0
|
||||
},
|
||||
{
|
||||
txId: 'f4c16475f2a6e9c602e4a287f9db3040e319eb9ece74761a4b84bc820fbeef50',
|
||||
vout: 1
|
||||
}
|
||||
]
|
||||
// https://blockchain.info/tx/f4c16475f2a6e9c602e4a287f9db3040e319eb9ece74761a4b84bc820fbeef50
|
||||
var tx = bitcoin.Transaction.fromHex('01000000020b668015b32a6178d8524cfef6dc6fc0a4751915c2e9b2ed2d2eab02424341c8000000006a47304402205e00298dc5265b7a914974c9d0298aa0e69a0ca932cb52a360436d6a622e5cd7022024bf5f506968f5f23f1835574d5afe0e9021b4a5b65cf9742332d5e4acb68f41012103fd089f73735129f3d798a657aaaa4aa62a00fa15c76b61fc7f1b27ed1d0f35b8ffffffffa95fa69f11dc1cbb77ef64f25a95d4b12ebda57d19d843333819d95c9172ff89000000006b48304502205e00298dc5265b7a914974c9d0298aa0e69a0ca932cb52a360436d6a622e5cd7022100832176b59e8f50c56631acbc824bcba936c9476c559c42a4468be98975d07562012103fd089f73735129f3d798a657aaaa4aa62a00fa15c76b61fc7f1b27ed1d0f35b8ffffffff02b000eb04000000001976a91472956eed9a8ecb19ae7e3ebd7b06cae4668696a788ac303db000000000001976a9146c0bd55dd2592287cd9992ce3ba3fc1208fb76da88ac00000000')
|
||||
|
||||
var txIds = inputs.map(function (x) { return x.txId })
|
||||
tx.ins.forEach(function (input, vin) {
|
||||
var script = input.script
|
||||
var scriptChunks = bitcoin.script.decompile(script)
|
||||
|
||||
// first retrieve the relevant transactions
|
||||
mainnet.transactions.get(txIds, function (err, results) {
|
||||
assert.ifError(err)
|
||||
assert(bitcoin.script.pubKeyHash.input.check(scriptChunks), 'Expected pubKeyHash script')
|
||||
var prevOutScript = bitcoin.address.toOutputScript('1ArJ9vRaQcoQ29mTWZH768AmRwzb6Zif1z')
|
||||
var scriptSignature = bitcoin.ECSignature.parseScriptSignature(scriptChunks[0])
|
||||
var publicKey = bitcoin.ECPair.fromPublicKeyBuffer(scriptChunks[1])
|
||||
|
||||
var transactions = {}
|
||||
results.forEach(function (tx) {
|
||||
transactions[tx.txId] = bitcoin.Transaction.fromHex(tx.txHex)
|
||||
})
|
||||
var m = tx.hashForSignature(vin, prevOutScript, scriptSignature.hashType)
|
||||
assert(publicKey.verify(m, scriptSignature.signature), 'Invalid m')
|
||||
|
||||
var tasks = []
|
||||
|
||||
// now we need to collect/transform a bit of data from the selected inputs
|
||||
inputs.forEach(function (input) {
|
||||
var transaction = transactions[input.txId]
|
||||
var script = transaction.ins[input.vout].script
|
||||
var scriptChunks = bitcoin.script.decompile(script)
|
||||
|
||||
assert(bitcoin.script.pubKeyHash.input.check(scriptChunks), 'Expected pubKeyHash script')
|
||||
|
||||
var prevOutTxId = Buffer.from(transaction.ins[input.vout].hash).reverse().toString('hex')
|
||||
var prevVout = transaction.ins[input.vout].index
|
||||
|
||||
tasks.push(function (callback) {
|
||||
mainnet.transactions.get(prevOutTxId, function (err, result) {
|
||||
if (err) return callback(err)
|
||||
|
||||
var prevOut = bitcoin.Transaction.fromHex(result.txHex)
|
||||
var prevOutScript = prevOut.outs[prevVout].script
|
||||
|
||||
var scriptSignature = bitcoin.ECSignature.parseScriptSignature(scriptChunks[0])
|
||||
var publicKey = bitcoin.ECPair.fromPublicKeyBuffer(scriptChunks[1])
|
||||
|
||||
var m = transaction.hashForSignature(input.vout, prevOutScript, scriptSignature.hashType)
|
||||
assert(publicKey.verify(m, scriptSignature.signature), 'Invalid m')
|
||||
|
||||
// store the required information
|
||||
input.signature = scriptSignature.signature
|
||||
input.z = bigi.fromBuffer(m)
|
||||
|
||||
return callback()
|
||||
})
|
||||
})
|
||||
})
|
||||
|
||||
// finally, run the tasks, then on to the math
|
||||
async.parallel(tasks, function (err) {
|
||||
if (err) throw err
|
||||
|
||||
var n = secp256k1.n
|
||||
|
||||
for (var i = 0; i < inputs.length; ++i) {
|
||||
for (var j = i + 1; j < inputs.length; ++j) {
|
||||
var inputA = inputs[i]
|
||||
var inputB = inputs[j]
|
||||
|
||||
// enforce matching r values
|
||||
assert.strictEqual(inputA.signature.r.toString(), inputB.signature.r.toString())
|
||||
var r = inputA.signature.r
|
||||
var rInv = r.modInverse(n)
|
||||
|
||||
var s1 = inputA.signature.s
|
||||
var s2 = inputB.signature.s
|
||||
var z1 = inputA.z
|
||||
var z2 = inputB.z
|
||||
|
||||
var zz = z1.subtract(z2).mod(n)
|
||||
var ss = s1.subtract(s2).mod(n)
|
||||
|
||||
// k = (z1 - z2) / (s1 - s2)
|
||||
// d1 = (s1 * k - z1) / r
|
||||
// d2 = (s2 * k - z2) / r
|
||||
var k = zz.multiply(ss.modInverse(n)).mod(n)
|
||||
var d1 = ((s1.multiply(k).mod(n)).subtract(z1).mod(n)).multiply(rInv).mod(n)
|
||||
var d2 = ((s2.multiply(k).mod(n)).subtract(z2).mod(n)).multiply(rInv).mod(n)
|
||||
|
||||
// enforce matching private keys
|
||||
assert.strictEqual(d1.toString(), d2.toString())
|
||||
}
|
||||
}
|
||||
|
||||
done()
|
||||
})
|
||||
// store the required information
|
||||
input.signature = scriptSignature.signature
|
||||
input.z = bigi.fromBuffer(m)
|
||||
})
|
||||
|
||||
// finally, run the tasks, then on to the math
|
||||
var n = secp256k1.n
|
||||
|
||||
for (var i = 0; i < tx.ins.length; ++i) {
|
||||
for (var j = i + 1; j < tx.ins.length; ++j) {
|
||||
var inputA = tx.ins[i]
|
||||
var inputB = tx.ins[j]
|
||||
|
||||
// enforce matching r values
|
||||
assert.strictEqual(inputA.signature.r.toString(), inputB.signature.r.toString())
|
||||
var r = inputA.signature.r
|
||||
var rInv = r.modInverse(n)
|
||||
|
||||
var s1 = inputA.signature.s
|
||||
var s2 = inputB.signature.s
|
||||
var z1 = inputA.z
|
||||
var z2 = inputB.z
|
||||
|
||||
var zz = z1.subtract(z2).mod(n)
|
||||
var ss = s1.subtract(s2).mod(n)
|
||||
|
||||
// k = (z1 - z2) / (s1 - s2)
|
||||
// d1 = (s1 * k - z1) / r
|
||||
// d2 = (s2 * k - z2) / r
|
||||
var k = zz.multiply(ss.modInverse(n)).mod(n)
|
||||
var d1 = ((s1.multiply(k).mod(n)).subtract(z1).mod(n)).multiply(rInv).mod(n)
|
||||
var d2 = ((s2.multiply(k).mod(n)).subtract(z2).mod(n)).multiply(rInv).mod(n)
|
||||
|
||||
// enforce matching private keys
|
||||
assert.strictEqual(d1.toString(), d2.toString())
|
||||
}
|
||||
}
|
||||
})
|
||||
|
||||
it('can recover a BIP32 parent private key from the parent public key, and a derived, non-hardened child private key', function () {
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue