Skip to content

compute tree #298

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
dbanks12 merged 2 commits into from
Mar 30, 2023
Merged

compute tree #298

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
93a954d
compute merkle tree
Mar 30, 2023
730fd46
compute tree comment
Mar 30, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
24 changes: 24 additions & 0 deletions cpp/src/barretenberg/stdlib/merkle_tree/hash.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -58,6 +58,30 @@ inline barretenberg::fr compute_tree_root_native(std::vector<barretenberg::fr> c
return layer[0];
}

// TODO write test
inline std::vector<barretenberg::fr> compute_tree_native(std::vector<barretenberg::fr> const& input)
{
// Check if the input vector size is a power of 2.
ASSERT(input.size() > 0);
ASSERT(numeric::is_power_of_two(input.size()));
auto layer = input;
std::vector<barretenberg::fr> tree(input);
while (layer.size() > 1) {
std::vector<barretenberg::fr> next_layer(layer.size() / 2);
for (size_t i = 0; i < next_layer.size(); ++i) {
if (plonk::SYSTEM_COMPOSER == plonk::PLOOKUP) {
next_layer[i] = crypto::pedersen_hash::lookup::hash_multiple({ layer[i * 2], layer[i * 2 + 1] });
} else {
next_layer[i] = crypto::pedersen_hash::hash_multiple({ layer[i * 2], layer[i * 2 + 1] });
}
tree.push_back(next_layer[i]);
}
layer = std::move(next_layer);
}

return tree;
}

} // namespace merkle_tree
} // namespace stdlib
} // namespace plonk