Open s0lness opened 3 months ago
I am applying to this issue via OnlyDust platform.
Software Engineer with interest in Mobile Application and Blockhain technologies. My stacks are: SwiftUI, Kotlin, Solidity, Golang, Flutter, Cairo with a basic knowledge of Rust.
I can do this with Cairo or Rust. For Cairo, I will setup Multisig by defining the data structures for public keys, signatures, and the logic to verify that K out of N signatures are valid, then I will proceed to implementing the Verification Logic which will take will take N public keys and K signatures as input and verify if the signatures are valid for the given public keys.
For Rust, firstly, I will add dependencies for cryptographic operations and possibly for zero-knowledge proofs, then proceed to Multisig setup by defining the structure to hold the public keys and signatures. Then I will implement the verification function, key generation and signing functions. Also, I will work on the logic to verify that K out of N signatures are valid. if needed, I can implement zero-knowledge proof aspect to this, which will require me to integrate a zk-SNARK or zk-STARK library. ETA: 2 - 3 days.
I am applying to this issue via OnlyDust platform.
Hii, my name is Daniel and I'm a software and web3 developer. I've done smart contracts using Cairo and recently started exploring Rust. I'm also doing a Starknet Bootcamp where I learned about provable languages, zk-proofs and the basics of a program. I'm also a member of the Dojo Coding community.
The way I would tackle the issues is in the following way:
Also, I would read the docs for the Collatz Conjecture and learn how to implement the program in Hyle correctly.
For writing the way I would tackle this issue, I read the following articles as references: https://scryptplatform.medium.com/threshold-signatures-a0eff03dc29c https://scryptplatform.medium.com/distributed-key-generation-3ef41ced01ed
I am applying to this issue via OnlyDust platform.
I would design a program to verify that a multisig transaction is authorized by at least K out of N signatures using a provable language. For instance, in Circom, I’d create a circuit to check the validity of K signatures from a set of N, leveraging zero-knowledge proofs to ensure only valid proofs are accepted without revealing the actual signatures. Testing and optimizing the circuit would be crucial to ensure performance and correctness.
To tackle this issue, I would:
This approach ensures the program accurately verifies multisig signatures while providing a provable, efficient solution.
I am applying to this issue via OnlyDust platform.
I have several years of experience working with provable languages and cryptographic protocols, particularly in the context of blockchain and distributed systems. I have deep expertise in Circom, Cairo, Noir, and Rust, and have developed various zero-knowledge proof applications and smart contracts.
I would approach this issue with following steps UI and UX Design: Create a user-friendly interface for signature input and proof submission. Communication with Backend: Establish a communication channel to send signatures and receive verification results. Signature Collection and Handling: Provide a way for users to input their signatures and validate the input. Proof Verification and Display: Receive the verification result from the backend and display it to the user. Error Handling and User Experience: Implement robust error handling and provide clear guidance to the user. Integration with the Backend: Collaborate with the backend team to ensure seamless integration. Security and Accessibility: Ensure the application adheres to best practices for web security and accessibility.
I am applying to this issue via OnlyDust platform.
Hi @s0lness I will love to work on this
I am applying to this issue via OnlyDust platform.
it is my first issue
Write a program in any provable language (Circom, Cairo, Noir, Rust) to provide a proof of K signatures out of N in a multisig setup.