@Per Vognsen
I like programming and understanding how stuff works. My background is in systems programming and game development.
Relays (1)
- wss://relay.ditto.pub – read & write
Recent Notes
What if I have a chunk of memory with a bunch of counters that are being constantly updated by another thread, and I want to make a private copy of it (doesn't have to be consistent as a whole, only e...
@nprofile1q... I'm a fuzzy on what exactly you're trying to accomplish. Are you just saying that you're okay with having a very delayed copy of the counters?
In case you're not already using it, SponsorBlock is really good: https://addons.mozilla.org/en-US/firefox/addon/sponsorblock/
nostr:nprofile1qy2hwumn8ghj7un9d3shjtnyd968gmewwp6kyqpqv8w8clyrdfpy0y43evpwx3kex6medg5j70rcvhuvnadu32teaa2qgmzdn5 nostr:nprofile1qy2hwumn8ghj7un9d3shjtnyd968gmewwp6kyqpqz9myc59yadhemq6s3mpsugrdzzfqr55...
@nprofile1q... @nprofile1q... The specific repo is new and Codeberg itself is new. So this is the absolute worst it'll ever be in terms of search ranking.
I'm pondering to move my projects to codeberg every other week, but the thing that holds me back is visibility. When searching for stuff, I have yet to get any hits on codeberg, except few pages meant...
@nprofile1q... @nprofile1q... It's on the first page of a Kagi search but definitely a bit buried. It's disappointing to see a bunch of random GH forks with higher ranking, but the Codeberg repo is also new.
1
Yesterday I was thinking about serialization of fiber-based state machines and remembered Near (RIP) had written an article exploring the problems and potential solutions: https://saveweb.github.io/near.sh/articles/design/cooperative-serialization.html.
1
I've seen several independent, complete misconceptions of the Curry-Howard isomorphism just in the last week. Where are people getting these ideas, I wonder. Today's specimen, courtesy of the Hegel thread on HN: "Given Curry-Howard isomorphism, couldn't we ask AI to directly prove the property of the binary executable under the assumption of the HW model, instead of running PBTs?"
My favorite weird physical scaling limit in computing is that you can't tile a 3D networked grid of computers indefinitely because you eventually create a black hole: https://en.wikipedia.org/wiki/Schwarzschild_radius#Calculating_the_maximum_volume_and_radius_possible_given_a_density_before_a_black_hole_forms. Whereas you can in theory tile the computers in a 2D network indefinitely.
My recollection is that people implementing infinite smooth scrolling on the Amiga dealt with the wrap-around issue by replicating the streaming writes so that when you eventually reset the window to the opposite edge the data there is ready as an identical copy. On the NES it's usually assumed you do this via mappers in the carts (so you don't have to replicate the writes but can rely on address mirroring) but were there non-mapper-based smooth scrolling games on NES that replicated writes?
1
It has been 0 days since I misused the Mastodon web UI to write a regular post when I meant to reply. -_-
I will continue to make this mistake every few months until they stop trying to repurpose the...
@nprofile1q... One of the nice things about https://phanpy.social (which is purely client side) is how it handles that. I remember having that problem you mentioned with the original Mastodon web UI.
1
I guess this deserves to be posted on a regular cadence for the benefit of anyone who hasn't seen it before: https://www.dkriesel.com/en/blog/2013/0802_xerox-workcentres_are_switching_written_numbers_when_scanning
Very strange to read a paper that has a section titled "SIMD Implementation" and sentences like "Utilizing SIMD instructions, specifically POPCNT, this step efficiently identifies varint terminations within the 64-bit block" and all it ever does is word-level popcnt, clz and pext.