Merged
Conversation
|
👋 mchain0, thanks for creating this pull request! To help reviewers, please consider creating future PRs as drafts first. This allows you to self-review and make any final changes before notifying the team. Once you're ready, you can mark it as "Ready for review" to request feedback. Thanks! |
📊 API Diff Results
|
jmank88
previously approved these changes
Apr 3, 2026
MStreet3
reviewed
Apr 3, 2026
MStreet3
previously approved these changes
Apr 3, 2026
Co-authored-by: Street <5597260+MStreet3@users.noreply.github.com>
MStreet3
approved these changes
Apr 3, 2026
jmank88
approved these changes
Apr 3, 2026
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
with a multimodal tie (e.g. two distinct values each appear the same number of times, and that number still satisfies
modeHasQuorumfor the chosen quorum type), different processes can legitimately build modes in different orders and return differentmodes[0]. that breaks the expectation that all honest nodes compute the same aggregated value for the same observation multiset.fix: after collecting tied modes, choose one deterministically - by ordering and returning the observation for the smallest SHA.
TDD test approach: the test calls mode 400 times with the same slice and requires every result to match the first under
proto.Equal, before the fix it pretty quickly failed:iteration 13: mode() must pick the same tied winner on every call, and after the fix it passes.