nspcc-dev / nspcc-dev/dbft

Better states separation

Open
#130 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

enhancement I4 S2 U4
Dominant language
Go
Stars
20
Forks
4
Avg merge
19h 59m
Merged PRs (30d)
1

Description

Is your feature request related to a problem? Please describe.

With anti-MEV extension added, the bounds between states in our nice and simple state machine are vanishing. There's a set of repetitive checks (https://github.com/nspcc-dev/dbft/pull/129#discussion_r1741086328) in state transitions that may be avoided.

Describe the solution you'd like

We need to refactor anti-MEV extension to have more clean state transitions.

Describe alternatives you've considered

Leave it as is, it works.

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start by reading the anti-MEV extension and the repetitive state-transition checks discussed in PR #129. Identify how the current state boundaries overlap before proposing the refactor. Done means the anti-MEV extension has cleaner state transitions while preserving the existing behavior.

Written by the indexing model from the issue text.

Assessment

Tech stack
go
Domain
distributed-systems
Issue type
Refactor
Difficulty
4/5
Estimated time
3-5 days
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.