Toggle navigation
MeasureThat
.net
Create a benchmark
Tools
Feedback
Feature Requests
FAQ
Register
Log In
uuid generation crypto.getRandomValues
(version: 0)
Benchmark.js
Comparing performance of:
uuidv4 vs random 1 vs random 2 vs random 3
Created:
5 years ago
by:
Guest
Go to the latest result
Tests:
uuidv4
bits = crypto.getRandomValues(new Uint8Array(20)) bits[5] = (bits[5] & 0x4F) | 0x40; bits[8] = (bits[8] & 0xBF) | 0x80; bits = [...bits].map(e => e.toString(16).padStart(2,'0') ).reduce((a,c,i)=>a+([4,7,10,13].includes(i)?'-':c));
random 1
Array(20).fill(0).map(()=>crypto.getRandomValues(new Uint8Array(1))[0].toString(16).padStart(2,'0')).reduce((a,c,i)=>a+([4,7,10,13].includes(i)?'-':c))
random 2
([1e3]+-10+-10+-1e5).replace(/\d/g, () => crypto.getRandomValues(new Uint8Array(1))[0].toString(16).padStart(2,'0'))
random 3
let s=[]; crypto.getRandomValues(new Uint8Array(20)).map( e => s.push(e.toString(16).padStart(2,'0')) ); [4,7,10,13].map( idx => s[idx]='-' ); s.join('');
Rendered benchmark preparation results:
Suite status:
<idle, ready to run>
Run tests (4)
Previous results
Fork
Test case name
Result
uuidv4
random 1
random 2
random 3
Fastest:
N/A
Slowest:
N/A
Latest run results:
Run details:
(Test run date:
one year ago
)
User agent:
Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/134.0.0.0 Safari/537.36
Browser/OS:
Chrome 134 on Mac OS X 10.15.7
View result in a separate tab
Embed
Embed Benchmark Result
<iframe src="https://measurethat.net/Embed?id=591324" width="100%" height="500px"></iframe>
random 3
241K/s
uuidv4
208K/s
random 2
34K/s
random 1
24K/s
View exact numbers
Test name
Executions per second
✓
random 3
240,737 Ops/sec
uuidv4
207,747 Ops/sec
random 2
33,989 Ops/sec
random 1
24,496 Ops/sec
Autogenerated LLM Summary
(model
llama3.2:3b
, generated one year ago):
Let's break down the provided benchmarking JSON and explain what's being tested. **Benchmark Overview** MeasureThat.net is a website that allows users to create and run JavaScript microbenchmarks. The goal of this benchmark is to measure the performance of different approaches for generating UUIDs (Universally Unique Identifiers) using the `crypto` module in JavaScript. **UUID Generation Methods** The benchmark tests four different methods for generating UUIDs: 1. **uuidv4**: This method uses the `crypto.getRandomValues` function to generate 20 random bytes, then modifies them according to a specific pattern. The resulting UUID is generated by reducing the modified bytes into a string. 2. **random 1**: This method generates an array of 20 random values using `crypto.getRandomValues`, converts each value to a hexadecimal string, and then reduces these strings together with some modifications. 3. **random 2**: Similar to `random 1`, but uses a different pattern for modifying the generated values. 4. **random 3**: This method creates an empty array `s` and pushes the generated random bytes into it as hexadecimal strings, followed by replacing specific indices with hyphens. **Library and Syntax** In this benchmark, the `crypto` module is used extensively. The `getRandomValues` function is a part of this module, which returns an array of random numbers. There are no special JavaScript features or syntaxes being tested in this benchmark. **Comparison of Approaches** The pros and cons of each approach are: * **uuidv4**: This method uses the least amount of modifications to generate the UUID, making it potentially the fastest. However, it may be less readable due to the complex pattern used. * **random 1** and **random 2**: These methods use more modifications than `uuidv4`, but they also provide more opportunities for optimization (e.g., caching or memoization). However, their increased complexity may lead to slower execution times. * **random 3**: This method is the slowest due to the unnecessary array creation and string manipulation. **Other Alternatives** If you're looking for alternative methods to generate UUIDs in JavaScript, consider using a dedicated library like `uuid` or `nanoid`. These libraries provide a simple and efficient way to generate UUIDs without relying on the `crypto` module. In conclusion, this benchmark tests four different approaches for generating UUIDs using the `crypto` module. The choice of approach depends on trade-offs between performance, readability, and complexity.
Related benchmarks
UUID V4 Crypto vs Math
Math.random vs crypto.getRandomValues vs uuid
Comments
Confirm delete:
Do you really want to delete benchmark?