2014-01-09 06:47:23 +01:00
|
|
|
// Copyright (c) 2013-2014 Conformal Systems LLC.
|
2013-06-12 23:35:27 +02:00
|
|
|
// Use of this source code is governed by an ISC
|
|
|
|
// license that can be found in the LICENSE file.
|
|
|
|
|
|
|
|
package btcscript
|
|
|
|
|
|
|
|
import (
|
|
|
|
"bytes"
|
2013-09-10 17:39:29 +02:00
|
|
|
"crypto/ecdsa"
|
|
|
|
"crypto/rand"
|
2013-06-12 23:35:27 +02:00
|
|
|
"encoding/binary"
|
|
|
|
"errors"
|
|
|
|
"fmt"
|
2013-09-10 17:39:29 +02:00
|
|
|
"github.com/conformal/btcec"
|
2014-01-03 20:35:31 +01:00
|
|
|
"github.com/conformal/btcutil"
|
2013-06-12 23:35:27 +02:00
|
|
|
"github.com/conformal/btcwire"
|
|
|
|
"github.com/davecgh/go-spew/spew"
|
2013-09-10 17:39:29 +02:00
|
|
|
"io"
|
2013-06-12 23:35:27 +02:00
|
|
|
"time"
|
|
|
|
)
|
|
|
|
|
2014-01-04 16:56:02 +01:00
|
|
|
var (
|
|
|
|
// StackErrShortScript is returned if the script has an opcode that is
|
|
|
|
// too long for the length of the script.
|
|
|
|
StackErrShortScript = errors.New("execute past end of script")
|
|
|
|
|
|
|
|
// StackErrUnderflow is returned if an opcode requires more items on the
|
|
|
|
// stack than is present.
|
|
|
|
StackErrUnderflow = errors.New("stack underflow")
|
|
|
|
|
|
|
|
// StackErrInvalidArgs is returned if the argument for an opcode is out
|
|
|
|
// of acceptable range.
|
|
|
|
StackErrInvalidArgs = errors.New("invalid argument")
|
|
|
|
|
|
|
|
// StackErrOpDisabled is returned when a disabled opcode is encountered
|
|
|
|
// in the script.
|
|
|
|
StackErrOpDisabled = errors.New("Disabled Opcode")
|
|
|
|
|
|
|
|
// StackErrVerifyFailed is returned when one of the OP_VERIFY or
|
|
|
|
// OP_*VERIFY instructions is executed and the conditions fails.
|
|
|
|
StackErrVerifyFailed = errors.New("Verify failed")
|
|
|
|
|
|
|
|
// StackErrNumberTooBig is returned when the argument for an opcode that
|
|
|
|
// should be an offset is obviously far too large.
|
|
|
|
StackErrNumberTooBig = errors.New("number too big")
|
|
|
|
|
|
|
|
// StackErrInvalidOpcode is returned when an opcode marked as invalid or
|
|
|
|
// a completely undefined opcode is encountered.
|
|
|
|
StackErrInvalidOpcode = errors.New("Invalid Opcode")
|
|
|
|
|
|
|
|
// StackErrReservedOpcode is returned when an opcode marked as reserved
|
|
|
|
// is encountered.
|
|
|
|
StackErrReservedOpcode = errors.New("Reserved Opcode")
|
|
|
|
|
|
|
|
// StackErrEarlyReturn is returned when OP_RETURN is executed in the
|
|
|
|
// script.
|
|
|
|
StackErrEarlyReturn = errors.New("Script returned early")
|
|
|
|
|
|
|
|
// StackErrNoIf is returned if an OP_ELSE or OP_ENDIF is encountered
|
|
|
|
// without first having an OP_IF or OP_NOTIF in the script.
|
|
|
|
StackErrNoIf = errors.New("OP_ELSE or OP_ENDIF with no matching OP_IF")
|
|
|
|
|
|
|
|
// StackErrMissingEndif is returned if the end of a script is reached
|
|
|
|
// without and OP_ENDIF to correspond to a conditional expression.
|
|
|
|
StackErrMissingEndif = fmt.Errorf("execute fail, in conditional execution")
|
|
|
|
|
|
|
|
// StackErrTooManyPubkeys is returned if an OP_CHECKMULTISIG is
|
|
|
|
// encountered with more than MaxPubKeysPerMultiSig pubkeys present.
|
|
|
|
StackErrTooManyPubkeys = errors.New("Invalid pubkey count in OP_CHECKMULTISIG")
|
|
|
|
|
|
|
|
// StackErrTooManyOperations is returned if a script has more than
|
|
|
|
// MaxOpsPerScript opcodes that do not push data.
|
|
|
|
StackErrTooManyOperations = errors.New("Too many operations in script")
|
|
|
|
|
|
|
|
// StackErrElementTooBig is returned if the size of an element to be
|
|
|
|
// pushed to the stack is over MaxScriptElementSize.
|
|
|
|
StackErrElementTooBig = errors.New("Element in script too large")
|
|
|
|
|
|
|
|
// StackErrUnknownAddress is returned when ScriptToAddrHash does not
|
|
|
|
// recognise the pattern of the script and thus can not find the address
|
|
|
|
// for payment.
|
|
|
|
StackErrUnknownAddress = errors.New("non-recognised address")
|
|
|
|
|
|
|
|
// StackErrScriptFailed is returned when at the end of a script the
|
|
|
|
// boolean on top of the stack is false signifying that the script has
|
|
|
|
// failed.
|
|
|
|
StackErrScriptFailed = errors.New("execute fail, fail on stack")
|
|
|
|
|
|
|
|
// StackErrScriptUnfinished is returned when CheckErrorCondition is
|
|
|
|
// called on a script that has not finished executing.
|
|
|
|
StackErrScriptUnfinished = errors.New("Error check when script unfinished")
|
|
|
|
|
|
|
|
// StackErrEmpyStack is returned when the stack is empty at the end of
|
|
|
|
// execution. Normal operation requires that a boolean is on top of the
|
|
|
|
// stack when the scripts have finished executing.
|
|
|
|
StackErrEmptyStack = errors.New("Stack empty at end of execution")
|
|
|
|
|
|
|
|
// StackErrP2SHNonPushOnly is returned when a Pay-to-Script-Hash
|
|
|
|
// transaction is encountered and the ScriptSig does operations other
|
|
|
|
// than push data (in violation of bip16).
|
|
|
|
StackErrP2SHNonPushOnly = errors.New("pay to script hash with non " +
|
|
|
|
"pushonly input")
|
|
|
|
|
|
|
|
// StackErrInvalidParseType is an internal error returned from
|
|
|
|
// ScriptToAddrHash ony if the internal data tables are wrong.
|
|
|
|
StackErrInvalidParseType = errors.New("internal error: invalid parsetype found")
|
|
|
|
|
|
|
|
// StackErrInvalidAddrOffset is an internal error returned from
|
|
|
|
// ScriptToAddrHash ony if the internal data tables are wrong.
|
|
|
|
StackErrInvalidAddrOffset = errors.New("internal error: invalid offset found")
|
|
|
|
|
|
|
|
// StackErrInvalidIndex is returned when an out-of-bounds index was
|
|
|
|
// passed to a function.
|
|
|
|
StackErrInvalidIndex = errors.New("Invalid script index")
|
|
|
|
|
|
|
|
// StackErrNonPushOnly is returned when ScriptInfo is called with a
|
|
|
|
// pkScript that peforms operations other that pushing data to the stack.
|
|
|
|
StackErrNonPushOnly = errors.New("SigScript is non pushonly")
|
|
|
|
)
|
2013-10-09 01:13:52 +02:00
|
|
|
|
2014-01-03 20:35:31 +01:00
|
|
|
// ErrUnsupportedAddress is returned when a concrete type that implements
|
|
|
|
// a btcutil.Address is not a supported type.
|
|
|
|
var ErrUnsupportedAddress = errors.New("unsupported address type")
|
|
|
|
|
2013-06-12 23:35:27 +02:00
|
|
|
// Bip16Activation is the timestamp where BIP0016 is valid to use in the
|
|
|
|
// blockchain. To be used to determine if BIP0016 should be called for or not.
|
|
|
|
// This timestamp corresponds to Sun Apr 1 00:00:00 UTC 2012.
|
|
|
|
var Bip16Activation = time.Unix(1333238400, 0)
|
|
|
|
|
|
|
|
// Hash type bits from the end of a signature.
|
|
|
|
const (
|
|
|
|
SigHashOld = 0x0
|
|
|
|
SigHashAll = 0x1
|
|
|
|
SigHashNone = 0x2
|
|
|
|
SigHashSingle = 0x3
|
|
|
|
SigHashAnyOneCanPay = 0x80
|
|
|
|
)
|
|
|
|
|
|
|
|
// These are the constants specified for maximums in individual scripts.
|
|
|
|
const (
|
|
|
|
MaxOpsPerScript = 201 // Max number of non-push operations.
|
|
|
|
MaxPubKeysPerMultiSig = 20 // Multisig can't have more sigs than this.
|
|
|
|
MaxScriptElementSize = 520 // Max bytes pushable to the stack.
|
|
|
|
)
|
|
|
|
|
2013-07-05 01:54:55 +02:00
|
|
|
// ScriptClass is an enumeration for the list of standard types of script.
|
|
|
|
type ScriptClass byte
|
2013-06-12 23:35:27 +02:00
|
|
|
|
2013-07-05 01:54:55 +02:00
|
|
|
// Classes of script payment known about in the blockchain.
|
2013-06-12 23:35:27 +02:00
|
|
|
const (
|
2013-11-14 22:05:20 +01:00
|
|
|
NonStandardTy ScriptClass = iota // None of the recognized forms.
|
|
|
|
PubKeyTy // Pay pubkey.
|
2013-07-31 02:31:27 +02:00
|
|
|
PubKeyHashTy // Pay pubkey hash.
|
|
|
|
ScriptHashTy // Pay to script hash.
|
|
|
|
MultiSigTy // Multi signature.
|
2013-11-14 22:05:20 +01:00
|
|
|
NullDataTy // Empty data-only (provably prunable).
|
2013-06-12 23:35:27 +02:00
|
|
|
)
|
|
|
|
|
2013-11-06 01:10:16 +01:00
|
|
|
var scriptClassToName = []string{
|
2013-11-14 22:05:20 +01:00
|
|
|
NonStandardTy: "nonstandard",
|
2013-11-14 18:13:58 +01:00
|
|
|
PubKeyTy: "pubkey",
|
|
|
|
PubKeyHashTy: "pubkeyhash",
|
|
|
|
ScriptHashTy: "scripthash",
|
|
|
|
MultiSigTy: "multisig",
|
2013-11-14 22:05:20 +01:00
|
|
|
NullDataTy: "nulldata",
|
2013-11-06 01:10:16 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// String implements the Stringer interface by returning the name of
|
|
|
|
// the enum script class. If the enum is invalid then "Invalid" will be
|
|
|
|
// returned.
|
|
|
|
func (t ScriptClass) String() string {
|
|
|
|
if int(t) > len(scriptClassToName) || int(t) < 0 {
|
|
|
|
return "Invalid"
|
|
|
|
}
|
|
|
|
return scriptClassToName[t]
|
|
|
|
}
|
|
|
|
|
2013-06-12 23:35:27 +02:00
|
|
|
// Script is the virtual machine that executes btcscripts.
|
|
|
|
type Script struct {
|
|
|
|
scripts [][]parsedOpcode
|
|
|
|
scriptidx int
|
|
|
|
scriptoff int
|
|
|
|
lastcodesep int
|
|
|
|
dstack Stack // data stack
|
|
|
|
astack Stack // alt stack
|
|
|
|
tx btcwire.MsgTx
|
|
|
|
txidx int
|
|
|
|
condStack []int
|
|
|
|
numOps int
|
|
|
|
bip16 bool // treat execution as pay-to-script-hash
|
2013-10-24 16:13:58 +02:00
|
|
|
der bool // enforce DER encoding
|
2013-06-12 23:35:27 +02:00
|
|
|
savedFirstStack [][]byte // stack from first script for bip16 scripts
|
|
|
|
}
|
|
|
|
|
2014-02-19 23:17:02 +01:00
|
|
|
// isSmallInt returns whether or not the opcode is considered a small integer,
|
|
|
|
// which is an OP_0, or OP_1 through OP_16.
|
|
|
|
func isSmallInt(op *opcode) bool {
|
|
|
|
if op.value == OP_0 || (op.value >= OP_1 && op.value <= OP_16) {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
2013-06-12 23:35:27 +02:00
|
|
|
// isPubkey returns true if the script passed is a pubkey transaction, false
|
|
|
|
// otherwise.
|
|
|
|
func isPubkey(pops []parsedOpcode) bool {
|
|
|
|
return len(pops) == 2 &&
|
|
|
|
pops[0].opcode.value > OP_FALSE &&
|
|
|
|
pops[0].opcode.value <= OP_DATA_75 &&
|
|
|
|
pops[1].opcode.value == OP_CHECKSIG
|
|
|
|
}
|
|
|
|
|
|
|
|
// isPubkeyHash returns true if the script passed is a pubkey hash transaction,
|
|
|
|
// false otherwise.
|
|
|
|
func isPubkeyHash(pops []parsedOpcode) bool {
|
|
|
|
return len(pops) == 5 &&
|
|
|
|
pops[0].opcode.value == OP_DUP &&
|
|
|
|
pops[1].opcode.value == OP_HASH160 &&
|
|
|
|
pops[2].opcode.value == OP_DATA_20 &&
|
|
|
|
pops[3].opcode.value == OP_EQUALVERIFY &&
|
|
|
|
pops[4].opcode.value == OP_CHECKSIG
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
// isScriptHash returns true if the script passed is a pay-to-script-hash (P2SH)
|
|
|
|
// transction, false otherwise.
|
|
|
|
func isScriptHash(pops []parsedOpcode) bool {
|
|
|
|
return len(pops) == 3 &&
|
|
|
|
pops[0].opcode.value == OP_HASH160 &&
|
|
|
|
pops[1].opcode.value == OP_DATA_20 &&
|
|
|
|
pops[2].opcode.value == OP_EQUAL
|
|
|
|
}
|
|
|
|
|
2013-06-27 01:32:11 +02:00
|
|
|
// IsPayToScriptHash returns true if the script is in the standard
|
|
|
|
// Pay-To-Script-Hash format, false otherwise.
|
|
|
|
func IsPayToScriptHash(script []byte) bool {
|
|
|
|
pops, err := parseScript(script)
|
|
|
|
if err != nil {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
return isScriptHash(pops)
|
|
|
|
}
|
|
|
|
|
2013-06-12 23:35:27 +02:00
|
|
|
// isMultiSig returns true if the passed script is a multisig transaction, false
|
|
|
|
// otherwise.
|
|
|
|
func isMultiSig(pops []parsedOpcode) bool {
|
|
|
|
l := len(pops)
|
|
|
|
// absolute minimum is 1 pubkey so
|
2014-02-19 23:17:02 +01:00
|
|
|
// OP_0/OP_1-16, pubkey, OP_1, OP_CHECKMULTISIG
|
2013-06-12 23:35:27 +02:00
|
|
|
if l < 4 {
|
|
|
|
return false
|
|
|
|
}
|
2014-02-19 23:17:02 +01:00
|
|
|
if !isSmallInt(pops[0].opcode) {
|
2013-06-12 23:35:27 +02:00
|
|
|
return false
|
|
|
|
}
|
2014-02-19 23:17:02 +01:00
|
|
|
if !isSmallInt(pops[l-2].opcode) {
|
2013-06-12 23:35:27 +02:00
|
|
|
return false
|
|
|
|
}
|
2014-01-04 22:13:29 +01:00
|
|
|
if pops[l-1].opcode.value != OP_CHECKMULTISIG {
|
2013-06-12 23:35:27 +02:00
|
|
|
return false
|
|
|
|
}
|
|
|
|
for _, pop := range pops[1 : l-2] {
|
|
|
|
// valid pubkeys are either 65 or 33 bytes
|
|
|
|
if len(pop.data) != 33 &&
|
|
|
|
len(pop.data) != 65 {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
2013-11-14 22:05:20 +01:00
|
|
|
// isNullData returns true if the passed script is a null data transaction,
|
|
|
|
// false otherwise.
|
|
|
|
func isNullData(pops []parsedOpcode) bool {
|
|
|
|
// A nulldata transaction is either a single OP_RETURN or an
|
|
|
|
// OP_RETURN SMALLDATA (where SMALLDATA is a push data up to 80 bytes).
|
|
|
|
l := len(pops)
|
|
|
|
if l == 1 && pops[0].opcode.value == OP_RETURN {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
return l == 2 &&
|
|
|
|
pops[0].opcode.value == OP_RETURN &&
|
|
|
|
pops[1].opcode.value <= OP_PUSHDATA4 &&
|
|
|
|
len(pops[1].data) <= 80
|
|
|
|
}
|
|
|
|
|
2013-06-12 23:35:27 +02:00
|
|
|
// isPushOnly returns true if the script only pushes data, false otherwise.
|
|
|
|
func isPushOnly(pops []parsedOpcode) bool {
|
|
|
|
// technically we cheat here, we don't look at opcodes
|
|
|
|
for _, pop := range pops {
|
|
|
|
// all opcodes up to OP_16 are data instructions.
|
|
|
|
if pop.opcode.value < OP_FALSE ||
|
|
|
|
pop.opcode.value > OP_16 {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
2013-09-27 03:34:25 +02:00
|
|
|
// IsPushOnlyScript returns whether or not the passed script only pushes data.
|
|
|
|
// If the script does not parse false will be returned.
|
|
|
|
func IsPushOnlyScript(script []byte) bool {
|
|
|
|
pops, err := parseScript(script)
|
|
|
|
if err != nil {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
return isPushOnly(pops)
|
|
|
|
}
|
|
|
|
|
2014-02-20 06:05:35 +01:00
|
|
|
// HasCanonicalPushes returns whether or not the passed script only contains
|
|
|
|
// canonical data pushes. A canonical data push one where the fewest number of
|
|
|
|
// bytes possible to encode the size of the data being pushed is used. This
|
|
|
|
// includes using the small integer opcodes for single byte data that can be
|
|
|
|
// represented directly.
|
|
|
|
func HasCanonicalPushes(script []byte) bool {
|
|
|
|
pops, err := parseScript(script)
|
|
|
|
if err != nil {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
for _, pop := range pops {
|
|
|
|
opcode := pop.opcode.value
|
|
|
|
data := pop.data
|
|
|
|
dataLen := len(pop.data)
|
|
|
|
if opcode > OP_16 {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
if opcode < OP_PUSHDATA1 && opcode > OP_0 && (dataLen == 1 && data[0] <= 16) {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
if opcode == OP_PUSHDATA1 && dataLen < OP_PUSHDATA1 {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
if opcode == OP_PUSHDATA2 && dataLen <= 0xff {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
if opcode == OP_PUSHDATA4 && dataLen <= 0xffff {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
2013-07-05 01:54:55 +02:00
|
|
|
// GetScriptClass returns the class of the script passed. If the script does not
|
|
|
|
// parse then NonStandardTy will be returned.
|
|
|
|
func GetScriptClass(script []byte) ScriptClass {
|
|
|
|
pops, err := parseScript(script)
|
|
|
|
if err != nil {
|
|
|
|
return NonStandardTy
|
|
|
|
}
|
|
|
|
return typeOfScript(pops)
|
|
|
|
}
|
|
|
|
|
2013-06-12 23:35:27 +02:00
|
|
|
// scriptType returns the type of the script being inspected from the known
|
|
|
|
// standard types.
|
2013-07-05 01:54:55 +02:00
|
|
|
func typeOfScript(pops []parsedOpcode) ScriptClass {
|
2013-06-12 23:35:27 +02:00
|
|
|
// XXX dubious optimisation: order these in order of popularity in the
|
|
|
|
// blockchain
|
|
|
|
if isPubkey(pops) {
|
2013-07-05 01:54:55 +02:00
|
|
|
return PubKeyTy
|
2013-06-12 23:35:27 +02:00
|
|
|
} else if isPubkeyHash(pops) {
|
2013-07-05 01:54:55 +02:00
|
|
|
return PubKeyHashTy
|
2013-06-12 23:35:27 +02:00
|
|
|
} else if isScriptHash(pops) {
|
2013-07-05 01:54:55 +02:00
|
|
|
return ScriptHashTy
|
2013-06-12 23:35:27 +02:00
|
|
|
} else if isMultiSig(pops) {
|
2013-07-05 01:54:55 +02:00
|
|
|
return MultiSigTy
|
2013-11-14 22:05:20 +01:00
|
|
|
} else if isNullData(pops) {
|
|
|
|
return NullDataTy
|
2013-06-12 23:35:27 +02:00
|
|
|
}
|
2013-07-05 01:54:55 +02:00
|
|
|
return NonStandardTy
|
2013-06-12 23:35:27 +02:00
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
// parseScript preparses the script in bytes into a list of parsedOpcodes while
|
|
|
|
// applying a number of sanity checks.
|
|
|
|
func parseScript(script []byte) ([]parsedOpcode, error) {
|
2013-06-28 01:46:34 +02:00
|
|
|
return parseScriptTemplate(script, opcodemap)
|
|
|
|
}
|
|
|
|
|
|
|
|
// parseScriptTemplate is the same as parseScript but allows the passing of the
|
2013-07-25 16:40:11 +02:00
|
|
|
// template list for testing purposes. On error we return the list of parsed
|
|
|
|
// opcodes so far.
|
2013-06-28 01:46:34 +02:00
|
|
|
func parseScriptTemplate(script []byte, opcodemap map[byte]*opcode) ([]parsedOpcode, error) {
|
2013-09-25 18:38:20 +02:00
|
|
|
retScript := make([]parsedOpcode, 0, len(script))
|
2013-06-12 23:35:27 +02:00
|
|
|
for i := 0; i < len(script); {
|
|
|
|
instr := script[i]
|
|
|
|
op, ok := opcodemap[instr]
|
|
|
|
if !ok {
|
2013-07-25 16:40:11 +02:00
|
|
|
return retScript, StackErrInvalidOpcode
|
2013-06-12 23:35:27 +02:00
|
|
|
}
|
|
|
|
pop := parsedOpcode{opcode: op}
|
|
|
|
// parse data out of instruction.
|
|
|
|
switch {
|
|
|
|
case op.length == 1:
|
|
|
|
// no data, done here
|
|
|
|
i++
|
|
|
|
case op.length > 1:
|
|
|
|
if len(script[i:]) < op.length {
|
2013-07-25 16:40:11 +02:00
|
|
|
return retScript, StackErrShortScript
|
2013-06-12 23:35:27 +02:00
|
|
|
}
|
|
|
|
// slice out the data.
|
|
|
|
pop.data = script[i+1 : i+op.length]
|
|
|
|
i += op.length
|
|
|
|
case op.length < 0:
|
|
|
|
var err error
|
|
|
|
var l uint
|
|
|
|
off := i + 1
|
|
|
|
switch op.length {
|
|
|
|
case -1:
|
|
|
|
l, err = scriptUInt8(script[off:])
|
|
|
|
case -2:
|
|
|
|
l, err = scriptUInt16(script[off:])
|
|
|
|
case -4:
|
|
|
|
l, err = scriptUInt32(script[off:])
|
|
|
|
default:
|
2013-07-25 16:40:11 +02:00
|
|
|
return retScript,
|
|
|
|
fmt.Errorf("invalid opcode length %d",
|
2013-07-31 02:31:27 +02:00
|
|
|
op.length)
|
2013-06-12 23:35:27 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
off = i + 1 - op.length // beginning of data
|
2013-10-09 00:21:40 +02:00
|
|
|
// Disallow entries that do not fit script or were
|
|
|
|
// sign extended.
|
2013-10-09 02:27:19 +02:00
|
|
|
if int(l) > len(script[off:]) || int(l) < 0 {
|
2013-07-25 16:40:11 +02:00
|
|
|
return retScript, StackErrShortScript
|
2013-06-12 23:35:27 +02:00
|
|
|
}
|
|
|
|
pop.data = script[off : off+int(l)]
|
|
|
|
i += 1 - op.length + int(l)
|
|
|
|
}
|
|
|
|
retScript = append(retScript, pop)
|
|
|
|
}
|
|
|
|
return retScript, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// unparseScript reversed the action of parseScript and returns the
|
|
|
|
// parsedOpcodes as a list of bytes
|
2013-09-10 17:39:29 +02:00
|
|
|
func unparseScript(pops []parsedOpcode) ([]byte, error) {
|
2013-09-25 18:38:20 +02:00
|
|
|
script := make([]byte, 0, len(pops))
|
2013-06-12 23:35:27 +02:00
|
|
|
for _, pop := range pops {
|
2013-09-10 17:39:29 +02:00
|
|
|
b, err := pop.bytes()
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
script = append(script, b...)
|
2013-06-12 23:35:27 +02:00
|
|
|
}
|
2013-09-10 17:39:29 +02:00
|
|
|
return script, nil
|
2013-06-12 23:35:27 +02:00
|
|
|
}
|
|
|
|
|
2013-10-24 16:13:58 +02:00
|
|
|
// ScriptFlags is a bitmask defining additional operations or
|
|
|
|
// tests that will be done when executing a Script.
|
|
|
|
type ScriptFlags uint32
|
|
|
|
|
|
|
|
const (
|
|
|
|
// ScriptBip16 defines whether the bip16 threshhold has passed and thus
|
|
|
|
// pay-to-script hash transactions will be fully validated.
|
|
|
|
ScriptBip16 ScriptFlags = 1 << iota
|
|
|
|
|
|
|
|
// ScriptCanonicalSignatures defines whether additional canonical
|
|
|
|
// signature checks are performed when parsing a signature.
|
|
|
|
//
|
|
|
|
// Canonical (DER) signatures are not required in the tx rules for
|
|
|
|
// block acceptance, but are checked in recent versions of bitcoind
|
|
|
|
// when accepting transactions to the mempool. Non-canonical (valid
|
|
|
|
// BER but not valid DER) transactions can potentially be changed
|
|
|
|
// before mined into a block, either by adding extra padding or
|
|
|
|
// flipping the sign of the R or S value in the signature, creating a
|
|
|
|
// transaction that still validates and spends the inputs, but is not
|
|
|
|
// recognized by creator of the transaction. Performing a canonical
|
|
|
|
// check enforces script signatures use a unique DER format.
|
|
|
|
ScriptCanonicalSignatures
|
|
|
|
)
|
|
|
|
|
2013-06-12 23:35:27 +02:00
|
|
|
// NewScript returns a new script engine for the provided tx and input idx with
|
|
|
|
// a signature script scriptSig and a pubkeyscript scriptPubKey. If bip16 is
|
|
|
|
// true then it will be treated as if the bip16 threshhold has passed and thus
|
|
|
|
// pay-to-script hash transactions will be fully validated.
|
2013-10-24 16:13:58 +02:00
|
|
|
func NewScript(scriptSig []byte, scriptPubKey []byte, txidx int, tx *btcwire.MsgTx, flags ScriptFlags) (*Script, error) {
|
2013-06-12 23:35:27 +02:00
|
|
|
var m Script
|
|
|
|
scripts := [][]byte{scriptSig, scriptPubKey}
|
|
|
|
m.scripts = make([][]parsedOpcode, len(scripts))
|
|
|
|
for i, scr := range scripts {
|
|
|
|
var err error
|
|
|
|
m.scripts[i], err = parseScript(scr)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
2013-06-26 15:16:00 +02:00
|
|
|
// If the first scripts(s) are empty, must start on later ones.
|
|
|
|
if i == 0 && len(scr) == 0 {
|
|
|
|
// This could end up seeing an invalid initial pc if
|
|
|
|
// all scripts were empty. However, that is an invalid
|
|
|
|
// case and should fail.
|
2013-06-12 23:35:27 +02:00
|
|
|
m.scriptidx = i + 1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-10-24 16:13:58 +02:00
|
|
|
// Parse flags.
|
|
|
|
bip16 := flags&ScriptBip16 == ScriptBip16
|
2013-06-12 23:35:27 +02:00
|
|
|
if bip16 && isScriptHash(m.scripts[1]) {
|
|
|
|
// if we are pay to scripthash then we only accept input
|
|
|
|
// scripts that push data
|
|
|
|
if !isPushOnly(m.scripts[0]) {
|
2013-06-25 14:12:15 +02:00
|
|
|
return nil, StackErrP2SHNonPushOnly
|
2013-06-12 23:35:27 +02:00
|
|
|
}
|
|
|
|
m.bip16 = true
|
|
|
|
}
|
2013-10-24 16:13:58 +02:00
|
|
|
if flags&ScriptCanonicalSignatures == ScriptCanonicalSignatures {
|
|
|
|
m.der = true
|
|
|
|
}
|
2013-06-12 23:35:27 +02:00
|
|
|
|
|
|
|
m.tx = *tx
|
|
|
|
m.txidx = txidx
|
|
|
|
m.condStack = []int{OpCondTrue}
|
|
|
|
|
|
|
|
return &m, nil
|
|
|
|
}
|
|
|
|
|
2013-07-06 18:58:28 +02:00
|
|
|
// Execute will execute all script in the script engine and return either nil
|
2013-06-12 23:35:27 +02:00
|
|
|
// for successful validation or an error if one occurred.
|
|
|
|
func (s *Script) Execute() (err error) {
|
|
|
|
done := false
|
|
|
|
for done != true {
|
|
|
|
log.Tracef("%v", newLogClosure(func() string {
|
|
|
|
dis, err := s.DisasmPC()
|
|
|
|
if err != nil {
|
|
|
|
return fmt.Sprintf("stepping (%v)", err)
|
|
|
|
}
|
|
|
|
return fmt.Sprintf("stepping %v", dis)
|
|
|
|
}))
|
|
|
|
|
|
|
|
done, err = s.Step()
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
log.Tracef("%v", newLogClosure(func() string {
|
|
|
|
var dstr, astr string
|
|
|
|
|
|
|
|
// if we're tracing, dump the stacks.
|
|
|
|
if s.dstack.Depth() != 0 {
|
|
|
|
dstr = "Stack\n" + spew.Sdump(s.dstack)
|
|
|
|
}
|
|
|
|
if s.astack.Depth() != 0 {
|
|
|
|
astr = "AltStack\n" + spew.Sdump(s.astack)
|
|
|
|
}
|
|
|
|
|
|
|
|
return dstr + astr
|
|
|
|
}))
|
|
|
|
}
|
2013-06-18 18:39:00 +02:00
|
|
|
|
|
|
|
return s.CheckErrorCondition()
|
|
|
|
}
|
|
|
|
|
|
|
|
// CheckErrorCondition returns nil if the running script has ended and was
|
|
|
|
// successful, leaving a a true boolean on the stack. An error otherwise,
|
|
|
|
// including if the script has not finished.
|
|
|
|
func (s *Script) CheckErrorCondition() (err error) {
|
|
|
|
// Check we are actually done. if pc is past the end of script array
|
|
|
|
// then we have run out of scripts to run.
|
|
|
|
if s.scriptidx < len(s.scripts) {
|
|
|
|
return StackErrScriptUnfinished
|
|
|
|
}
|
2013-06-12 23:35:27 +02:00
|
|
|
if s.dstack.Depth() < 1 {
|
2013-06-18 18:39:00 +02:00
|
|
|
return StackErrEmptyStack
|
2013-06-12 23:35:27 +02:00
|
|
|
}
|
|
|
|
v, err := s.dstack.PopBool()
|
|
|
|
if err == nil && v == false {
|
|
|
|
// log interesting data.
|
2014-02-19 20:22:33 +01:00
|
|
|
log.Tracef("%v", newLogClosure(func() string {
|
2013-06-12 23:35:27 +02:00
|
|
|
dis0, _ := s.DisasmScript(0)
|
|
|
|
dis1, _ := s.DisasmScript(1)
|
2013-06-18 18:39:00 +02:00
|
|
|
return fmt.Sprintf("scripts failed: script0: %s\n"+
|
|
|
|
"script1: %s", dis0, dis1)
|
2014-02-19 20:22:33 +01:00
|
|
|
}))
|
2013-06-12 23:35:27 +02:00
|
|
|
err = StackErrScriptFailed
|
|
|
|
}
|
|
|
|
if err == nil && len(s.condStack) != 1 {
|
|
|
|
// conditional execution stack context left active
|
|
|
|
err = StackErrMissingEndif
|
|
|
|
}
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
|
|
|
// Step will execute the next instruction and move the program counter to the
|
|
|
|
// next opcode in the script, or the next script if the curent has ended. Step
|
|
|
|
// will return true in the case that the last opcode was successfully executed.
|
|
|
|
// if an error is returned then the result of calling Step or any other method
|
|
|
|
// is undefined.
|
|
|
|
func (m *Script) Step() (done bool, err error) {
|
|
|
|
// verify that it is pointing to a valid script address
|
|
|
|
err = m.validPC()
|
|
|
|
if err != nil {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
opcode := m.scripts[m.scriptidx][m.scriptoff]
|
|
|
|
|
|
|
|
executeInstr := true
|
|
|
|
if m.condStack[0] != OpCondTrue {
|
|
|
|
// some opcodes still 'activate' if on the non-executing side
|
|
|
|
// of conditional execution
|
|
|
|
if opcode.conditional() {
|
|
|
|
executeInstr = true
|
|
|
|
} else {
|
|
|
|
executeInstr = false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if executeInstr {
|
|
|
|
err = opcode.exec(m)
|
|
|
|
if err != nil {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// prepare for next instruction
|
|
|
|
m.scriptoff++
|
|
|
|
if m.scriptoff >= len(m.scripts[m.scriptidx]) {
|
2013-06-18 18:38:18 +02:00
|
|
|
m.numOps = 0 // number of ops is per script.
|
2013-06-12 23:35:27 +02:00
|
|
|
m.scriptoff = 0
|
|
|
|
if m.scriptidx == 0 && m.bip16 {
|
2013-06-18 18:39:00 +02:00
|
|
|
m.scriptidx++
|
2013-06-12 23:35:27 +02:00
|
|
|
m.savedFirstStack = m.GetStack()
|
|
|
|
} else if m.scriptidx == 1 && m.bip16 {
|
2013-06-18 18:39:00 +02:00
|
|
|
// Put us past the end for CheckErrorCondition()
|
|
|
|
m.scriptidx++
|
|
|
|
// We check script ran ok, if so then we pull
|
|
|
|
// the script out of the first stack and executre that.
|
|
|
|
err := m.CheckErrorCondition()
|
2013-06-12 23:35:27 +02:00
|
|
|
if err != nil {
|
|
|
|
return false, err
|
|
|
|
}
|
2013-06-18 18:39:00 +02:00
|
|
|
|
2013-06-12 23:35:27 +02:00
|
|
|
script := m.savedFirstStack[len(m.savedFirstStack)-1]
|
|
|
|
pops, err := parseScript(script)
|
|
|
|
if err != nil {
|
|
|
|
return false, err
|
|
|
|
}
|
|
|
|
m.scripts = append(m.scripts, pops)
|
|
|
|
// Set stack to be the stack from first script
|
|
|
|
// minus the script itself
|
|
|
|
m.SetStack(m.savedFirstStack[:len(m.savedFirstStack)-1])
|
2013-06-18 18:39:00 +02:00
|
|
|
} else {
|
|
|
|
m.scriptidx++
|
2013-06-12 23:35:27 +02:00
|
|
|
}
|
|
|
|
// there are zero length scripts in the wild
|
|
|
|
if m.scriptidx < len(m.scripts) && m.scriptoff >= len(m.scripts[m.scriptidx]) {
|
|
|
|
m.scriptidx++
|
|
|
|
}
|
|
|
|
m.lastcodesep = 0
|
|
|
|
if m.scriptidx >= len(m.scripts) {
|
|
|
|
done = true
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
// curPC returns either the current script and offset, or an error if the
|
|
|
|
// position isn't valid.
|
|
|
|
func (m *Script) curPC() (script int, off int, err error) {
|
|
|
|
err = m.validPC()
|
|
|
|
if err != nil {
|
|
|
|
return 0, 0, err
|
|
|
|
}
|
|
|
|
return m.scriptidx, m.scriptoff, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// validPC returns an error if the current script position is valid for
|
|
|
|
// execution, nil otherwise.
|
|
|
|
func (m *Script) validPC() error {
|
|
|
|
if m.scriptidx >= len(m.scripts) {
|
|
|
|
return fmt.Errorf("Past input scripts %v:%v %v:xxxx", m.scriptidx, m.scriptoff, len(m.scripts))
|
|
|
|
}
|
|
|
|
if m.scriptoff >= len(m.scripts[m.scriptidx]) {
|
|
|
|
return fmt.Errorf("Past input scripts %v:%v %v:%04d", m.scriptidx, m.scriptoff, m.scriptidx, len(m.scripts[m.scriptidx]))
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// DisasmScript returns the disassembly string for the script at offset
|
|
|
|
// ``idx''. Where 0 is the scriptSig and 1 is the scriptPubKey.
|
|
|
|
func (m *Script) DisasmScript(idx int) (disstr string, err error) {
|
|
|
|
if idx >= len(m.scripts) {
|
2013-06-27 16:07:37 +02:00
|
|
|
return "", StackErrInvalidIndex
|
2013-06-12 23:35:27 +02:00
|
|
|
}
|
|
|
|
for i := range m.scripts[idx] {
|
|
|
|
disstr = disstr + m.disasm(idx, i) + "\n"
|
|
|
|
}
|
|
|
|
return disstr, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// DisasmPC returns the string for the disassembly of the opcode that will be
|
|
|
|
// next to execute when Step() is called.
|
|
|
|
func (m *Script) DisasmPC() (disstr string, err error) {
|
|
|
|
scriptidx, scriptoff, err := m.curPC()
|
|
|
|
if err != nil {
|
|
|
|
return "", err
|
|
|
|
}
|
|
|
|
return m.disasm(scriptidx, scriptoff), nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// disasm is a helper member to produce the output for DisasmPC and
|
|
|
|
// DisasmScript. It produces the opcode prefixed by the program counter at the
|
|
|
|
// provided position in the script. it does no error checking and leaves that
|
|
|
|
// to the caller to provide a valid offse.
|
|
|
|
func (m *Script) disasm(scriptidx int, scriptoff int) string {
|
|
|
|
return fmt.Sprintf("%02x:%04x: %s", scriptidx, scriptoff,
|
|
|
|
m.scripts[scriptidx][scriptoff].print(false))
|
|
|
|
}
|
|
|
|
|
|
|
|
// subScript will return the script since the last OP_CODESEPARATOR
|
|
|
|
func (s *Script) subScript() []parsedOpcode {
|
|
|
|
return s.scripts[s.scriptidx][s.lastcodesep:]
|
|
|
|
}
|
|
|
|
|
|
|
|
// removeOpcode will remove any opcode matching ``opcode'' from the opcode
|
|
|
|
// stream in pkscript
|
|
|
|
func removeOpcode(pkscript []parsedOpcode, opcode byte) []parsedOpcode {
|
2013-09-25 18:38:20 +02:00
|
|
|
retScript := make([]parsedOpcode, 0, len(pkscript))
|
2013-06-12 23:35:27 +02:00
|
|
|
for _, pop := range pkscript {
|
|
|
|
if pop.opcode.value != opcode {
|
|
|
|
retScript = append(retScript, pop)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return retScript
|
|
|
|
}
|
|
|
|
|
|
|
|
// removeOpcodeByData will return the pkscript minus any opcodes that would
|
|
|
|
// push the data in ``data'' to the stack.
|
|
|
|
func removeOpcodeByData(pkscript []parsedOpcode, data []byte) []parsedOpcode {
|
2013-09-25 18:38:20 +02:00
|
|
|
retScript := make([]parsedOpcode, 0, len(pkscript))
|
2013-06-12 23:35:27 +02:00
|
|
|
for _, pop := range pkscript {
|
|
|
|
if !bytes.Equal(pop.data, data) {
|
|
|
|
retScript = append(retScript, pop)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return retScript
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2014-01-04 01:47:00 +01:00
|
|
|
// DisasmString formats a disassembled script for one line printing. When the
|
|
|
|
// script fails to parse, the returned string will contain the disassembled
|
|
|
|
// script up to the point the failure occurred along with the string '[error]'
|
|
|
|
// appended. In addition, the reason the script failed to parse is returned
|
|
|
|
// if the caller wants more information about the failure.
|
2013-06-12 23:35:27 +02:00
|
|
|
func DisasmString(buf []byte) (string, error) {
|
|
|
|
disbuf := ""
|
|
|
|
opcodes, err := parseScript(buf)
|
|
|
|
for _, pop := range opcodes {
|
|
|
|
disbuf += pop.print(true) + " "
|
|
|
|
}
|
|
|
|
if disbuf != "" {
|
|
|
|
disbuf = disbuf[:len(disbuf)-1]
|
|
|
|
}
|
2014-01-04 01:47:00 +01:00
|
|
|
if err != nil {
|
|
|
|
disbuf += "[error]"
|
|
|
|
}
|
|
|
|
return disbuf, err
|
2013-06-12 23:35:27 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// calcScriptHash will, given the a script and hashtype for the current
|
|
|
|
// scriptmachine, calculate the doubleSha256 hash of the transaction and
|
|
|
|
// script to be used for signature signing and verification.
|
2013-09-10 17:39:29 +02:00
|
|
|
func calcScriptHash(script []parsedOpcode, hashType byte, tx *btcwire.MsgTx, idx int) []byte {
|
2013-06-12 23:35:27 +02:00
|
|
|
|
|
|
|
// remove all instances of OP_CODESEPARATOR still left in the script
|
|
|
|
script = removeOpcode(script, OP_CODESEPARATOR)
|
|
|
|
|
|
|
|
// Make a deep copy of the transaction, zeroing out the script
|
|
|
|
// for all inputs that are not currently being processed.
|
2013-09-10 17:39:29 +02:00
|
|
|
txCopy := tx.Copy()
|
2013-06-12 23:35:27 +02:00
|
|
|
for i := range txCopy.TxIn {
|
|
|
|
var txIn btcwire.TxIn
|
|
|
|
txIn = *txCopy.TxIn[i]
|
|
|
|
txCopy.TxIn[i] = &txIn
|
2013-09-10 17:39:29 +02:00
|
|
|
if i == idx {
|
|
|
|
// unparseScript cannot fail here, because removeOpcode
|
|
|
|
// above only returns a valid script.
|
|
|
|
sigscript, _ := unparseScript(script)
|
|
|
|
txCopy.TxIn[idx].SignatureScript = sigscript
|
2013-06-12 23:35:27 +02:00
|
|
|
} else {
|
|
|
|
txCopy.TxIn[i].SignatureScript = []byte{}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// Default behaviour has all outputs set up.
|
|
|
|
for i := range txCopy.TxOut {
|
|
|
|
var txOut btcwire.TxOut
|
|
|
|
txOut = *txCopy.TxOut[i]
|
|
|
|
txCopy.TxOut[i] = &txOut
|
|
|
|
}
|
|
|
|
|
|
|
|
switch hashType & 31 {
|
|
|
|
case SigHashNone:
|
|
|
|
txCopy.TxOut = txCopy.TxOut[0:0] // empty slice
|
|
|
|
for i := range txCopy.TxIn {
|
2013-09-10 17:39:29 +02:00
|
|
|
if i != idx {
|
2013-06-12 23:35:27 +02:00
|
|
|
txCopy.TxIn[i].Sequence = 0
|
|
|
|
}
|
|
|
|
}
|
|
|
|
case SigHashSingle:
|
2013-09-10 17:39:29 +02:00
|
|
|
if idx >= len(txCopy.TxOut) {
|
2013-07-30 23:45:26 +02:00
|
|
|
// This was created by a buggy implementation.
|
|
|
|
// In this case we do the same as bitcoind and bitcoinj
|
|
|
|
// and return 1 (as a uint256 little endian) as an
|
|
|
|
// error. Unfortunately this was not checked anywhere
|
|
|
|
// and thus is treated as the actual
|
|
|
|
// hash.
|
|
|
|
hash := make([]byte, 32)
|
|
|
|
hash[0] = 0x01
|
|
|
|
return hash
|
|
|
|
}
|
|
|
|
// Resize output array to up to and including requested index.
|
2013-09-10 17:39:29 +02:00
|
|
|
txCopy.TxOut = txCopy.TxOut[:idx+1]
|
2013-06-12 23:35:27 +02:00
|
|
|
// all but current output get zeroed out
|
2013-09-10 17:39:29 +02:00
|
|
|
for i := 0; i < idx; i++ {
|
2013-06-12 23:35:27 +02:00
|
|
|
txCopy.TxOut[i].Value = -1
|
|
|
|
txCopy.TxOut[i].PkScript = []byte{}
|
|
|
|
}
|
|
|
|
// Sequence on all other inputs is 0, too.
|
|
|
|
for i := range txCopy.TxIn {
|
2013-09-10 17:39:29 +02:00
|
|
|
if i != idx {
|
2013-06-12 23:35:27 +02:00
|
|
|
txCopy.TxIn[i].Sequence = 0
|
|
|
|
}
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
// XXX bitcoind treats undefined hashtypes like normal
|
|
|
|
// SigHashAll for purposes of hash generation.
|
|
|
|
fallthrough
|
|
|
|
case SigHashOld:
|
|
|
|
fallthrough
|
|
|
|
case SigHashAll:
|
|
|
|
// nothing special here
|
|
|
|
}
|
|
|
|
if hashType&SigHashAnyOneCanPay != 0 {
|
2013-09-10 17:39:29 +02:00
|
|
|
txCopy.TxIn = txCopy.TxIn[idx : idx+1]
|
|
|
|
idx = 0
|
2013-06-12 23:35:27 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
var wbuf bytes.Buffer
|
2013-08-05 22:08:28 +02:00
|
|
|
txCopy.Serialize(&wbuf)
|
2013-06-12 23:35:27 +02:00
|
|
|
// Append LE 4 bytes hash type
|
|
|
|
binary.Write(&wbuf, binary.LittleEndian, uint32(hashType))
|
|
|
|
|
|
|
|
return btcwire.DoubleSha256(wbuf.Bytes())
|
|
|
|
}
|
|
|
|
|
|
|
|
// scriptUInt8 return the number stored in the first byte of a slice.
|
|
|
|
func scriptUInt8(script []byte) (uint, error) {
|
|
|
|
if len(script) <= 1 {
|
|
|
|
return 0, StackErrShortScript
|
|
|
|
}
|
|
|
|
return uint(script[0]), nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// scriptUInt16 returns the number stored in the next 2 bytes of a slice.
|
|
|
|
func scriptUInt16(script []byte) (uint, error) {
|
|
|
|
if len(script) <= 2 {
|
|
|
|
return 0, StackErrShortScript
|
|
|
|
}
|
|
|
|
// Yes this is little endian
|
|
|
|
return ((uint(script[1]) << 8) | uint(script[0])), nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// scriptUInt32 returns the number stored in the first 4 bytes of a slice.
|
|
|
|
func scriptUInt32(script []byte) (uint, error) {
|
|
|
|
if len(script) <= 4 {
|
|
|
|
return 0, StackErrShortScript
|
|
|
|
}
|
|
|
|
// Yes this is little endian
|
|
|
|
return ((uint(script[3]) << 24) | (uint(script[2]) << 16) |
|
|
|
|
(uint(script[1]) << 8) | uint(script[0])), nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// getStack returns the contents of stack as a byte array bottom up
|
|
|
|
func getStack(stack *Stack) [][]byte {
|
|
|
|
array := make([][]byte, stack.Depth())
|
|
|
|
for i := range array {
|
|
|
|
// PeekByteArry can't fail due to overflow, already checked
|
|
|
|
array[len(array)-i-1], _ =
|
|
|
|
stack.PeekByteArray(i)
|
|
|
|
}
|
|
|
|
return array
|
|
|
|
}
|
|
|
|
|
|
|
|
// setStack sets the stack to the contents of the array where the last item in
|
|
|
|
// the array is the top item in the stack.
|
|
|
|
func setStack(stack *Stack, data [][]byte) {
|
|
|
|
// This can not error. Only errors are for invalid arguments.
|
|
|
|
_ = stack.DropN(stack.Depth())
|
|
|
|
|
|
|
|
for i := range data {
|
|
|
|
stack.PushByteArray(data[i])
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// GetStack returns the contents of the primary stack as an array. where the
|
|
|
|
// last item in the array is the top of the stack.
|
|
|
|
func (s *Script) GetStack() [][]byte {
|
|
|
|
return getStack(&s.dstack)
|
|
|
|
}
|
|
|
|
|
|
|
|
// SetStack sets the contents of the primary stack to the contents of the
|
|
|
|
// provided array where the last item in the array will be the top of the stack.
|
|
|
|
func (s *Script) SetStack(data [][]byte) {
|
|
|
|
setStack(&s.dstack, data)
|
|
|
|
}
|
|
|
|
|
|
|
|
// GetAltStack returns the contents of the primary stack as an array. where the
|
|
|
|
// last item in the array is the top of the stack.
|
|
|
|
func (s *Script) GetAltStack() [][]byte {
|
|
|
|
return getStack(&s.astack)
|
|
|
|
}
|
|
|
|
|
|
|
|
// SetAltStack sets the contents of the primary stack to the contents of the
|
|
|
|
// provided array where the last item in the array will be the top of the stack.
|
|
|
|
func (s *Script) SetAltStack(data [][]byte) {
|
|
|
|
setStack(&s.astack, data)
|
|
|
|
}
|
2013-06-20 19:07:44 +02:00
|
|
|
|
|
|
|
// GetSigOpCount provides a quick count of the number of signature operations
|
|
|
|
// in a script. a CHECKSIG operations counts for 1, and a CHECK_MULTISIG for 20.
|
2013-07-25 16:40:11 +02:00
|
|
|
// If the script fails to parse, then the count up to the point of failure is
|
|
|
|
// returned.
|
2013-07-25 15:27:58 +02:00
|
|
|
func GetSigOpCount(script []byte) int {
|
2013-07-25 16:40:11 +02:00
|
|
|
// We don't check error since parseScript returns the parsed-up-to-error
|
|
|
|
// list of pops.
|
|
|
|
pops, _ := parseScript(script)
|
2013-06-20 19:07:44 +02:00
|
|
|
|
2013-07-25 15:27:58 +02:00
|
|
|
return getSigOpCount(pops, false)
|
2013-06-20 19:07:44 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// GetPreciseSigOpCount returns the number of signature operations in
|
|
|
|
// scriptPubKey. If bip16 is true then scriptSig may be searched for the
|
|
|
|
// Pay-To-Script-Hash script in order to find the precise number of signature
|
2013-07-31 02:31:27 +02:00
|
|
|
// operations in the transaction. If the script fails to parse, then the
|
2013-07-25 16:40:11 +02:00
|
|
|
// count up to the point of failure is returned.
|
2013-07-25 15:27:58 +02:00
|
|
|
func GetPreciseSigOpCount(scriptSig, scriptPubKey []byte, bip16 bool) int {
|
2013-07-25 16:40:11 +02:00
|
|
|
// We don't check error since parseScript returns the parsed-up-to-error
|
|
|
|
// list of pops.
|
|
|
|
pops, _ := parseScript(scriptPubKey)
|
2013-06-20 19:07:44 +02:00
|
|
|
// non P2SH transactions just treated as normal.
|
|
|
|
if !(bip16 && isScriptHash(pops)) {
|
2013-07-25 15:27:58 +02:00
|
|
|
return getSigOpCount(pops, true)
|
2013-06-20 19:07:44 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// Ok so this is P2SH, get the contained script and count it..
|
|
|
|
|
|
|
|
sigPops, err := parseScript(scriptSig)
|
|
|
|
if err != nil {
|
2013-07-25 15:27:58 +02:00
|
|
|
return 0
|
2013-06-20 19:07:44 +02:00
|
|
|
}
|
|
|
|
if !isPushOnly(sigPops) || len(sigPops) == 0 {
|
2013-07-25 15:27:58 +02:00
|
|
|
return 0
|
2013-06-20 19:07:44 +02:00
|
|
|
}
|
|
|
|
|
2013-06-21 02:33:56 +02:00
|
|
|
shScript := sigPops[len(sigPops)-1].data
|
2013-06-20 19:07:44 +02:00
|
|
|
// Means that sigPops is jus OP_1 - OP_16, no sigops there.
|
|
|
|
if shScript == nil {
|
2013-07-25 15:27:58 +02:00
|
|
|
return 0
|
2013-06-20 19:07:44 +02:00
|
|
|
}
|
|
|
|
|
2013-07-25 16:40:11 +02:00
|
|
|
shPops, _ := parseScript(shScript)
|
2013-06-20 19:07:44 +02:00
|
|
|
|
2013-07-25 15:27:58 +02:00
|
|
|
return getSigOpCount(shPops, true)
|
2013-06-20 19:07:44 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// getSigOpCount is the implementation function for counting the number of
|
|
|
|
// signature operations in the script provided by pops. If precise mode is
|
|
|
|
// requested then we attempt to count the number of operations for a multisig
|
|
|
|
// op. Otherwise we use the maximum.
|
|
|
|
func getSigOpCount(pops []parsedOpcode, precise bool) int {
|
|
|
|
nSigs := 0
|
|
|
|
for i, pop := range pops {
|
|
|
|
switch pop.opcode.value {
|
|
|
|
case OP_CHECKSIG:
|
2013-06-21 02:33:56 +02:00
|
|
|
fallthrough
|
2013-06-20 19:07:44 +02:00
|
|
|
case OP_CHECKSIGVERIFY:
|
|
|
|
nSigs++
|
2014-01-04 22:13:29 +01:00
|
|
|
case OP_CHECKMULTISIG:
|
2013-06-21 02:33:56 +02:00
|
|
|
fallthrough
|
2013-06-20 19:07:44 +02:00
|
|
|
case OP_CHECKMULTISIGVERIFY:
|
|
|
|
// If we are being precise then look for familiar
|
|
|
|
// patterns for multisig, for now all we recognise is
|
2013-06-21 02:33:56 +02:00
|
|
|
// OP_1 - OP_16 to signify the number of pubkeys.
|
2013-06-20 19:07:44 +02:00
|
|
|
// Otherwise, we use the max of 20.
|
|
|
|
if precise && i > 0 &&
|
2013-06-21 02:33:56 +02:00
|
|
|
pops[i-1].opcode.value >= OP_1 &&
|
|
|
|
pops[i-1].opcode.value <= OP_16 {
|
|
|
|
nSigs += int(pops[i-1].opcode.value -
|
2013-06-20 19:07:44 +02:00
|
|
|
(OP_1 - 1))
|
|
|
|
} else {
|
|
|
|
nSigs += MaxPubKeysPerMultiSig
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
// not a sigop.
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return nSigs
|
|
|
|
}
|
2013-09-10 17:39:29 +02:00
|
|
|
|
2014-02-20 18:39:03 +01:00
|
|
|
// payToPubKeyHashScript creates a new script to pay a transaction
|
|
|
|
// output to a 20-byte pubkey hash. It is expected that the input is a valid
|
|
|
|
// hash.
|
|
|
|
func payToPubKeyHashScript(pubKeyHash []byte) []byte {
|
2014-02-20 18:42:06 +01:00
|
|
|
return NewScriptBuilder().AddOp(OP_DUP).AddOp(OP_HASH160).
|
|
|
|
AddData(pubKeyHash).AddOp(OP_EQUALVERIFY).AddOp(OP_CHECKSIG).
|
2014-02-20 18:39:03 +01:00
|
|
|
Script()
|
2013-09-10 17:39:29 +02:00
|
|
|
}
|
|
|
|
|
2014-02-20 18:39:03 +01:00
|
|
|
// payToScriptHashScript creates a new script to pay a transaction output to a
|
|
|
|
// script hash. It is expected that the input is a valid hash.
|
|
|
|
func payToScriptHashScript(scriptHash []byte) []byte {
|
2014-02-20 18:42:06 +01:00
|
|
|
return NewScriptBuilder().AddOp(OP_HASH160).AddData(scriptHash).
|
2014-02-21 09:09:55 +01:00
|
|
|
AddOp(OP_EQUAL).Script()
|
2014-01-03 20:35:31 +01:00
|
|
|
}
|
|
|
|
|
2014-02-20 19:37:42 +01:00
|
|
|
// payToPubkeyScript creates a new script to pay a transaction output to a
|
|
|
|
// public key. It is expected that the input is a valid pubkey.
|
|
|
|
func payToPubKeyScript(serializedPubKey []byte) []byte {
|
|
|
|
return NewScriptBuilder().AddData(serializedPubKey).
|
2014-02-21 09:09:55 +01:00
|
|
|
AddOp(OP_CHECKSIG).Script()
|
2014-02-20 19:37:42 +01:00
|
|
|
}
|
|
|
|
|
2014-01-03 20:35:31 +01:00
|
|
|
// PayToAddrScript creates a new script to pay a transaction output to a the
|
2014-02-20 19:37:42 +01:00
|
|
|
// specified address.
|
2014-01-03 20:35:31 +01:00
|
|
|
func PayToAddrScript(addr btcutil.Address) ([]byte, error) {
|
|
|
|
switch addr := addr.(type) {
|
|
|
|
case *btcutil.AddressPubKeyHash:
|
|
|
|
if addr == nil {
|
|
|
|
return nil, ErrUnsupportedAddress
|
|
|
|
}
|
2014-02-20 18:39:03 +01:00
|
|
|
return payToPubKeyHashScript(addr.ScriptAddress()), nil
|
2014-01-03 20:35:31 +01:00
|
|
|
|
|
|
|
case *btcutil.AddressScriptHash:
|
|
|
|
if addr == nil {
|
|
|
|
return nil, ErrUnsupportedAddress
|
|
|
|
}
|
2014-02-20 18:39:03 +01:00
|
|
|
return payToScriptHashScript(addr.ScriptAddress()), nil
|
2014-02-20 19:37:42 +01:00
|
|
|
|
|
|
|
case *btcutil.AddressPubKey:
|
|
|
|
if addr == nil {
|
|
|
|
return nil, ErrUnsupportedAddress
|
|
|
|
}
|
|
|
|
return payToPubKeyScript(addr.ScriptAddress()), nil
|
2014-01-03 20:35:31 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
return nil, ErrUnsupportedAddress
|
|
|
|
}
|
|
|
|
|
2014-02-21 01:20:24 +01:00
|
|
|
// ErrBadNumRequired is returned from MultiSigScript when nrequired is larger
|
|
|
|
// than the number of provided public keys.
|
2014-02-21 09:09:55 +01:00
|
|
|
var ErrBadNumRequired = errors.New("more signatures required than keys present")
|
2014-02-21 01:20:24 +01:00
|
|
|
|
|
|
|
// MultiSigScript returns a valid script for a multisignature redemption where
|
|
|
|
// nrequired of the keys in pubkeys are required to have signed the transaction
|
|
|
|
// for success. An ErrBadNumRequired will be returned if nrequired is larger than
|
|
|
|
// the number of keys provided.
|
|
|
|
func MultiSigScript(pubkeys []*btcutil.AddressPubKey, nrequired int) ([]byte, error) {
|
|
|
|
if len(pubkeys) < nrequired {
|
|
|
|
return nil, ErrBadNumRequired
|
|
|
|
}
|
|
|
|
|
|
|
|
builder := NewScriptBuilder().AddInt64(int64(nrequired))
|
2014-02-21 09:09:55 +01:00
|
|
|
for _, key := range pubkeys {
|
2014-02-21 01:20:24 +01:00
|
|
|
builder.AddData(key.ScriptAddress())
|
|
|
|
}
|
|
|
|
builder.AddInt64(int64(len(pubkeys)))
|
|
|
|
builder.AddOp(OP_CHECKMULTISIG)
|
|
|
|
|
|
|
|
return builder.Script(), nil
|
|
|
|
}
|
|
|
|
|
2013-09-10 17:39:29 +02:00
|
|
|
// SignatureScript creates an input signature script for tx to spend
|
|
|
|
// BTC sent from a previous output to the owner of privkey. tx must
|
|
|
|
// include all transaction inputs and outputs, however txin scripts are
|
|
|
|
// allowed to be filled or empty. The returned script is calculated to
|
|
|
|
// be used as the idx'th txin sigscript for tx. subscript is the PkScript
|
|
|
|
// of the previous output being used as the idx'th input. privkey is
|
|
|
|
// serialized in either a compressed or uncompressed format based on
|
|
|
|
// compress. This format must match the same format used to generate
|
|
|
|
// the payment address, or the script validation will fail.
|
|
|
|
func SignatureScript(tx *btcwire.MsgTx, idx int, subscript []byte, hashType byte, privkey *ecdsa.PrivateKey, compress bool) ([]byte, error) {
|
|
|
|
return signatureScriptCustomReader(rand.Reader, tx, idx, subscript,
|
|
|
|
hashType, privkey, compress)
|
|
|
|
}
|
|
|
|
|
|
|
|
// This function exists so we can test ecdsa.Sign's error for an invalid
|
|
|
|
// reader.
|
|
|
|
func signatureScriptCustomReader(reader io.Reader, tx *btcwire.MsgTx, idx int,
|
|
|
|
subscript []byte, hashType byte, privkey *ecdsa.PrivateKey,
|
|
|
|
compress bool) ([]byte, error) {
|
|
|
|
|
|
|
|
parsedScript, err := parseScript(subscript)
|
|
|
|
if err != nil {
|
|
|
|
return nil, fmt.Errorf("cannot parse output script: %v", err)
|
|
|
|
}
|
|
|
|
hash := calcScriptHash(parsedScript, hashType, tx, idx)
|
|
|
|
r, s, err := ecdsa.Sign(reader, privkey, hash)
|
|
|
|
if err != nil {
|
|
|
|
return nil, fmt.Errorf("cannot sign tx input: %s", err)
|
|
|
|
}
|
2013-12-23 18:03:09 +01:00
|
|
|
ecSig := btcec.Signature{R: r, S: s}
|
|
|
|
sig := append(ecSig.Serialize(), hashType)
|
2013-09-10 17:39:29 +02:00
|
|
|
|
|
|
|
pk := (*btcec.PublicKey)(&privkey.PublicKey)
|
2014-02-20 18:39:03 +01:00
|
|
|
var pkData []byte
|
2013-09-10 17:39:29 +02:00
|
|
|
if compress {
|
2014-02-20 18:39:03 +01:00
|
|
|
pkData = pk.SerializeCompressed()
|
2013-09-10 17:39:29 +02:00
|
|
|
} else {
|
2014-02-20 18:39:03 +01:00
|
|
|
pkData = pk.SerializeUncompressed()
|
2013-09-10 17:39:29 +02:00
|
|
|
}
|
2014-02-20 18:39:03 +01:00
|
|
|
|
2014-02-20 18:42:06 +01:00
|
|
|
return NewScriptBuilder().AddData(sig).AddData(pkData).Script(), nil
|
2013-09-10 17:39:29 +02:00
|
|
|
}
|
|
|
|
|
2013-10-09 01:13:52 +02:00
|
|
|
// expectedInputs returns the number of arguments required by a script.
|
|
|
|
// If the script is of unnown type such that the number can not be determined
|
2014-02-20 18:19:48 +01:00
|
|
|
// then -1 is returned. We are an internal function and thus assume that class
|
2013-10-09 01:13:52 +02:00
|
|
|
// is the real class of pops (and we can thus assume things that were
|
|
|
|
// determined while finding out the type).
|
|
|
|
func expectedInputs(pops []parsedOpcode, class ScriptClass) int {
|
|
|
|
// count needed inputs.
|
|
|
|
switch class {
|
|
|
|
case PubKeyTy:
|
|
|
|
return 1
|
|
|
|
case PubKeyHashTy:
|
|
|
|
return 2
|
|
|
|
case ScriptHashTy:
|
|
|
|
// Not including script, handled below.
|
|
|
|
return 1
|
|
|
|
case MultiSigTy:
|
|
|
|
// Standard multisig has a push a small number for the number
|
|
|
|
// of sigs and number of keys.
|
2014-02-19 23:17:02 +01:00
|
|
|
// Check the first push instruction to see how many arguments
|
|
|
|
// are expected. typeOfScript already checked this so we know
|
|
|
|
// it'll be a small int.
|
|
|
|
return asSmallInt(pops[0].opcode)
|
2013-11-14 22:05:20 +01:00
|
|
|
case NullDataTy:
|
|
|
|
fallthrough
|
2013-10-09 01:13:52 +02:00
|
|
|
default:
|
|
|
|
return -1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
type ScriptInfo struct {
|
|
|
|
// The class of the sigscript, equivalent to calling GetScriptClass
|
|
|
|
// on the sigScript.
|
|
|
|
PkScriptClass ScriptClass
|
|
|
|
// the number of inputs provided by the pkScript
|
|
|
|
NumInputs int
|
|
|
|
// the number of outputs required by sigScript and any
|
|
|
|
// pay-to-script-hash scripts. The number will be -1 if unknown.
|
|
|
|
ExpectedInputs int
|
|
|
|
// The nubmer of signature operations in the scriptpair.
|
|
|
|
SigOps int
|
|
|
|
}
|
|
|
|
|
|
|
|
// CalcScriptInfo returns a structure providing data about the scriptpair that
|
|
|
|
// are provided as arguments. It will error if the pair is in someway invalid
|
2014-01-06 19:14:43 +01:00
|
|
|
// such that they can not be analysed, i.e. if they do not parse or the
|
2013-10-09 01:13:52 +02:00
|
|
|
// pkScript is not a push-only script
|
|
|
|
func CalcScriptInfo(sigscript, pkscript []byte, bip16 bool) (*ScriptInfo, error) {
|
|
|
|
si := new(ScriptInfo)
|
|
|
|
// parse both scripts.
|
|
|
|
sigPops, err := parseScript(sigscript)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
pkPops, err := parseScript(pkscript)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
// push only sigScript makes little sense.
|
|
|
|
si.PkScriptClass = typeOfScript(pkPops)
|
|
|
|
|
|
|
|
// Can't have a pkScript that doesn't just push data.
|
|
|
|
if !isPushOnly(sigPops) {
|
|
|
|
return nil, StackErrNonPushOnly
|
|
|
|
}
|
|
|
|
|
|
|
|
si.ExpectedInputs = expectedInputs(pkPops, si.PkScriptClass)
|
|
|
|
// all entries push to stack (or are OP_RESERVED and exec will fail).
|
|
|
|
si.NumInputs = len(sigPops)
|
|
|
|
|
|
|
|
if si.PkScriptClass == ScriptHashTy && bip16 {
|
|
|
|
// grab the last push instruction in the script and pull out the
|
|
|
|
// data.
|
|
|
|
script := sigPops[len(sigPops)-1].data
|
|
|
|
// check for existance and error else.
|
|
|
|
shPops, err := parseScript(script)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
shClass := typeOfScript(shPops)
|
|
|
|
|
|
|
|
shInputs := expectedInputs(shPops, shClass)
|
|
|
|
if shInputs == -1 {
|
|
|
|
// We have no fucking clue, then.
|
|
|
|
si.ExpectedInputs = -1
|
|
|
|
} else {
|
|
|
|
si.ExpectedInputs += shInputs
|
|
|
|
}
|
|
|
|
si.SigOps = getSigOpCount(shPops, true)
|
|
|
|
} else {
|
|
|
|
si.SigOps = getSigOpCount(pkPops, true)
|
|
|
|
}
|
|
|
|
|
|
|
|
return si, nil
|
|
|
|
}
|
2013-11-14 18:14:25 +01:00
|
|
|
|
2014-02-19 23:17:02 +01:00
|
|
|
// asSmallInt returns the passed opcode, which must be true according to
|
|
|
|
// isSmallInt(), as an integer.
|
|
|
|
func asSmallInt(op *opcode) int {
|
|
|
|
if op.value == OP_0 {
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
|
|
|
|
return int(op.value - (OP_1 - 1))
|
|
|
|
}
|
|
|
|
|
2013-11-14 18:14:25 +01:00
|
|
|
// CalcMultiSigStats returns the number of public keys and signatures from
|
|
|
|
// a multi-signature transaction script. The passed script MUST already be
|
|
|
|
// known to be a multi-signature script.
|
|
|
|
func CalcMultiSigStats(script []byte) (int, int, error) {
|
|
|
|
pops, err := parseScript(script)
|
|
|
|
if err != nil {
|
|
|
|
return 0, 0, err
|
|
|
|
}
|
|
|
|
|
|
|
|
// A multi-signature script is of the pattern:
|
|
|
|
// NUM_SIGS PUBKEY PUBKEY PUBKEY... NUM_PUBKEYS OP_CHECKMULTISIG
|
|
|
|
// Therefore the number of signatures is the oldest item on the stack
|
|
|
|
// and the number of pubkeys is the 2nd to last. Also, the absolute
|
|
|
|
// minimum for a multi-signature script is 1 pubkey, so at least 4
|
|
|
|
// items must be on the stack per:
|
|
|
|
// OP_1 PUBKEY OP_1 OP_CHECKMULTISIG
|
|
|
|
if len(pops) < 4 {
|
|
|
|
return 0, 0, StackErrUnderflow
|
|
|
|
}
|
|
|
|
|
2014-02-19 23:17:02 +01:00
|
|
|
numSigs := asSmallInt(pops[0].opcode)
|
|
|
|
numPubKeys := asSmallInt(pops[len(pops)-2].opcode)
|
2013-11-14 18:14:25 +01:00
|
|
|
return numPubKeys, numSigs, nil
|
|
|
|
}
|