Daniel Wang
Daniel Wang
Please think more. These ideas may turn out to have some downside :)
# Implementing a simple, batch-based auction system for prover cost-efficiency ## Background Our current tokenomics framework rewards the fastest prover, encouraging prioritization of speed over cost-effectiveness. This conflicts with Taiko's...
Following several attempts at designing and implementing Taiko's tokenomics, I've come to a few important realizations: - We may have underestimated the complexity and time investment required for this task....
In an effort to facilitate our ongoing discussions on tokenomics, I've developed a comparison table based on the metrics we've discussed. You may observe that these metrics seemingly tilt towards...
> I changed a ✕ to a ✓ for Alpha-3 for "Preference for Cheaper over Faster Proofs" because that fee system also selects the most efficient proof for the target...
**Isn't PoS the same as *the rich ones always wins*?** Assuming Alice stakes a lot of tokens and now can prove 10% of all blocks, but her proofs are on...
Maybe we should prepare two branches with different tokenomics. When we launch our mainnet, we can have one token but two L2s, each with a different tokenomics. If we feel...
An updated diagram based on the above idea is here: https://github.com/taikoxyz/taiko-mono/blob/prover_req_diagram_depositsRoot/packages/protocol/docs/how_taiko_proves_blocks.md
I think we can just leave the implementation as-is?
I don't think this is a valid attack vector, but I'd also like to learn more. Please feel free to reopen this issue if more information can be provided.