text: // Copyright (c) 2014-2018, The Monero 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 <vector>
  
  #include "cryptonote_basic/account.h"
  #include "cryptonote_basic/cryptonote_basic.h"
  #include "cryptonote_core/cryptonote_tx_utils.h"
  #include "crypto/crypto.h"
  #include "ringct/rctSigs.h"
  
  #include "multi_tx_test_base.h"
  
  template<size_t a_ring_size, size_t a_outputs, bool a_rct, rct::RangeProofType range_proof_type = rct::RangeProofType::Borromean, int bp_version = 2>
  class test_check_tx_signature : private multi_tx_test_base<a_ring_size>
  {
    static_assert(0 < a_ring_size, "ring_size must be greater than 0");
  
  public:
    static const size_t loop_count = a_rct ? (a_ring_size <= 2 ? 50 : 10) : a_ring_size < 100 ? 100 : 10;
    static const size_t ring_size = a_ring_size;
    static const size_t outputs = a_outputs;
    static const bool rct = a_rct;
  
    typedef multi_tx_test_base<a_ring_size> base_class;
  
    bool init()
    {
      using namespace cryptonote;
  
      if (!base_class::init())
        return false;
  
      m_alice.generate();
  
      std::vector<tx_destination_entry> destinations;
      destinations.push_back(tx_destination_entry(this->m_source_amount - outputs + 1, m_alice.get_keys().m_account_address, false));
      for (size_t n = 1; n < outputs; ++n)
        destinations.push_back(tx_destination_entry(1, m_alice.get_keys().m_account_address, false));
  
      crypto::secret_key tx_key;
      std::vector<crypto::secret_key> additional_tx_keys;
      std::unordered_map<crypto::public_key, cryptonote::subaddress_index> subaddresses;
      subaddresses[this->m_miners[this->real_source_idx].get_keys().m_account_address.m_spend_public_key] = {0,0};
      quenero_construct_tx_params tx_params;
      tx_params.hf_version = cryptonote::network_version_count - 1;
      rct::RCTConfig rct_config{range_proof_type, bp_version};
      if (!construct_tx_and_get_tx_key(this->m_miners[this->real_source_idx].get_keys(), subaddresses, this->m_sources, destinations, cryptonote::tx_destination_entry{}, std::vector<uint8_t>(), m_tx, 0, tx_key, additional_tx_keys, rct_config, nullptr, tx_params))
        return false;
  
      get_transaction_prefix_hash(m_tx, m_tx_prefix_hash);
  
      return true;
    }
  
    bool test()
    {
      if (rct)
      {
        if (m_tx.rct_signatures.type == rct::RCTType::Full)
          return rct::verRct(m_tx.rct_signatures);
        else
          return rct::verRctSimple(m_tx.rct_signatures);
      }
      else
      {
        const cryptonote::txin_to_key& txin = var::get<cryptonote::txin_to_key>(m_tx.vin[0]);
        return crypto::check_ring_signature(m_tx_prefix_hash, txin.k_image, this->m_public_key_ptrs, m_tx.signatures[0].data());
      }
    }
  
  private:
    cryptonote::account_base m_alice;
    cryptonote::transaction m_tx;
    crypto::hash m_tx_prefix_hash;
  };
  
  template<size_t a_ring_size, size_t a_outputs, size_t a_num_txes, size_t extra_outs = 0>
  class test_check_tx_signature_aggregated_bulletproofs : private multi_tx_test_base<a_ring_size>
  {
    static_assert(0 < a_ring_size, "ring_size must be greater than 0");
  
  public:
    static const size_t loop_count = a_ring_size <= 2 ? 50 : 10;
    static const size_t ring_size = a_ring_size;
    static const size_t outputs = a_outputs;
  
    typedef multi_tx_test_base<a_ring_size> base_class;
  
    bool init()
    {
      using namespace cryptonote;
  
      if (!base_class::init())
        return false;
  
      m_alice.generate();
  
      std::vector<tx_destination_entry> destinations;
      destinations.push_back(tx_destination_entry(this->m_source_amount - outputs + 1, m_alice.get_keys().m_account_address, false));
      for (size_t n = 1; n < outputs; ++n)
        destinations.push_back(tx_destination_entry(1, m_alice.get_keys().m_account_address, false));
  
      crypto::secret_key tx_key;
      std::vector<crypto::secret_key> additional_tx_keys;
      std::unordered_map<crypto::public_key, cryptonote::subaddress_index> subaddresses;
      subaddresses[this->m_miners[this->real_source_idx].get_keys().m_account_address.m_spend_public_key] = {0,0};
  
      quenero_construct_tx_params tx_params;
      tx_params.hf_version = cryptonote::network_version_count - 1;
      m_txes.resize(a_num_txes + (extra_outs > 0 ? 1 : 0));
      for (size_t n = 0; n < a_num_txes; ++n)
      {
        if (!construct_tx_and_get_tx_key(this->m_miners[this->real_source_idx].get_keys(), subaddresses, this->m_sources, destinations, cryptonote::tx_destination_entry{}, std::vector<uint8_t>(), m_txes[n], 0, tx_key, additional_tx_keys, {rct::RangeProofType::PaddedBulletproof, 2}, nullptr, tx_params))
          return false;
      }
  
      if (extra_outs)
      {
        destinations.clear();
        destinations.push_back(tx_destination_entry(this->m_source_amount - extra_outs + 1, m_alice.get_keys().m_account_address, false));
        if constexpr (extra_outs > 1)
          for (size_t n = 1; n < extra_outs; ++n)
            destinations.push_back(tx_destination_entry(1, m_alice.get_keys().m_account_address, false));
  
        if (!construct_tx_and_get_tx_key(this->m_miners[this->real_source_idx].get_keys(), subaddresses, this->m_sources, destinations, cryptonote::tx_destination_entry{}, std::vector<uint8_t>(), m_txes.back(), 0, tx_key, additional_tx_keys, {rct::RangeProofType::MultiOutputBulletproof, 2}, nullptr, tx_params))
          return false;
      }
  
      return true;
    }
  
    bool test()
    {
      std::vector<const rct::rctSig*> rvv;
      rvv.reserve(m_txes.size());
      for (size_t n = 0; n < m_txes.size(); ++n)
      {
        const rct::rctSig &rv = m_txes[n].rct_signatures;
        if (!rct::verRctNonSemanticsSimple(rv))
          return false;
        rvv.push_back(&rv);
      }
      return rct::verRctSemanticsSimple(rvv);
    }
  
  private:
    cryptonote::account_base m_alice;
    std::vector<cryptonote::transaction> m_txes;
  };
  