Max-min Fairness Based Faucet Design for Blockchains
Serdar Metin, Can \"Ozturan

TL;DR
This paper introduces a max-min fairness algorithm and Solidity implementation for distributing Ether via faucets in blockchains, ensuring fairness while maintaining low transaction costs regardless of user count.
Contribution
The work presents a novel max-min fairness algorithm and a low-cost Solidity smart contract for equitable Ether distribution in blockchain faucets.
Findings
Low transaction costs achieved regardless of user number
Algorithm confirmed effective through testing
Smart contract scalable for large user bases
Abstract
In order to have transactions executed and recorded on blockchains such as the Ethereum Mainnet, fees expressed in crypto-currency units of the blockchain must be paid. One can buy crypto-currency called Ether of the Ethereum blockchain from exchanges and pay for the transaction fees. In the case of test networks (such as Rinkeby) or scientific research blockchains (such as Bloxberg), free crypto-currency, Ether, is distributed to users via faucets. Since transaction slots on the blocks, storage and smart contract executions are consuming blockchain resources, Ethers are distributed by fixed small amounts to users. Users may have different amount of Ether requirements; some small amounts and some large amounts during different times. As a result, rather than allowing the user to get a fixed small amount of Ether, a more general distribution mechanism that allows a user to demand and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlockchain Technology Applications and Security · Cryptography and Data Security · Cloud Computing and Resource Management
