mirror of
https://github.com/arnaucube/hermez-node.git
synced 2026-02-07 11:26:44 +01:00
b59710a149
- Til
- update Til users BJJ key generation for better js tests
compatibility
- Common
- PoolL2Tx to L2Tx use AuxToIdx in case that ToIdx is 0
- Update ZKInputs parameter descriptions
- TxProcessor
- Fix AccumulatedFees in case that there is no CoordIdx for that token
- Fix zki.NewExit usage
- Use same order for AccumulatedFees & FeeIdx & FeePlanTokens
- Add Nonce usage to ExitLeafs
- Update TestZKInput6 and check its compatibility with circom Hermez
circuits
53 lines
1.5 KiB
Go
53 lines
1.5 KiB
Go
package txprocessor
|
|
|
|
import (
|
|
"math/big"
|
|
|
|
"github.com/hermeznetwork/hermez-node/common"
|
|
"github.com/iden3/go-iden3-crypto/babyjub"
|
|
"github.com/iden3/go-merkletree"
|
|
)
|
|
|
|
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 {
|
|
func formatAccumulatedFees(collectedFees map[common.TokenID]*big.Int, orderTokenIDs []*big.Int, coordIdxs []common.Idx) []*big.Int {
|
|
accFeeOut := make([]*big.Int, len(orderTokenIDs))
|
|
for i := 0; i < len(accFeeOut); i++ {
|
|
accFeeOut[i] = big.NewInt(0)
|
|
}
|
|
for i := 0; i < len(coordIdxs); i++ {
|
|
tokenID := common.TokenIDFromBigInt(orderTokenIDs[i])
|
|
if _, ok := collectedFees[tokenID]; ok {
|
|
accFeeOut[i] = new(big.Int).Set(collectedFees[tokenID])
|
|
}
|
|
}
|
|
return accFeeOut
|
|
}
|