-
Online fact checking is hard, however Bitcoin has taught us a lot regarding how solving the Byzantine General's problem helps us create a single source of truth in the digital world.
What if the sa…
-
## Summary
Tendermint is a BFT consensus algorithm run by multiple nodes. IBC semantics does not distinguish single-machine node and distributed state machine, so Tendermint can be run on multiple …
-
this is a big one we'll look into a bit later
-
Currently, fontmake let's us run ttfautohint
It'd be great if it could also:
- run psautohint
- take the CLI params of pyftsubset and call the fontTools.subset
- do basic font renaming
- opti…
-
# Highlights of the Proposal
Instead of storing the entire asset payload (for CREATE transactions) this issues proposes to store the hash of the asset data.
Similarly, for the metadata field, this…
-
When debugging a separate issue, I discovered that Time/EN happily resolves "9:15 815" to 9:15 on January 1, 815 (i.e. a very specific time of day during the Byzantine Empire), marked as non-latent. S…
-
Solana achieves scalability through a combination of Proof of History (PoH) and other innovations like Tower BFT (Byzantine Fault Tolerance), Gulf Stream, Sealevel, and Turbine.
-
As part of the Vomit History at Neo series, this time let's talk about the Ecumenical Council of Florence, the day that Europe stopped vomiting crusades in the middle of Germany, discovered that it is…
-
## Overview
- [x] History @siddontang
- [ ] Rust @BusyJay
- [x] Architecture @siddontang
## Key-Value Engine
- [x] B+Tree vs LSM @DorianZheng
- [x] RocksDB @DorianZheng
- [ ] Wisckey …
-
- setKey could be postponed until 0.2. It is not totally necessary for 0.1
- .search() currently searches the titles of the scales. It could be nice to have a function that searches the descriptions o…