HN user

mischief6

349 karma

i like plan 9 and golang

Posts1
Comments37
View on HN

i got annoyed by this especially the memory use and non portability aspect of bun so I had claude (lol) and kiro cook up my own agent. it runs on linux, openbsd and even on omnios and esp32. it's just a personal project so there are probably rough edges, but I am using it on my clockworkpi uconsole daily now. https://github.com/mischief/clm

08:46:37.125 [err] [fps] 4.0 (12 frames in 3.0s) 08:46:40.225 [err] [fps] 1.0 (3 frames in 3.1s) 08:46:41.224 FIRM | * ASSERTION FAILED: ASSERTN 08:46:41.443 [err] DEBUG post-reset: halted=0 stopped=1 R13=0x20002170 R15=0x080001b4 thumb=1 08:46:42.123 [err] clktree_recalc_output_freq: Clock PCLK1 output frequency (32000000 Hz) exceeds max frequency (30000000 Hz).

found an assertion just by clicking up/down. doesn't seem too stable.

i know freebsd and macos have similar implementations, but it is just different enough that it is nontrivial to make work. i had started fixing it locally but didn't quite get it working, since i'm not really that familiar with zig, although i like the idea of the language.

my only wish for ghostty is that there was openbsd support. some work needs to be done in the io layer to support openbsd kqueue to make it work.

my one gripe after using mc for a few years is no parallel transfer support. it slows down significantly when transferring small files compared to one large file.

All parts of Go's simplicity push that seems to assume people don't need anything else other than Array Lists and hash maps.

you can see some of this in the work of the progenitors of Go.

quoth pike style, from rob pike:

Rule 4. Fancy algorithms are buggier than simple ones, and they're much harder to implement. Use simple algorithms as well as simple data structures.

      The following data structures are a complete list for almost all practical programs:
array linked list hash table binary tree

Of course, you must also be prepared to collect these into compound data structures. For instance, a symbol table might be implemented as a hash table containing linked lists of arrays of characters.

https://doc.cat-v.org/bell_labs/pikestyle

I like that the author went very in depth reverse engineering the proprietary update program, but it boiled down to what amounts to a single or few ata commands that can be manually invoked on linux. it's a shame they don't just publish these commands for linux users, and let the windows users have the fancy bespoke tools.

while it is unfortunate it requires a write, it is useful in some cases. for example, finding old objects in a cache, or today i used it to find out what firmware my kernel is loading by checking atime of /lib/firmware.

.plan 5 years ago

worse is better.

it is a protocol for a specific purpose, and because it has that specific purpose, it was used for that, and desired for that. http can do it, but without the constraints, of course nobody will use it for reinventing finger.

i'm glad someone appreciates this.

some people at cat-v.org were interested in this and there happened to be a copy at stanford library where a roommate of mine was working at the time. he borrowed it on my behalf and i used the book scanner at noisebridge in san francisco (constructed from wood and two canon cameras and a python script) to image it, and uploaded it to archive.org.

these are fair points, but frankly i have never needed to upload a file to facebook or use a group chat, and i have never seen a facebook sticker but i would probably find them distracting. i use bitlbee+irssi because it is the least distracting way in which i can consume facebook chat to communicate with people on their platform.