Skip to content

Commit

Permalink
Remove cout#78
Browse files Browse the repository at this point in the history
  • Loading branch information
@ETatuzova
ETatuzova committed Apr 24, 2024
1 parent 4207271 commit e22e12b
Show file tree
Hide file tree
Showing 4 changed files with 0 additions and 30 deletions.
3 changes: 0 additions & 3 deletions include/nil/blueprint/transpiler/evm_verifier_gen.hpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -245,8 +245,6 @@ namespace nil {
}
_use_lookups = _constraint_system.lookup_gates().size() > 0;
_use_permutations = common_data.permuted_columns.size() > 0;
std::cout << "Permuted columns " << common_data.permuted_columns.size() << std::endl;
std::cout << "Batches_num " << _placeholder_info.batches_num << std::endl;

_z_offset = (_placeholder_info.batches_num - 1) * 0x28 + 0x29;
_special_selectors_offset = _z_offset + _permutation_size * 0x40;
Expand Down Expand Up @@ -541,7 +539,6 @@ namespace nil {
} else {
auto it = constraints.begin();
while (it != constraints.end()) {
std::cout << "Gates modules count" << gate_modules_count << std::endl;
std::string code = print_constraint_series(it, constraints.end());

std::string result = modular_external_gate_library_template;
Expand Down
16 changes: 0 additions & 16 deletions include/nil/blueprint/transpiler/lpc_scheme_gen.hpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -66,22 +66,6 @@ namespace nil {
common_data, permutation_size, quotient_polys, lookup_polys,
"evm" // Generator mode
);
std::cout << "Singles" << std::endl;
for( std::size_t i = 0; i < singles_strs.size(); i++){
std::cout << singles_strs[i] << std::endl;
}
std::cout << "Z point indices " << std::endl;
for( std::size_t i = 0; i < z_points_indices.size(); i++ ){
std::cout << z_points_indices[i] << " ";
}
std::cout << std::endl;
for( std::size_t i = 0; i < poly_ids.size(); i++ ){
std::cout << "Poly ids " << std::endl;
for( std::size_t j = 0; j < poly_ids[i].size(); j++ ){
std::cout << poly_ids[i][j] << " ";
}
std::cout << std::endl;
}

std::stringstream points_initializer;
std::size_t i = 0;
Expand Down
3 changes: 0 additions & 3 deletions include/nil/blueprint/transpiler/templates/permutation_argument_chunked.hpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -102,7 +102,6 @@ library modular_permutation_argument_$TEST_NAME${
unchecked{cur++;}
if( cur == max_quotient_chunks - 1 ){
state.current_value = basic_marshalling.get_uint256_be(blob, table_values_offset + $PERMUTATION_TABLE_OFFSET$ + 0x40 + (chunk<<5));
console.log("Permutation chunk", state.current_value);
F[1] = addmod(
F[1],
mulmod(
Expand All @@ -116,7 +115,6 @@ library modular_permutation_argument_$TEST_NAME${
),
modulus
);
console.log("EVM Permutation F = ", F[1]);
state.previous_value = state.current_value;
state.g = 1;
state.h = 1;
Expand All @@ -138,7 +136,6 @@ library modular_permutation_argument_$TEST_NAME${
),
modulus
);
console.log("Pre-final F[1]", F[1]);
state.tmp = addmod(
addmod(
basic_marshalling.get_uint256_be(blob, special_selectors_offset),
Expand Down
8 changes: 0 additions & 8 deletions include/nil/blueprint/transpiler/util.hpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -112,7 +112,6 @@ namespace nil {
std::size_t sorted_size,
std::string mode
){
std::cout << "Calculate unique points" <<std::endl;
std::vector<std::size_t> z_points_indices;
std::vector<std::string> singles;
std::map<std::string, std::size_t> singles_map;
Expand Down Expand Up @@ -165,9 +164,7 @@ namespace nil {

for(std::size_t i = 0; i < desc.selector_columns; i++){
std::stringstream str;
std::cout << "Selector column " << i << " rotations ";
for(auto j:common_data.columns_rotations[i + desc.witness_columns + desc.public_input_columns + desc.constant_columns]){
std::cout << j << " ";
if(singles_map.find(rot_string(j, rows_amount, mode)) == singles_map.end()){
singles_map[rot_string(j, rows_amount, mode)] = singles_map.size();
singles.push_back(rot_string(j, rows_amount, mode));
Expand All @@ -176,7 +173,6 @@ namespace nil {
poly_ids[singles_map[rot_string(j, rows_amount, mode)]].push_back(count);
z_points_indices.push_back(singles_map[rot_string(j, rows_amount, mode)]);
}
std::cout << std::endl;
count++;
}

Expand Down Expand Up @@ -210,7 +206,6 @@ namespace nil {

// Permutation argument
if( placeholder_info.use_permutations ){
std::cout << "Use permutations" << std::endl;
poly_ids[singles_map[rot_string(0, rows_amount, mode)]].push_back(count);
poly_ids[singles_map[rot_string(1, rows_amount, mode)]].push_back(count);
z_points_indices.push_back(singles_map[rot_string(0, rows_amount, mode)]);
Expand All @@ -225,8 +220,6 @@ namespace nil {

// Lookup permutation
if(placeholder_info.use_lookups){
std::cout << "Use lookups" << std::endl;
std::cout << "Lookup_poly amount = " << placeholder_info.lookup_poly_amount << std::endl;
poly_ids[singles_map[rot_string(0, rows_amount, mode)]].push_back(count);
poly_ids[singles_map[rot_string(1, rows_amount, mode)]].push_back(count);
z_points_indices.push_back(singles_map[rot_string(0, rows_amount, mode)]);
Expand All @@ -240,7 +233,6 @@ namespace nil {
}

// Quotient
std::cout << "Quotient size" << placeholder_info.quotient_size << ", " << quotient_size << std::endl;
for(std::size_t i = 0; i < placeholder_info.quotient_size; i++){
poly_ids[singles_map[rot_string(0, rows_amount, mode)]].push_back(count);
z_points_indices.push_back(singles_map[rot_string(0, rows_amount, mode)]);
Expand Down

0 comments on commit e22e12b

Please sign in to comment.