lyse @lyse.isobeef.org
 (6d ago)

(#j5s5khq) @movq@www.uninformativ.de How about ā€œQuongsiā€? I generated the first five letters with pwgen --no-capitalize --no-numerals 5 and since that already showed up in DDG search results, I simply appended the last two, which yielded nothing on DDG and Google).

What kind of project is it? Maybe we can help you find a name or nudge you in the right direction.

#7tsxwnq
lyse @lyse.isobeef.org
 (6d ago)

The tt URLs View now automatically selects the first URL that I probably are going to open. In decreasing order, the URL types are:

  1. markdown media URLs (images, videos, etc.)
  2. markdown or plaintext URLs
  3. subjects
  4. mentions

I might differentiate between mentions of subscribed and unsubscribed feeds in the future. The odds of opening a new feed over an already existing one are higher.

#sd722yq
prologic @twtxt.net
 (6d ago)

Whoo! I fixed one of the hardest bugs in mu (Āµ) I think Iā€™ve had to figure out. Took me several days in fact to figure it out. The basic problem was, println(1, 2) was bring printed as 1 2 in the bytecode VM and 1 nil when natively compiled to machine code on macOS. In the end it turned out the machine code being generated / emitted meant that the list pointers for the rest... of the variadic arguments was being slot into a register that was being clobbered by the mu_retain and mu_release calls and effectively getting freed up on first use by the RC (reference counting) garbage collector šŸ¤¦ā€ā™‚ļø

#xupmaxa
lyse @lyse.isobeef.org
 (6d ago)

(#pact6sq) @prologic@twtxt.net In my opinion, the integrity isnā€™t lost. The same input data always result in the same output hash, no matter when you calculate the hashes. Itā€™s true that a corrupt database contents yields to corrupt hashes, but then you have a whole bigger problem than just receiving different hashes. :-D

#uugltha
lyse @lyse.isobeef.org
 (6d ago)

(#73l4niq) @zvava@twtxt.net By hashing definition, if you edit your message, it simply becomes a new message. Itā€™s just not the same message anymore. At least from a technical point of view. As a human, personally I disagree, but thatā€™s what Iā€™m stuck with. Thereā€™s no reliable way to detect and ā€œcorrectā€ for that.

Storing the hash in your database doesnā€™t prevent you from switching to another hashing implementation later on. As of now, message creation timestamps earlier than some magical point in time use twt hash v1, messages on or after that magical timestamp use twt hash v2. So, a message either has a v1 or a v2 hash, but not both. At least one of them is never meaningful.

Once you ā€œupgradeā€ your database schema, you can check for stored messages from the future which should have been hashed using v2, but were actually v1-hashed and simply fix them.

If there will ever be another addressing scheme, you could reuse the existing hash column if it supersedes the v1/v2 hashes. Otherwise, a new column might be useful, or perhaps no column at all (looking at location-based addressing or how it was called). The old v1/v2 hashes are still needed for all past conversation trees.

In my opinion, always recalculating the hashes is a big waste of time and energy. But if it serves you well, then go for it.

#qatkviq
prologic @twtxt.net
 (1w ago)

Hmmm I need to figure out a way to reduce the no. of lines of code / complexity of the ARM64 native code emitter for mu (Āµ). Itā€™s insane really, itā€™s a whopping ~6k SLOC, the next biggest source file is the compiler at only ~800 SLOC šŸ¤”

#kaiqxgq
movq @www.uninformativ.de
 (1w ago)

(#gslvc3q) @prologic@twtxt.net That might be a challenge, at least in 16-bit Real Mode: The OS follows the model of COM files on DOS, i.e. the size of the binary cannot exceed 64 KiB and heap+stack of the running program will have to fit into that same 64 KiB. šŸ˜… (The memory layout is very rigid, each process gets such a 64 KiB slice.)

And in 64-bit Long Mode, there is no ā€œkernelā€ yet. The thing in the video is literally just a small bare-metal program.

But some day, maybe. šŸ˜ƒ

#q6pehia
movq @www.uninformativ.de
 (1w ago)

My little toy operating system from last year runs in 16-bit Real Mode (like DOS). Since Iā€™ve recently figured out how to switch to 64-bit Long Mode right after BIOS boot, I now have a little program that performs this switch on my toy OS. It will load and run any x86-64 program, assuming itā€™s freestanding, a flat binary, and small enough (< 128 KiB code, only uses the first 2 MiB of memory).

Here Iā€™m running a little C program (compiled using normal GCC, no Watcom trickery):

https://movq.de/v/b27ced6dcb/los86%2D64.mp4

https://movq.de/v/b27ced6dcb/c.png

Next steps could include:

  • Use Rust instead of C for that 64-bit program?
  • Provide interrupt service routines. (At the moment, it just keeps interrupts disabled.)
#gslvc3q
shinyoukai @neko.laidback.moe
 (1y ago)

The classified information in the future classified information the surface so classified information is classified information and I wasnā€™t hurt

In fact, look at how soft this ball is

~ Mikuru Asahina The Elder (The Melancholy of Suzumiya Haruhi-chan)

#c2xbjca