forked from cerc-io/plugeth
bbfb1e4008
This adds support for EIP-2718 typed transactions as well as EIP-2930 access list transactions (tx type 1). These EIPs are scheduled for the Berlin fork. There very few changes to existing APIs in core/types, and several new APIs to deal with access list transactions. In particular, there are two new constructor functions for transactions: types.NewTx and types.SignNewTx. Since the canonical encoding of typed transactions is not RLP-compatible, Transaction now has new methods for encoding and decoding: MarshalBinary and UnmarshalBinary. The existing EIP-155 signer does not support the new transaction types. All code dealing with transaction signatures should be updated to use the newer EIP-2930 signer. To make this easier for future updates, we have added new constructor functions for types.Signer: types.LatestSigner and types.LatestSignerForChainID. This change also adds support for the YoloV3 testnet. Co-authored-by: Martin Holst Swende <martin@swende.se> Co-authored-by: Felix Lange <fjl@twurst.com> Co-authored-by: Ryan Schneider <ryanleeschneider@gmail.com>
122 lines
3.9 KiB
Go
122 lines
3.9 KiB
Go
package trie
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/ethereum/go-ethereum/common"
|
|
"github.com/ethereum/go-ethereum/ethdb/memorydb"
|
|
)
|
|
|
|
func TestSizeBug(t *testing.T) {
|
|
st := NewStackTrie(nil)
|
|
nt, _ := New(common.Hash{}, NewDatabase(memorydb.New()))
|
|
|
|
leaf := common.FromHex("290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563")
|
|
value := common.FromHex("94cf40d0d2b44f2b66e07cace1372ca42b73cf21a3")
|
|
|
|
nt.TryUpdate(leaf, value)
|
|
st.TryUpdate(leaf, value)
|
|
|
|
if nt.Hash() != st.Hash() {
|
|
t.Fatalf("error %x != %x", st.Hash(), nt.Hash())
|
|
}
|
|
}
|
|
|
|
func TestEmptyBug(t *testing.T) {
|
|
st := NewStackTrie(nil)
|
|
nt, _ := New(common.Hash{}, NewDatabase(memorydb.New()))
|
|
|
|
//leaf := common.FromHex("290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563")
|
|
//value := common.FromHex("94cf40d0d2b44f2b66e07cace1372ca42b73cf21a3")
|
|
kvs := []struct {
|
|
K string
|
|
V string
|
|
}{
|
|
{K: "405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace", V: "9496f4ec2bf9dab484cac6be589e8417d84781be08"},
|
|
{K: "40edb63a35fcf86c08022722aa3287cdd36440d671b4918131b2514795fefa9c", V: "01"},
|
|
{K: "b10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6", V: "947a30f7736e48d6599356464ba4c150d8da0302ff"},
|
|
{K: "c2575a0e9e593c00f959f8c92f12db2869c3395a3b0502d05e2516446f71f85b", V: "02"},
|
|
}
|
|
|
|
for _, kv := range kvs {
|
|
nt.TryUpdate(common.FromHex(kv.K), common.FromHex(kv.V))
|
|
st.TryUpdate(common.FromHex(kv.K), common.FromHex(kv.V))
|
|
}
|
|
|
|
if nt.Hash() != st.Hash() {
|
|
t.Fatalf("error %x != %x", st.Hash(), nt.Hash())
|
|
}
|
|
}
|
|
|
|
func TestValLength56(t *testing.T) {
|
|
st := NewStackTrie(nil)
|
|
nt, _ := New(common.Hash{}, NewDatabase(memorydb.New()))
|
|
|
|
//leaf := common.FromHex("290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563")
|
|
//value := common.FromHex("94cf40d0d2b44f2b66e07cace1372ca42b73cf21a3")
|
|
kvs := []struct {
|
|
K string
|
|
V string
|
|
}{
|
|
{K: "405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace", V: "1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111"},
|
|
}
|
|
|
|
for _, kv := range kvs {
|
|
nt.TryUpdate(common.FromHex(kv.K), common.FromHex(kv.V))
|
|
st.TryUpdate(common.FromHex(kv.K), common.FromHex(kv.V))
|
|
}
|
|
|
|
if nt.Hash() != st.Hash() {
|
|
t.Fatalf("error %x != %x", st.Hash(), nt.Hash())
|
|
}
|
|
}
|
|
|
|
// TestUpdateSmallNodes tests a case where the leaves are small (both key and value),
|
|
// which causes a lot of node-within-node. This case was found via fuzzing.
|
|
func TestUpdateSmallNodes(t *testing.T) {
|
|
st := NewStackTrie(nil)
|
|
nt, _ := New(common.Hash{}, NewDatabase(memorydb.New()))
|
|
kvs := []struct {
|
|
K string
|
|
V string
|
|
}{
|
|
{"63303030", "3041"}, // stacktrie.Update
|
|
{"65", "3000"}, // stacktrie.Update
|
|
}
|
|
for _, kv := range kvs {
|
|
nt.TryUpdate(common.FromHex(kv.K), common.FromHex(kv.V))
|
|
st.TryUpdate(common.FromHex(kv.K), common.FromHex(kv.V))
|
|
}
|
|
if nt.Hash() != st.Hash() {
|
|
t.Fatalf("error %x != %x", st.Hash(), nt.Hash())
|
|
}
|
|
}
|
|
|
|
// TestUpdateVariableKeys contains a case which stacktrie fails: when keys of different
|
|
// sizes are used, and the second one has the same prefix as the first, then the
|
|
// stacktrie fails, since it's unable to 'expand' on an already added leaf.
|
|
// For all practical purposes, this is fine, since keys are fixed-size length
|
|
// in account and storage tries.
|
|
//
|
|
// The test is marked as 'skipped', and exists just to have the behaviour documented.
|
|
// This case was found via fuzzing.
|
|
func TestUpdateVariableKeys(t *testing.T) {
|
|
t.SkipNow()
|
|
st := NewStackTrie(nil)
|
|
nt, _ := New(common.Hash{}, NewDatabase(memorydb.New()))
|
|
kvs := []struct {
|
|
K string
|
|
V string
|
|
}{
|
|
{"0x33303534636532393561313031676174", "303030"},
|
|
{"0x3330353463653239356131303167617430", "313131"},
|
|
}
|
|
for _, kv := range kvs {
|
|
nt.TryUpdate(common.FromHex(kv.K), common.FromHex(kv.V))
|
|
st.TryUpdate(common.FromHex(kv.K), common.FromHex(kv.V))
|
|
}
|
|
if nt.Hash() != st.Hash() {
|
|
t.Fatalf("error %x != %x", st.Hash(), nt.Hash())
|
|
}
|
|
}
|