- Scheme 55.9%
- Tree-sitter Query 28%
- C 15.5%
- Makefile 0.6%
| lib/srfi | add peek-u8, draft #4 procedures, and add normalization of states so that equal? works better on them | |
| tests | add peek-u8, draft #4 procedures, and add normalization of states so that equal? works better on them | |
| .gitignore | init | |
| Makefile | 0.3.0 | |
| README.md | add TODO | |
| srfi-271.egg | 0.3.0 | |
| srfi-271.release-info | 0.3.0 | |
SRFI 271 for CHICKEN 6
An implementation of SRFI 271 for CHICKEN. The main loop for each RNG is written in C, making generating bulk data fast.
Includes
- splitmix64
- xoshiro256++
- chacha20
- chacha20 with fast key erasure
Benchmark
These benchmarks were run on a i5-2520M, -O3 compile setting, gcc.
You can run benchmarks by running the script tests/benchmark.scm.
Each benchmark test the amount of time it takes to read 100MB of data
into a bytevector. This is a bulk operation: it would be significantly
slower if done by reading and writing using read-u8.
randomized
0.381s CPU time, 0.005s GC time (major), 14/0 mutations (total/tracked), 1/0 GCs (major/minor), maximum live heap: 96.12 MiB
splitmix64
0.384s CPU time, 14/0 mutations (total/tracked), 0/1 GCs (major/minor), maximum live heap: 96.12 MiB
xoshiro256++
0.489s CPU time, 0.003s GC time (major), 14/0 mutations (total/tracked), 1/0 GCs (major/minor), maximum live heap: 96.12 MiB
chacha20
4.429s CPU time, 0.003s GC time (major), 14/0 mutations (total/tracked), 1/0 GCs (major/minor), maximum live heap: 96.12 MiB
chacha20-fast-key-erasure (default)
4.535s CPU time, 14/0 mutations (total/tracked), 0/1 GCs (major/minor), maximum live heap: 96.13 MiB
TODO
Test peek-u8, which can mess with the internal state representation.
License
© 2026 Peter McGoron
Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.