I've been working since yesterday on https://t.co/9LJW9PV60I Inspired by every-uuid[dot]com. Although, my idea for the scrollbar is not so clever. I think I can make it possible to display even more than 2^128 fibonacci numbers 🙂

"but bro dont you want to make a company, you could raise 20M+ in a week, dont you want to be a founder" no... not really... I wanna spend time on the purest math possible with the least amount of applications for the world and then build a riscv CPU emulator on top of the

https://t.co/YbhtPWdLjt

The most important question to ask yourself: are you having fun?

just started a new job in Ireland… and what I miss most is my personal dev environment ☹️

small update: i made it capable of displaying up to 2^160 fibonacci numbers, it even works for 2^512, but as you can guess, that’s too many digits in the index to display properly, so for now I’ll leave it with around 49 digits

Most infrastructure is held together by 5 commands someone remembers when shit breaks Docs? Outdated. Answers? Buried in Slack, Notion, or shell history We got tired of that. So we built Atuin Desktop.

me after designing data intensive applications for the 463rd time

the beginning of the end :)

https://t.co/XwCVadPWGe

Stippling with weighted voronoid + TSP art + Fourier epicycles I have to write a blog post for this…

at this point, i'm afraid to ask what a kd-tree is

I remember teaching Functional Programming and Haskell to the smartest software engineer in the world at ITMO University 10 years ago. It's one of those unique experiences that teach you a lot while you're teaching others.

https://t.co/e6XP5LyvU6

OpenAI presents: Competitive Programming with Large Reasoning Models - Competed live at IOI 2024 - o3 achieved gold - General-purpose o3 surpasses o1 w/ hand-crafted pipelines specialized for coding resultss

TIL I can use Rust in HackerRank. I’ve reached rank 1 in my country for the ProjectEuler+ contest, however I have not yet been able to finish the first 100 problems… #ProjectEuler

Lucy again... It's not as fast as the iterative implementation, but it's easy to code and still sublinear. #ProjectEuler

trivial, but I have not been able to find a modular solution... shame. #ProjectEuler

done, ugly code

I've come with a better idea, it's just a simple two pointers with an array storing the 0's values