Skip to content

fix: python rounding #100

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.

Sign up for GitHub

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

Merged
LHerskind merged 2 commits into from
Feb 23, 2026
Merged

fix: python rounding #100

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
f68fc8f
fix: python rounding
LHerskind Feb 23, 2026
6e925b0
fix: 3.6M for epoch verification
LHerskind Feb 23, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions docs/fees/notebook/fee-model.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -546,7 +546,7 @@ def fee_update_fraction(self) -> Uint256:
A bit of magic for the fake exponential and integer math. Computing the divisor this way should ensure
that the multiplier will increase by at most a factor of ~ 1.125 every block.
"""
return Uint256(int(self.mana_target.value / 0.117))
return Uint256((self.mana_target.value * 854_700_854) // 100_000_000)

def compute_sequencer_costs(
self, block: Optional[Block], real=False
Expand Down Expand Up @@ -820,9 +820,9 @@ def _(
random,
):
fee_model = FeeModel(
mana_target=Uint256(int(1e8)),
l1_gas_per_block_proposed=Uint256(int(0.3e6)),
l1_gas_per_epoch_verified=Uint256(int(1e6)),
mana_target=Uint256(int(75_000_000)),
l1_gas_per_block_proposed=Uint256(int(300_000)),
l1_gas_per_epoch_verified=Uint256(int(3_600_000)),
proving_cost_per_mana=Uint256(int(WEI_PER_MANA)),
l1_gas_oracle=L1GasOracle(
pre=L1Fees(blob_fee=Uint256(1), base_fee=Uint256(int(1e9))),
Expand Down