Fees on #StarkNet
The idea is to compute the L1 footprint of a transaction, including 2 dimensions:
- computational complexity: the heavier the transaction, the larger its portion in the proof verification cost
- on chain data: L1 call data cost
Let see how it works 🧵
The idea is to compute the L1 footprint of a transaction, including 2 dimensions:
- computational complexity: the heavier the transaction, the larger its portion in the proof verification cost
- on chain data: L1 call data cost
Let see how it works 🧵
Users can specify the maximum fee they are willing to pay via max_fee field of the transaction.
Fee mechanism:
#Computation =
Number of Cairo steps and applications of each builtins, weighted by a vector: CairoResourceFeeWeights
Current weights:
Fee mechanism:
#Computation =
Number of Cairo steps and applications of each builtins, weighted by a vector: CairoResourceFeeWeights
Current weights:
#OnChainData = storage updates + L2 <> L1 messages + deployed contracts
- Storage updates
For each contract: the keys to update and the new values
- L2 <> L1 messages
L2 sender, L1 destination, payload
- Deployed contracts
Contract address, class hash, constructor arguments
- Storage updates
For each contract: the keys to update and the new values
- L2 <> L1 messages
L2 sender, L1 destination, payload
- Deployed contracts
Contract address, class hash, constructor arguments
It is good to know how fees are computed because it has an impact on the design of your smart contracts. Basically devs can roughly assume that computation is cheap, and storage is more expensive.
Data availability is an important topic, see this great thread from @henrlihenrli:
https://twitter.com/henrlihenrli/status/1541823636562219008
More information about fee mechanism here: docs.starknet.io/docs/Fees/fee-…
• • •
Missing some Tweet in this thread? You can try to
force a refresh
