• 0 Posts
  • 20 Comments
Joined 1 year ago
cake
Cake day: October 4th, 2023

help-circle



  • Considering that reading source code can take a long time

    You’ll get faster over time, until reading code is faster than reading documentation, as code will always represent what’s truly happening, while docs are frequently outdated.

    In a language the user isn’t familiar with

    If you’re not that familiar with the language, it’s likely you won’t be contributing to the project. Open source projects usually to have quite limited resources, so they tend to optimize docs and dev UX for people who are likely to contribute.




  • The UK spent decades convincing everyone that all bad decisions are made by the EU and all good decisions are made by Westminster. That’s the first mistake.

    If the UK had properly educated its citizens about what the EU actually was and did, no remain campaign would’ve been necessary whatsoever. But it was politically convenient to have a scapegoat.

    And let’s be honest, remain aka “remoaners” had a ton of arguments all the time. But brexiteers just wanted to enter the magical land where the UK still mattered and they’d eat their cake and have it still.



  • Sure, it’d be a solution for five minutes until someone delids the secure enclave on the gaming card, extracts the keys, and builds their own open source hw alternative.

    High-performance FPGAs are actually relatively cheap if you take apart broken elgato/bmd capture cards, just a pain in the butt to reball and solder them. But possibly the cheapest way to be able to emulate any chip you could want.





  • If you’ve got 14 billion years, a theft takes a minute, then you need 53 recursion levels of binary search to find the moment of the theft. (14 billion years can be split into about 7.3e15 1-minute segments, 53 levels of binary search allow you to search through 9e15 segments)

    That means OP assumed that it’d take 1 minute to decide whether at a certain still frame the theft had already occured or not, to compute the new offset to seek to, and the time it’d take to actually seek the tape to that point.

    Not an unreasonable assumption, but a very conservative estimate. Assuming the footage is on an HDD and you’ve got an automated system for binary search, I’d actually assume it’d take 5 seconds for each step, meaning finding a 1min theft on 14 billion years of footage would take 5 minutes.