| // 1) "Tables of linear congruential generators of different sizes and good lattice structure" (1999), Pierre L'Ecuyer | |
| // 2) Pre-print version of (3) (https://arxiv.org/abs/2001.05304) | |
| // 3) "Computationally easy, spectrally good multipliers for congruential pseudorandom number generators" (2021), Guy L. Steele Jr. & Sebastiano Vigna (https://onlinelibrary.wiley.com/doi/epdf/10.1002/spe.3030) | |
| // inline comment number is bit width of constant | |
| const uint32_t lcg_mul_k_table_32[] = | |
| { | |
| // (3) Table 4 LCGs | |
| 0x0000d9f5, // 16 |
Here we create the master key. We want only Certify capability: we use the master key only to create the subkeys, Sign - Encrypt - Authenticate capabilities will be assigned to the subkeys.
Run the following command to start the master key generation process. Select the set your own capabilities creation process (type 8)
▶ gpg --full-generate-key --expert
gpg (GnuPG) 2.2.9; Copyright (C) 2018 Free Software Foundation, Inc.
| /* Allocate aligned memory in a portable way. | |
| * | |
| * Memory allocated with aligned alloc *MUST* be freed using aligned_free. | |
| * | |
| * @param alignment The number of bytes to which memory must be aligned. This | |
| * value *must* be <= 255. | |
| * @param bytes The number of bytes to allocate. | |
| * @param zero If true, the returned memory will be zeroed. If false, the | |
| * contents of the returned memory are undefined. | |
| * @returns A pointer to `size` bytes of memory, aligned to an `alignment`-byte |
| // Today, I noticed that someone favorited this tweet of mine from 2012: | |
| // https://twitter.com/cowboy/status/232587756486938624 | |
| // !function $(){console.log('!'+$+'()')}() #quine | |
| // So I fooled around for a little bit: | |
| // Shortest JavaScript quine? | |
| (function _(){return'('+_+')()'})() | |
| // Have fun with this one! |
