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.

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

Jump to bottom

Docs fix spelling issues #546

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Docs fix spelling issues #546

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
64bcb0d
Update CHANGELOG.md
nnsW3 Sep 24, 2024
59cf34d
Update tree.go
nnsW3 Sep 24, 2024
7d68950
Update multiexp_affine.go
nnsW3 Sep 24, 2024
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
2 changes: 1 addition & 1 deletion CHANGELOG.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -36,7 +36,7 @@
- resolve conflict around kzg

### Perf
- remove uneeded bucket init in affine coordinates fixes [#529](https://github.com/ConsenSys/gnark-crypto/issues/529) ([#530](https://github.com/ConsenSys/gnark-crypto/issues/530))
- remove unneeded bucket init in affine coordinates fixes [#529](https://github.com/ConsenSys/gnark-crypto/issues/529) ([#530](https://github.com/ConsenSys/gnark-crypto/issues/530))

### Refactor
- variable name
Expand Down
2 changes: 1 addition & 1 deletion accumulator/merkletree/tree.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -158,7 +158,7 @@ func (t *Tree) Prove() (merkleRoot []byte, proofSet [][]byte, proofIndex uint64,
// containing the proof index as left siblings.

// Start at the smallest subtree and combine it with larger subtrees until
// it would be combining with the subtree that contains the proof index. We
// it would be combined with the subtree that contains the proof index. We
// can recognize the subtree containing the proof index because the height
// of that subtree will be one less than the current length of the proof
// set.
Expand Down
2 changes: 1 addition & 1 deletion ecc/bls12-377/multiexp_affine.go
View file
Open in desktop

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