Barretenberg
The ZK-SNARK library at the core of Aztec
|
#include <gtest/gtest.h>
#include "barretenberg/circuit_checker/circuit_checker.hpp"
#include "barretenberg/ecc/curves/bn254/fr.hpp"
#include "barretenberg/ecc/curves/bn254/g1.hpp"
#include "barretenberg/flavor/ultra_flavor.hpp"
#include "barretenberg/flavor/ultra_recursive_flavor.hpp"
#include "barretenberg/flavor/ultra_rollup_recursive_flavor.hpp"
#include "barretenberg/polynomials/univariate.hpp"
#include "barretenberg/stdlib/proof/proof.hpp"
#include "barretenberg/transcript/transcript.hpp"
#include "barretenberg/ultra_honk/decider_proving_key.hpp"
#include "barretenberg/ultra_honk/ultra_prover.hpp"
#include "barretenberg/ultra_honk/ultra_verifier.hpp"
Go to the source code of this file.
Namespaces | |
namespace | bb |
Entry point for Barretenberg command-line interface. | |
namespace | bb::stdlib |
namespace | bb::stdlib::recursion |
namespace | bb::stdlib::recursion::honk |
Functions | |
template<class Flavor , size_t LENGTH> | |
auto | bb::stdlib::recursion::honk::generate_mock_proof_data (auto prover_transcript) |
Create some mock data; add it to the provided prover transcript in various mock rounds. | |
template<class Flavor , size_t LENGTH> | |
void | bb::stdlib::recursion::honk::perform_mock_verifier_transcript_operations (auto transcript) |
Perform series of verifier transcript operations. | |
bb::stdlib::recursion::honk::TEST (RecursiveHonkTranscript, InterfacesMatch) | |
Test basic transcript functionality and check circuit. | |
bb::stdlib::recursion::honk::TEST (RecursiveHonkTranscript, ReturnValuesMatch) | |
Check that native and stdlib verifier transcript functions produce equivalent outputs. | |
bb::stdlib::recursion::honk::TEST (RecursiveTranscript, InfinityConsistencyGrumpkin) | |
Ensure that when encountering an infinity commitment results stay consistent in the recursive and native case for Grumpkin and the native and stdlib transcripts produce the same challenge. | |
bb::stdlib::recursion::honk::TEST (RecursiveTranscript, InfinityConsistencyBN254) | |
Ensure that when encountering an infinity commitment results stay consistent in the recursive and native case for BN254 and the native and stdlib transcripts produce the same challenge. | |