[contracts] feat: Implement Merkle Airdrop Support for Initial Token Distribution

[AbdelStark]

Issue: Implement Merkle Airdrop Support for Initial Token Distribution

Description

This issue aims to implement Merkle airdrop support for the initial distribution of tokens in the Unruggable Memecoin project. This feature will enable users to claim their allocated tokens by submitting a Merkle proof, verifying their inclusion in the eligibility Merkle tree. The Merkle root for the airdrop eligibility will be provided during the deployment of the token.

Requirements

1. Merkle Root Integration: Include a parameter for the Merkle root in the token deployment process, representing the root of the airdrop eligibility tree.
2. Claim Function: Develop a smart contract function that allows users to claim their tokens by submitting a valid Merkle proof.
3. Verification Process: Implement a verification mechanism in the contract to check the submitted Merkle proof against the stored Merkle root.
4. Efficient Claiming Process: Optimize the claiming process to be gas-efficient and user-friendly.

Implementation Notes

• Ensure the accuracy and security of the Merkle proof verification process.
• The Merkle root should be immutable post-deployment to maintain the integrity of the airdrop.
• Provide clear documentation and examples on how users can generate and submit their Merkle proofs.
• Thoroughly test the claim functionality to handle various cases, including invalid proofs or attempts to claim more than once.

[Akashneelesh]

Hey @abdelhamidbakhta I would like to take this issue could you assign this to me.
Thanks

[AbdelStark]

Hey @abdelhamidbakhta I would like to take this issue could you assign this to me. Thanks

great, assigned to you

[Akashneelesh]

Hey @abdelhamidbakhta I would like to take this issue could you assign this to me. Thanks

great, assigned to you

Thank you

[cpp-phoenix]

Hey, Is it closed? Otherwise I can work on it

[0xDegenDeveloper]

Also curious if this issue is still open, can tackle it if so.