-
Notifications
You must be signed in to change notification settings - Fork 29
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
Activity Idea: Create an effective transaction spam utility in JS / RUST #118
Comments
https://github.com/paritytech/subxt would be likely the best Rust lib to use - perhaps we could ask the team there to help design this as a jupyter notebook? This seems like a good fit for such a thing, or a stand-alone crate 🤔 Their internal channel: https://matrix.to/#/!lVvMINUrllAJPjlOTY:matrix.parity.io?via=matrix.parity.io |
Pasting in a rough sketch of this workshop instructions. I have some questions @shawntabrizi, mainly:
I think we should encourage students to write Rust code, hence pointing them to Workshop: Create an effective transaction spam utilityThe goal of this workshop is to build a tool which floods a node / network with transactions at maximum throughput. GuidelinesSince this course is Rust based, these guidelines assume you complete this workshop using You will be required to:
Steps(brain dump for now)
Submission and resultsPlease submit your source code and a results. |
@JoshOrndorff is this something we need to keep open still? |
I still think it's a cool idea. I don't have any concrete plans to do it. IDK the semantics for that kind of thing. |
potentially this will be the topic of my talk if I go to Sub0, so maybe i can create a basis from that |
A common thing that has been built multiple times is a tool which floods a node / network with transactions.
To do this at maximum throughput is not trivial, and requires knowledge of:
This should be a full half day exercise, and we make it a competition between students to see who can get the highest numbers.
The text was updated successfully, but these errors were encountered: