closePot() computes the manager cut and then the per-claimant distribution using sequential integer division. Each division independently truncates any fractional remainder, and the aggregate of both truncations is never distributed or recovered.
The compound truncation leaves a residual token balance in every Pot contract after every closePot call. The contract has no sweep function and no automatic dust recovery, so this residual is permanently locked.
Likelihood:
Integer truncation occurs on virtually every closePot call — any remainingRewards value not perfectly divisible by both managerCutPercent and the player/claimant count produces locked dust.
Tokens with 0 or 6 decimals (e.g., USDC) make the per-pot locked amount more material, since the truncation is a larger fraction of the minimum unit.
Impact:
Tokens are permanently locked in every Pot contract with no recovery path. The amount per pot may be small in isolation, but grows in aggregate across all contests over the protocol's lifetime.
For high-value or low-decimal tokens, a single pot can lock a material amount — e.g., with remainingRewards = 9 USDC and 5 players: managerCut = 0, claimantCut = 1, distributed = 5 USDC, locked = 4 USDC.
Place this test in test/ and run forge test --match-test testDustLockedAfterClose. The test demonstrates that integer division truncation in closePot() leaves a small dust amount permanently locked in the contract after the distribution loop completes.
After the distribution loop, transfer any remaining token balance (i_token.balanceOf(address(this))) to the owner as a dust sweep so no funds are left stranded in the contract.
### \[H-03] Precision loss can lead to rewards getting stuck in the pot forever **Description:** When contest manager closes the pot by calling `Pot::closePot`, 10 percent of the remaining rewards are transferred to the contest manager and the rest are distributed equally among the claimants. It does this by dividing the rewards by the manager's cut percentage which is 10. Then the remaining rewards are divided by the number of players to distribute equally among claimants. Since solidity allows only integer division this will lead to precision loss which will cause a portion of funds to be left in the pot forever. Each pot follows the same method, so as number of pots grow, the loss of funds is very significant. **Impact:** Reward tokens get stuck in the pot forever which causes loss of funds. **Proof of code:** Add the below test to `test/TestMyCut.t.sol` ```javascript function testPrecisionLoss() public mintAndApproveTokens { ContestManager cm = ContestManager(conMan); uint playersLength = 3; address[] memory p = new address[](playersLength); uint256[] memory r = new uint256[](playersLength); uint tr = 86; p[0] = makeAddr("_player1"); p[1] = makeAddr("_player2"); p[2] = makeAddr("_player3"); r[0] = 20; r[1] = 23; r[2] = 43; vm.startPrank(user); address pot = cm.createContest(p, r, weth, tr); cm.fundContest(0); vm.stopPrank(); console.log("\n\ntoken balance in pot before: ", weth.balanceOf(pot)); vm.prank(p[1]); // player 2 Pot(pot).claimCut(); vm.prank(p[0]); // player 1 Pot(pot).claimCut(); vm.prank(user); vm.warp(block.timestamp + 90 days + 1); cm.closeContest(pot); console.log( "\n\ntoken balance in pot after closing pot: ", weth.balanceOf(pot) ); assert(weth.balanceOf(pot) != 0); } ``` Run the below test command in terminal ```Solidity forge test --mt testPrecisionLoss -vv ``` Which results in the below output ```Solidity [⠒] Compiling... [⠆] Compiling 1 files with 0.8.20 [⠰] Solc 0.8.20 finished in 2.57s Compiler run successful! Ran 1 test for test/TestMyCut.t.sol:TestMyCut [PASS] testPrecisionLoss() (gas: 936926) Logs: token balance in pot before: 86 token balance in pot after closing pot: 1 Suite result: ok. 1 passed; 0 failed; 0 skipped; finished in 1.75ms (654.60µs CPU time) Ran 1 test suite in 261.16ms (1.75ms CPU time): 1 tests passed, 0 failed, 0 skipped (1 total tests) ``` If you observe the output you can see the pot still has rewards despite distributing them to claimants. **Recommended Mitigations:** Fixed-Point Arithmetic: Utilize a fixed-point arithmetic library or implement a custom solution to handle fee calculations with greater precision.
The contest is live. Earn rewards by submitting a finding.
Submissions are being reviewed by our AI judge. Results will be available in a few minutes.
View all submissionsThe contest is complete and the rewards are being distributed.