-
Notifications
You must be signed in to change notification settings - Fork 451
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
msc placeholder: daos, scams, FROST, message drop, something #7074
Comments
This is a short draft of my idea: Are_Daos_A_Scam_draft.pdf I've also read some papers, but most of the interesting things are found outside of papers on blogs or articles.
|
This angle is difficult to bring in the science. DAO now reads as engineering and financial shenanigans. More scientific example are going into these type of algorithms to generate trust or another wild angle is technology is becoming political; see Susskind book. Or especially wild: "why we never produced a global brain". Example |
lit surveythis is what I currently have lit_survey_current.pdf. thesisDo we really need to use FROST? Depending on what improvements FROST made over its predecessors, it might be worth it to use older schemes as they already have mature implementations. I found a go library that allows creating threshold signatures for ECDSA and EdDSA. Then we could use go mobile to call it from android. |
Solid idea! Somehow I failed to read more, after seeing FROST. I just wanted it after reading. 😄
|
current version of survey |
Master thesis thinking:
|
Update
What I’m planning to do next sprint
|
|
small update
|
Update
possible directions
|
|
While quite late, I'd like to contribute FROST is far simpler than any threshold ECDSA protocol, relying on far fewer assumptions. It also has extensive security review in: Threshold ECDSA also has review, yet provides a much larger surface taking several rounds to complete, and relying on far more assumptions to be proven. Part of this can be cited back to ECDSA being a convoluted attempt at avoiding a patent, leading itself to not have a security proof given the discrete log problem. Practically, FROST is 2-rounds, only one requiring knowledge of the message. The lowest thresold ECDSA protocol is 4 rounds to sign, when the famed GG20 is 7. Binance's tss-lib has been forked to GG20 by THORChain, and their fork has since had several security issues with it, from Alpha-Rays to the ability to cause honest parties to be blamed to leaking key shares. Despite this, THORChain's library was prior audited (though the quality of this audit now must be called into question) and is likely the better choice than the tss-lib it comes from (as I assume it has had far more scrutiny, yet I may just be unaware of the review on Binance's lib. Their one published audit is years old, prior to Alpha-Rays). As for Binance's EdDSA impl, they appear to use a 3-round threshold signature protocol (not FROST, yet not vulnerable to Drijver's application of Wagner's algorithm thanks to a hashed commitment round). I'm unsure what actual protocol it implements, yet I can note FROST achieves a 2-round protocol with the same raw bandwidth for their messages. It didn't include any horrendously expensive proof to achieve the reduced complexity. I also believe, regarding performance, no threshold ECDSA is linear to amount of signers. GG20 is quadratic, which is why THORChain takes tens of seconds to sign for their 20 participants. FROST is linear, and I've benchmarked <0.7s per-signer for a 333-500 group. I do believe this is months late, and y'all are using FROST (specifically my lib, currently under audit :D ), yet I still wanted to chime in as I can :) At least this should be helpful by providing plenty of references to refer to? |
@kayabaNerve Thanks. This is great and It'll be helpful when writing my thesis. |
Update
plans for next sprint
|
Please document the possible final goals of your master thesis, brainstorm:
|
apk Arxiv still has the survey on hold. 🤔
I think I will work on making these things work and then maybe add extra stuff:
Thesis paper brainstorm:
|
|
I didn't do much this time.
For the next weeks:
|
|
For the next weeks
Before choosing to do just acks for reliability I spend time looking into other ways. I think a future project could be adding quic to ipv8. I know you said its too heavy, but you could have quic for peers you interact with often and then have normal udp for other peers/ messages. There is a java quic lib aswell https://github.com/ptrd/kwik. I played around with it and it worked. |
|
For comparison I ran FROST keygen with and without ipv8.
|
|
Can we have next meeting in two weeks? |
|
Can start setting up a date for the defense?
|
|
I probably won't be able to show the app while I'm in Curacao so I made a recording. https://www.youtube.com/watch?v=CVgsn-JL4g0 I still need to add/fix a bunch of stuff, but its way nicer than before.
|
|
Harvard Kennedy School on DAO. Hubbard, Sarah, Connor Spelliscy, Nathan Schneider and Samuel Vance-Law. “Toward Equitable Ownership and Governance in the Digital Public Sphere.” , June 8, 2023. This paper explores how newly developed DAO tooling could help co-ops compete in the online economy. Specifically, we outline how DAO tooling could provide co-ops with:
|
Is this enough to start the defense process? I got a job which starts in September, so I'd like to finish before then. I spent this sprint writing: The writing still isn't that good, but I think it is much better than before. What do you think of the plots? I used scatter plots because you can quickly see the variability and because the graphs have a lot of values on the x-axis, so box plots did not look nice. You mentioned that the problem description sounds more like requirements than a problem. I tried to change it, but I'm not sure how good it is. This is the old problem description:
|
|
FROSTDAO__Collective_Ownership_of_wealth_using_FROST.pdf Aside from the abstract, I think the writing of the first chapters is decent. I spent a bit of time looking into EVA. The main problem is that it does not support concurrent transfers to the same peer + there seems to be a 20 second duration before this is reset. Key gen only needs to use EVA once per peer, so I don't think this is a problem in practice. But in my experiments, I do key gen from 2 to 50 members sequentially. This is from https://arxiv.org/abs/2203.00398: I optimized the serialized of the message, so EVA is not needed so early, and I played around with the EVA code: |
|
Delft literature survey, 20 DAO participants is the tipping point for sustainability. |
FROSTDAO__Collective_Ownership_of_wealth_using_FROST.pdf
|
|
Review of draft master thesis presentation:
Collective money, FROSTDAO learnings
|
The text was updated successfully, but these errors were encountered: