Electroneum
bulletproof.h
Go to the documentation of this file.
1 // Copyright (c) 2014-2019, The Monero Project
2 //
3 // All rights reserved.
4 //
5 // Redistribution and use in source and binary forms, with or without modification, are
6 // permitted provided that the following conditions are met:
7 //
8 // 1. Redistributions of source code must retain the above copyright notice, this list of
9 // conditions and the following disclaimer.
10 //
11 // 2. Redistributions in binary form must reproduce the above copyright notice, this list
12 // of conditions and the following disclaimer in the documentation and/or other
13 // materials provided with the distribution.
14 //
15 // 3. Neither the name of the copyright holder nor the names of its contributors may be
16 // used to endorse or promote products derived from this software without specific
17 // prior written permission.
18 //
19 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
20 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
21 // MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
22 // THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
24 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25 // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
26 // STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
27 // THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 //
29 // Parts of this file are originally copyright (c) 2012-2013 The Cryptonote developers
30 
31 #pragma once
32 
33 #include "ringct/rctSigs.h"
34 #include "ringct/bulletproofs.h"
35 
36 template<bool a_verify, size_t n_amounts>
38 {
39 public:
40  static const size_t approx_loop_count = 100 / n_amounts;
41  static const size_t loop_count = (approx_loop_count >= 10 ? approx_loop_count : 10) / (a_verify ? 1 : 5);
42  static const bool verify = a_verify;
43 
44  bool init()
45  {
46  proof = rct::bulletproof_PROVE(std::vector<uint64_t>(n_amounts, 749327532984), rct::skvGen(n_amounts));
47  return true;
48  }
49 
50  bool test()
51  {
52  bool ret = true;
53  if (verify)
54  ret = rct::bulletproof_VERIFY(proof);
55  else
56  rct::bulletproof_PROVE(std::vector<uint64_t>(n_amounts, 749327532984), rct::skvGen(n_amounts));
57  return ret;
58  }
59 
60 private:
61  rct::Bulletproof proof;
62 };
63 
64 template<bool batch, size_t start, size_t repeat, size_t mul, size_t add, size_t N>
66 {
67 public:
68  static const size_t loop_count = 500 / (N * repeat);
69 
70  bool init()
71  {
72  size_t o = start;
73  for (size_t n = 0; n < N; ++n)
74  {
75  //printf("adding %zu times %zu\n", repeat, o);
76  for (size_t i = 0; i < repeat; ++i)
77  proofs.push_back(rct::bulletproof_PROVE(std::vector<uint64_t>(o, 749327532984), rct::skvGen(o)));
78  o = o * mul + add;
79  }
80  return true;
81  }
82 
83  bool test()
84  {
85  if (batch)
86  {
87  return rct::bulletproof_VERIFY(proofs);
88  }
89  else
90  {
91  for (const rct::Bulletproof &proof: proofs)
92  if (!rct::bulletproof_VERIFY(proof))
93  return false;
94  return true;
95  }
96  }
97 
98 private:
99  std::vector<rct::Bulletproof> proofs;
100 };
keyV skvGen(size_t rows)
Definition: rctOps.cpp:266
bool bulletproof_VERIFY(const Bulletproof &proof)
static const size_t approx_loop_count
Definition: bulletproof.h:40
static const size_t loop_count
Definition: bulletproof.h:41
static const bool verify
Definition: bulletproof.h:42
static const size_t loop_count
Definition: bulletproof.h:68
Bulletproof bulletproof_PROVE(const rct::key &v, const rct::key &gamma)