OperationQueue + Asynchronous Code
Photo by Austris Augusts on UnsplashIn Swift using OperationQueue for asynchronous code may seem like pure hell because, under the hood, Operations are considered complete if the compilation of their synchronous code is completed.In other words, compiling the example described below will output a broken execution order since, by the time
Read moreEngineer to Engineering Manager: For Better or for Worse
You’ve spent your entire career looking at the microscopic details of computing systems. When moving into management, you learn to shareContinue reading on Better Programming »
Read moreCrafting Elaborate (Yet Meaningless) Plots with Python
Dive into the intricacies of matplotlib and mathematical discretizationContinue reading on Better Programming »
Read moreLike Python++ for AI developers
This is part two of our conversation with Chris Lattner, creator of Swift, Clang, and LLVM and CEO/cofounder of Modular AI.
Read moreHow ChatGPT Wins Friends and Influences People
The smooth-talking chatbot has dubious merchandise but textbook sales techniqueContinue reading on Better Programming »
Read moreChris’ Corner: Better CSS Animation
CSS animation rules. Just have a look at… CodePen lol. There was a (long) time when it didn’t exist, though. My old buddy Jonathan Snook wrote in 2007 that he didn’t like the idea of animation coming to CSS at all, but had changed his mind by 2009. They’ve evolved
Read moreBehind the scenes with OverflowAI Search
Go behind the scenes with how we designed our new search.
Read moreMersenne primes are unsafe
In the previous post I mentioned that a particular Mersenne prime would be unsuitable for cryptography. In fact, all Mersenne primes are unsuitable for cryptography. A prime number p is called “safe” if p = 2q + 1 where q is also a prime. Safe primes are called safe because
Read moreVictorian public key cryptography
Electronic computers were invented before public key cryptography. Would public key cryptography have been possible before computers? The security of RSA encryption depends on the ratio of the difficulty of factoring relative to the difficulty of multiplication. This ratio was high, maybe higher, before modern computers. Suppose the idea of
Read more