|
package til
|
|
|
|
import (
|
|
"crypto/ecdsa"
|
|
"fmt"
|
|
"math/big"
|
|
"strconv"
|
|
"strings"
|
|
"time"
|
|
|
|
ethCommon "github.com/ethereum/go-ethereum/common"
|
|
ethCrypto "github.com/ethereum/go-ethereum/crypto"
|
|
"github.com/hermeznetwork/hermez-node/common"
|
|
"github.com/hermeznetwork/hermez-node/log"
|
|
"github.com/iden3/go-iden3-crypto/babyjub"
|
|
)
|
|
|
|
// Context contains the data of the test
|
|
type Context struct {
|
|
Instructions []instruction
|
|
accountsNames []string
|
|
Users map[string]*User
|
|
lastRegisteredTokenID common.TokenID
|
|
l1CreatedAccounts map[string]*Account
|
|
|
|
// rollupConstMaxL1UserTx Maximum L1-user transactions allowed to be queued in a batch
|
|
rollupConstMaxL1UserTx int
|
|
|
|
idx int
|
|
currBlock BlockData
|
|
currBatch BatchData
|
|
currBatchNum int
|
|
queues [][]L1Tx
|
|
toForgeNum int
|
|
openToForge int
|
|
}
|
|
|
|
// NewContext returns a new Context
|
|
func NewContext(rollupConstMaxL1UserTx int) *Context {
|
|
return &Context{
|
|
Users: make(map[string]*User),
|
|
l1CreatedAccounts: make(map[string]*Account),
|
|
lastRegisteredTokenID: 0,
|
|
|
|
rollupConstMaxL1UserTx: rollupConstMaxL1UserTx,
|
|
idx: common.UserThreshold,
|
|
currBatchNum: 0,
|
|
// start with 2 queues, one for toForge, and the other for openToForge
|
|
queues: make([][]L1Tx, 2),
|
|
toForgeNum: 0,
|
|
openToForge: 1,
|
|
}
|
|
}
|
|
|
|
// Account contains the data related to the account for a specific TokenID of a User
|
|
type Account struct {
|
|
Idx common.Idx
|
|
Nonce common.Nonce
|
|
}
|
|
|
|
// User contains the data related to a testing user
|
|
type User struct {
|
|
BJJ *babyjub.PrivateKey
|
|
Addr ethCommon.Address
|
|
Accounts map[common.TokenID]*Account
|
|
}
|
|
|
|
// BlockData contains the information of a Block
|
|
type BlockData struct {
|
|
// block *common.Block // ethereum block
|
|
// L1UserTxs that were accepted in the block
|
|
L1UserTxs []common.L1Tx
|
|
Batches []BatchData
|
|
RegisteredTokens []common.Token
|
|
}
|
|
|
|
// BatchData contains the information of a Batch
|
|
type BatchData struct {
|
|
L1Batch bool // TODO: Remove once Batch.ForgeL1TxsNum is a pointer
|
|
L1CoordinatorTxs []common.L1Tx
|
|
testL1CoordinatorTxs []L1Tx
|
|
L2Txs []common.L2Tx
|
|
// testL2Tx are L2Txs without the Idx&EthAddr&BJJ setted, but with the
|
|
// string that represents the account
|
|
testL2Txs []L2Tx
|
|
}
|
|
|
|
// L1Tx is the data structure used internally for transaction test generation,
|
|
// which contains a common.L1Tx data plus some intermediate data for the
|
|
// transaction generation.
|
|
type L1Tx struct {
|
|
lineNum int
|
|
fromIdxName string
|
|
toIdxName string
|
|
|
|
L1Tx common.L1Tx
|
|
}
|
|
|
|
// L2Tx is the data structure used internally for transaction test generation,
|
|
// which contains a common.L2Tx data plus some intermediate data for the
|
|
// transaction generation.
|
|
type L2Tx struct {
|
|
lineNum int
|
|
fromIdxName string
|
|
toIdxName string
|
|
tokenID common.TokenID
|
|
L2Tx common.L2Tx
|
|
}
|
|
|
|
// GenerateBlocks returns an array of BlockData for a given set. It uses the
|
|
// accounts (keys & nonces) of the Context.
|
|
func (tc *Context) GenerateBlocks(set string) ([]BlockData, error) {
|
|
parser := newParser(strings.NewReader(set))
|
|
parsedSet, err := parser.parse()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
tc.Instructions = parsedSet.instructions
|
|
tc.accountsNames = parsedSet.accounts
|
|
|
|
tc.generateKeys(tc.accountsNames)
|
|
|
|
var blocks []BlockData
|
|
for _, inst := range parsedSet.instructions {
|
|
switch inst.typ {
|
|
case txTypeCreateAccountDepositCoordinator:
|
|
if err := tc.checkIfTokenIsRegistered(inst); err != nil {
|
|
log.Error(err)
|
|
return nil, fmt.Errorf("Line %d: %s", inst.lineNum, err.Error())
|
|
}
|
|
tx := common.L1Tx{
|
|
FromEthAddr: tc.Users[inst.from].Addr,
|
|
FromBJJ: tc.Users[inst.from].BJJ.Public(),
|
|
TokenID: inst.tokenID,
|
|
LoadAmount: big.NewInt(int64(inst.loadAmount)),
|
|
Type: common.TxTypeCreateAccountDeposit, // as txTypeCreateAccountDepositCoordinator is not valid oustide Til package
|
|
}
|
|
testTx := L1Tx{
|
|
lineNum: inst.lineNum,
|
|
fromIdxName: inst.from,
|
|
L1Tx: tx,
|
|
}
|
|
tc.currBatch.testL1CoordinatorTxs = append(tc.currBatch.testL1CoordinatorTxs, testTx)
|
|
case common.TxTypeCreateAccountDeposit, common.TxTypeCreateAccountDepositTransfer:
|
|
if err := tc.checkIfTokenIsRegistered(inst); err != nil {
|
|
log.Error(err)
|
|
return nil, fmt.Errorf("Line %d: %s", inst.lineNum, err.Error())
|
|
}
|
|
tx := common.L1Tx{
|
|
FromEthAddr: tc.Users[inst.from].Addr,
|
|
FromBJJ: tc.Users[inst.from].BJJ.Public(),
|
|
TokenID: inst.tokenID,
|
|
LoadAmount: big.NewInt(int64(inst.loadAmount)),
|
|
Type: inst.typ,
|
|
}
|
|
if inst.typ == common.TxTypeCreateAccountDepositTransfer {
|
|
tx.Amount = big.NewInt(int64(inst.amount))
|
|
}
|
|
testTx := L1Tx{
|
|
lineNum: inst.lineNum,
|
|
fromIdxName: inst.from,
|
|
toIdxName: inst.to,
|
|
L1Tx: tx,
|
|
}
|
|
tc.addToL1Queue(testTx)
|
|
case common.TxTypeDeposit, common.TxTypeDepositTransfer:
|
|
if err := tc.checkIfTokenIsRegistered(inst); err != nil {
|
|
log.Error(err)
|
|
return nil, fmt.Errorf("Line %d: %s", inst.lineNum, err.Error())
|
|
}
|
|
if err := tc.checkIfAccountExists(inst.from, inst); err != nil {
|
|
log.Error(err)
|
|
return nil, fmt.Errorf("Line %d: %s", inst.lineNum, err.Error())
|
|
}
|
|
tx := common.L1Tx{
|
|
TokenID: inst.tokenID,
|
|
LoadAmount: big.NewInt(int64(inst.loadAmount)),
|
|
Type: inst.typ,
|
|
}
|
|
if inst.typ == common.TxTypeDepositTransfer {
|
|
tx.Amount = big.NewInt(int64(inst.amount))
|
|
}
|
|
testTx := L1Tx{
|
|
lineNum: inst.lineNum,
|
|
fromIdxName: inst.from,
|
|
toIdxName: inst.to,
|
|
L1Tx: tx,
|
|
}
|
|
tc.addToL1Queue(testTx)
|
|
case common.TxTypeTransfer:
|
|
if err := tc.checkIfTokenIsRegistered(inst); err != nil {
|
|
log.Error(err)
|
|
return nil, fmt.Errorf("Line %d: %s", inst.lineNum, err.Error())
|
|
}
|
|
tx := common.L2Tx{
|
|
Amount: big.NewInt(int64(inst.amount)),
|
|
Fee: common.FeeSelector(inst.fee),
|
|
Type: common.TxTypeTransfer,
|
|
}
|
|
tx.BatchNum = common.BatchNum(tc.currBatchNum) // when converted to PoolL2Tx BatchNum parameter is lost
|
|
testTx := L2Tx{
|
|
lineNum: inst.lineNum,
|
|
fromIdxName: inst.from,
|
|
toIdxName: inst.to,
|
|
tokenID: inst.tokenID,
|
|
L2Tx: tx,
|
|
}
|
|
tc.currBatch.testL2Txs = append(tc.currBatch.testL2Txs, testTx)
|
|
case common.TxTypeExit:
|
|
if err := tc.checkIfTokenIsRegistered(inst); err != nil {
|
|
log.Error(err)
|
|
return nil, fmt.Errorf("Line %d: %s", inst.lineNum, err.Error())
|
|
}
|
|
tx := common.L2Tx{
|
|
ToIdx: common.Idx(1), // as is an Exit
|
|
Amount: big.NewInt(int64(inst.amount)),
|
|
Type: common.TxTypeExit,
|
|
}
|
|
tx.BatchNum = common.BatchNum(tc.currBatchNum) // when converted to PoolL2Tx BatchNum parameter is lost
|
|
testTx := L2Tx{
|
|
lineNum: inst.lineNum,
|
|
fromIdxName: inst.from,
|
|
toIdxName: inst.to,
|
|
tokenID: inst.tokenID,
|
|
L2Tx: tx,
|
|
}
|
|
tc.currBatch.testL2Txs = append(tc.currBatch.testL2Txs, testTx)
|
|
case common.TxTypeForceExit:
|
|
if err := tc.checkIfTokenIsRegistered(inst); err != nil {
|
|
log.Error(err)
|
|
return nil, fmt.Errorf("Line %d: %s", inst.lineNum, err.Error())
|
|
}
|
|
tx := common.L1Tx{
|
|
ToIdx: common.Idx(1), // as is an Exit
|
|
TokenID: inst.tokenID,
|
|
Amount: big.NewInt(int64(inst.amount)),
|
|
Type: common.TxTypeExit,
|
|
}
|
|
testTx := L1Tx{
|
|
lineNum: inst.lineNum,
|
|
fromIdxName: inst.from,
|
|
toIdxName: inst.to,
|
|
L1Tx: tx,
|
|
}
|
|
tc.addToL1Queue(testTx)
|
|
case typeNewBatch:
|
|
if err = tc.calculateIdxForL1Txs(true, tc.currBatch.testL1CoordinatorTxs); err != nil {
|
|
return nil, err
|
|
}
|
|
if err = tc.setIdxs(); err != nil {
|
|
log.Error(err)
|
|
return nil, err
|
|
}
|
|
case typeNewBatchL1:
|
|
// for each L1UserTx of the queues[ToForgeNum], calculate the Idx
|
|
if err = tc.calculateIdxForL1Txs(false, tc.queues[tc.toForgeNum]); err != nil {
|
|
return nil, err
|
|
}
|
|
if err = tc.calculateIdxForL1Txs(true, tc.currBatch.testL1CoordinatorTxs); err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
// once Idxs are calculated, update transactions to use the real Idxs
|
|
for i := 0; i < len(tc.queues[tc.toForgeNum]); i++ {
|
|
testTx := &tc.queues[tc.toForgeNum][i]
|
|
if testTx.L1Tx.Type != common.TxTypeCreateAccountDeposit && testTx.L1Tx.Type != common.TxTypeCreateAccountDepositTransfer {
|
|
testTx.L1Tx.FromIdx = tc.Users[testTx.fromIdxName].Accounts[testTx.L1Tx.TokenID].Idx
|
|
}
|
|
testTx.L1Tx.FromEthAddr = tc.Users[testTx.fromIdxName].Addr
|
|
testTx.L1Tx.FromBJJ = tc.Users[testTx.fromIdxName].BJJ.Public()
|
|
if testTx.toIdxName == "" {
|
|
testTx.L1Tx.ToIdx = common.Idx(0)
|
|
} else {
|
|
testTx.L1Tx.ToIdx = tc.Users[testTx.toIdxName].Accounts[testTx.L1Tx.TokenID].Idx
|
|
}
|
|
if testTx.L1Tx.Type == common.TxTypeExit {
|
|
testTx.L1Tx.ToIdx = common.Idx(1)
|
|
}
|
|
bn := common.BatchNum(tc.currBatchNum)
|
|
testTx.L1Tx.BatchNum = &bn
|
|
nTx, err := common.NewL1Tx(&testTx.L1Tx)
|
|
if err != nil {
|
|
fmt.Println(testTx)
|
|
return nil, fmt.Errorf("Line %d: %s", testTx.lineNum, err.Error())
|
|
}
|
|
testTx.L1Tx = *nTx
|
|
|
|
tc.currBlock.L1UserTxs = append(tc.currBlock.L1UserTxs, testTx.L1Tx)
|
|
}
|
|
if err = tc.setIdxs(); err != nil {
|
|
log.Error(err)
|
|
return nil, err
|
|
}
|
|
// advance batch
|
|
tc.toForgeNum++
|
|
if tc.toForgeNum == tc.openToForge {
|
|
tc.openToForge++
|
|
newQueue := []L1Tx{}
|
|
tc.queues = append(tc.queues, newQueue)
|
|
}
|
|
case typeNewBlock:
|
|
blocks = append(blocks, tc.currBlock)
|
|
tc.currBlock = BlockData{}
|
|
case typeRegisterToken:
|
|
newToken := common.Token{
|
|
TokenID: inst.tokenID,
|
|
EthBlockNum: int64(len(blocks)),
|
|
}
|
|
if inst.tokenID != tc.lastRegisteredTokenID+1 {
|
|
return nil, fmt.Errorf("Line %d: RegisterToken TokenID should be sequential, expected TokenID: %d, defined TokenID: %d", inst.lineNum, tc.lastRegisteredTokenID+1, inst.tokenID)
|
|
}
|
|
tc.lastRegisteredTokenID++
|
|
tc.currBlock.RegisteredTokens = append(tc.currBlock.RegisteredTokens, newToken)
|
|
default:
|
|
return nil, fmt.Errorf("Line %d: Unexpected type: %s", inst.lineNum, inst.typ)
|
|
}
|
|
}
|
|
|
|
return blocks, nil
|
|
}
|
|
|
|
// calculateIdxsForL1Txs calculates new Idx for new created accounts. If
|
|
// 'isCoordinatorTxs==true', adds the tx to tc.currBatch.L1CoordinatorTxs.
|
|
func (tc *Context) calculateIdxForL1Txs(isCoordinatorTxs bool, txs []L1Tx) error {
|
|
// for each batch.L1CoordinatorTxs of the queues[ToForgeNum], calculate the Idx
|
|
for i := 0; i < len(txs); i++ {
|
|
tx := txs[i]
|
|
if tx.L1Tx.Type == common.TxTypeCreateAccountDeposit || tx.L1Tx.Type == common.TxTypeCreateAccountDepositTransfer {
|
|
if tc.Users[tx.fromIdxName].Accounts[tx.L1Tx.TokenID] != nil { // if account already exists, return error
|
|
return fmt.Errorf("Can not create same account twice (same User & same TokenID) (this is a design property of Til)")
|
|
}
|
|
tc.Users[tx.fromIdxName].Accounts[tx.L1Tx.TokenID] = &Account{
|
|
Idx: common.Idx(tc.idx),
|
|
Nonce: common.Nonce(0),
|
|
}
|
|
tc.l1CreatedAccounts[idxTokenIDToString(tx.fromIdxName, tx.L1Tx.TokenID)] = tc.Users[tx.fromIdxName].Accounts[tx.L1Tx.TokenID]
|
|
tc.idx++
|
|
}
|
|
if isCoordinatorTxs {
|
|
tc.currBatch.L1CoordinatorTxs = append(tc.currBatch.L1CoordinatorTxs, tx.L1Tx)
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// setIdxs sets the Idxs to the transactions of the tc.currBatch
|
|
func (tc *Context) setIdxs() error {
|
|
// once Idxs are calculated, update transactions to use the new Idxs
|
|
for i := 0; i < len(tc.currBatch.testL2Txs); i++ {
|
|
testTx := &tc.currBatch.testL2Txs[i]
|
|
|
|
if tc.Users[testTx.fromIdxName].Accounts[testTx.tokenID] == nil {
|
|
return fmt.Errorf("Line %d: %s from User %s for TokenID %d while account not created yet", testTx.lineNum, testTx.L2Tx.Type, testTx.fromIdxName, testTx.tokenID)
|
|
}
|
|
if testTx.L2Tx.Type == common.TxTypeTransfer {
|
|
if _, ok := tc.l1CreatedAccounts[idxTokenIDToString(testTx.toIdxName, testTx.tokenID)]; !ok {
|
|
return fmt.Errorf("Line %d: Can not create Transfer for a non existing account. Batch %d, ToIdx name: %s, TokenID: %d", testTx.lineNum, tc.currBatchNum, testTx.toIdxName, testTx.tokenID)
|
|
}
|
|
}
|
|
tc.Users[testTx.fromIdxName].Accounts[testTx.tokenID].Nonce++
|
|
testTx.L2Tx.Nonce = tc.Users[testTx.fromIdxName].Accounts[testTx.tokenID].Nonce
|
|
|
|
// set real Idx
|
|
testTx.L2Tx.FromIdx = tc.Users[testTx.fromIdxName].Accounts[testTx.tokenID].Idx
|
|
if testTx.L2Tx.Type == common.TxTypeTransfer {
|
|
testTx.L2Tx.ToIdx = tc.Users[testTx.toIdxName].Accounts[testTx.tokenID].Idx
|
|
}
|
|
// in case Type==Exit, ToIdx=1, already set at the
|
|
// GenerateBlocks main switch inside TxTypeExit case
|
|
|
|
nTx, err := common.NewL2Tx(&testTx.L2Tx)
|
|
if err != nil {
|
|
return fmt.Errorf("Line %d: %s", testTx.lineNum, err.Error())
|
|
}
|
|
testTx.L2Tx = *nTx
|
|
|
|
tc.currBatch.L2Txs = append(tc.currBatch.L2Txs, testTx.L2Tx)
|
|
}
|
|
|
|
tc.currBlock.Batches = append(tc.currBlock.Batches, tc.currBatch)
|
|
tc.currBatchNum++
|
|
tc.currBatch = BatchData{}
|
|
|
|
return nil
|
|
}
|
|
|
|
// addToL1Queue adds the L1Tx into the queue that is open and has space
|
|
func (tc *Context) addToL1Queue(tx L1Tx) {
|
|
if len(tc.queues[tc.openToForge]) >= tc.rollupConstMaxL1UserTx {
|
|
// if current OpenToForge queue reached its Max, move into a
|
|
// new queue
|
|
tc.openToForge++
|
|
newQueue := []L1Tx{}
|
|
tc.queues = append(tc.queues, newQueue)
|
|
}
|
|
tc.queues[tc.openToForge] = append(tc.queues[tc.openToForge], tx)
|
|
}
|
|
|
|
func (tc *Context) checkIfAccountExists(tf string, inst instruction) error {
|
|
if tc.Users[tf].Accounts[inst.tokenID] == nil {
|
|
return fmt.Errorf("%s at User: %s, for TokenID: %d, while account not created yet", inst.typ, tf, inst.tokenID)
|
|
}
|
|
return nil
|
|
}
|
|
func (tc *Context) checkIfTokenIsRegistered(inst instruction) error {
|
|
if inst.tokenID > tc.lastRegisteredTokenID {
|
|
return fmt.Errorf("Can not process %s: TokenID %d not registered, last registered TokenID: %d", inst.typ, inst.tokenID, tc.lastRegisteredTokenID)
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// GeneratePoolL2Txs returns an array of common.PoolL2Tx from a given set. It
|
|
// uses the accounts (keys & nonces) of the Context.
|
|
func (tc *Context) GeneratePoolL2Txs(set string) ([]common.PoolL2Tx, error) {
|
|
parser := newParser(strings.NewReader(set))
|
|
parsedSet, err := parser.parse()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
tc.Instructions = parsedSet.instructions
|
|
tc.accountsNames = parsedSet.accounts
|
|
|
|
tc.generateKeys(tc.accountsNames)
|
|
|
|
txs := []common.PoolL2Tx{}
|
|
for _, inst := range tc.Instructions {
|
|
switch inst.typ {
|
|
case common.TxTypeTransfer:
|
|
if err := tc.checkIfAccountExists(inst.from, inst); err != nil {
|
|
log.Error(err)
|
|
return nil, fmt.Errorf("Line %d: %s", inst.lineNum, err.Error())
|
|
}
|
|
if err := tc.checkIfAccountExists(inst.to, inst); err != nil {
|
|
log.Error(err)
|
|
return nil, fmt.Errorf("Line %d: %s", inst.lineNum, err.Error())
|
|
}
|
|
tc.Users[inst.from].Accounts[inst.tokenID].Nonce++
|
|
// if account of receiver does not exist, don't use
|
|
// ToIdx, and use only ToEthAddr & ToBJJ
|
|
tx := common.PoolL2Tx{
|
|
FromIdx: tc.Users[inst.from].Accounts[inst.tokenID].Idx,
|
|
ToIdx: tc.Users[inst.to].Accounts[inst.tokenID].Idx,
|
|
ToEthAddr: tc.Users[inst.to].Addr,
|
|
ToBJJ: tc.Users[inst.to].BJJ.Public(),
|
|
TokenID: inst.tokenID,
|
|
Amount: big.NewInt(int64(inst.amount)),
|
|
Fee: common.FeeSelector(inst.fee),
|
|
Nonce: tc.Users[inst.from].Accounts[inst.tokenID].Nonce,
|
|
State: common.PoolL2TxStatePending,
|
|
Timestamp: time.Now(),
|
|
RqToEthAddr: common.EmptyAddr,
|
|
RqToBJJ: nil,
|
|
Type: common.TxTypeTransfer,
|
|
}
|
|
nTx, err := common.NewPoolL2Tx(&tx)
|
|
if err != nil {
|
|
return nil, fmt.Errorf("Line %d: %s", inst.lineNum, err.Error())
|
|
}
|
|
tx = *nTx
|
|
// perform signature and set it to tx.Signature
|
|
toSign, err := tx.HashToSign()
|
|
if err != nil {
|
|
return nil, fmt.Errorf("Line %d: %s", inst.lineNum, err.Error())
|
|
}
|
|
sig := tc.Users[inst.from].BJJ.SignPoseidon(toSign)
|
|
tx.Signature = sig.Compress()
|
|
|
|
txs = append(txs, tx)
|
|
case common.TxTypeExit:
|
|
tc.Users[inst.from].Accounts[inst.tokenID].Nonce++
|
|
tx := common.PoolL2Tx{
|
|
FromIdx: tc.Users[inst.from].Accounts[inst.tokenID].Idx,
|
|
ToIdx: common.Idx(1), // as is an Exit
|
|
TokenID: inst.tokenID,
|
|
Amount: big.NewInt(int64(inst.amount)),
|
|
Nonce: tc.Users[inst.from].Accounts[inst.tokenID].Nonce,
|
|
Type: common.TxTypeExit,
|
|
}
|
|
nTx, err := common.NewPoolL2Tx(&tx)
|
|
if err != nil {
|
|
return nil, fmt.Errorf("Line %d: %s", inst.lineNum, err.Error())
|
|
}
|
|
tx = *nTx
|
|
// perform signature and set it to tx.Signature
|
|
toSign, err := tx.HashToSign()
|
|
if err != nil {
|
|
return nil, fmt.Errorf("Line %d: %s", inst.lineNum, err.Error())
|
|
}
|
|
sig := tc.Users[inst.from].BJJ.SignPoseidon(toSign)
|
|
tx.Signature = sig.Compress()
|
|
txs = append(txs, tx)
|
|
default:
|
|
return nil, fmt.Errorf("Line %d: instruction type unrecognized: %s", inst.lineNum, inst.typ)
|
|
}
|
|
}
|
|
|
|
return txs, nil
|
|
}
|
|
|
|
// generateKeys generates BabyJubJub & Address keys for the given list of
|
|
// account names in a deterministic way. This means, that for the same given
|
|
// 'accNames' in a certain order, the keys will be always the same.
|
|
func (tc *Context) generateKeys(accNames []string) {
|
|
for i := 1; i < len(accNames)+1; i++ {
|
|
if _, ok := tc.Users[accNames[i-1]]; ok {
|
|
// account already created
|
|
continue
|
|
}
|
|
// babyjubjub key
|
|
var sk babyjub.PrivateKey
|
|
copy(sk[:], []byte(strconv.Itoa(i))) // only for testing
|
|
|
|
// eth address
|
|
var key ecdsa.PrivateKey
|
|
key.D = big.NewInt(int64(i)) // only for testing
|
|
key.PublicKey.X, key.PublicKey.Y = ethCrypto.S256().ScalarBaseMult(key.D.Bytes())
|
|
key.Curve = ethCrypto.S256()
|
|
addr := ethCrypto.PubkeyToAddress(key.PublicKey)
|
|
|
|
u := User{
|
|
BJJ: &sk,
|
|
Addr: addr,
|
|
Accounts: make(map[common.TokenID]*Account),
|
|
}
|
|
tc.Users[accNames[i-1]] = &u
|
|
}
|
|
}
|