HNHacker News
TopNewBestAskShowJobs

avhon1

1,354 karma · joined June 16, 2016

avhn.us
submissionscomments
avhon1··on Ask HN: Large USB drives that don't get blazing hot?
USB 3 provides up to 900mA, so potential waste of up to 4.5W
avhon1··on Ask HN: Large USB drives that don't get blazing hot?
It's still a terrible waste of energy to generate that much heat with a storage device which is essentially idle.
avhon1··on An Unbelievable Demo
Yep. Here's a list of one-party recording consent states from [1]:

Alabama, Alaska, Arizona, Arkansas, Colorado, District of Columbia, Georgia, Hawaii, Idaho, Indiana, Iowa, Kansas, Kentucky, Louisiana, Maine, Michigan, Minnesota, Mississippi, Missouri, Montana*, Nebraska, New Jersey, New Mexico, New York, North Carolina, North Dakota, Ohio, Oklahoma, Oregon, Rhode Island, South Carolina, South Dakota, Tennessee, Texas, Utah, Virginia, West Virginia, Wisconsin, Wyoming

[1] https://recordinglaw.com/united-states-recording-laws/one-pa...

avhon1··on Spintronics: Build Mechanical Circuits
If you scroll way far down on the campaign page, there's actually a table of Spintronics Physical Units:

Spin Volt = 0.1 newtons

Spin Coulomb = 10 meters of chain

Spin Ampere = 10 meters of chain per second

Spin Ohm = 0.1 newton-seconds per meter

Spin Farad = 100 meters per newton

Spin Henry = 0.01 newton-second-seconds per meter

Spin Watt = 1 newton-meter per second

avhon1··on DIY Boat Monitoring System
The ESP32 can negotiate TLS1.2, using, among other options, mbedtls.

https://tls.mbed.org/api/

> mbed TLS supports SSLv3 up to TLSv1.2

avhon1··on Vizy, an AI Camera for the Pi
> > DO NOT RUN THIS VERSION OF NGROK (1.X) IN PRODUCTION

> I don't see that anywhere.

I didn't find it on the website, but I did find it on the GitHub:

https://github.com/inconshreveable/ngrok

avhon1··on NASA’s bet on Starship for the Moon
Lunar Starship won't be (intentionally, excepting emergencies or retirement) returning to Earth's Surface, but the plan might involve it returning closer to Earth for refueling.
avhon1··on NASA’s bet on Starship for the Moon
Unless the fuel is being produced on the Moon, it would be more efficient for Mars-bound spaceships to fuel up in LEO. All Earth-departing mass has to pass through LEO, so it's simpler to rendezvous there rather than enter, and then leave, Lunar orbit.

If launches are cheap, then refueling in LEO makes a lot of sense. Historically, this has not been the case at all, but it's all part of SpaceX's model for Starship.

avhon1··on Ten years of OP-1
You're welcome! Dan Deacon's music is fun, and I've heard that his concerts are a blast.

My favorite online presentation of his music is the collaborative video made by Adult Swim for the song "When I was Done Dying".

https://www.youtube.com/watch?v=TuJqUvBj4rE

avhon1··on Ten years of OP-1
Just wondering, what phone do you have that still uses mini-usb?
avhon1··on Ten years of OP-1
At $875 in 2013, it was somewhat cheaper, but not much.

https://camelcamelcamel.com/product/B00CXSJUZS

avhon1··on Ten years of OP-1
Sure, Dan Deacon comes to mind. Most of the instruments he uses in his performances are smaller than a computer keyboard.

Here's a picture he posted of his gear:

https://twitter.com/ebaynetflix/status/442078506655023104/ph...

In his NPR Music Tiny Desk Concert, you can see an OP-1 on the near-right of his table.

https://www.youtube.com/watch?v=heFRwLfjVXI

edit: I found a website which catalogs musicians and the equipment they use. It lists 190 users of the OP-1.

https://equipboard.com/items/teenage-engineering-op-1-portab...

avhon1··on Reflections on One Year as the CEO of Mozilla
It works, but it's a pain to have do it, and to remember how to do it (especially when you don't yet have internet, because you can't log into the wifi!)
avhon1··on Reflections on One Year as the CEO of Mozilla
It doesn't have to be an announcement of something new. It'd be great if the reflections included any improvements to Firefox that happened over the year.
avhon1··on You Don't Need a GUI
There are actually a couple of good GUI bulk file renamers. I'm fond of the one built into xfce's Thunar file manager [1], but there is also ReNamer [2] and Ant Renamer [3].

[1] https://docs.xfce.org/xfce/thunar/bulk-renamer/start

[2] http://www.den4b.com/products/renamer

[3] http://www.antp.be/software/renamer

avhon1··on Wuffs the Language
to add to the list: HPL, the programming language on Hewlett-Packard's RPN calculators.
avhon1··on An HTTP server in a single .c file
Being in a single .c or .h file does make a project easy to incorporate into the source tree of other projects.
avhon1··on I bought ISO 8601-1:2019 and 8601-2:2019
Not necessarily. For example, for about $4,000,000,000, Disney bought Star Wars: the Complete Collection, including all rights and trademarks. Not just copies of the movies, but actual ownership of the concept of "Star Wars", in exchange for nothing more than (a whole lot of) money.
avhon1··on Blender 2.92
Helical features are supported in the latest Solvespace release (3.0pre3). There has been some discussion of how chamfers, fillets, and draft angles might work, but the concensus has been that they would be tricky to add, and are not a priority for release 3.0.
avhon1··on Mars landing: Photo shows Perseverance rover during landing
Last year, NASA had a public challenge for teams to submit designs for Venus rovers. The winners were announced in July[0]. The designs are pretty interesting!

As far as planned missions go, a proposal by the Goddard Space Flight Center for a 2021 Venus atmospheric probe called DAVINCI+ was shortlisted in February 2020 [1], but was waylaid in favor of asteroid probes Lucy and Psyche[2].

[0] https://www.nasa.gov/feature/jpl/nasas-venus-rover-challenge...

[1] https://www.nasa.gov/feature/goddard/2020/nasa-goddard-team-...

[2] https://www.nasa.gov/planetarymissions/discovery.html

avhon1··on Mars landing: Photo shows Perseverance rover during landing
The current plan is for a launch in 2026 to send a NASA-designed rocket, and a rover and an orbiter designed by ESA, to Mars. The rover will collect Perseverance's sample tubes and place them in the rocket, which will carry the tubes into Mars orbit. The orbiter will rendezvous, collect the sample tubes, and carry them back to Earth, landing in Utah in 2031.

https://spaceflightnow.com/2020/04/20/nasa-narrows-design-fo...

Edit: to your other points, I've thought of some justifications for this architecture:

* The sample return mission will have very limited payload capacity, so the samples should be chosen on the basis of potential scientific value, and selected from a large land area. This can probably best be done with a multi-year rover mission equipped with the best scientific instruments and locomotion available.

* Perseverance's scientific instruments are useful for studying rocks that won't be sampled, so spending weeks or months ferrying samples to a return vehicle would be a sub-optimal use of its very valuable time.

* Mechanically interfacing (to transfer samples) with an orbital solid-fuel rocket is probably somewhat dangerous, so it's best for Perseverance if there's a less-valuable robot to do that.

* The return vehicle will probably be limited in where it can land, because it will have to land on ground that is suitable to launch from. It is unlikely to be landed anywhere close to a bunch of interesting rocks and formations.

* Science instruments, and the manipulators to use them, are heavy, power-hungry, and fragile. If the sample-collection rover doesn't have any, then it can be better-specialized for the task: faster, less fragile, able to traverse softer or more rugged ground. Traveling many tens of kilometers to collect samples may not be nearly as difficult for it as for any previous, science-burdened rover.

avhon1··on 31.2˝ Color EPaper Display
It's right there on the page. $2,300.00 excluding tax
avhon1··on I created the BIPLAN programming language, what do you think about it?
This is Polish Notation, and it does not have this problem as long as you don't allow variadic functions. If functions always consume the same number of arguments, it's no problem at all.

This is basically how concatenative stack-based languages do it, although by convention they put the arguments before the function call. (Reverse Polish Notation) In Forth, your example would be written one of the following two ways, depending on whether multiply() or sum() is consuming the extra 2:

2 2 2 * 2 + +

> 8

2 2 2 * * 2 +

> 10

Also valid would be:

2 2 2 * 2 +

> 2 6

where the left-most 2 is not consumed, but rather is left in place.

avhon1··on KeePassXC 2.6.4 Released
I'm not sure this is a good signal for trustworthiness. For example, how do you know the humans are real? In this new age of deepfakes, it's easier than ever to generate profiles of non-existent people.
avhon1··on The MIT License, Line by Line
The CC0 license and the Unlicense attempt to do this with language to the effect of:

> This work is placed in the public domain.

> In regions where this is not possible, the author grants unlimited license to this work.

Unfortunately, the CC0 explicitly does not waive patent rights, the Unlicense doesn't mention patents at all, the Blue Oak Model License and Apache 2.0 don't attempt to place the work into the public domain, and 0BSD and MIT-0 neither address patents nor attempt to place the work into the public domain. None of these licenses aggressively waive all of the author's rights to their work; I wonder why there isn't a strong public-domain no-patents-or-anything-else license ?

avhon1··on Signal is having technical difficulties
I didn't see the banner in the Android app until I tried to send a message.
avhon1··on The J1 Forth CPU
Probably not.

iCE40 FPGAs come with up to 7,680 logic cells.

The J1 was designed for a board with a Xilinx XC3S1000, which has 17,280 logic cells.

avhon1··on How Tail Call Optimization Works
IMO, the two challenging parts of recursion are:

First, realizing that you can have separate instances of functions at the same time -- different stack frames. Making the mental leap from "the content of x in function f" to "the content of x in f(0), and also the content of x in f(1)" is a leap of abstraction, but not necessarily a tremendous one.

Second, mentally modeling recursion when it gets complicated. Simple recursive cases are easy to model in your head, because either there is little state to keep track of, or because you can extrapolate the pattern between function calls, mentally compressing the state of the whole call tree.

Tail-call optimization, for example, is really easy to mentally model because you only have to keep track of the state of one function's variables at a time -- unless you start passing continuations or thunks into your function calls, in which case you're carrying a stack of unlimited complexity into each function call. It's still just a function call, with the same number and types of arguments, but now one or more of those arguments contains turing-complete, recursive programs of unlimited complexity.

This similar to the worst-case mentally-complicated recursion without TCO, where you can build a complex graph of function calls, scopes, shared data accesses, and mutated copies of what used to be the same data, that can all be present at once, and where you might need to keep track of all of them in order to track down and understand something that you need to understand.

You can, of course, build similarly tangled-up structures in a purely-iterative manner, but the upside is that the complexity will be confined to the data state -- there will be no call tree to mentally model, and no need to track variable scope.

---

Shorter version: if the efficiency and elegance of recursion (with appropriate compiler/runtime optimizations, like TCO) is like zip compression for your mental model of code complexity, then there exist recursive-program equivalents of zip bombs.

---

Even shorter version: recursion itself isn't hard to reason about, but recursive programs can be very hard to reason about

avhon1··on U.S. Capitol Locked Down Amid Escalating Protests
Next-day correction: during the 2016 election, I voted in a different city (about an hour's drive away, but in the same state) from the city that I voted in 2020. I was attending college in the city where I currently live and vote, but at the time I was still registered to vote in my hometown.
avhon1··on U.S. Capitol Locked Down Amid Escalating Protests
Yes there are. In 2016 I voted in Indiana on a voting machine that was all-electronic. I didn't put my vote down on paper, and the machine didn't produce a paper record for me to examine. After I voted, I asked if I could have a record of my vote, and was told I couldn't.

In 2020, in the same city, I voted by marking a paper ballot and inserting it into a machine which scanned it and output it into a sealed box.

← PreviousPage 9 of 19Next →