Skip to content
New issue

Have a question about this project? # for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “#”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? # to your account

[feat] Implement the functionality to retrieve profile by anchor #14

Open
Akashneelesh opened this issue May 28, 2024 · 3 comments
Open
Assignees
Labels
Cairo Smart contract good first issue Good for newcomers

Comments

@Akashneelesh
Copy link
Collaborator

Akashneelesh commented May 28, 2024

Down below is the function that is to be implemented in the contract but in cairo.
https://github.com/allo-protocol/allo-v2/blob/4dd0ea34a504a16ac90e80f49a5570b8be9b30e9/contracts/core/Registry.sol#L102

Resources :
https://book.cairo-lang.org/title-page.html
https://book.cairo-lang.org/ch14-01-contract-storage.html?highlight=lega#storage-mappings

If you have any doubts over on how to implement something similar to this you can try discovering few cairo code bases such as :

Unruggable memecoin : https://github.com/keep-starknet-strange/unruggable.meme/tree/main/packages/contracts/src
Blobstream : https://github.com/keep-starknet-strange/blobstream-starknet/tree/main/src

Exclusively for Starknet India team - To onboard new devs from India
Estimated Time taken to complete - 2-3 days (Max)

@Akashneelesh Akashneelesh added good first issue Good for newcomers Cairo Smart contract labels May 28, 2024
@kyzan
Copy link

kyzan commented May 31, 2024

I would like to take this up!

@Akashneelesh
Copy link
Collaborator Author

Awesome, you've been assigned less goo !!

@Rana718
Copy link

Rana718 commented Aug 28, 2024

Would like to work on this issue.

# for free to join this conversation on GitHub. Already have an account? # to comment
Labels
Cairo Smart contract good first issue Good for newcomers
Projects
None yet
Development

Successfully merging a pull request may close this issue.

3 participants