some-assembly-required
lurk-rs
some-assembly-required | lurk-rs | |
---|---|---|
15 | 6 | |
3,010 | 397 | |
1.0% | 4.0% | |
6.5 | 9.6 | |
5 months ago | 14 days ago | |
Assembly | Rust | |
GNU General Public License v3.0 or later | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
some-assembly-required
- Some assembly required: An approachable introduction to assembly
-
Show HN: Sprig, open-source game console and engine, by teenagers, for teenagers
See also:
"Some Assembly Required: An approachable introduction to assembly" - https://github.com/hackclub/some-assembly-required
https://news.ycombinator.com/item?id=31909183 (587 points | 4 months ago | 125 comments)
-
Ask HN: Who is hiring? (November 2022)
Hack Club | Full-time, Part-time or Contract | ONSITE | Vermont, US | https://hackclub.com
Hello friends,
I come from the game dev world where I led the team on the Crash Bandicoot reboot trilogy and helped ship two of the Destiny 2 expansions. Iām now building out a team here at Hack Club that will make inspiring technical and creative projects with and for thousands of the most technical teenagers youāll probably ever meet.
In the past 3 months, weāve shipped an open source game console ( https://github.com/hackclub/sprig ) that you can only get by building a game for it, a guide to assembly language thatās now the 4th most popular GitHub repo written in assembly ( https://github.com/hackclub/some-assembly-required ), and a teaser for a game we're producing about love and graphing (https://hack.af/sr ).
For this role, Iām looking for a technical partner-in-crime with a few notches in your belt.
JOB DESCRIP/APPLY: https://hiring.hackclub.com/26020 or email [email protected]
-
PAID - Creative Technologist
We do this by creating open-source projects which serve the community like a transparent ābankā for nonprofits, a game console you can only get by building a game for it, a guide to assembly language, a cross-country hackathon on a train. Hack Club supports and grows our community by facilitating wholesome social spaces online and in-person.
- Meus caros, vocĆŖs possuem dicas para aprender a linguagem assembly ?
-
Lensm: Go Assembly and Source Viewer
A recent YC article mentioned this [site] (https://github.com/hackclub/some-assembly-required/)
-
Embedded Systems Weekly #107
Some Assembly Required An approachable introduction to assembly that can be read in 30 minutes if you skip code examples. Although it's probably interesting to take a bit more time to try to read them and understand the details.
-
Hacker News top posts: Jun 29, 2022
Some Assembly Required: An approachable introduction to assembly\ (119 comments)
- hackclub/some-assembly-required: An approachable introduction to assembly. Has 6502.
- Teenagersā 30 minute guide to writing in Assembly
lurk-rs
-
Ask HN: Who is hiring? (December 2022)
Lurk Lab @ Protocol Labs | Multiple Positions | REMOTE | Full-time
Lurk Lab is building Lurk (https://github.com/lurk-lang), a Turing-complete programming language for recursive zk-SNARKs. Lurk implements a minimal Lisp whose program executions can be proved in zero-knowledge, yielding succinct proofs that are concretely small and fast to verify. Lurk uses a Rust implementation (https://github.com/lurk-lang/lurk-rs) for expression evaluation, proving, and verification, with Nova (https://github.com/microsoft/Nova/) as its proving backend. Because Lurk is Turing-complete, it can be used to make and prove arbitrary computational claims (within resource limits).
We are looking for strong cryptography engineers, researchers, functional programming language specialists, applications developers, and start-up leaders/web3 entrepreneurs who want to build next-generation SNARK technology.
Ideal candidates will be knowledgeable about the state of the art in zero-knowledge proofs and (if looking for an engineering position) strong in Rust.
We are specifically hiring for:
- Rust Cryptography Engineers
-
Ask HN: Who is hiring? (November 2022)
Lurk Lab is building Lurk (https://github.com/lurk-lang), a Turing-complete programming language for recursive zk-SNARKs. Lurk implements a minimal Lisp whose program executions can be proved in zero-knowledge, yielding succinct proofs that are concretely small and fast to verify. Lurk uses a Rust implementation (https://github.com/lurk-lang/lurk-rs) for expression evaluation, proving, and verification, with Nova (https://github.com/microsoft/Nova/) as its proving backend. Because Lurk is Turing-complete, it can be used to make and prove arbitrary computational claims (within resource limits).
We are looking for strong cryptography engineers, researchers, documentation specialists, applications developers, and start-up leaders/web3 entrepreneurs who want to build next-generation SNARK technology. Relevant programming languages include Rust, Lisp, and (less significantly) WASM.
We are hiring for:
- Rust Cryptography Engineers, https://grnh.se/d94e94ec4us
- Software Engineers for Lurk Application Development, https://grnh.se/de7e82424us
- Documentation Engineer, https://grnh.se/10e2ca4d4us
- Start-up operator / business lead (currently unlisted, email [email protected] with CV and a brief cover letter describing your experience driving the business end of deep technical projects in the web3 space)
-
How to Prove You Know a Secret Without Giving It Away
I recently published a fairly detailed blog post about how to formulate expressive provable programs in Lurk (https://github.com/lurk-lang/lurk-rs). Although this post goes into no details about the underlying proving mechanism, it does build to some pretty powerful ideas. If you haven't thought about the implications of being able to prove correctness of a computation without revealing some or all details of what the computation actually was, you might enjoy it. https://blog.lurk-lang.org/posts/prog-intro/
-
Ask HN: Who is hiring? (October 2022)
Lurk Lab @ Protocol Labs | Multiple Positions | REMOTE | Full-time contract-to-hire
Lurk Lab is building Lurk (https://github.com/lurk-lang), a Turing-complete programming language for recursive zk-SNARKs. Lurk implements a minimal Lisp whose program executions can be proved in zero-knowledge, yielding succinct proofs that are concretely small and fast to verify. Lurk uses a Rust implementation (https://github.com/lurk-lang/lurk-rs) for expression evaluation, proving, and verification, with Nova (https://github.com/microsoft/Nova/) as its proving backend. Because Lurk is Turing-complete, it can be used to make and prove arbitrary computational claims (within resource limits).
We are looking for strong cryptography engineers, researchers, documentation specialists, applications developers, and start-up leaders/web3 entrepreneurs who want to build next-generation SNARK technology. Relevant programming languages include Rust, Lisp, and (less significantly) WASM.
We are hiring for:
- Rust Cryptography Engineers, https://grnh.se/d94e94ec4us
-
Lurk ā Language for Recursive ZK-SNARKs Inspired by Common Lisp and Scheme
Nova (for example) doesn't require a trusted setup. The circuit is just a schematic description of the underlying computation. In the case of the Lurk core language, this computation is 'one reduction step of a Lurk evaluation' (https://github.com/lurk-lang/lurk-rs/blob/master/spec/reduct...). Coming up with a 'fixed computation' that yields general computation is part of the design problem for Lurk (or any other Lurk-like language). Even if we did need a per-circuit trusted setup (which we don't), we could perform such a setup for our core circuit and use it to prove arbitrary programs. For example, although we have not actually performed the trusted setup, we do have an example using Groth16 (which does require a trusted setup to be secure) and aggregates the potentially many discrete reduction steps to produce a succinct proof.
What are some alternatives?
lensm - Go assembly and source viewer
Nova - Nova: High-speed recursive arguments from folding schemes
collisions - Hash collisions and exploitations
sprig - š Learn to code by making games in a JavaScript web-based game editor.
GitJournal - Mobile first Note Taking integrated with Git
twenty-first - Collection of mathematics routines and cryptography for the twenty-first century
HANDSONTABLE - JavaScript data grid with a spreadsheet look & feel. Works with React, Angular, and Vue. Supported by the Handsontable team ā”
job-descriptions
taiga - A framework for generalized shielded state transitions
the-hacker-zephyr - š The Hacker Zephyr: A cross-country hackathon on a train! This repo: all of our planning documents, finances, and code open sourced.
o1js - TypeScript framework for zk-SNARKs and zkApps