For the purpose of unqueuing & for claiming , Priority Pool uses Merkle trees to verify . To implement this verification process , PriorityPool.sol uses nodes/leaf which hashes more than 64 bytes using as can be seen here :
https://github.com/Cyfrin/2024-09-stakelink/blob/main/contracts/core/priorityPool/PriorityPool.sol#L343C13-L346C80
but Openzeppelin's MerkleProofUpgradeable.sol library clearly gives the warning that usage of such node/leaf with more than 64 bytes length is not safe as those trees could be reinterpreted as a leaf value. as can be seen here -
https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.9.2/contracts/utils/cryptography/MerkleProofUpgradeable.sol#L13C1-L19C1
Use a combination of variables that doesn't sum to 64 bytes .
The contest is live. Earn rewards by submitting a finding.
This is your time to appeal against judgements on your submissions.
Appeals are being carefully reviewed by our judges.