2#include "../../primitives/plookup/plookup.hpp"
8#include <gtest/gtest.h>
12template <
class Builder>
class StdlibKeccak :
public ::testing::Test {};
14using BuilderTypes = ::testing::Types<bb::UltraCircuitBuilder, bb::MegaCircuitBuilder>;
29 for (
size_t i = 0; i < 25; ++i) {
35 field_ct sparse_limb = accumulators[plookup::ColumnIdx::C2][0];
36 field_ct msb = accumulators[plookup::ColumnIdx::C3][accumulators[plookup::ColumnIdx::C3].size() - 1];
39 uint64_t expected_msb = (limb_native >> 63) & 1ULL;
42 EXPECT_EQ(
static_cast<uint64_t
>(msb.
get_value()), expected_msb);
46 EXPECT_EQ(proof_result,
true);
57 for (
size_t i = 0; i < 25; ++i) {
63 field_ct normalized_limb = accumulators[plookup::ColumnIdx::C2][0];
67 EXPECT_EQ(proof_result,
true);
78 for (
size_t i = 0; i < 25; ++i) {
81 for (
size_t j = 0; j < 8; ++j) {
82 extended_native *= 11;
83 expected_normalized *= 11;
85 uint64_t bit = base_value & 1;
86 extended_native += base_value;
87 expected_normalized += bit;
97 EXPECT_EQ(proof_result,
true);
108 constexpr_for<0, 25, 1>([&]<
size_t i> {
111 for (
size_t j = 0; j < 64; ++j) {
112 extended_native *= 11;
113 binary_native = binary_native << 1;
115 extended_native += base_value;
116 binary_native += (base_value & 1);
119 const size_t right_bits = 64 - left_bits;
120 const uint256_t left = binary_native >> right_bits;
121 const uint256_t right = binary_native - (left << right_bits);
122 const uint256_t binary_rotated = left + (right << left_bits);
126 const uint256_t expected_msb = (binary_native >> 63);
134 info(
"num gates = ",
builder.get_num_finalized_gates_inefficient());
136 EXPECT_EQ(proof_result,
true);
145 static constexpr uint64_t chi_normalization_table[5]{
151 for (
size_t i = 0; i < 25; ++i) {
155 for (
size_t j = 0; j < 8; ++j) {
156 extended_native *= 11;
157 normalized_native *= 11;
158 binary_native = binary_native << 1;
160 extended_native += base_value;
161 normalized_native += chi_normalization_table[base_value];
162 binary_native += chi_normalization_table[base_value];
165 const auto accumulators =
168 field_ct normalized = accumulators[plookup::ColumnIdx::C2][0];
169 field_ct msb = accumulators[plookup::ColumnIdx::C3][accumulators[plookup::ColumnIdx::C3].size() - 1];
174 info(
"num gates = n",
builder.get_num_finalized_gates_inefficient());
176 EXPECT_EQ(proof_result,
true);
190 for (
size_t i = 0; i < 25; ++i) {
200 for (
size_t i = 0; i < 25; i++) {
209 EXPECT_EQ(proof_result,
true);
212 for (
size_t i = 0; i < 25; i++) {
213 uint64_t circuit_value =
static_cast<uint64_t
>(circuit_output[i].get_value());
214 EXPECT_EQ(circuit_value, expected_state[i]);
217 info(
"num gates = ",
builder.get_num_finalized_gates_inefficient());
static bool check(const Builder &circuit)
Check the witness satisifies the circuit.
virtual uint64_t get_random_uint64()=0
bb::fr get_value() const
Given a := *this, compute its value given by a.v * a.mul + a.add.
static std::array< field_ct, NUM_KECCAK_LANES > permutation_opcode(std::array< field_ct, NUM_KECCAK_LANES > state, Builder *context)
static constexpr uint256_t convert_to_sparse(uint256_t input)
Convert a binary integer into a base11 integer.
static plookup::ReadData< field_pt > get_lookup_accumulators(const plookup::MultiTableId id, const field_pt &key_a, const field_pt &key_b=0, const bool is_2_to_1_lookup=false)
static field_pt read_from_1_to_2_table(const plookup::MultiTableId id, const field_pt &key_a)
void ethash_keccakf1600(uint64_t state[KECCAKF1600_LANES]) NOEXCEPT
ECCVMCircuitBuilder Builder
stdlib::witness_t< Builder > witness_ct
RNG & get_debug_randomness(bool reset, std::uint_fast64_t seed)
Entry point for Barretenberg command-line interface.
TYPED_TEST_SUITE(CommitmentKeyTest, Curves)
TYPED_TEST(CommitmentKeyTest, CommitToZeroPoly)
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
::testing::Types< UltraCircuitBuilder, MegaCircuitBuilder > BuilderTypes