Hacker News new | ask | show | jobs
by simplyluke 26 days ago
Yeah, CAD has been my personal example of "oh the barrier to entry for this skill was high enough that I didn't do it and now I can be passably bad at it enough to get some simple things done"

I've had similar experiences with making simple functional parts off a 3d printer with OpenSCAD + LLMs. I'm very aware that the models are worse at it than say, generating react code, and I'm also the antithesis of a skilled pilot. It's still cool and has resulted in me starting to learn a new skill at a hobby level.

3 comments

It's like this with a lot of things now. For example, Nix's learning curve used to be a huge barrier to entry. Now with LLMs, I'm using nix-darwin and home-manager for dotfiles, package management, and have individual flakes in all of my projects for cryptographically reproducible builds!
Nit: there’s nothing “cryptographic” about reproducible builds.

“Reproducible build” already usually implies bit-by-bit reproducibility.

“The reproducibility is cryptographically verifiable with hashes“ would be the full sentence, but it’s a mouthful.
Build reproducibility checks usually use bitwise comparison, not hash comparison.

The Reproducible Builds project also wrote diffoscope, which goes quite far with helping identify where differences occur and how to fix them.

https://reproducible-builds.org/ https://diffoscope.org/ https://try.diffoscope.org/

Let’s say, for the positive case, hash comparison is significantly faster.
I feel like that is quite unlikely. Both the hash and bitwise comparisons read both files in both cases. In the not-equal case the hash reads the entirety of both files, so its slower than a start-to-end bitwise comparison, which exits at the first not-equal bit. In the equal case, both read the entirety of both files. Various other bitwise strategies can be faster than start-to-end, rdfind for example checks the start of the file first, then the end, then the rest of the file.
yes, but it's still not cryptological, it's just verification using hashes.
The hash being cryptographically secure is significant. In contrast, you could use (for example) md5 to non-cryptographically verify that the full process matched.
Sorry, the point I was making is that this isn't cryptography- it's the properties of a cryptographic hash (hard to spoof) that are useful. I don't think any verified build program uses the hash to encrypt data at any point. If I'm wrong on this point, that's fine, but please include a link.
I meant with Nix you're comparing hashes. With Docker, you're using pinned versions
i thought it mainly implied architectural/hardware compatibility and deterministic output
Nix mostly does not guarantee deterministic output. It rather guarantees deterministic inputs, and then sandboxes the system to inhibit the build from accessing the outside world.

Deterministic inputs do not always imply deterministic outputs.

Indeed, the Reproducible Builds community is working on fixing non-deterministic build output https://reproducible-builds.org/
Nix is also great at work. You keep the server nix code in the same repo and OpenCode can just change and test server config.
Learning to make simple parts in onshape is pretty darn easy (and fun).
Yeah. I teach this after school to 7th grade kids. Anyone can pick this up in a few hours.
They taught us to make Legobricks with CAD when I was in 6th. Wish I retained more of that and that it would be more widely taught.
I am reasonably confident that access to solid modeling and additive fabrication is now more widespread than ever.
I mean, like any other skill that has pretty much been my experience (though I tried fusion + openscad), but there is something about being able to ask a computer all the dumb noob questions that makes that first phase easier.
same — LLMs turn skills i'd parked for years into 'just try it' territory, which is genuinely new.