Free tools Windows power users keep installed
One-click scans. No signup required.
iTechGuides is reader-supported. When you buy through links on our site, we may earn an affiliate commission. As an Amazon Associate I earn from qualifying purchases. Learn more
Vincent Granville’s proposal is a deterministic software pseudorandom-number generator (PRNG) that extracts binary digits from many quadratic irrational numbers, skips an initial portion of each sequence, and combines short segments into a longer bit stream. The approach may reduce computation compared with expanding one irrational number to the same total length, according to Granville’s own complexity analysis. However, the available material does not establish military adoption, certification, cryptographic security, or independent validation.
What the generator actually is
A quadratic irrational is a number such as a square root of a nonsquare integer whose decimal or binary expansion does not terminate or repeat periodically. Granville’s design uses seed pairs to define many such numbers, then derives binary digits from their expansions. The generator is therefore deterministic: the same accepted seeds, parameters, and implementation can reproduce the same output.
The method is not a physical entropy source. It does not obtain unpredictability from quantum events, electronic noise, or another external process. Its output is calculated by software from its initial state.
What’s actually slowing this PC down?
Pick the symptom - the matching free tool is one click away.
How the proposed construction works
1. Build candidate quadratic irrationals
The implementation starts with seed pairs and forms candidate quadratic irrationals. It uses the square-free parts of the candidates to select distinct numbers. Granville’s chapter states that 61% of positive integers are square-free, giving the proportion as 6/π²; that figure is presented here as the author’s supplied mathematical context.
#1 Best Overall
- THE RANDOM NUMBER GENERATOR (RNG-01) is a laboratory quality instrument that uses the immutable randomness of radioactivity decay to generate random numbers
- THE RNG-01 PRODUCES approximately one to three random numbers every minute from background radiation.
- TRUE RANDOM NUMBERS that are useful for data encryption (cryptography), statistical mechanics, probability, gaming, neural networks and disorder systems, PSI and ESP testing, micro PK experiments, etc.
- SELECTION OF RANDOM NUMBER RANGES: 1-2, 1-4, 1-8, 1-16, 1-32, 1-64 and 1-128 .
- This unit is the Clear Transparent Etched Case. IMAGES SCIENTIFIC INSTRUMENTS INC., manufacturing electronic instruments and kits for over 25 years.
2. Generate digits without expanding one number from the beginning
Granville describes a way to obtain a digit at a selected position rather than necessarily calculating every preceding digit. His implementation instead generates a set of digits for each accepted irrational, discards an initial offset, and stores the remaining bits.
3. Combine many short segments
The output stream is assembled from segments produced by many different irrationals. The intended benefit is distributing the work across numerous shorter expansions rather than calculating one very long expansion.
Why the author expects faster computation
Granville’s technical chapter models the cost of generating one sequence of length n as O(n²). If the same total length is divided among r numbers with m digits each, where n = rm, the chapter gives a total cost of O(rm²). In the extreme case r = n and m = 1, this becomes O(n), which the author compares asymptotically with the Mersenne Twister.
These are the author’s complexity claims, not an independently reproduced benchmark. Actual throughput depends on the digit-extraction algorithm, Python implementation details, parameter choices, memory use, processor, parallelism, and how output is combined. A fair comparison would run the same workload on the same hardware against established generators.
Rank #2
- This password key storage, random number generator. Protected storage of up to 16 keys, certificates or data. Hardware support for asymmetric signature, verification, and key agreement.
- It can be applied to the key management and exchange of IoT endpoints, encrypted small messages and PI data, secure boot and protection download and ecosystem control, anti-cloning and other fields.
- Curve support: NIST standard P256 elliptic curve , Random number generator (RNG): high quality FIPS 800-90 A/B/C
- IIC interface: 1MHz standard , IO port level: 1.8-5.5V
- Power supply voltage: 25.5V
Why an offset is needed
The chapter reports that early digits for its selected seeds can be biased. Its remedy is to skip an initial offset before retaining output. This is an implementation parameter, not a general proof that later digits are unbiased or unpredictable. Different seeds and configurations could require different analysis.
What testing has—and has not—shown
Tests described by the chapter
- Basic summary statistics on finite output samples.
- Correlation checks.
- Compression comparisons.
- Discussion of how an initial offset affects the observed stream.
The chapter also says that a standard battery such as Diehard remained a next step and notes that one proposed configuration had not yet been tested. Granville writes: “The next step is to run a standard battery of tests such as the Diehard tests, and check whether this PRNG passes all of them depending on the parameters and configuration.” Passing such tests would still address statistical behavior, not automatically establish resistance to prediction or attack.
Can digits of irrational numbers be used to generate random bits?
They can be used to generate pseudorandom-looking bits. An irrational expansion supplies a long, nonrepeating deterministic sequence, and combining sequences can make simple patterns harder to see. But irrationality alone is not a cryptographic security property. A sequence can be mathematically nonperiodic yet predictable when its construction, seed, or internal state is known.
The relevant questions are whether the seed contains enough genuine entropy, whether an attacker can recover or infer the state, how output changes after partial state compromise, and whether the construction has a demonstrated security reduction or extensive independent review. The supplied sources do not answer those questions for this proposal.
Is this quadratic-irrational PRNG secure for cryptography?
That has not been established by the cited material. The chapter recommends that encryption use a hardware-generated seed that is never reused. This is the author’s recommendation, not evidence that the complete generator is a standards-conformant cryptographic random-bit generator or secure against an adversary.
NIST makes the broader limitation explicit: “Running statistical tests can help, but no statistical test on the output alone can absolutely guarantee that the output was unpredictable, especially if an adversary has tampered with the device.” This guidance applies to randomness testing generally; it is not an evaluation of Granville’s algorithm.
No independent audit, certification, military deployment record, or cryptographic validation is established in the cited sources. “Military-grade” should therefore be read as a label in the article title, not as a demonstrated procurement or assurance status.
Recommended Free Tools
How it compares with an established cryptographic generator
Before using this design for keys, nonces, tokens, or other security decisions, compare it with a well-reviewed cryptographically secure PRNG using the same criteria:
| Criterion | Questions to ask | Status for this proposal |
|---|---|---|
| Cryptographic security | Is there a formal analysis, security reduction, or independent review? | Not established by the cited sources. |
| Seed and state | How is entropy collected, is the seed unique, and what happens after state exposure? | The chapter recommends a never-reused hardware-generated seed; broader guarantees are not established. |
| Throughput | How fast is it on the target hardware under identical workloads? | Only the author’s asymptotic analysis is supplied; no independent benchmark is established. |
| Reproducibility | Do the same parameters produce identical output across implementations and platforms? | The deterministic construction is intended to be reproducible, but cross-platform validation is not established. |
| Statistical testing | Which independent test batteries and configurations have been completed? | Finite summaries, correlations, and compression comparisons are described; the chapter calls for further standard testing. |
What the proposal is useful for
The design is valuable as an educational case study in number theory, digit extraction, algorithmic complexity, and experimental randomness testing. Its Python implementation can help readers reproduce the construction, vary the number of irrationals and offset, and observe how configuration changes affect speed and sample statistics.
For production cryptography, use a generator specified and reviewed for that purpose unless a qualified security review establishes that this construction meets the required threat model and standards.
Bottom line
Granville’s quadratic-irrational PRNG is an interesting deterministic method that combines many short digit sequences and may offer an author-reported computational advantage. The available chapter also documents an early-digit bias concern and limited testing. Those facts do not demonstrate military use or cryptographic unpredictability. Treat the proposal as experimental and educational until independent analysis, comprehensive testing, and an appropriate security assessment are available.
Do these 3 things before closing this tab:
1Clear out junk files and repair common Windows errors2Fix the driver behind crashes, sound loss and screen glitches3Repair Windows errors before they cause bigger problemsFrequently Asked Questions
Does using irrational numbers make the output truly random?
No. The proposed generator is deterministic software. Irrational expansions can produce nonrepeating, random-looking digits, but irrationality alone does not provide entropy or prove unpredictability.
Should this generator be used to create encryption keys?
Not on the evidence cited here. The author recommends a never-reused hardware-generated seed, but the sources do not establish standards compliance, resistance to state compromise, or independent cryptographic validation.
What does “military-grade” mean in this context?
The cited sources do not document military adoption, certification, or independent security validation. It is a title descriptor rather than a demonstrated assurance level.
Quick Recap
Product prices and availability are accurate as of the date/time indicated and are subject to change. Any price and availability information displayed on Amazon at the time of purchase will apply.
