tetraodonpuffer (u/tetraodonpuffer)

tetraodonpuffer commented on Two recently found works of J.S. Bach presented in Leipzig [video] youtube.com/watch?v=4hXzU... · Posted by u/Archelaos

hodgehog11 · a month ago

Do you have any particular pieces in mind when you wrote this?

Bach is impressive, no doubt, but to each their own perhaps. I acknowledge that I have not received the appropriate training to fully appreciate the complexity in his works, so I wish I could hear what you do. To my ear, (and this isn't a novel opinion in the slightest), I think the Baroque era was more limited in expression due to the inherent limitations in the instruments and consequent styles at the time. Within those constraints, calling Bach an absolute titan of composition would be an understatement. But one wonders what he could have made without those constraints.

tetraodonpuffer · a month ago

when it comes to Bach I am surprised more people don't mention pieces like this

https://www.youtube.com/watch?v=tsxP-YjDWlQ (arioso from the cantata 156, here for oboe)

which I think stands up just fine against pretty much any other classical piece baroque or not.

Personally I have a very big soft spot for his organ works, as I play (badly) some organ myself, and among those I don't see the trio sonatas recommended nearly often enough (here is a live recital of all of them, which is super impressive)

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

among those I probably enjoy the most the vivace of BWV 530. Other favorite pieces are the passacaglia and fugue https://www.youtube.com/watch?v=nVoFLM_BDgs the toccata adagio and fugue in C major https://www.youtube.com/watch?v=Klh9GiWMc9U (the adagio especially is super nice), but there's so many. Among organists I often come back to Helmut Walcha, and am always amazed at how he was able to learn everything just by listening, him being blind.

tetraodonpuffer commented on Software update bricks some Jeep 4xe hybrids over the weekend arstechnica.com/cars/2025... · Posted by u/gloxkiqcza

Someone1234 · 2 months ago

You're starting out with an assumption, that this is an OTA update for the infotainment system, and then conclude this incident shouldn't be possible. The problem is the assumption.

This is a OTA vehicle update. It has the ability to update the infotainment, ECU, ECM, TCM, and BCM. Multiple manufacturers have been able to release recalls that fix major vehicle defects (safety, reliability, and performance). That wouldn't be possible without OTA updates that update core vehicle computer systems.

Unclear where this idea that OTA = Infotainment came from. I'd go as far as to say that most manufacturers can do this in 2025.

tetraodonpuffer · 2 months ago

most cars these days have GPS and return location and so on, why can't manufacturer run these updates only at night and when the car is parked at home? There should be no reason for any OTA update to happen while the vehicle is running (or on a trip etc.), downloading the OTA update, sure, but definitely not applying it. Also there should be a documented procedure to restore the previous in case an OTA update fails.

tetraodonpuffer commented on Why are so many pedestrians killed by cars in the US? construction-physics.com/... · Posted by u/thelastgallon

notacoward · 2 months ago

While it's true that this particular driver probably violated existing law, it's also true that this particular maneuver is inherently mistake-prone. The driver still has to look three ways - across the intersection (for left turners), at the crosswalk, and behind them for cyclists (or fast pedestrians). It's too easy to miss one while checking for another, even for a diligent driver following all laws. The statistics on "right hooks" and the pedestrian equivalent don't lie. Right on red is just a bad idea.

tetraodonpuffer · 2 months ago

any time there is a right turn you can still end up in this same situation, whether it's right turn on red or not, if the driver does not look to their right: there have been plenty of times I have been nearly ran over when a car turning right on green did not notice that the same direction pedestrian crossing light was green also and I was about to cross.

Same thing for cars turning right in front of me riding my bike in the bike lane, it's just par for the course, so pedestrians should ALWAYS make eye contact with the driver before crossing, and cyclists should NEVER be side-by-side with a car when approaching an intersection.

tetraodonpuffer commented on Preserving Order in Concurrent Go Apps: Three Approaches Compared destel.dev/blog/preservin... · Posted by u/destel

destel · 4 months ago

Wow, that’s some seriously sophisticated stuff - it’s not that often you see a heap used in typical production code (outside of libraries)!

Your first example definitely gives me merge-sort vibes - a really clean way to keep things ordered across multiple sources. The second and third scenarios are a bit beyond what I’ve tackled so far, but super interesting to read about.

This also reminded me of a WIP PR I drafted for rill (probably too niche, so I’m not sure I’ll ever merge it). It implements a channel buffer that behaves like a heap - basically a fixed-size priority queue where re-prioritization only happens for items that pile up due to backpressure. Maybe some of that code could be useful for your future use cases: https://github.com/destel/rill/pull/50

tetraodonpuffer · 4 months ago

Hah not sure about “production”, I am currently in between jobs and am taking advantage of that to work on a docker/k8s/file TUI log viewer.

I am using those techniques respectively for loading backups (I store each container log in a separate file inside a big zip file, which allows concurrent reading without unpacking) and for servicing the various log producing goroutines (which use the docker/k8s apis as well as fsnotify for files) since I allow creating “views” of containers that consequently need to aggregate in order. The TUI itself, using tview, runs in a separate goroutine at configurable fps reading from these buffers.

I have things mostly working, the latest significant refactoring was introducing the btree based reading after noticing the “fix the order” stalls were too bad, and I am planning to do a show hn when I’m finished. It has been a lot of fun going back to solo-dev greenfield stuff after many years of architecture focused work.

I definitely love golang but despite being careful and having access to great tools like rr and dlv in goland, it can get difficult sometimes to debug deadlocks sometimes especially when mixing channels and locks. I have found this library quite useful to chase down deadlocks in some scenarios https://github.com/sasha-s/go-deadlock

tetraodonpuffer commented on Preserving Order in Concurrent Go Apps: Three Approaches Compared destel.dev/blog/preservin... · Posted by u/destel

tetraodonpuffer · 4 months ago

Thanks for the write up! In my current application I have a few different scenarios that are a bit different from yours but still require processing aggregated data in order

1. Reading from various files where each file has lines with a unique identifier I can use to process in order: I open all the files and create a min heap reading the first line of each, then process by grabbing the lowest from the min-heap repeatedly, after reading a line from a file, I read another and put it in the min-heap again (the min heap cells contain the opened file descriptor for that file)

2. Aggregating across goroutines that service data generators with different latencies and throughputs. I have a goroutine each that interfaces with them and consider them “producers”. Using a global atomic integer I can quickly assign a unique increasing index to the messages coming in, these can be serviced with a min-heap same as above. There are some considerations about dropping too old messages, so an alternative approach for some cases is to index the min-heap on received time and process only up to time.Now()-some buffering time to allow more time for things to settle before dropping things (trading total latency for this).

3. Similar to the above I have another scenario where throughput ingestion is more important and repeated processing happens in-order but there is no requirement on all messages to have been processed every time, just that they are processed in order (this is the backing for a log viewer). In this case I just slab allocate and dump what I receive without ordering concerns but I also keep a btree with the indexes that I iterate over when it’s time to process. I originally had this buffering like (2) to guarantee mostly ordered insertions in the slabs themselves (which I simply iterated on) but if a stall happened in a goroutine then shifting over the items in the slab when the old items came in became very expensive and could spiral badly.

tetraodonpuffer commented on I spent over $31k on Whiteout Survival old.reddit.com/r/whiteout... · Posted by u/Ralfp

stewx · 4 months ago

I wonder what would happen if the app stores posted info on the app page like "the top 1% players of this game spent an average on $5,000 on it last year". Would that do anything to help people avoid getting into this form of quasi-gambling?

tetraodonpuffer · 4 months ago

I think what would help is that any F2P game was mandated to never cost more than $x/year to be listed in the app store, and possibly have different tiers that a game could decide to be in ($10/$100/$1000) based on the maximum yearly spend. The game also should prominently display the total spend per year, and lifetime, every time it is launched.

Although I do not like F2P for all the dark patterns (which have infiltrated non-F2P as well unfortunately) if it was capped to a reasonable maximum amount a year, with no player to player trading at all, and no multiple accounts for the same store account, it might could be made to not be as predatory while still keeping it financially sustainable for the companies that produce the games.

tetraodonpuffer commented on "Privacy preserving age verification" is bullshit pluralistic.net/2025/08/1... · Posted by u/Refreeze5224

pier25 · 4 months ago

There's no way this could be implemented globally.

tetraodonpuffer · 4 months ago

why don't you think this would work? Technically this is basically "the (SP) site trusts another (IDP) site to sign/encrypt a JWT containing some custom assertions". The user would go to the SP, get a signed blob (session nonce / expiry / whatever), take that to the IDP, log in there, IDP creates a JWT with the original blob plus any assertion you allow, you post the JWT back to the SP, SP decrypts the IDP packet, gets its own nonce, ties you to the session, done.

There are also obviously better ways (https://blog.cloudflare.com/privacy-pass-standard/ possibly some variation of zero knowledge proofs) but technically this seems like a solvable problem. Money wise the IDP or in general verifier can charge users for an account and/or generated assertions.

tetraodonpuffer commented on A spellchecker used to be a major feat of software engineering (2008) prog21.dadgum.com/29.html... · Posted by u/Bogdanp

Someone · 4 months ago

For the basic word list, possibly tries (https://en.wikipedia.org/wiki/Trie), DAGs (https://en.wikipedia.org/wiki/Directed_acyclic_graph#Data_co...), or Bloom filter (https://en.wikipedia.org/wiki/Bloom_filter)

tetraodonpuffer · 4 months ago

according to https://en.wikipedia.org/wiki/Ispell ispell (1971) already used Levenshtein Distance (although from the article it is not stated if this already existed in the original version, or if it was added in later years).

tetraodonpuffer commented on Qwen-Image: Crafting with native text rendering qwenlm.github.io/blog/qwe... · Posted by u/meetpateltech

rushingcreek · 4 months ago

Not sure why this isn’t a bigger deal —- it seems like this is the first open-source model to beat gpt-image-1 in all respects while also beating Flux Kontext in terms of editing ability. This seems huge.

tetraodonpuffer · 4 months ago

I think the fact that, as far as I understand, it takes 40GB of VRAM to run, is probably dampening some of the enthusiasm.

As an aside, I am not sure why for LLM models the technology to spread among multiple cards is quite mature, while for image models, despite also using GGUFs, this has not been the case. Maybe as image models become bigger there will be more of a push to implement it.