Click here to Skip to main content
15,849,458 members
Articles / Programming Languages / C++11

XorShift Jump 101, Part 1: Matrix Multiplication

Rate me:
Please Sign up or sign in to vote.
5.00/5 (5 votes)
14 Apr 2020CPOL22 min read 10.8K   213   6  
Jump forward/backward procedures for XorShift RNG explained step by step
This is a step by step tutorial explaining the math foundations and C++ implementation of the jump forward/backward procedures for the xorshift random number generators family. Part 1 is dedicated to algorithm based on matrix multiplication. Transition matrix is calculated automatically from the RNG formula definition with symbolic transformations implemented in Haskell.

Views

Daily Counts

Downloads

Weekly Counts

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


Written By
Unknown
This member has not yet provided a Biography. Assume it's interesting and varied, and probably something to do with programming.

Comments and Discussions