Hawkynt

SFMT-19937 (SIMD-oriented Fast Mersenne Twister)

SFMT19937 is a variant of Mersenne Twister optimized for modern CPUs with SIMD instructions. It generates 128-bit blocks with period 2^19937-1 and faster generation than standard MT19937, though this JavaScript version uses portable C implementation without native SIMD.

Properties

Property	Value
Category	Random Number Generators
Sub-category	Pseudo-Random Number Generator
Security status	🎓 Educational Only
Complexity	Advanced
Inventor	Mutsuo Saito and Makoto Matsumoto
Year	2006
Origin	🇯🇵 Japan
Source	algorithms/random/sfmt.js

Parameters

Parameter	Supported values
Seed sizes	4 bytes (32 bits)

Capabilities

Flag	Value
IsDeterministic	Yes
IsCryptographicallySecure	No

Security

Status: 🎓 Educational Only

No vulnerabilities are recorded for this implementation.

Documentation

• Official SFMT Website
• SFMT Paper: SIMD-oriented Fast Mersenne Twister (MCQMC 2006)
• GitHub Repository: MersenneTwister-Lab/SFMT
• Master’s Thesis: Variants of Mersenne Twister (Mutsuo Saito)

References

• Reference Implementation (C code)
• SFMT19937 Parameters
• Test Vectors (32-bit output)

Test vectors

2 vectors ship with this algorithm and run in the test suite. Byte values are hexadecimal.

Vector 1 — SFMT19937 with seed 1234 (first 10 outputs)

Field	Value
seed	d2040000
outputSize	40
input	null
expected	32000dcdd7f5475df6fb0a5a247ba8ae 84799256a57546e2f05c38195d13c87f d0bb1ee4638d0ab2

Vector 2 — SFMT19937 with seed 1234 (outputs 11-20)

Field	Value
seed	d2040000
skipBytes	40
outputSize	40
input	null
expected	32ef709f125b9a5b911bd2789b771797 ed5e8664e4a88120498ac0586cb1b051 bc2130fc4bdb1bee

---

← All algorithms

This site is open source. Improve this page.