core/vm, tests: implemented semi-jit vm

* changed stack and removed stack ptr. Let go decide on slice reuse.

9 files changed, 1356 insertions, 64 deletions

diff --git a/core/vm/context.go b/core/vm/context.go
index 162666ef2..d17934ba5 100644
--- a/core/vm/context.go
+++ b/core/vm/context.go
@@ -35,6 +35,7 @@ type Context struct {
 	jumpdests destinations // result of JUMPDEST analysis.
 
 	Code     []byte
+	Input    []byte
 	CodeAddr *common.Address
 
 	value, Gas, UsedGas, Price *big.Int
diff --git a/core/vm/contracts.go b/core/vm/contracts.go
index 2d70f173e..b965fa095 100644
--- a/core/vm/contracts.go
+++ b/core/vm/contracts.go
@@ -94,7 +94,7 @@ func ecrecoverFunc(in []byte) []byte {
 	v := byte(vbig.Uint64())
 
 	if !crypto.ValidateSignatureValues(v, r, s) {
-		glog.V(logger.Error).Infof("EC RECOVER FAIL: v, r or s value invalid")
+		glog.V(logger.Debug).Infof("EC RECOVER FAIL: v, r or s value invalid")
 		return nil
 	}
 
diff --git a/core/vm/gas.go b/core/vm/gas.go
index af2e586a7..b2f068e6e 100644
--- a/core/vm/gas.go
+++ b/core/vm/gas.go
@@ -54,8 +54,8 @@ func baseCheck(op OpCode, stack *stack, gas *big.Int) error {
 			return err
 		}
 
-		if r.stackPush > 0 && len(stack.data)-r.stackPop+r.stackPush > int(params.StackLimit.Int64())+1 {
-			return fmt.Errorf("stack limit reached %d (%d)", len(stack.data), params.StackLimit.Int64())
+		if r.stackPush > 0 && stack.len()-r.stackPop+r.stackPush > int(params.StackLimit.Int64()) {
+			return fmt.Errorf("stack limit reached %d (%d)", stack.len(), params.StackLimit.Int64())
 		}
 
 		gas.Add(gas, r.gas)
diff --git a/core/vm/instructions.go b/core/vm/instructions.go
new file mode 100644
index 000000000..7793ff169
--- /dev/null
+++ b/core/vm/instructions.go
@@ -0,0 +1,587 @@
+// Copyright 2014 The go-ethereum Authors
+// This file is part of the go-ethereum library.
+//
+// The go-ethereum library is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// The go-ethereum library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+// GNU Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
+package vm
+
+import (
+	"math/big"
+
+	"github.com/ethereum/go-ethereum/common"
+	"github.com/ethereum/go-ethereum/core/state"
+	"github.com/ethereum/go-ethereum/crypto"
+	"github.com/ethereum/go-ethereum/params"
+)
+
+type instrFn func(instr instruction, env Environment, context *Context, memory *Memory, stack *stack)
+type instrExFn func(instr instruction, ret *big.Int, env Environment, context *Context, memory *Memory, stack *stack)
+
+type instruction struct {
+	op     OpCode
+	pc     uint64
+	fn     instrFn
+	specFn instrExFn
+	data   *big.Int
+
+	gas   *big.Int
+	spop  int
+	spush int
+}
+
+func opStaticJump(instr instruction, ret *big.Int, env Environment, context *Context, memory *Memory, stack *stack) {
+	ret.Set(instr.data)
+}
+
+func opAdd(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	x, y := stack.pop(), stack.pop()
+
+	stack.push(U256(new(big.Int).Add(x, y)))
+}
+
+func opSub(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	x, y := stack.pop(), stack.pop()
+
+	stack.push(U256(new(big.Int).Sub(x, y)))
+}
+
+func opMul(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	x, y := stack.pop(), stack.pop()
+
+	stack.push(U256(new(big.Int).Mul(x, y)))
+}
+
+func opDiv(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	base := new(big.Int)
+	x, y := stack.pop(), stack.pop()
+
+	if y.Cmp(common.Big0) != 0 {
+		base.Div(x, y)
+	}
+
+	// pop result back on the stack
+	stack.push(U256(base))
+}
+
+func opSdiv(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	base := new(big.Int)
+	x, y := S256(stack.pop()), S256(stack.pop())
+
+	if y.Cmp(common.Big0) == 0 {
+		base.Set(common.Big0)
+	} else {
+		n := new(big.Int)
+		if new(big.Int).Mul(x, y).Cmp(common.Big0) < 0 {
+			n.SetInt64(-1)
+		} else {
+			n.SetInt64(1)
+		}
+
+		base.Div(x.Abs(x), y.Abs(y)).Mul(base, n)
+
+		U256(base)
+	}
+
+	stack.push(base)
+}
+
+func opMod(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	base := new(big.Int)
+	x, y := stack.pop(), stack.pop()
+
+	if y.Cmp(common.Big0) == 0 {
+		base.Set(common.Big0)
+	} else {
+		base.Mod(x, y)
+	}
+
+	U256(base)
+
+	stack.push(base)
+}
+
+func opSmod(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	base := new(big.Int)
+	x, y := S256(stack.pop()), S256(stack.pop())
+
+	if y.Cmp(common.Big0) == 0 {
+		base.Set(common.Big0)
+	} else {
+		n := new(big.Int)
+		if x.Cmp(common.Big0) < 0 {
+			n.SetInt64(-1)
+		} else {
+			n.SetInt64(1)
+		}
+
+		base.Mod(x.Abs(x), y.Abs(y)).Mul(base, n)
+
+		U256(base)
+	}
+
+	stack.push(base)
+}
+
+func opExp(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	base := new(big.Int)
+	x, y := stack.pop(), stack.pop()
+
+	base.Exp(x, y, Pow256)
+
+	U256(base)
+
+	stack.push(base)
+}
+
+func opSignExtend(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	back := stack.pop()
+	if back.Cmp(big.NewInt(31)) < 0 {
+		bit := uint(back.Uint64()*8 + 7)
+		num := stack.pop()
+		mask := new(big.Int).Lsh(common.Big1, bit)
+		mask.Sub(mask, common.Big1)
+		if common.BitTest(num, int(bit)) {
+			num.Or(num, mask.Not(mask))
+		} else {
+			num.And(num, mask)
+		}
+
+		num = U256(num)
+
+		stack.push(num)
+	}
+}
+
+func opNot(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(U256(new(big.Int).Not(stack.pop())))
+}
+
+func opLt(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	x, y := stack.pop(), stack.pop()
+
+	// x < y
+	if x.Cmp(y) < 0 {
+		stack.push(common.BigTrue)
+	} else {
+		stack.push(common.BigFalse)
+	}
+}
+
+func opGt(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	x, y := stack.pop(), stack.pop()
+
+	// x > y
+	if x.Cmp(y) > 0 {
+		stack.push(common.BigTrue)
+	} else {
+		stack.push(common.BigFalse)
+	}
+}
+
+func opSlt(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	x, y := S256(stack.pop()), S256(stack.pop())
+
+	// x < y
+	if x.Cmp(S256(y)) < 0 {
+		stack.push(common.BigTrue)
+	} else {
+		stack.push(common.BigFalse)
+	}
+}
+
+func opSgt(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	x, y := S256(stack.pop()), S256(stack.pop())
+
+	// x > y
+	if x.Cmp(y) > 0 {
+		stack.push(common.BigTrue)
+	} else {
+		stack.push(common.BigFalse)
+	}
+}
+
+func opEq(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	x, y := stack.pop(), stack.pop()
+
+	// x == y
+	if x.Cmp(y) == 0 {
+		stack.push(common.BigTrue)
+	} else {
+		stack.push(common.BigFalse)
+	}
+}
+
+func opIszero(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	x := stack.pop()
+	if x.Cmp(common.BigFalse) > 0 {
+		stack.push(common.BigFalse)
+	} else {
+		stack.push(common.BigTrue)
+	}
+}
+
+func opAnd(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	x, y := stack.pop(), stack.pop()
+
+	stack.push(new(big.Int).And(x, y))
+}
+func opOr(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	x, y := stack.pop(), stack.pop()
+
+	stack.push(new(big.Int).Or(x, y))
+}
+func opXor(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	x, y := stack.pop(), stack.pop()
+
+	stack.push(new(big.Int).Xor(x, y))
+}
+func opByte(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	base := new(big.Int)
+	th, val := stack.pop(), stack.pop()
+
+	if th.Cmp(big.NewInt(32)) < 0 {
+		byt := big.NewInt(int64(common.LeftPadBytes(val.Bytes(), 32)[th.Int64()]))
+
+		base.Set(byt)
+	} else {
+		base.Set(common.BigFalse)
+	}
+
+	stack.push(base)
+}
+func opAddmod(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	base := new(big.Int)
+	x := stack.pop()
+	y := stack.pop()
+	z := stack.pop()
+
+	if z.Cmp(Zero) > 0 {
+		add := new(big.Int).Add(x, y)
+		base.Mod(add, z)
+
+		base = U256(base)
+	}
+
+	stack.push(base)
+}
+func opMulmod(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	base := new(big.Int)
+	x := stack.pop()
+	y := stack.pop()
+	z := stack.pop()
+
+	if z.Cmp(Zero) > 0 {
+		mul := new(big.Int).Mul(x, y)
+		base.Mod(mul, z)
+
+		U256(base)
+	}
+
+	stack.push(base)
+}
+
+func opSha3(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	offset, size := stack.pop(), stack.pop()
+	hash := crypto.Sha3(memory.Get(offset.Int64(), size.Int64()))
+
+	stack.push(common.BigD(hash))
+}
+
+func opAddress(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(common.Bytes2Big(context.Address().Bytes()))
+}
+
+func opBalance(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	addr := common.BigToAddress(stack.pop())
+	balance := env.State().GetBalance(addr)
+
+	stack.push(new(big.Int).Set(balance))
+}
+
+func opOrigin(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(env.Origin().Big())
+}
+
+func opCaller(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(common.Bytes2Big(context.caller.Address().Bytes()))
+}
+
+func opCallValue(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(new(big.Int).Set(context.value))
+}
+
+func opCalldataLoad(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(common.Bytes2Big(getData(context.Input, stack.pop(), common.Big32)))
+}
+
+func opCalldataSize(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(big.NewInt(int64(len(context.Input))))
+}
+
+func opCalldataCopy(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	var (
+		mOff = stack.pop()
+		cOff = stack.pop()
+		l    = stack.pop()
+	)
+	memory.Set(mOff.Uint64(), l.Uint64(), getData(context.Input, cOff, l))
+}
+
+func opExtCodeSize(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	addr := common.BigToAddress(stack.pop())
+	l := big.NewInt(int64(len(env.State().GetCode(addr))))
+	stack.push(l)
+}
+
+func opCodeSize(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	l := big.NewInt(int64(len(context.Code)))
+	stack.push(l)
+}
+
+func opCodeCopy(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	var (
+		mOff = stack.pop()
+		cOff = stack.pop()
+		l    = stack.pop()
+	)
+	codeCopy := getData(context.Code, cOff, l)
+
+	memory.Set(mOff.Uint64(), l.Uint64(), codeCopy)
+}
+
+func opExtCodeCopy(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	var (
+		addr = common.BigToAddress(stack.pop())
+		mOff = stack.pop()
+		cOff = stack.pop()
+		l    = stack.pop()
+	)
+	codeCopy := getData(env.State().GetCode(addr), cOff, l)
+
+	memory.Set(mOff.Uint64(), l.Uint64(), codeCopy)
+}
+
+func opGasprice(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(new(big.Int).Set(context.Price))
+}
+
+func opBlockhash(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	num := stack.pop()
+
+	n := new(big.Int).Sub(env.BlockNumber(), common.Big257)
+	if num.Cmp(n) > 0 && num.Cmp(env.BlockNumber()) < 0 {
+		stack.push(env.GetHash(num.Uint64()).Big())
+	} else {
+		stack.push(common.Big0)
+	}
+}
+
+func opCoinbase(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(env.Coinbase().Big())
+}
+
+func opTimestamp(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(new(big.Int).SetUint64(env.Time()))
+}
+
+func opNumber(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(U256(env.BlockNumber()))
+}
+
+func opDifficulty(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(new(big.Int).Set(env.Difficulty()))
+}
+
+func opGasLimit(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(new(big.Int).Set(env.GasLimit()))
+}
+
+func opPop(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.pop()
+}
+
+func opPush(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(new(big.Int).Set(instr.data))
+}
+
+func opDup(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.dup(int(instr.data.Int64()))
+}
+
+func opSwap(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.swap(int(instr.data.Int64()))
+}
+
+func opLog(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	n := int(instr.data.Int64())
+	topics := make([]common.Hash, n)
+	mStart, mSize := stack.pop(), stack.pop()
+	for i := 0; i < n; i++ {
+		topics[i] = common.BigToHash(stack.pop())
+	}
+
+	d := memory.Get(mStart.Int64(), mSize.Int64())
+	log := state.NewLog(context.Address(), topics, d, env.BlockNumber().Uint64())
+	env.AddLog(log)
+}
+
+func opMload(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	offset := stack.pop()
+	val := common.BigD(memory.Get(offset.Int64(), 32))
+	stack.push(val)
+}
+
+func opMstore(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	// pop value of the stack
+	mStart, val := stack.pop(), stack.pop()
+	memory.Set(mStart.Uint64(), 32, common.BigToBytes(val, 256))
+}
+
+func opMstore8(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	off, val := stack.pop().Int64(), stack.pop().Int64()
+	memory.store[off] = byte(val & 0xff)
+}
+
+func opSload(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	loc := common.BigToHash(stack.pop())
+	val := env.State().GetState(context.Address(), loc).Big()
+	stack.push(val)
+}
+
+func opSstore(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	loc := common.BigToHash(stack.pop())
+	val := stack.pop()
+
+	env.State().SetState(context.Address(), loc, common.BigToHash(val))
+}
+
+func opJump(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+}
+func opJumpi(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+}
+func opJumpdest(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+}
+
+func opPc(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(instr.data)
+}
+
+func opMsize(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(big.NewInt(int64(memory.Len())))
+}
+
+func opGas(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	stack.push(new(big.Int).Set(context.Gas))
+}
+
+func opCreate(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	var (
+		value        = stack.pop()
+		offset, size = stack.pop(), stack.pop()
+		input        = memory.Get(offset.Int64(), size.Int64())
+		gas          = new(big.Int).Set(context.Gas)
+		addr         common.Address
+	)
+
+	context.UseGas(context.Gas)
+	ret, suberr, ref := env.Create(context, input, gas, context.Price, value)
+	if suberr != nil {
+		stack.push(common.BigFalse)
+
+	} else {
+		// gas < len(ret) * Createinstr.dataGas == NO_CODE
+		dataGas := big.NewInt(int64(len(ret)))
+		dataGas.Mul(dataGas, params.CreateDataGas)
+		if context.UseGas(dataGas) {
+			ref.SetCode(ret)
+		}
+		addr = ref.Address()
+
+		stack.push(addr.Big())
+
+	}
+}
+
+func opCall(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	gas := stack.pop()
+	// pop gas and value of the stack.
+	addr, value := stack.pop(), stack.pop()
+	value = U256(value)
+	// pop input size and offset
+	inOffset, inSize := stack.pop(), stack.pop()
+	// pop return size and offset
+	retOffset, retSize := stack.pop(), stack.pop()
+
+	address := common.BigToAddress(addr)
+
+	// Get the arguments from the memory
+	args := memory.Get(inOffset.Int64(), inSize.Int64())
+
+	if len(value.Bytes()) > 0 {
+		gas.Add(gas, params.CallStipend)
+	}
+
+	ret, err := env.Call(context, address, args, gas, context.Price, value)
+
+	if err != nil {
+		stack.push(common.BigFalse)
+
+	} else {
+		stack.push(common.BigTrue)
+
+		memory.Set(retOffset.Uint64(), retSize.Uint64(), ret)
+	}
+}
+
+func opCallCode(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	gas := stack.pop()
+	// pop gas and value of the stack.
+	addr, value := stack.pop(), stack.pop()
+	value = U256(value)
+	// pop input size and offset
+	inOffset, inSize := stack.pop(), stack.pop()
+	// pop return size and offset
+	retOffset, retSize := stack.pop(), stack.pop()
+
+	address := common.BigToAddress(addr)
+
+	// Get the arguments from the memory
+	args := memory.Get(inOffset.Int64(), inSize.Int64())
+
+	if len(value.Bytes()) > 0 {
+		gas.Add(gas, params.CallStipend)
+	}
+
+	ret, err := env.CallCode(context, address, args, gas, context.Price, value)
+
+	if err != nil {
+		stack.push(common.BigFalse)
+
+	} else {
+		stack.push(common.BigTrue)
+
+		memory.Set(retOffset.Uint64(), retSize.Uint64(), ret)
+	}
+}
+
+func opReturn(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {}
+func opStop(instr instruction, env Environment, context *Context, memory *Memory, stack *stack)   {}
+
+func opSuicide(instr instruction, env Environment, context *Context, memory *Memory, stack *stack) {
+	receiver := env.State().GetOrNewStateObject(common.BigToAddress(stack.pop()))
+	balance := env.State().GetBalance(context.Address())
+
+	receiver.AddBalance(balance)
+
+	env.State().Delete(context.Address())
+}
diff --git a/core/vm/jit.go b/core/vm/jit.go
new file mode 100644
index 000000000..a77309223
--- /dev/null
+++ b/core/vm/jit.go
@@ -0,0 +1,537 @@
+// Copyright 2014 The go-ethereum Authors
+// This file is part of the go-ethereum library.
+//
+// The go-ethereum library is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// The go-ethereum library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+// GNU Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
+package vm
+
+import (
+	"fmt"
+	"math/big"
+	"sync/atomic"
+
+	"github.com/ethereum/go-ethereum/common"
+	"github.com/ethereum/go-ethereum/core/state"
+	"github.com/ethereum/go-ethereum/crypto"
+	"github.com/ethereum/go-ethereum/params"
+	"github.com/hashicorp/golang-lru"
+)
+
+type progStatus int32
+
+const (
+	progUnknown progStatus = iota
+	progCompile
+	progReady
+	progError
+)
+
+var programs *lru.Cache
+
+func init() {
+	programs, _ = lru.New(defaultJitMaxCache)
+}
+
+// SetJITCacheSize recreates the program cache with the max given size. Setting
+// a new cache is **not** thread safe. Use with caution.
+func SetJITCacheSize(size int) {
+	programs, _ = lru.New(size)
+}
+
+// GetProgram returns the program by id or nil when non-existant
+func GetProgram(id common.Hash) *Program {
+	if p, ok := programs.Get(id); ok {
+		return p.(*Program)
+	}
+
+	return nil
+}
+
+// GenProgramStatus returns the status of the given program id
+func GetProgramStatus(id common.Hash) progStatus {
+	program := GetProgram(id)
+	if program != nil {
+		return progStatus(atomic.LoadInt32(&program.status))
+	}
+
+	return progUnknown
+}
+
+// Program is a compiled program for the JIT VM and holds all required for
+// running a compiled JIT program.
+type Program struct {
+	Id     common.Hash // Id of the program
+	status int32       // status should be accessed atomically
+
+	context *Context
+
+	instructions []instruction       // instruction set
+	mapping      map[uint64]int      // real PC mapping to array indices
+	destinations map[uint64]struct{} // cached jump destinations
+
+	code []byte
+}
+
+func NewProgram(code []byte) *Program {
+	program := &Program{
+		Id:           crypto.Sha3Hash(code),
+		mapping:      make(map[uint64]int),
+		destinations: make(map[uint64]struct{}),
+		code:         code,
+	}
+
+	programs.Add(program.Id, program)
+	return program
+}
+
+func (p *Program) addInstr(op OpCode, pc uint64, fn instrFn, data *big.Int) {
+	// PUSH and DUP are a bit special. They all cost the same but we do want to have checking on stack push limit
+	// PUSH is also allowed to calculate the same price for all PUSHes
+	// DUP requirements are handled elsewhere (except for the stack limit check)
+	baseOp := op
+	if op >= PUSH1 && op <= PUSH32 {
+		baseOp = PUSH1
+	}
+	if op >= DUP1 && op <= DUP16 {
+		baseOp = DUP1
+	}
+	base := _baseCheck[baseOp]
+	instr := instruction{op, pc, fn, nil, data, base.gas, base.stackPop, base.stackPush}
+
+	p.instructions = append(p.instructions, instr)
+	p.mapping[pc] = len(p.instructions) - 1
+}
+
+func CompileProgram(program *Program) (err error) {
+	if progStatus(atomic.LoadInt32(&program.status)) == progCompile {
+		return nil
+	}
+	atomic.StoreInt32(&program.status, int32(progCompile))
+	defer func() {
+		if err != nil {
+			atomic.StoreInt32(&program.status, int32(progError))
+		} else {
+			atomic.StoreInt32(&program.status, int32(progReady))
+		}
+	}()
+
+	// loop thru the opcodes and "compile" in to instructions
+	for pc := uint64(0); pc < uint64(len(program.code)); pc++ {
+		switch op := OpCode(program.code[pc]); op {
+		case ADD:
+			program.addInstr(op, pc, opAdd, nil)
+		case SUB:
+			program.addInstr(op, pc, opSub, nil)
+		case MUL:
+			program.addInstr(op, pc, opMul, nil)
+		case DIV:
+			program.addInstr(op, pc, opDiv, nil)
+		case SDIV:
+			program.addInstr(op, pc, opSdiv, nil)
+		case MOD:
+			program.addInstr(op, pc, opMod, nil)
+		case SMOD:
+			program.addInstr(op, pc, opSmod, nil)
+		case EXP:
+			program.addInstr(op, pc, opExp, nil)
+		case SIGNEXTEND:
+			program.addInstr(op, pc, opSignExtend, nil)
+		case NOT:
+			program.addInstr(op, pc, opNot, nil)
+		case LT:
+			program.addInstr(op, pc, opLt, nil)
+		case GT:
+			program.addInstr(op, pc, opGt, nil)
+		case SLT:
+			program.addInstr(op, pc, opSlt, nil)
+		case SGT:
+			program.addInstr(op, pc, opSgt, nil)
+		case EQ:
+			program.addInstr(op, pc, opEq, nil)
+		case ISZERO:
+			program.addInstr(op, pc, opIszero, nil)
+		case AND:
+			program.addInstr(op, pc, opAnd, nil)
+		case OR:
+			program.addInstr(op, pc, opOr, nil)
+		case XOR:
+			program.addInstr(op, pc, opXor, nil)
+		case BYTE:
+			program.addInstr(op, pc, opByte, nil)
+		case ADDMOD:
+			program.addInstr(op, pc, opAddmod, nil)
+		case MULMOD:
+			program.addInstr(op, pc, opMulmod, nil)
+		case SHA3:
+			program.addInstr(op, pc, opSha3, nil)
+		case ADDRESS:
+			program.addInstr(op, pc, opAddress, nil)
+		case BALANCE:
+			program.addInstr(op, pc, opBalance, nil)
+		case ORIGIN:
+			program.addInstr(op, pc, opOrigin, nil)
+		case CALLER:
+			program.addInstr(op, pc, opCaller, nil)
+		case CALLVALUE:
+			program.addInstr(op, pc, opCallValue, nil)
+		case CALLDATALOAD:
+			program.addInstr(op, pc, opCalldataLoad, nil)
+		case CALLDATASIZE:
+			program.addInstr(op, pc, opCalldataSize, nil)
+		case CALLDATACOPY:
+			program.addInstr(op, pc, opCalldataCopy, nil)
+		case CODESIZE:
+			program.addInstr(op, pc, opCodeSize, nil)
+		case EXTCODESIZE:
+			program.addInstr(op, pc, opExtCodeSize, nil)
+		case CODECOPY:
+			program.addInstr(op, pc, opCodeCopy, nil)
+		case EXTCODECOPY:
+			program.addInstr(op, pc, opExtCodeCopy, nil)
+		case GASPRICE:
+			program.addInstr(op, pc, opGasprice, nil)
+		case BLOCKHASH:
+			program.addInstr(op, pc, opBlockhash, nil)
+		case COINBASE:
+			program.addInstr(op, pc, opCoinbase, nil)
+		case TIMESTAMP:
+			program.addInstr(op, pc, opTimestamp, nil)
+		case NUMBER:
+			program.addInstr(op, pc, opNumber, nil)
+		case DIFFICULTY:
+			program.addInstr(op, pc, opDifficulty, nil)
+		case GASLIMIT:
+			program.addInstr(op, pc, opGasLimit, nil)
+		case PUSH1, PUSH2, PUSH3, PUSH4, PUSH5, PUSH6, PUSH7, PUSH8, PUSH9, PUSH10, PUSH11, PUSH12, PUSH13, PUSH14, PUSH15, PUSH16, PUSH17, PUSH18, PUSH19, PUSH20, PUSH21, PUSH22, PUSH23, PUSH24, PUSH25, PUSH26, PUSH27, PUSH28, PUSH29, PUSH30, PUSH31, PUSH32:
+			size := uint64(op - PUSH1 + 1)
+			bytes := getData([]byte(program.code), new(big.Int).SetUint64(pc+1), new(big.Int).SetUint64(size))
+
+			program.addInstr(op, pc, opPush, common.Bytes2Big(bytes))
+
+			pc += size
+
+		case POP:
+			program.addInstr(op, pc, opPop, nil)
+		case DUP1, DUP2, DUP3, DUP4, DUP5, DUP6, DUP7, DUP8, DUP9, DUP10, DUP11, DUP12, DUP13, DUP14, DUP15, DUP16:
+			program.addInstr(op, pc, opDup, big.NewInt(int64(op-DUP1+1)))
+		case SWAP1, SWAP2, SWAP3, SWAP4, SWAP5, SWAP6, SWAP7, SWAP8, SWAP9, SWAP10, SWAP11, SWAP12, SWAP13, SWAP14, SWAP15, SWAP16:
+			program.addInstr(op, pc, opSwap, big.NewInt(int64(op-SWAP1+2)))
+		case LOG0, LOG1, LOG2, LOG3, LOG4:
+			program.addInstr(op, pc, opLog, big.NewInt(int64(op-LOG0)))
+		case MLOAD:
+			program.addInstr(op, pc, opMload, nil)
+		case MSTORE:
+			program.addInstr(op, pc, opMstore, nil)
+		case MSTORE8:
+			program.addInstr(op, pc, opMstore8, nil)
+		case SLOAD:
+			program.addInstr(op, pc, opSload, nil)
+		case SSTORE:
+			program.addInstr(op, pc, opSstore, nil)
+		case JUMP:
+			program.addInstr(op, pc, opJump, nil)
+		case JUMPI:
+			program.addInstr(op, pc, opJumpi, nil)
+		case JUMPDEST:
+			program.addInstr(op, pc, opJumpdest, nil)
+			program.destinations[pc] = struct{}{}
+		case PC:
+			program.addInstr(op, pc, opPc, big.NewInt(int64(pc)))
+		case MSIZE:
+			program.addInstr(op, pc, opMsize, nil)
+		case GAS:
+			program.addInstr(op, pc, opGas, nil)
+		case CREATE:
+			program.addInstr(op, pc, opCreate, nil)
+		case CALL:
+			program.addInstr(op, pc, opCall, nil)
+		case CALLCODE:
+			program.addInstr(op, pc, opCallCode, nil)
+		case RETURN:
+			program.addInstr(op, pc, opReturn, nil)
+		case SUICIDE:
+			program.addInstr(op, pc, opSuicide, nil)
+		case STOP: // Stop the context
+			program.addInstr(op, pc, opStop, nil)
+		default:
+			program.addInstr(op, pc, nil, nil)
+		}
+	}
+
+	return nil
+}
+
+func RunProgram(program *Program, env Environment, context *Context, input []byte) ([]byte, error) {
+	return runProgram(program, 0, NewMemory(), newstack(), env, context, input)
+}
+
+func runProgram(program *Program, pcstart uint64, mem *Memory, stack *stack, env Environment, context *Context, input []byte) ([]byte, error) {
+	context.Input = input
+
+	var (
+		caller      = context.caller
+		statedb     = env.State()
+		pc      int = program.mapping[pcstart]
+
+		jump = func(to *big.Int) error {
+			if !validDest(program.destinations, to) {
+				nop := context.GetOp(to.Uint64())
+				return fmt.Errorf("invalid jump destination (%v) %v", nop, to)
+			}
+
+			pc = program.mapping[to.Uint64()]
+
+			return nil
+		}
+	)
+
+	for pc < len(program.instructions) {
+		instr := program.instructions[pc]
+
+		// calculate the new memory size and gas price for the current executing opcode
+		newMemSize, cost, err := jitCalculateGasAndSize(env, context, caller, instr, statedb, mem, stack)
+		if err != nil {
+			return nil, err
+		}
+
+		// Use the calculated gas. When insufficient gas is present, use all gas and return an
+		// Out Of Gas error
+		if !context.UseGas(cost) {
+			return nil, OutOfGasError
+		}
+		// Resize the memory calculated previously
+		mem.Resize(newMemSize.Uint64())
+
+		// These opcodes return an argument and are thefor handled
+		// differently from the rest of the opcodes
+		switch instr.op {
+		case JUMP:
+			if err := jump(stack.pop()); err != nil {
+				return nil, err
+			}
+			continue
+		case JUMPI:
+			pos, cond := stack.pop(), stack.pop()
+
+			if cond.Cmp(common.BigTrue) >= 0 {
+				if err := jump(pos); err != nil {
+					return nil, err
+				}
+				continue
+			}
+		case RETURN:
+			offset, size := stack.pop(), stack.pop()
+			ret := mem.GetPtr(offset.Int64(), size.Int64())
+
+			return context.Return(ret), nil
+		case SUICIDE:
+			instr.fn(instr, env, context, mem, stack)
+
+			return context.Return(nil), nil
+		case STOP:
+			return context.Return(nil), nil
+		default:
+			if instr.fn == nil {
+				return nil, fmt.Errorf("Invalid opcode %x", instr.op)
+			}
+
+			instr.fn(instr, env, context, mem, stack)
+		}
+
+		pc++
+	}
+
+	return context.Return(nil), nil
+}
+
+// validDest checks if the given distination is a valid one given the
+// destination table of the program
+func validDest(dests map[uint64]struct{}, dest *big.Int) bool {
+	// PC cannot go beyond len(code) and certainly can't be bigger than 64bits.
+	// Don't bother checking for JUMPDEST in that case.
+	if dest.Cmp(bigMaxUint64) > 0 {
+		return false
+	}
+	_, ok := dests[dest.Uint64()]
+	return ok
+}
+
+// jitCalculateGasAndSize calculates the required given the opcode and stack items calculates the new memorysize for
+// the operation. This does not reduce gas or resizes the memory.
+func jitCalculateGasAndSize(env Environment, context *Context, caller ContextRef, instr instruction, statedb *state.StateDB, mem *Memory, stack *stack) (*big.Int, *big.Int, error) {
+	var (
+		gas                 = new(big.Int)
+		newMemSize *big.Int = new(big.Int)
+	)
+	err := jitBaseCheck(instr, stack, gas)
+	if err != nil {
+		return nil, nil, err
+	}
+
+	// stack Check, memory resize & gas phase
+	switch op := instr.op; op {
+	case SWAP1, SWAP2, SWAP3, SWAP4, SWAP5, SWAP6, SWAP7, SWAP8, SWAP9, SWAP10, SWAP11, SWAP12, SWAP13, SWAP14, SWAP15, SWAP16:
+		n := int(op - SWAP1 + 2)
+		err := stack.require(n)
+		if err != nil {
+			return nil, nil, err
+		}
+		gas.Set(GasFastestStep)
+	case DUP1, DUP2, DUP3, DUP4, DUP5, DUP6, DUP7, DUP8, DUP9, DUP10, DUP11, DUP12, DUP13, DUP14, DUP15, DUP16:
+		n := int(op - DUP1 + 1)
+		err := stack.require(n)
+		if err != nil {
+			return nil, nil, err
+		}
+		gas.Set(GasFastestStep)
+	case LOG0, LOG1, LOG2, LOG3, LOG4:
+		n := int(op - LOG0)
+		err := stack.require(n + 2)
+		if err != nil {
+			return nil, nil, err
+		}
+
+		mSize, mStart := stack.data[stack.len()-2], stack.data[stack.len()-1]
+
+		gas.Add(gas, params.LogGas)
+		gas.Add(gas, new(big.Int).Mul(big.NewInt(int64(n)), params.LogTopicGas))
+		gas.Add(gas, new(big.Int).Mul(mSize, params.LogDataGas))
+
+		newMemSize = calcMemSize(mStart, mSize)
+	case EXP:
+		gas.Add(gas, new(big.Int).Mul(big.NewInt(int64(len(stack.data[stack.len()-2].Bytes()))), params.ExpByteGas))
+	case SSTORE:
+		err := stack.require(2)
+		if err != nil {
+			return nil, nil, err
+		}
+
+		var g *big.Int
+		y, x := stack.data[stack.len()-2], stack.data[stack.len()-1]
+		val := statedb.GetState(context.Address(), common.BigToHash(x))
+
+		// This checks for 3 scenario's and calculates gas accordingly
+		// 1. From a zero-value address to a non-zero value         (NEW VALUE)
+		// 2. From a non-zero value address to a zero-value address (DELETE)
+		// 3. From a nen-zero to a non-zero                         (CHANGE)
+		if common.EmptyHash(val) && !common.EmptyHash(common.BigToHash(y)) {
+			// 0 => non 0
+			g = params.SstoreSetGas
+		} else if !common.EmptyHash(val) && common.EmptyHash(common.BigToHash(y)) {
+			statedb.Refund(params.SstoreRefundGas)
+
+			g = params.SstoreClearGas
+		} else {
+			// non 0 => non 0 (or 0 => 0)
+			g = params.SstoreClearGas
+		}
+		gas.Set(g)
+	case SUICIDE:
+		if !statedb.IsDeleted(context.Address()) {
+			statedb.Refund(params.SuicideRefundGas)
+		}
+	case MLOAD:
+		newMemSize = calcMemSize(stack.peek(), u256(32))
+	case MSTORE8:
+		newMemSize = calcMemSize(stack.peek(), u256(1))
+	case MSTORE:
+		newMemSize = calcMemSize(stack.peek(), u256(32))
+	case RETURN:
+		newMemSize = calcMemSize(stack.peek(), stack.data[stack.len()-2])
+	case SHA3:
+		newMemSize = calcMemSize(stack.peek(), stack.data[stack.len()-2])
+
+		words := toWordSize(stack.data[stack.len()-2])
+		gas.Add(gas, words.Mul(words, params.Sha3WordGas))
+	case CALLDATACOPY:
+		newMemSize = calcMemSize(stack.peek(), stack.data[stack.len()-3])
+
+		words := toWordSize(stack.data[stack.len()-3])
+		gas.Add(gas, words.Mul(words, params.CopyGas))
+	case CODECOPY:
+		newMemSize = calcMemSize(stack.peek(), stack.data[stack.len()-3])
+
+		words := toWordSize(stack.data[stack.len()-3])
+		gas.Add(gas, words.Mul(words, params.CopyGas))
+	case EXTCODECOPY:
+		newMemSize = calcMemSize(stack.data[stack.len()-2], stack.data[stack.len()-4])
+
+		words := toWordSize(stack.data[stack.len()-4])
+		gas.Add(gas, words.Mul(words, params.CopyGas))
+
+	case CREATE:
+		newMemSize = calcMemSize(stack.data[stack.len()-2], stack.data[stack.len()-3])
+	case CALL, CALLCODE:
+		gas.Add(gas, stack.data[stack.len()-1])
+
+		if op == CALL {
+			if env.State().GetStateObject(common.BigToAddress(stack.data[stack.len()-2])) == nil {
+				gas.Add(gas, params.CallNewAccountGas)
+			}
+		}
+
+		if len(stack.data[stack.len()-3].Bytes()) > 0 {
+			gas.Add(gas, params.CallValueTransferGas)
+		}
+
+		x := calcMemSize(stack.data[stack.len()-6], stack.data[stack.len()-7])
+		y := calcMemSize(stack.data[stack.len()-4], stack.data[stack.len()-5])
+
+		newMemSize = common.BigMax(x, y)
+	}
+
+	if newMemSize.Cmp(common.Big0) > 0 {
+		newMemSizeWords := toWordSize(newMemSize)
+		newMemSize.Mul(newMemSizeWords, u256(32))
+
+		if newMemSize.Cmp(u256(int64(mem.Len()))) > 0 {
+			oldSize := toWordSize(big.NewInt(int64(mem.Len())))
+			pow := new(big.Int).Exp(oldSize, common.Big2, Zero)
+			linCoef := new(big.Int).Mul(oldSize, params.MemoryGas)
+			quadCoef := new(big.Int).Div(pow, params.QuadCoeffDiv)
+			oldTotalFee := new(big.Int).Add(linCoef, quadCoef)
+
+			pow.Exp(newMemSizeWords, common.Big2, Zero)
+			linCoef = new(big.Int).Mul(newMemSizeWords, params.MemoryGas)
+			quadCoef = new(big.Int).Div(pow, params.QuadCoeffDiv)
+			newTotalFee := new(big.Int).Add(linCoef, quadCoef)
+
+			fee := new(big.Int).Sub(newTotalFee, oldTotalFee)
+			gas.Add(gas, fee)
+		}
+	}
+
+	return newMemSize, gas, nil
+}
+
+// jitBaseCheck is the same as baseCheck except it doesn't do the look up in the
+// gas table. This is done during compilation instead.
+func jitBaseCheck(instr instruction, stack *stack, gas *big.Int) error {
+	err := stack.require(instr.spop)
+	if err != nil {
+		return err
+	}
+
+	if instr.spush > 0 && stack.len()-instr.spop+instr.spush > int(params.StackLimit.Int64()) {
+		return fmt.Errorf("stack limit reached %d (%d)", stack.len(), params.StackLimit.Int64())
+	}
+
+	// nil on gas means no base calculation
+	if instr.gas == nil {
+		return nil
+	}
+
+	gas.Add(gas, instr.gas)
+
+	return nil
+}
diff --git a/core/vm/jit_test.go b/core/vm/jit_test.go
new file mode 100644
index 000000000..70432d47b
--- /dev/null
+++ b/core/vm/jit_test.go
@@ -0,0 +1,119 @@
+// Copyright 2014 The go-ethereum Authors
+// This file is part of the go-ethereum library.
+//
+// The go-ethereum library is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// The go-ethereum library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+// GNU Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
+package vm
+
+import (
+	"math/big"
+	"testing"
+	"time"
+
+	"github.com/ethereum/go-ethereum/common"
+	"github.com/ethereum/go-ethereum/core/state"
+	"github.com/ethereum/go-ethereum/crypto"
+	"github.com/ethereum/go-ethereum/ethdb"
+)
+
+const maxRun = 1000
+
+type vmBench struct {
+	precompile bool // compile prior to executing
+	nojit      bool // ignore jit (sets DisbaleJit = true
+	forcejit   bool // forces the jit, precompile is ignored
+
+	code  []byte
+	input []byte
+}
+
+func runVmBench(test vmBench, b *testing.B) {
+	db, _ := ethdb.NewMemDatabase()
+	sender := state.NewStateObject(common.Address{}, db)
+
+	if test.precompile && !test.forcejit {
+		NewProgram(test.code)
+	}
+	env := NewEnv()
+
+	DisableJit = test.nojit
+	ForceJit = test.forcejit
+
+	b.ResetTimer()
+
+	for i := 0; i < b.N; i++ {
+		context := NewContext(sender, sender, big.NewInt(100), big.NewInt(10000), big.NewInt(0))
+		context.Code = test.code
+		context.CodeAddr = &common.Address{}
+		_, err := New(env).Run(context, test.input)
+		if err != nil {
+			b.Error(err)
+			b.FailNow()
+		}
+	}
+}
+
+var benchmarks = map[string]vmBench{
+	"pushes": vmBench{
+		false, false, false,
+		common.Hex2Bytes("600a600a01600a600a01600a600a01600a600a01600a600a01600a600a01600a600a01600a600a01600a600a01600a600a01"), nil,
+	},
+}
+
+func BenchmarkPushes(b *testing.B) {
+	runVmBench(benchmarks["pushes"], b)
+}
+
+type Env struct {
+	gasLimit *big.Int
+	depth    int
+}
+
+func NewEnv() *Env {
+	return &Env{big.NewInt(10000), 0}
+}
+
+func (self *Env) Origin() common.Address { return common.Address{} }
+func (self *Env) BlockNumber() *big.Int  { return big.NewInt(0) }
+func (self *Env) AddStructLog(log StructLog) {
+}
+func (self *Env) StructLogs() []StructLog {
+	return nil
+}
+
+//func (self *Env) PrevHash() []byte      { return self.parent }
+func (self *Env) Coinbase() common.Address { return common.Address{} }
+func (self *Env) Time() uint64             { return uint64(time.Now().Unix()) }
+func (self *Env) Difficulty() *big.Int     { return big.NewInt(0) }
+func (self *Env) State() *state.StateDB    { return nil }
+func (self *Env) GasLimit() *big.Int       { return self.gasLimit }
+func (self *Env) VmType() Type             { return StdVmTy }
+func (self *Env) GetHash(n uint64) common.Hash {
+	return common.BytesToHash(crypto.Sha3([]byte(big.NewInt(int64(n)).String())))
+}
+func (self *Env) AddLog(log *state.Log) {
+}
+func (self *Env) Depth() int     { return self.depth }
+func (self *Env) SetDepth(i int) { self.depth = i }
+func (self *Env) Transfer(from, to Account, amount *big.Int) error {
+	return nil
+}
+func (self *Env) Call(caller ContextRef, addr common.Address, data []byte, gas, price, value *big.Int) ([]byte, error) {
+	return nil, nil
+}
+func (self *Env) CallCode(caller ContextRef, addr common.Address, data []byte, gas, price, value *big.Int) ([]byte, error) {
+	return nil, nil
+}
+func (self *Env) Create(caller ContextRef, data []byte, gas, price, value *big.Int) ([]byte, error, ContextRef) {
+	return nil, nil, nil
+}
diff --git a/core/vm/settings.go b/core/vm/settings.go
new file mode 100644
index 000000000..9e30d3add
--- /dev/null
+++ b/core/vm/settings.go
@@ -0,0 +1,24 @@
+// Copyright 2014 The go-ethereum Authors
+// This file is part of the go-ethereum library.
+//
+// The go-ethereum library is free software: you can redistribute it and/or modify
+// it under the terms of the GNU Lesser General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+//
+// The go-ethereum library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+// GNU Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public License
+// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
+package vm
+
+var (
+	DisableJit  bool // Disable the JIT VM
+	ForceJit    bool // Force the JIT, skip byte VM
+	MaxProgSize int  // Max cache size for JIT Programs
+)
+
+const defaultJitMaxCache int = 64
diff --git a/core/vm/stack.go b/core/vm/stack.go
index 3d669b2f2..23c109455 100644
--- a/core/vm/stack.go
+++ b/core/vm/stack.go
@@ -27,32 +27,27 @@ func newstack() *stack {
 
 type stack struct {
 	data []*big.Int
-	ptr  int
 }
 
 func (st *stack) Data() []*big.Int {
-	return st.data[:st.ptr]
+	return st.data
 }
 
 func (st *stack) push(d *big.Int) {
 	// NOTE push limit (1024) is checked in baseCheck
-	stackItem := new(big.Int).Set(d)
-	if len(st.data) > st.ptr {
-		st.data[st.ptr] = stackItem
-	} else {
-		st.data = append(st.data, stackItem)
-	}
-	st.ptr++
+	//stackItem := new(big.Int).Set(d)
+	//st.data = append(st.data, stackItem)
+	st.data = append(st.data, d)
 }
 
 func (st *stack) pop() (ret *big.Int) {
-	st.ptr--
-	ret = st.data[st.ptr]
+	ret = st.data[len(st.data)-1]
+	st.data = st.data[:len(st.data)-1]
 	return
 }
 
 func (st *stack) len() int {
-	return st.ptr
+	return len(st.data)
 }
 
 func (st *stack) swap(n int) {
@@ -60,7 +55,7 @@ func (st *stack) swap(n int) {
 }
 
 func (st *stack) dup(n int) {
-	st.push(st.data[st.len()-n])
+	st.push(new(big.Int).Set(st.data[st.len()-n]))
 }
 
 func (st *stack) peek() *big.Int {
diff --git a/core/vm/vm.go b/core/vm/vm.go
index 21e0a4665..c292b45d1 100644
--- a/core/vm/vm.go
+++ b/core/vm/vm.go
@@ -24,30 +24,19 @@ import (
 	"github.com/ethereum/go-ethereum/common"
 	"github.com/ethereum/go-ethereum/core/state"
 	"github.com/ethereum/go-ethereum/crypto"
+	"github.com/ethereum/go-ethereum/logger"
+	"github.com/ethereum/go-ethereum/logger/glog"
 	"github.com/ethereum/go-ethereum/params"
 )
 
 // Vm implements VirtualMachine
 type Vm struct {
 	env Environment
-
-	err error
-	// For logging
-	debug bool
-
-	BreakPoints []int64
-	Stepping    bool
-	Fn          string
-
-	Recoverable bool
-
-	// Will be called before the vm returns
-	After func(*Context, error)
 }
 
 // New returns a new Virtual Machine
 func New(env Environment) *Vm {
-	return &Vm{env: env, debug: Debug, Recoverable: true}
+	return &Vm{env: env}
 }
 
 // Run loops and evaluates the contract's code with the given input data
@@ -55,17 +44,67 @@ func (self *Vm) Run(context *Context, input []byte) (ret []byte, err error) {
 	self.env.SetDepth(self.env.Depth() + 1)
 	defer self.env.SetDepth(self.env.Depth() - 1)
 
+	// User defer pattern to check for an error and, based on the error being nil or not, use all gas and return.
+	defer func() {
+		if err != nil {
+			// In case of a VM exception (known exceptions) all gas consumed (panics NOT included).
+			context.UseGas(context.Gas)
+
+			ret = context.Return(nil)
+		}
+	}()
+
+	if context.CodeAddr != nil {
+		if p := Precompiled[context.CodeAddr.Str()]; p != nil {
+			return self.RunPrecompiled(p, input, context)
+		}
+	}
+
+	var (
+		codehash = crypto.Sha3Hash(context.Code) // codehash is used when doing jump dest caching
+		program  *Program
+	)
+	if !DisableJit {
+		// Fetch program status.
+		// * If ready run using JIT
+		// * If unknown, compile in a seperate goroutine
+		// * If forced wait for compilation and run once done
+		if status := GetProgramStatus(codehash); status == progReady {
+			return RunProgram(GetProgram(codehash), self.env, context, input)
+		} else if status == progUnknown {
+			if ForceJit {
+				// Create and compile program
+				program = NewProgram(context.Code)
+				perr := CompileProgram(program)
+				if perr == nil {
+					return RunProgram(program, self.env, context, input)
+				}
+				glog.V(logger.Info).Infoln("error compiling program", err)
+			} else {
+				// create and compile the program. Compilation
+				// is done in a seperate goroutine
+				program = NewProgram(context.Code)
+				go func() {
+					err := CompileProgram(program)
+					if err != nil {
+						glog.V(logger.Info).Infoln("error compiling program", err)
+						return
+					}
+				}()
+			}
+		}
+	}
+
 	var (
 		caller = context.caller
 		code   = context.Code
 		value  = context.value
 		price  = context.Price
 
-		op       OpCode                  // current opcode
-		codehash = crypto.Sha3Hash(code) // codehash is used when doing jump dest caching
-		mem      = NewMemory()           // bound memory
-		stack    = newstack()            // local stack
-		statedb  = self.env.State()      // current state
+		op      OpCode             // current opcode
+		mem     = NewMemory()      // bound memory
+		stack   = newstack()       // local stack
+		statedb = self.env.State() // current state
 		// For optimisation reason we're using uint64 as the program counter.
 		// It's theoretically possible to go above 2^64. The YP defines the PC to be uint256. Pratically much less so feasible.
 		pc = uint64(0) // program counter
@@ -89,32 +128,25 @@ func (self *Vm) Run(context *Context, input []byte) (ret []byte, err error) {
 
 	// User defer pattern to check for an error and, based on the error being nil or not, use all gas and return.
 	defer func() {
-		if self.After != nil {
-			self.After(context, err)
-		}
-
 		if err != nil {
 			self.log(pc, op, context.Gas, cost, mem, stack, context, err)
-
-			// In case of a VM exception (known exceptions) all gas consumed (panics NOT included).
-			context.UseGas(context.Gas)
-
-			ret = context.Return(nil)
 		}
 	}()
 
-	if context.CodeAddr != nil {
-		if p := Precompiled[context.CodeAddr.Str()]; p != nil {
-			return self.RunPrecompiled(p, input, context)
-		}
-	}
-
 	// Don't bother with the execution if there's no code.
 	if len(code) == 0 {
 		return context.Return(nil), nil
 	}
 
 	for {
+		// Overhead of the atomic read might not be worth it
+		/* TODO this still causes a few issues in the tests
+		if program != nil && progStatus(atomic.LoadInt32(&program.status)) == progReady {
+			// move execution
+			glog.V(logger.Info).Infoln("Moved execution to JIT")
+			return runProgram(program, pc, mem, stack, self.env, context, input)
+		}
+		*/
 		// The base for all big integer arithmetic
 		base := new(big.Int)
 
@@ -122,7 +154,7 @@ func (self *Vm) Run(context *Context, input []byte) (ret []byte, err error) {
 		op = context.GetOp(pc)
 
 		// calculate the new memory size and gas price for the current executing opcode
-		newMemSize, cost, err = self.calculateGasAndSize(context, caller, op, statedb, mem, stack)
+		newMemSize, cost, err = calculateGasAndSize(self.env, context, caller, op, statedb, mem, stack)
 		if err != nil {
 			return nil, err
 		}
@@ -130,11 +162,9 @@ func (self *Vm) Run(context *Context, input []byte) (ret []byte, err error) {
 		// Use the calculated gas. When insufficient gas is present, use all gas and return an
 		// Out Of Gas error
 		if !context.UseGas(cost) {
-
-			context.UseGas(context.Gas)
-
-			return context.Return(nil), OutOfGasError
+			return nil, OutOfGasError
 		}
+
 		// Resize the memory calculated previously
 		mem.Resize(newMemSize.Uint64())
 		// Add a log message
@@ -376,7 +406,7 @@ func (self *Vm) Run(context *Context, input []byte) (ret []byte, err error) {
 			addr := common.BigToAddress(stack.pop())
 			balance := statedb.GetBalance(addr)
 
-			stack.push(balance)
+			stack.push(new(big.Int).Set(balance))
 
 		case ORIGIN:
 			origin := self.env.Origin()
@@ -388,7 +418,7 @@ func (self *Vm) Run(context *Context, input []byte) (ret []byte, err error) {
 			stack.push(common.Bytes2Big(caller.Bytes()))
 
 		case CALLVALUE:
-			stack.push(value)
+			stack.push(new(big.Int).Set(value))
 
 		case CALLDATALOAD:
 			data := getData(input, stack.pop(), common.Big32)
@@ -441,7 +471,7 @@ func (self *Vm) Run(context *Context, input []byte) (ret []byte, err error) {
 			mem.Set(mOff.Uint64(), l.Uint64(), codeCopy)
 
 		case GASPRICE:
-			stack.push(context.Price)
+			stack.push(new(big.Int).Set(context.Price))
 
 		case BLOCKHASH:
 			num := stack.pop()
@@ -471,11 +501,11 @@ func (self *Vm) Run(context *Context, input []byte) (ret []byte, err error) {
 		case DIFFICULTY:
 			difficulty := self.env.Difficulty()
 
-			stack.push(difficulty)
+			stack.push(new(big.Int).Set(difficulty))
 
 		case GASLIMIT:
 
-			stack.push(self.env.GasLimit())
+			stack.push(new(big.Int).Set(self.env.GasLimit()))
 
 		case PUSH1, PUSH2, PUSH3, PUSH4, PUSH5, PUSH6, PUSH7, PUSH8, PUSH9, PUSH10, PUSH11, PUSH12, PUSH13, PUSH14, PUSH15, PUSH16, PUSH17, PUSH18, PUSH19, PUSH20, PUSH21, PUSH22, PUSH23, PUSH24, PUSH25, PUSH26, PUSH27, PUSH28, PUSH29, PUSH30, PUSH31, PUSH32:
 			size := uint64(op - PUSH1 + 1)
@@ -555,8 +585,7 @@ func (self *Vm) Run(context *Context, input []byte) (ret []byte, err error) {
 		case MSIZE:
 			stack.push(big.NewInt(int64(mem.Len())))
 		case GAS:
-			stack.push(context.Gas)
-
+			stack.push(new(big.Int).Set(context.Gas))
 		case CREATE:
 
 			var (
@@ -652,7 +681,7 @@ func (self *Vm) Run(context *Context, input []byte) (ret []byte, err error) {
 
 // calculateGasAndSize calculates the required given the opcode and stack items calculates the new memorysize for
 // the operation. This does not reduce gas or resizes the memory.
-func (self *Vm) calculateGasAndSize(context *Context, caller ContextRef, op OpCode, statedb *state.StateDB, mem *Memory, stack *stack) (*big.Int, *big.Int, error) {
+func calculateGasAndSize(env Environment, context *Context, caller ContextRef, op OpCode, statedb *state.StateDB, mem *Memory, stack *stack) (*big.Int, *big.Int, error) {
 	var (
 		gas                 = new(big.Int)
 		newMemSize *big.Int = new(big.Int)
@@ -759,7 +788,7 @@ func (self *Vm) calculateGasAndSize(context *Context, caller ContextRef, op OpCo
 		gas.Add(gas, stack.data[stack.len()-1])
 
 		if op == CALL {
-			if self.env.State().GetStateObject(common.BigToAddress(stack.data[stack.len()-2])) == nil {
+			if env.State().GetStateObject(common.BigToAddress(stack.data[stack.len()-2])) == nil {
 				gas.Add(gas, params.CallNewAccountGas)
 			}
 		}