text: // Copyright (c) 2014-2019, The ByteRub Project
  // 
  // All rights reserved.
  // 
  // Redistribution and use in source and binary forms, with or without modification, are
  // permitted provided that the following conditions are met:
  // 
  // 1. Redistributions of source code must retain the above copyright notice, this list of
  //    conditions and the following disclaimer.
  // 
  // 2. Redistributions in binary form must reproduce the above copyright notice, this list
  //    of conditions and the following disclaimer in the documentation and/or other
  //    materials provided with the distribution.
  // 
  // 3. Neither the name of the copyright holder nor the names of its contributors may be
  //    used to endorse or promote products derived from this software without specific
  //    prior written permission.
  // 
  // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
  // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
  // MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
  // THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  // STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
  // THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  // 
  // Parts of this file are originally copyright (c) 2012-2013 The Cryptonote developers
  
  #pragma once
  
  #include "ringct/rctSigs.h"
  #include "ringct/bulletproofs.h"
  
  template<bool a_verify, size_t n_amounts>
  class test_bulletproof
  {
  public:
    static const size_t approx_loop_count = 100 / n_amounts;
    static const size_t loop_count = (approx_loop_count >= 10 ? approx_loop_count : 10) / (a_verify ? 1 : 5);
    static const bool verify = a_verify;
  
    bool init()
    {
      proof = rct::bulletproof_PROVE(std::vector<uint64_t>(n_amounts, 749327532984), rct::skvGen(n_amounts));
      return true;
    }
  
    bool test()
    {
      bool ret = true;
      if (verify)
        ret = rct::bulletproof_VERIFY(proof);
      else
        rct::bulletproof_PROVE(std::vector<uint64_t>(n_amounts, 749327532984), rct::skvGen(n_amounts));
      return ret;
    }
  
  private:
    rct::Bulletproof proof;
  };
  
  template<bool batch, size_t start, size_t repeat, size_t mul, size_t add, size_t N>
  class test_aggregated_bulletproof
  {
  public:
    static const size_t loop_count = 500 / (N * repeat);
  
    bool init()
    {
      size_t o = start;
      for (size_t n = 0; n < N; ++n)
      {
        //printf("adding %zu times %zu\n", repeat, o);
        for (size_t i = 0; i < repeat; ++i)
          proofs.push_back(rct::bulletproof_PROVE(std::vector<uint64_t>(o, 749327532984), rct::skvGen(o)));
        o = o * mul + add;
      }
      return true;
    }
  
    bool test()
    {
      if (batch)
      {
        return rct::bulletproof_VERIFY(proofs);
      }
      else
      {
        for (const rct::Bulletproof &proof: proofs)
          if (!rct::bulletproof_VERIFY(proof))
            return false;
        return true;
      }
    }
  
  private:
    std::vector<rct::Bulletproof> proofs;
  };
  