forked from cerc-io/plugeth
10a57fc3d4
This commit is a preparation for the upcoming metropolis hardfork. It prepares the state, core and vm packages such that integration with metropolis becomes less of a hassle. * Difficulty calculation requires header instead of individual parameters * statedb.StartRecord renamed to statedb.Prepare and added Finalise method required by metropolis, which removes unwanted accounts from the state (i.e. selfdestruct) * State keeps record of destructed objects (in addition to dirty objects) * core/vm pre-compiles may now return errors * core/vm pre-compiles gas check now take the full byte slice as argument instead of just the size * core/vm now keeps several hard-fork instruction tables instead of a single instruction table and removes the need for hard-fork checks in the instructions * core/vm contains a empty restruction function which is added in preparation of metropolis write-only mode operations * Adds the bn256 curve * Adds and sets the metropolis chain config block parameters (2^64-1)
72 lines
2.1 KiB
Go
72 lines
2.1 KiB
Go
package bn256
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"crypto/rand"
|
|
)
|
|
|
|
func TestRandomG2Marshal(t *testing.T) {
|
|
for i := 0; i < 10; i++ {
|
|
n, g2, err := RandomG2(rand.Reader)
|
|
if err != nil {
|
|
t.Error(err)
|
|
continue
|
|
}
|
|
t.Logf("%d: %x\n", n, g2.Marshal())
|
|
}
|
|
}
|
|
|
|
func TestPairings(t *testing.T) {
|
|
a1 := new(G1).ScalarBaseMult(bigFromBase10("1"))
|
|
a2 := new(G1).ScalarBaseMult(bigFromBase10("2"))
|
|
a37 := new(G1).ScalarBaseMult(bigFromBase10("37"))
|
|
an1 := new(G1).ScalarBaseMult(bigFromBase10("21888242871839275222246405745257275088548364400416034343698204186575808495616"))
|
|
|
|
b0 := new(G2).ScalarBaseMult(bigFromBase10("0"))
|
|
b1 := new(G2).ScalarBaseMult(bigFromBase10("1"))
|
|
b2 := new(G2).ScalarBaseMult(bigFromBase10("2"))
|
|
b27 := new(G2).ScalarBaseMult(bigFromBase10("27"))
|
|
b999 := new(G2).ScalarBaseMult(bigFromBase10("999"))
|
|
bn1 := new(G2).ScalarBaseMult(bigFromBase10("21888242871839275222246405745257275088548364400416034343698204186575808495616"))
|
|
|
|
p1 := Pair(a1, b1)
|
|
pn1 := Pair(a1, bn1)
|
|
np1 := Pair(an1, b1)
|
|
if pn1.String() != np1.String() {
|
|
t.Error("Pairing mismatch: e(a, -b) != e(-a, b)")
|
|
}
|
|
if !PairingCheck([]*G1{a1, an1}, []*G2{b1, b1}) {
|
|
t.Error("MultiAte check gave false negative!")
|
|
}
|
|
p0 := new(GT).Add(p1, pn1)
|
|
p0_2 := Pair(a1, b0)
|
|
if p0.String() != p0_2.String() {
|
|
t.Error("Pairing mismatch: e(a, b) * e(a, -b) != 1")
|
|
}
|
|
p0_3 := new(GT).ScalarMult(p1, bigFromBase10("21888242871839275222246405745257275088548364400416034343698204186575808495617"))
|
|
if p0.String() != p0_3.String() {
|
|
t.Error("Pairing mismatch: e(a, b) has wrong order")
|
|
}
|
|
p2 := Pair(a2, b1)
|
|
p2_2 := Pair(a1, b2)
|
|
p2_3 := new(GT).ScalarMult(p1, bigFromBase10("2"))
|
|
if p2.String() != p2_2.String() {
|
|
t.Error("Pairing mismatch: e(a, b * 2) != e(a * 2, b)")
|
|
}
|
|
if p2.String() != p2_3.String() {
|
|
t.Error("Pairing mismatch: e(a, b * 2) != e(a, b) ** 2")
|
|
}
|
|
if p2.String() == p1.String() {
|
|
t.Error("Pairing is degenerate!")
|
|
}
|
|
if PairingCheck([]*G1{a1, a1}, []*G2{b1, b1}) {
|
|
t.Error("MultiAte check gave false positive!")
|
|
}
|
|
p999 := Pair(a37, b27)
|
|
p999_2 := Pair(a1, b999)
|
|
if p999.String() != p999_2.String() {
|
|
t.Error("Pairing mismatch: e(a * 37, b * 27) != e(a, b * 999)")
|
|
}
|
|
}
|