Charlotte 猫 Awoo Fide @confusedcharlot@awoo.space

so multiplicative inverses in GF(2⁸ ) are of the form
b^-1 = a mod m, and there is an algorithm for finding them, but if i'm just going to build a lookup table anyway, can't just check equality with m+1 or m² + 1 when i iterate through the products?

cat under a bed

new shy guy in my life

"hello triangle" is 16 tutorial programs in on the vulcan tutorial i'm following

i wish i had the energy to do a mission control type audio checklist for the initialization of this monster.

"required validation layers are confirmed. proceed with instance creation (3/70)"

everytime i try to learn graphics programming, there seems to be a mountain of boilerplate to get through before i can do anything interesting.

to render a triangle, first you must create the universe.

"this will help with the td you're getting from the med that's going to make your diabetes worse. as a bonus, this will also make your diabetes worse".

found a compiler i wrote in c for a subset of lisp that included call/cc. the target was mips, and it had a small runtime (mostly the garbage collector) written in assembly.

it's hard to believe i had that all in my head at one point.

vulcan looks reasonably intimidating

writing simple programs as therapy. might be hitting a wall where things are starting to get too "serious".

maybe programming again is closed off to me after all.

anyway he's kind of a fartstorm

sometimes gare bear is sensitive to changes in his diet
https://twitter.com/i/status/1494382907150028801