writeups
rand
Our great sponsors
writeups | rand | |
---|---|---|
4 | 29 | |
49 | 1,578 | |
- | 2.7% | |
0.0 | 8.3 | |
about 1 year ago | 2 days ago | |
Sage | Rust | |
- | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
writeups
-
Bitcoin tries to maintain 10 minutes between each block. This gives everyone in the world enough time to update their ledgers. Consistency is difficult when millions of machines are turned on and off every day. And yet, bitcoin is still becoming more reliable by the block
However, averaged over sufficiently long periods of time, the duration of blocks tends to be 600.5958 seconds (10 minutes times 2016/2014, see https://github.com/sipa/writeups/tree/main/bitcoin-difficulty-adjustment for a very mathematical explanation). If the average tends to less than that, it implies the hashrate is on average growing. If the average tends to more than that, it implies the hashrate is average shrinking.
- Private Authentication Protocols
-
An optimal algorithm for bounded random integers
You may be interested in this work going in the opposite direction, holding the bias constant and extracting the most ranges from a constant amount of randomness:
https://github.com/sipa/writeups/tree/main/uniform-range-ext...
This work is interesting because generating random bits via strong generators is typically much more expensive than extraction-- so it can be very useful in cases where a number of small random values are needed in a tight loop such as for some kinds of hash table and generating permutations.
-
A fast alternative to the modulo reduction
I recently discovered a generalization of this approach, which allows mapping a single hash to multiple independent numbers, each in their own range, while maintaining various uniformity properties.
A write-up is here, in case anyone is interested: https://github.com/sipa/writeups/tree/main/uniform-range-ext...
rand
-
We have getrandom at home
Making compatibility promises for distributions means they cannot take advantage of potential advancements in the field.
-
Blog Post: On Random Numbers
Defining an error type that is meaningful, portable, and compatible with no-std isn't straightforward. If the std lib's getrandom requires std, then just like that, rand and many other crates won't use it anyway. Using io::Result seems to me to face this challenge.
-
Hey Rustaceans! Got a question? Ask here (52/2022)!
Some wasm targets can’t generate random numbers at all but in the case of the book because you are using wasm in a browser you can use JS to generate random numbers. I believe there’s a way to get the rand crate to use JS as the backend for generating rand but its a bit more convoluted than the easy one-liner that the book suggests.
- Data-driven performance optimization with Rust and Miri
-
What crates are considered as de-facto standard?
rand
- Why Rust?
-
[Media] Nebulabrot rendered with Rust — Explanations in the comments
This uses rand and xcomplex to handle the mathematics, png to write image files, and dialoguer and indicatif for some pretty prompts and progress bars.
-
Do you ever use unsafe { .. } when not implementing custom data structures or interacting with external C code?
You can often achieve this without any unsafe by putting an assert!() on the length before the hot loop. For example, I got rid of some unsafe in rand that way.
-
Original source of `(seed * 9301 and 49297) % 233280` random algorithm?
This is a widely used method to map random integers to floating point numbers, but it has the disadvantage of wasting 1 bit of float mantissa precision.
On modern CPUs, its computational advantage over full-precision mapping methods, such as multiplication by a float, is not always clear [1].
[1] https://github.com/rust-random/rand/issues/416
-
Any plans for built-in support of Vec2/Vec3/Vec4 in Rust?
In fact, there are a lot of crates in Rust where in other programming languages, it would be included in the standard library. Examples are regex, random number generators, additional iterator methods, macros for other collections, num traits, loggers, HTTP libraries, error handling, async runtimes, serialization and deserialization, date and time, and many more.
What are some alternatives?
fastrand - A simple and fast random number generator
fast-float-rust - Super-fast float parser in Rust (now part of Rust core)
winapi-rs - Rust bindings to Windows API
yew - Rust / Wasm framework for creating reliable and efficient web applications
cargo-fuzz - Command line helpers for fuzzing
rust - Rust for the xtensa architecture. Built in targets for the ESP32 and ESP8266
log - Logging implementation for Rust
regex - An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
rust-sdl2 - SDL2 bindings for Rust
rayon - Rayon: A data parallelism library for Rust
json - JSON for Modern C++
rust - Empowering everyone to build reliable and efficient software.