(Yet another rant on TAR commands.)
Whose idea was it to make TAR file listing "tar -t" and not "tar -l"?

How does it make sense? It goes against intuition.

It would have been more logical to make "-t" tarfile instead of "-f", and to make "-l" list.

Obligatory: https://xkcd.com/1168/

random writing on wall : "new mcDonalds burger for just Rs 99/-" (* 10% GST)
me : "oh that's easy. 99+ 10% of 99 = 9.9 , so total will be 108.9
---
random DSA question in interview : "given a number n, write a program to break it into n parts, such that product of all parts is the highest for given number n. like for 10, 4x3x3 is 36, 4x3x2x1 is24, 5x5 is 25, and thus the correct answer is 4x3x3"

me : 💀💀💀🏳️🏳️🏳️🏳️

-----
seriously though why the fuck is this programming so difficult. I also learnt java c++ python and various languages during my education days, and currently using it to create awesome buttons and ui screens which is being used by millions of people,

but why the interviewers have to ask questions that results in such a horrific use of these beautiful languages!?!

these non realistic stuff are not at all intuitive and will only result in people who likes to mug up these questions and their solutions to keep winning in life

Sometimes I just don't know what to say anymore

I'm working on my engine and I really wanna push high triangle counts. I'm doing a pretty cool technique called visibility rendering and it's great because it kind of balances out some known causes of bad performance on GPUs (namely that pixels are always rasterized in quads, which is especially bad for small triangles)

So then I come across this post https://tellusim.com/compute-raster... which shows some fantastic results and just for the fun of it I implement it. Like not optimized or anything just a quick and dirty toy demo to see what sort of performance I can get

... I just don't know what to say. Using actual hardware accelerated rasterization, which GPUs are literally designed to be good at, I render about 37 million triangles in 3.6 ms. Eh, fine but not great. Then I implement this guys unoptimized(!) software rasterizer and I render the same scene in 0.5 ms?!

IT'S LITERALLY A COMPUTE SHADER. I rasterize the triangles manually IN SOFTWARE and write them out with 64-bit atomic image stores. HOW IS THIS FASTER THAN ACTUAL HARDWARE!???
AND BY LIKE A ORDER OF MAGNITUDE AT THAT???

Like I even tried doing some optimizations like backface cone culling on the meshlets, but doing that makes it slower. HOW. Im rendering 37 million triangles without ANY fancy tricks. No hi-z depth culling which a GPU would normally do. No backface culling which a GPU with normally do. Not even damn clipping of triangles. I render ALL of them ALL the time. At 0.5 ms

2010: having so many toolbars intalled in the browser you can barely see the actual webpage.
2024: having so many banners and popups in the webpage you can barely see the actual webpage.

Title: "Wizard of Alzheimer's: Memories of Magic"

Setting:
You play as an elderly wizard who has been diagnosed with Alzheimer's disease. As your memories fade, so does your grasp on the magical world you once knew. You must navigate the fragmented and ever-changing landscapes of your own mind, casting spells and piecing together the remnants of your magical knowledge to delay the progression of the disease and preserve your most precious memories.

Gameplay:
1. Procedurally generated memories: Each playthrough generates a unique labyrinth of memories, representing different aspects and moments of your life as a wizard.

2. Memory loss mechanic: As you progress through the game, your memories will gradually fade, affecting your abilities, available spells, and the layout of the world around you.

3. Spell crafting: Collect fragments of your magical knowledge and combine them to craft powerful spells. However, as your memory deteriorates, you'll need to adapt your spellcasting to your changing abilities.

4. Mnemonic puzzles: Solve puzzles and challenges that require you to recall specific memories or piece together fragments of your past to progress.

5. Emotional companions: Encounter manifestations of your emotions, such as Joy, Fear, or Regret. Interact with them to gain insight into your past and unlock new abilities or paths forward.

6. Boss battles against Alzheimer's: Face off against physical manifestations of Alzheimer's disease, representing the different stages of cognitive decline. Use your spells and wits to overcome these challenges and momentarily push back the progression of the disease.

7. Memory anchors: Discover and collect significant objects or mementos from your past that serve as memory anchors. These anchors help you maintain a grasp on reality and slow down the rate of memory loss.

8. Branching skill trees: Develop your wizard's abilities across multiple skill trees, focusing on different schools of magic or mental faculties, such as Concentration, Reasoning, or Creativity.

9. Lucid moments: Experience brief periods of clarity where your memories and abilities are temporarily restored. Make the most of these moments to progress further or uncover crucial secrets.

10. Bittersweet ending: As you delve deeper into your own mind, you'll confront the inevitability of your condition while celebrating the rich magical life you've lived. The game's ending will be a poignant reflection on the power of memories and the legacy you leave behind.

In "Wizard of Alzheimer's: Memories of Magic," you'll embark on a deeply personal journey through the fragmented landscapes of a once-powerful mind. As you navigate the challenges posed by Alzheimer's disease, you'll rediscover the magic you once wielded, cherish the memories you hold dear, and leave a lasting impact on the magical world you've called home.

LMAO

One unfortunate thing I have realized about being a human is that socialization is necessary in order to excel in the long term

What’s the object-oriented way to become wealthy? Inheritance.

greed is addiction to acquiring resources
lust is addiction to experiencing sex
gluttony is addiction to consuming food

wonder if historically people added sins over time as they discovered them
perhaps modern era is stuck in a fugue addiction to amassing knowledge, something quite difficult to do to a destructive degree before internet era
so much so they forget to use it
like greedy people don't value their resources and forget to utilize them
like lusty people don't value their mates and forget to emotionally bond to them
like gluttonous people don't value their food and forget it's for health

Task: blinking light.

Boomers: One lightbulb, one bimetallic strip.

Zoomers: LED (D13), Atmega328P, Atmega328, 5V, 16MHz, 2KB SRAM, 32KB flash, 1KB EEPROM, FT232RL, 19.0mm x 43.18mm, 16 analog pins, 14 digital I/O pins, 6 PWM pins, 2 resettable fuses, 8MHz external crystal, 16MHz external crystal, 12MHz crystal, 0.5mm pitch, 0.1 inch headers, 1.27mm pitch headers, mini-USB, 3.3V regulator, 5V regulator, 16MHz ceramic resonator, 1N5819 Schottky diode, 47uF capacitor, 100uF capacitor, 10uF capacitor, 100nF capacitor, 0.1uF capacitor, 22pF capacitor, 1N4007 diode, 10K resistor, 4.7K resistor, 330 ohm resistor, 10uH inductor, 27 ohm resistor, 2x3 ICSP header, reset button, LED (D13), green LED, red LED, yellow LED, 6-pin header, 8-pin header, 28-pin DIP socket, 6-pin FTDI header, ceramic resonator, USB mini-B socket, 16MHz oscillator, M7 diode, LDO voltage regulator, 3.3V regulator, 5V voltage regulator, polyfuse, 22pF capacitors, 100nF capacitors, 10uF capacitors, 47uF capacitors, 100uF capacitors, 1N4007 diode, 1N5819 Schottky diode, 16MHz resonator, 0.1uF capacitor, 330 ohm resistors, 27 ohm resistors, 4.7K resistor, 10K resistor, 10uH inductor, 22pF capacitor, mini-USB connector, 8-pin header, 6-pin header, 2x3 ICSP header, reset button, ceramic resonator.

Soviet “Altair”: a Nintendo Game&Watch with a built-in Geiger counter.

Right side, top to bottom: game 1, alarm, game 2, reset, time, µSv/hr x 100 µR/h
Top side: Altair
Bottom side: Dosimeter ✻ Watch ✻ Game

I can’t anymore with those companies hiring unicorns only, reposting the same job offer for 6 months while they could have hired someone more junior and taught them. 1 year my girlfriend is in the “no experience” death loop while she outsmarts me by far.

Oh, for fuck's sake.

We’ve reached the point where every single hyped tech thing is a scam.

Between me and my wife, we pull in 300k CAD a year, but we're still middle class. We should be fucking ballers living in a mansion, but I'm still budgeting at the grocery store.

I can afford to keep my house up, raise a family, and have 1 nice vacation a year. I guess it's fucked to complain since others are struggling to eat.

Still it seems crazy.

Just leave the scroll alone!

Cat of the day — mine!

Why is it that companies feel the need to ask, “Why do you wanna work here?” Or “What made you apply?”

Ah, idk, just spitballing here, you’re hiring and I’m unemployed.

I need money, and I heard you pay ppl to do work for you. 🤷🏾‍♂️

I have bills to pay and u have the money to satisfy that need.

Good enough or should I keep going?? 🙄

Cat of the day — mine!

Giving a software engineer design work is such an evil thing to do

As its now customary for kids of her age my 9 years old cousin received her first phone. Said phone has just 32gb of internal storage and her continuously putting games on it doesn't help so it constantly gets full and since I'm family's tech guy I'm the one who get called for that... I'd really love to destroy that waste of silicon by throwing it under a bus and then give a Nintendo Switch to my cousin as a better replacement. I hate these Android devices that are obsolete even before they hit the market but most importantly I hate the fact that 9 years old get "smart" phones for no actual fucking reasons.

There was some fragmentation and corruption that i had to eat away. I like things properly partitioned.

Buzz buzz bitchhhh

Launching deploy pipelines has never been funnier

Fuck you AMD for being too lazy to implement VK_EXT_fragment_shader_interlock even though your hardware supports it [1]

It's literally *the* best way to implement any sort of order independent transparency ( https://web.archive.org/web/... )

But noo, not enough people are using it so too bad. Now you just have to render transparent objects all fucked up and bad looking on AMD hardware because "we don't feel like it"

[1] https://github.com/GPUOpen-Drivers/...

Horses for courses.

That's where baby horses come from.

I went into a sex shop once. They didn't have any sex. So I left.

What's that? The coolest mug ever? I would never.

How weekends are supposed to be. Ofc it's only one part of a balanced breakfast.

After a lot of work, the new factorization algorithm has a search space thats the factorial of (log(log(n))**2) from what it looks like.

But thats outerloop type stuff. Subgraph search (inner loop) doesn't appear to need to do any factor testing above about 97, so its all trivial factors for sequence analysis, but I haven't explored the parameter space for improvements.

It converts finding the factors of a semiprime into a sequence search on a modulus related to
OIS sequence A143975 a(n) = floor(n*(n+3)/3)
and returns a number m such that n=pq, m%p == 0||(p*i), but m%q != 0||(q*k)
where i and k are respective multiples of p and q.

This is similar in principal to earlier work where I discovered that if i = p/2, where n=p*q then

r = (abs(((((n)-(9**i)-9)+1))-((((9**i)-(n)-9)-2)))-n+1+1)

yielding a new number r that shared p as a factor with n, but is coprime with n for q, meaning you now had a third number that you could use, sharing only one non-trivial factor with n, that you could use to triangulate or suss out the factors of n.

The problem with that variation on modular exponentiation, as @hitko discovered,
was that if q was greater than about 3^p, the abs in the formula messes the whole thing up. He wrote an improvement but I didn't undertsand his code enough to use it at the time. The other thing was that you had to know p/2 beforehand to find r and I never did find a way to get at r without p/2

This doesn't have that problem, though I won't play stupid and pretend not to know that a search space of (log(log(n))**2)! isn't an enormous improvement over state of the art,
unless I'm misunderstanding.

I haven't posted the full details here, or sequence generation code, but when I'm more confident in what my eyes are seeing, and I've tested thoroughly to understand what I'm looking at, I'll post some code.

hitko's post I mentioned earlier is in this thread here:
https://devrant.com/rants/5632235/...

There’s a street near me called Flash Drive