/explore
|
You are here 
|
ridiculousfish.com | ||
| | | | |
www.righto.com
|
|
| | | | | While programmers today take division for granted, most microprocessors in the 1970s could only add and subtract - division required a sl... | |
| | | | |
gpfault.net
|
|
| | | | | [AI summary] The text provides an in-depth exploration of various x86-64 instruction set architectures, focusing on arithmetic operations (ADD, SUB, MUL, SMUL, DIV, SDIV), logical operations (AND, OR, XOR, NOT), and control flow instructions. It details the implementation of these instructions in the QBX virtual machine, emphasizing how they emulate real x86-64 instructions while managing the flags register and handling different operand sizes (8-bit and 16-bit). The text also discusses the nuances of flag handling, register operations, and macro-based code generation to streamline instruction implementation. | |
| | | | |
mark.engineer
|
|
| | | | | [AI summary] The user shared an extensive account of their project to compute the first 255 digits of π using an Intel 4040 CPU, which is over 50 years old. They described their hardware setup, firmware modifications, and optimization techniques to achieve the computation within a significantly reduced time compared to earlier estimates. The project involved custom firmware, precise timing control, and a spigot algorithm to calculate π's digits efficiently on vintage hardware. The final run completed the task in approximately 69 hours, showcasing the potential of optimizing algorithms for older processors. | |
| | | | |
rareskills.io
|
|
| | | Elliptic Curves over Finite Fields What do elliptic curves in finite fields look like? It's easy to visualize smooth elliptic curves, but what do elliptic curves over a finite field look like? The following is a plot of $y² = x³ + 3 \pmod {23}$ Because we only allow integer inputs (more specifically, finite field... | ||
