Source: Build Your Own Text Editor
Source/Math/Frustum.cpp · master · OSS Lugaru / lugaru · GitLab
Lugaru HD, free and open source ninja rabbit fighting game – https://osslugaru.gitlab.io
Source: Source/Math/Frustum.cpp · master · OSS Lugaru / lugaru · GitLab
How SHA-256 Works Step-By-Step | Boot.dev
SHA-2 (Secure Hash Algorithm 2), of which SHA-256 is a part, is one of the most popular hash algorithms around. In this article, we will break down each step of the cryptographic algorithm and work through a real example by hand. SHA-2 is known for its security (it hasn’t broken down like SHA-1) and its speed. In cases where keys are not generated, such as mining Bitcoin, a fast hash algorithm like SHA-2 often has the upper hand.
Designing Uber – High Scalability –
How I stopped worrying and learned to run wasm and native hybrid code – Tweag
Introduce the trick we use to run ghc test suite that needs to exec wasm code
Source: How I stopped worrying and learned to run wasm and native hybrid code – Tweag
Guides | Hypercore Protocol
Documentation for the Hypercore Protocol.
Source: Guides | Hypercore Protocol
nop nop nop nop nop nop nop rts
Compiler Explorer is an interactive online compiler which shows the assembly output of compiled C++, Rust, Go (and many more) code.
Source: Compiler Explorer
Bots
Grumpy Website
Source: Grumpy Website
Another New Record in Self-Cleaning Turing Machines | Something Something Programming
How long can a Turing machine program run when started on the blank tape before the tape becomes blank again? Of course, this will depend on the length of the program – how many states and colors it has. Even given these parameters, it is logically impossible to calculate how long a self-cleaning Turing machine can run. Any values that can be known have to be discovered empirically.
Source: Another New Record in Self-Cleaning Turing Machines | Something Something Programming