Skip to content

feat: use longest common prefix for determining tx replay set #6352

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

Closed
wants to merge 31 commits into from

Conversation

hstove
Copy link
Contributor

@hstove hstove commented Aug 5, 2025

This PR adds the ability for the global state machine evaluator to use a longest common prefix algorithm to determine the global transaction replay set after a fork.

For example, if one replay set is [A,B,C] with 50% weight, and another is [A,B] with 30% weight, then we will use [A,B] as the global replay set.

There is code for ensuring we end up with a deterministic global replay set by doing a comparison of signer weight, and then length, and then via txid comparisons.

hstove added 30 commits June 19, 2025 15:19
@hstove hstove requested review from a team as code owners August 5, 2025 23:36
@hstove
Copy link
Contributor Author

hstove commented Aug 5, 2025

Closing - this is built on top of the failsafe PR, but it can just be opened on top of develop (which is #6353)

@hstove hstove closed this Aug 5, 2025
Copy link

This pull request has been automatically locked since there has not been any recent activity after it was closed. Please open a new issue for related bugs.

@github-actions github-actions bot locked as resolved and limited conversation to collaborators Aug 13, 2025
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant