Recently, I learned that at least one of my readers is dissatisfied with my current favourite “open source license”. For him and any others like him, I would like to propose a new one, and offer to “relicense” under it any of the VTronic items I have published on my site (strictly by explicit request, […]
This is a continuation of “Pest” v. 0xFC. This is the heaviest revision of the spec to date, approaching a total rewrite. Pedantic details concerning data types and their encodings were added; several algorithms have been reworked and substantially simplified; and a number of ugly gaffes — corrected. There is a pretty-printed mirror of this […]
This is a continuation of “Pest” v. 0xFD. There are currently two published prototype implementations of Pest: “Blatta” (by thimbronion); and “smalpest” (by jonsykkel). Thank you, prototype implementers! A quite lively Pestnet is now active, and a public log thereof, operated by billymg (WOT) may be seen here. There is a working draft of v. […]
This is a continuation of “Pest” v. 0xFE. There is a pretty-printed mirror of this page. There is now a prototype! (Thank you, thimbronion!) 14 Dec 2021: And there is now a second prototype! (Thank you, jonsykkel!) There is a working draft of v. 0xFC. (Note: it may change without warning!) The document (very much […]
This is a continuation of “Pest” v. 0xFF. Edit: A note for the innocent — this series of articles concerns an algorithm! It is not, at the time of writing, fully implemented anywhere! There is now a prototype! (Thank you, thimbronion!) Or even entirely complete. Edit: There is a working draft of v. 0xFD. (Note: […]
What follows is a long-promised detailed specification of a DDOS-proof, CPU-inexpensive, ciphered-authenticated peer-to-peer communication protocol. I would like to thank Thimbronion for implementing a large subset of this spec already despite not having seen it yet! The document (very much a work in progress!) is available as a vtree. You will need: A V-tron. If […]
This article is part of a series of hands-on tutorials introducing FFA, or the Finite Field Arithmetic library. FFA differs from the typical “Open Sores” abomination, in that — rather than trusting the author blindly with their lives — prospective users are expected to read and fully understand every single line. In exactly the same […]
Note: this the second, revised draft of the prospectus, incorporating feedback from prospective customers. The previous draft can be seen here. I have provisioned a machine colocation rack for the exclusive use of The Most Serene Republic, as represented by the WoT L1 and L2. If you, reader, are not in this roster, you may […]
Edit (27 Oct 2019) : This document is supplanted by the second draft of the prospectus. I have provisioned a machine colocation rack for the exclusive use of The Most Serene Republic, as represented by the WoT L1 and L2. If you, reader, are not in this roster, you may safely skip this article.
This article is part of a series of hands-on tutorials introducing FFA, or the Finite Field Arithmetic library. FFA differs from the typical “Open Sores” abomination, in that — rather than trusting the author blindly with their lives — prospective users are expected to read and fully understand every single line. In exactly the same […]
