Byzantine-fault-tolerant time synchronization
Byztime is a Byzantine-fault-tolerant protocol for synchronizing time among a group of peers, without reliance on any external time authority. The time kept by Byztime is simply a counter that advances at a rate of something very close to one unit per second, such that all nodes are in close agreement as to its current value [...]
Reading about the concept of "storage" in #rust.
A very deep read TBH, that deserves certainly (for me) more than one pass.
"Is custom allocators the right abstraction?"
Starting from a recently shared summary at the post #74 https://internals.rust-lang.org/t/is-custom-allocators-the-right-abstraction/13460/76
Infinite versions of minesweeper are Turing complete
The starting point [...] is [...] that the [...] Minesweeper game is NP-complete. The proof was by making suitable minesweeper configurations simulate digital computers [...] reminiscent of John Conway’s game of life [...] which was proved to be Turing complete [...] It is reasonable to ask whether or not there is an version of Minesweeper [...] that is also Turing complete [...] there is.
me last night: "ok a half hour of skyrim before bed"
[game launches, mid dungeon]
me: "oh i'm too full to pick up this treasure"
[backtrack to outside]
[fast travel to discombobulate a new magic weapon and learn its secrets]
[fast travel to the 3 shops that still have money to buy various things from me]
[fast travel back to the dungeon entrance]
me: "welp that's a half hour. bedtime!"
Package Release: 02/24 nano 5.6 GNU nano: a curse-based text editor for UNIX https://www.nano-editor.org/
Re-reading with genuine fascination and admiration for the clarity of the writing.
Stacked Borrows Implemented
"What Stacked Borrows does is that it defines a semantics for Rust programs such that some things about references always hold true for every valid execution [...]: &mut references are unique [...] and & references are immutable [...] We have to define a set of rules that makes sense even for unsafe code."
Rust ownership, the hard way
"In order to truly understand Rust, one needs to understand its crucial differentiating feature: ownership. Let’s go through it in detail the hard way."
New Release: 0 A.D. Alpha 24: Xšayāršā
Wildfire Games, an international group of volunteer game developers, proudly announces the release of 0 A.D. Alpha 24: “Xšayāršā” (pronounced: Khsha-ya-ṛsha), the twenty-fourth alpha version of 0 A.D., a free, open-source real-time strategy game of ancient warfare. The release is named after Xerxes the Great, ruler of the Achaemenid Empire from 485 to 465 BC
Cranelift, Part 2: #compiler Efficiency, CFGs, and a Branch Peephole Optimizer
In this post [...] dive into the compiler performance aspect [...] There are many interesting aspects of compilation speed I could talk about, but one particularly difficult problem is the handling of control flow: how do we translate structured control flow at the Wasm level into control-flow graphs at the IR level, and finally to branches in a linear stream of instructions at the machine-code level?
Is there a special algorithm complexity theory for Functional Programming?
I looked through NP-hardness definitions - they use notions of von Neumann architecture everywhere. It doesn't look that this logic is applicable if we speak about reductions of #fp
Generalizing over Generics in Rust (Part 1) - AKA Higher Kinded Types in #rust
What goes into default #debian ?
A [p]locate history.