Skip to content
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.

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

refactor(pb/proof.go)!: converting pb definition to use snake_case #232

Merged
merged 2 commits into from
Aug 31, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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
39 changes: 20 additions & 19 deletions pb/proof.pb.go

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

10 changes: 5 additions & 5 deletions pb/proof.proto
Original file line number Diff line number Diff line change
Expand Up @@ -12,11 +12,11 @@ message Proof {
int64 end = 2;
// Nodes hold the tree nodes necessary for the Merkle range proof.
repeated bytes nodes = 3;
// LeafHash contains the namespace.ID if NMT does not have it and
// it should be proven. LeafHash is necessary to prove the Absence Proof.
// leaf_hash contains the namespace.ID if NMT does not have it and
// it should be proven. leaf_hash is necessary to prove the Absence Proof.
// This field will be empty in case of Inclusion Proof.
bytes leafHash = 4;
// The isMaxNamespaceIgnored flag influences the calculation of the
bytes leaf_hash = 4;
// The is_max_namespace_ignored flag influences the calculation of the
// namespace ID range for intermediate nodes in the tree.
bool isMaxNamespaceIgnored=5;
bool is_max_namespace_ignored=5;
}
Loading