|
package statedb
|
|
|
|
import (
|
|
"bytes"
|
|
"fmt"
|
|
"math/big"
|
|
|
|
ethCommon "github.com/ethereum/go-ethereum/common"
|
|
"github.com/hermeznetwork/hermez-node/common"
|
|
"github.com/hermeznetwork/hermez-node/log"
|
|
"github.com/hermeznetwork/tracerr"
|
|
"github.com/iden3/go-iden3-crypto/babyjub"
|
|
"github.com/iden3/go-merkletree"
|
|
)
|
|
|
|
func concatEthAddrTokenID(addr ethCommon.Address, tokenID common.TokenID) []byte {
|
|
var b []byte
|
|
b = append(b, addr.Bytes()...)
|
|
b = append(b[:], tokenID.Bytes()[:]...)
|
|
return b
|
|
}
|
|
func concatEthAddrBJJTokenID(addr ethCommon.Address, pk *babyjub.PublicKey, tokenID common.TokenID) []byte {
|
|
pkComp := pk.Compress()
|
|
var b []byte
|
|
b = append(b, addr.Bytes()...)
|
|
b = append(b[:], pkComp[:]...)
|
|
b = append(b[:], tokenID.Bytes()[:]...)
|
|
return b
|
|
}
|
|
|
|
// setIdxByEthAddrBJJ stores the given Idx in the StateDB as follows:
|
|
// - key: Eth Address, value: idx
|
|
// - key: EthAddr & BabyJubJub PublicKey Compressed, value: idx
|
|
// If Idx already exist for the given EthAddr & BJJ, the remaining Idx will be
|
|
// always the smallest one.
|
|
func (s *StateDB) setIdxByEthAddrBJJ(idx common.Idx, addr ethCommon.Address, pk *babyjub.PublicKey, tokenID common.TokenID) error {
|
|
oldIdx, err := s.GetIdxByEthAddrBJJ(addr, pk, tokenID)
|
|
if err == nil {
|
|
// EthAddr & BJJ already have an Idx
|
|
// check which Idx is smaller
|
|
// if new idx is smaller, store the new one
|
|
// if new idx is bigger, don't store and return, as the used one will be the old
|
|
if idx >= oldIdx {
|
|
log.Debug("StateDB.setIdxByEthAddrBJJ: Idx not stored because there already exist a smaller Idx for the given EthAddr & BJJ")
|
|
return nil
|
|
}
|
|
}
|
|
|
|
if pk == nil {
|
|
return tracerr.Wrap(fmt.Errorf("BabyJubJub pk not defined"))
|
|
}
|
|
|
|
// store idx for EthAddr & BJJ assuming that EthAddr & BJJ still don't
|
|
// have an Idx stored in the DB, and if so, the already stored Idx is
|
|
// bigger than the given one, so should be updated to the new one
|
|
// (smaller)
|
|
tx, err := s.db.NewTx()
|
|
if err != nil {
|
|
return tracerr.Wrap(err)
|
|
}
|
|
idxBytes, err := idx.Bytes()
|
|
if err != nil {
|
|
return tracerr.Wrap(err)
|
|
}
|
|
// store Addr&BJJ-idx
|
|
k := concatEthAddrBJJTokenID(addr, pk, tokenID)
|
|
err = tx.Put(append(PrefixKeyAddrBJJ, k...), idxBytes[:])
|
|
if err != nil {
|
|
return tracerr.Wrap(err)
|
|
}
|
|
|
|
// store Addr-idx
|
|
k = concatEthAddrTokenID(addr, tokenID)
|
|
err = tx.Put(append(PrefixKeyAddr, k...), idxBytes[:])
|
|
if err != nil {
|
|
return tracerr.Wrap(err)
|
|
}
|
|
err = tx.Commit()
|
|
if err != nil {
|
|
return tracerr.Wrap(err)
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// GetIdxByEthAddr returns the smallest Idx in the StateDB for the given
|
|
// Ethereum Address. Will return common.Idx(0) and error in case that Idx is
|
|
// not found in the StateDB.
|
|
func (s *StateDB) GetIdxByEthAddr(addr ethCommon.Address, tokenID common.TokenID) (common.Idx, error) {
|
|
k := concatEthAddrTokenID(addr, tokenID)
|
|
b, err := s.db.Get(append(PrefixKeyAddr, k...))
|
|
if err != nil {
|
|
return common.Idx(0), tracerr.Wrap(fmt.Errorf("GetIdxByEthAddr: %s: ToEthAddr: %s, TokenID: %d", ErrToIdxNotFound, addr.Hex(), tokenID))
|
|
}
|
|
idx, err := common.IdxFromBytes(b)
|
|
if err != nil {
|
|
return common.Idx(0), tracerr.Wrap(fmt.Errorf("GetIdxByEthAddr: %s: ToEthAddr: %s, TokenID: %d", err, addr.Hex(), tokenID))
|
|
}
|
|
return idx, nil
|
|
}
|
|
|
|
// GetIdxByEthAddrBJJ returns the smallest Idx in the StateDB for the given
|
|
// Ethereum Address AND the given BabyJubJub PublicKey. If `addr` is the zero
|
|
// address, it's ignored in the query. If `pk` is nil, it's ignored in the
|
|
// query. Will return common.Idx(0) and error in case that Idx is not found in
|
|
// the StateDB.
|
|
func (s *StateDB) GetIdxByEthAddrBJJ(addr ethCommon.Address, pk *babyjub.PublicKey, tokenID common.TokenID) (common.Idx, error) {
|
|
if !bytes.Equal(addr.Bytes(), common.EmptyAddr.Bytes()) && pk == nil {
|
|
// ToEthAddr
|
|
// case ToEthAddr!=0 && ToBJJ=0
|
|
return s.GetIdxByEthAddr(addr, tokenID)
|
|
} else if !bytes.Equal(addr.Bytes(), common.EmptyAddr.Bytes()) && pk != nil {
|
|
// case ToEthAddr!=0 && ToBJJ!=0
|
|
k := concatEthAddrBJJTokenID(addr, pk, tokenID)
|
|
b, err := s.db.Get(append(PrefixKeyAddrBJJ, k...))
|
|
if err != nil {
|
|
return common.Idx(0), tracerr.Wrap(fmt.Errorf("GetIdxByEthAddrBJJ: %s: ToEthAddr: %s, ToBJJ: %s, TokenID: %d", ErrToIdxNotFound, addr.Hex(), pk, tokenID))
|
|
}
|
|
idx, err := common.IdxFromBytes(b)
|
|
if err != nil {
|
|
return common.Idx(0), tracerr.Wrap(fmt.Errorf("GetIdxByEthAddrBJJ: %s: ToEthAddr: %s, ToBJJ: %s, TokenID: %d", err, addr.Hex(), pk, tokenID))
|
|
}
|
|
return idx, nil
|
|
}
|
|
// rest of cases (included case ToEthAddr==0) are not possible
|
|
return common.Idx(0), tracerr.Wrap(fmt.Errorf("GetIdxByEthAddrBJJ: Not found, %s: ToEthAddr: %s, ToBJJ: %s, TokenID: %d", ErrGetIdxNoCase, addr.Hex(), pk, tokenID))
|
|
}
|
|
|
|
func (s *StateDB) getTokenIDsFromIdxs(idxs []common.Idx) (map[common.TokenID]common.Idx, error) {
|
|
m := make(map[common.TokenID]common.Idx)
|
|
for i := 0; i < len(idxs); i++ {
|
|
a, err := s.GetAccount(idxs[i])
|
|
if err != nil {
|
|
return nil, tracerr.Wrap(fmt.Errorf("getTokenIDsFromIdxs error on GetAccount with Idx==%d: %s", idxs[i], err.Error()))
|
|
}
|
|
m[a.TokenID] = idxs[i]
|
|
}
|
|
return m, nil
|
|
}
|
|
|
|
func siblingsToZKInputFormat(s []*merkletree.Hash) []*big.Int {
|
|
b := make([]*big.Int, len(s))
|
|
for i := 0; i < len(s); i++ {
|
|
b[i] = s[i].BigInt()
|
|
}
|
|
return b
|
|
}
|
|
|
|
// BJJCompressedTo256BigInts returns a [256]*big.Int array with the bit
|
|
// representation of the babyjub.PublicKeyComp
|
|
func BJJCompressedTo256BigInts(pkComp babyjub.PublicKeyComp) [256]*big.Int {
|
|
var r [256]*big.Int
|
|
b := pkComp[:]
|
|
|
|
for i := 0; i < 256; i++ {
|
|
if b[i/8]&(1<<(i%8)) == 0 {
|
|
r[i] = big.NewInt(0)
|
|
} else {
|
|
r[i] = big.NewInt(1)
|
|
}
|
|
}
|
|
|
|
return r
|
|
}
|
|
|
|
// formatAccumulatedFees returns an array of [nFeeAccounts]*big.Int containing
|
|
// the balance of each FeeAccount, taken from the 'collectedFees' map, in the
|
|
// order of the 'orderTokenIDs'
|
|
func formatAccumulatedFees(collectedFees map[common.TokenID]*big.Int, orderTokenIDs []*big.Int) []*big.Int {
|
|
accFeeOut := make([]*big.Int, len(orderTokenIDs))
|
|
for i := 0; i < len(orderTokenIDs); i++ {
|
|
tokenID := common.TokenIDFromBigInt(orderTokenIDs[i])
|
|
if _, ok := collectedFees[tokenID]; ok {
|
|
accFeeOut[i] = new(big.Int).Set(collectedFees[tokenID])
|
|
} else {
|
|
accFeeOut[i] = big.NewInt(0)
|
|
}
|
|
}
|
|
return accFeeOut
|
|
}
|