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

Caplin: Fix aggregate quality #12583

Merged
merged 6 commits into from
Nov 15, 2024
Merged

Caplin: Fix aggregate quality #12583

merged 6 commits into from
Nov 15, 2024

Conversation

Giulio2002
Copy link
Contributor

@Giulio2002 Giulio2002 commented Nov 2, 2024

Basically we had wrong behaviour is overlapping bits. last bit on are length and shall not be counted. also decreased batched chunk size

@Giulio2002 Giulio2002 enabled auto-merge (squash) November 14, 2024 12:57
}
var foundOverlap bool
// check the overlap bit by bit
for j := 0; j < 8; j++ {
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

So if we have two positions in both bytes where bits are 1s in both of them we return true? that's the intention right?

@@ -160,16 +160,42 @@ func IsNonStrictSupersetBitlist(a, b []byte) bool {
return true
}

func IsOverlappingBitlist(a, b []byte) bool {
// IsOverlappingSSZBitlist checks if bitlist 'a' and bitlist 'b' have any overlapping bits
// However, it ignores the last bits in the last byte.
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

In the last byte we check all the 8 bits. Is this correct comment?

@Giulio2002 Giulio2002 merged commit adfdcbd into main Nov 15, 2024
14 of 15 checks passed
@Giulio2002 Giulio2002 deleted the fix-aggregate-quality branch November 15, 2024 13:23
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants