Replies: 3 comments 6 replies
-
Nice project. Has anyone already adapted it to a production environment? |
Beta Was this translation helpful? Give feedback.
-
Like the sorting problem of the transaction pool above, it is actually the same problem as the Nonce value problem I mentioned earlier. At present, each person can only have one op at the same time. If it is changed to be compatible with many ops, the sorting function of the transaction pool also needs to be further changed. |
Beta Was this translation helpful? Give feedback.
-
Just adding that there were some changes to 4337 about how the nonces are handled: https://eips.ethereum.org/EIPS/eip-4337#semi-abstracted-nonce-support Bundler doesn't yet handle that. We are happy to accept contributions @octavei |
Beta Was this translation helpful? Give feedback.
-
We assume that a person has many ops in the transaction pool, and the op monotonically increases the max_priority_fee_per_gas value. At this time, since the max_priority_fee_per_gas is ranked first, it eventually leads to the op with a large Nonce being submitted first, and the verification simulation fails.
code in project(crates/uopool/src/memory/mempool.rs):
Beta Was this translation helpful? Give feedback.
All reactions