You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

158 lines
5.2 KiB

  1. package statedb
  2. import (
  3. "bytes"
  4. "fmt"
  5. "math/big"
  6. ethCommon "github.com/ethereum/go-ethereum/common"
  7. "github.com/hermeznetwork/hermez-node/common"
  8. "github.com/hermeznetwork/hermez-node/log"
  9. "github.com/iden3/go-iden3-crypto/babyjub"
  10. "github.com/iden3/go-merkletree"
  11. )
  12. func concatEthAddrTokenID(addr ethCommon.Address, tokenID common.TokenID) []byte {
  13. var b []byte
  14. b = append(b, addr.Bytes()...)
  15. b = append(b[:], tokenID.Bytes()[:]...)
  16. return b
  17. }
  18. func concatEthAddrBJJTokenID(addr ethCommon.Address, pk *babyjub.PublicKey, tokenID common.TokenID) []byte {
  19. pkComp := pk.Compress()
  20. var b []byte
  21. b = append(b, addr.Bytes()...)
  22. b = append(b[:], pkComp[:]...)
  23. b = append(b[:], tokenID.Bytes()[:]...)
  24. return b
  25. }
  26. // setIdxByEthAddrBJJ stores the given Idx in the StateDB as follows:
  27. // - key: Eth Address, value: idx
  28. // - key: EthAddr & BabyJubJub PublicKey Compressed, value: idx
  29. // If Idx already exist for the given EthAddr & BJJ, the remaining Idx will be
  30. // always the smallest one.
  31. func (s *StateDB) setIdxByEthAddrBJJ(idx common.Idx, addr ethCommon.Address, pk *babyjub.PublicKey, tokenID common.TokenID) error {
  32. oldIdx, err := s.GetIdxByEthAddrBJJ(addr, pk, tokenID)
  33. if err == nil {
  34. // EthAddr & BJJ already have an Idx
  35. // check which Idx is smaller
  36. // if new idx is smaller, store the new one
  37. // if new idx is bigger, don't store and return, as the used one will be the old
  38. if idx >= oldIdx {
  39. log.Debug("StateDB.setIdxByEthAddrBJJ: Idx not stored because there already exist a smaller Idx for the given EthAddr & BJJ")
  40. return nil
  41. }
  42. }
  43. // store idx for EthAddr & BJJ assuming that EthAddr & BJJ still don't
  44. // have an Idx stored in the DB, and if so, the already stored Idx is
  45. // bigger than the given one, so should be updated to the new one
  46. // (smaller)
  47. tx, err := s.db.NewTx()
  48. if err != nil {
  49. return err
  50. }
  51. k := concatEthAddrBJJTokenID(addr, pk, tokenID)
  52. // store Addr&BJJ-idx
  53. idxBytes, err := idx.Bytes()
  54. if err != nil {
  55. return err
  56. }
  57. err = tx.Put(append(PrefixKeyAddrBJJ, k...), idxBytes[:])
  58. if err != nil {
  59. return err
  60. }
  61. // store Addr-idx
  62. k = concatEthAddrTokenID(addr, tokenID)
  63. err = tx.Put(append(PrefixKeyAddr, k...), idxBytes[:])
  64. if err != nil {
  65. return err
  66. }
  67. err = tx.Commit()
  68. if err != nil {
  69. return err
  70. }
  71. return nil
  72. }
  73. // GetIdxByEthAddr returns the smallest Idx in the StateDB for the given
  74. // Ethereum Address. Will return common.Idx(0) and error in case that Idx is
  75. // not found in the StateDB.
  76. func (s *StateDB) GetIdxByEthAddr(addr ethCommon.Address, tokenID common.TokenID) (common.Idx, error) {
  77. k := concatEthAddrTokenID(addr, tokenID)
  78. b, err := s.db.Get(append(PrefixKeyAddr, k...))
  79. if err != nil {
  80. return common.Idx(0), fmt.Errorf("GetIdxByEthAddr: %s: ToEthAddr: %s, TokenID: %d", ErrToIdxNotFound, addr.Hex(), tokenID)
  81. }
  82. idx, err := common.IdxFromBytes(b)
  83. if err != nil {
  84. return common.Idx(0), fmt.Errorf("GetIdxByEthAddr: %s: ToEthAddr: %s, TokenID: %d", err, addr.Hex(), tokenID)
  85. }
  86. return idx, nil
  87. }
  88. // GetIdxByEthAddrBJJ returns the smallest Idx in the StateDB for the given
  89. // Ethereum Address AND the given BabyJubJub PublicKey. If `addr` is the zero
  90. // address, it's ignored in the query. If `pk` is nil, it's ignored in the
  91. // query. Will return common.Idx(0) and error in case that Idx is not found in
  92. // the StateDB.
  93. func (s *StateDB) GetIdxByEthAddrBJJ(addr ethCommon.Address, pk *babyjub.PublicKey, tokenID common.TokenID) (common.Idx, error) {
  94. if !bytes.Equal(addr.Bytes(), common.EmptyAddr.Bytes()) && pk == nil {
  95. // ToEthAddr
  96. // case ToEthAddr!=0 && ToBJJ=0
  97. return s.GetIdxByEthAddr(addr, tokenID)
  98. } else if !bytes.Equal(addr.Bytes(), common.EmptyAddr.Bytes()) && pk != nil {
  99. // case ToEthAddr!=0 && ToBJJ!=0
  100. k := concatEthAddrBJJTokenID(addr, pk, tokenID)
  101. b, err := s.db.Get(append(PrefixKeyAddrBJJ, k...))
  102. if err != nil {
  103. return common.Idx(0), fmt.Errorf("GetIdxByEthAddrBJJ: %s: ToEthAddr: %s, ToBJJ: %s, TokenID: %d", ErrToIdxNotFound, addr.Hex(), pk, tokenID)
  104. }
  105. idx, err := common.IdxFromBytes(b)
  106. if err != nil {
  107. return common.Idx(0), fmt.Errorf("GetIdxByEthAddrBJJ: %s: ToEthAddr: %s, ToBJJ: %s, TokenID: %d", err, addr.Hex(), pk, tokenID)
  108. }
  109. return idx, nil
  110. }
  111. // rest of cases (included case ToEthAddr==0) are not possible
  112. return common.Idx(0), fmt.Errorf("GetIdxByEthAddrBJJ: Not found, %s: ToEthAddr: %s, ToBJJ: %s, TokenID: %d", ErrGetIdxNoCase, addr.Hex(), pk, tokenID)
  113. }
  114. func (s *StateDB) getTokenIDsFromIdxs(idxs []common.Idx) (map[common.TokenID]common.Idx, error) {
  115. m := make(map[common.TokenID]common.Idx)
  116. for i := 0; i < len(idxs); i++ {
  117. a, err := s.GetAccount(idxs[i])
  118. if err != nil {
  119. return nil, fmt.Errorf("getTokenIDsFromIdxs error on GetAccount with Idx==%d: %s", idxs[i], err.Error())
  120. }
  121. m[a.TokenID] = idxs[i]
  122. }
  123. return m, nil
  124. }
  125. func siblingsToZKInputFormat(s []*merkletree.Hash) []*big.Int {
  126. b := make([]*big.Int, len(s))
  127. for i := 0; i < len(s); i++ {
  128. b[i] = s[i].BigInt()
  129. }
  130. return b
  131. }
  132. // BJJCompressedTo256BigInts returns a [256]*big.Int array with the bit
  133. // representation of the babyjub.PublicKeyComp
  134. func BJJCompressedTo256BigInts(pkComp babyjub.PublicKeyComp) [256]*big.Int {
  135. var r [256]*big.Int
  136. b := pkComp[:]
  137. for i := 0; i < 256; i++ {
  138. if b[i/8]&(1<<(i%8)) == 0 {
  139. r[i] = big.NewInt(0)
  140. } else {
  141. r[i] = big.NewInt(1)
  142. }
  143. }
  144. return r
  145. }