Examples
Examples
Try the starting example
- Timestamp bits
- 20
- Milliseconds per time tick
- 1
- Worker ID bits
- 4
- Sequence bits per worker per tick
- 8
- Epoch as UTC timestamp
- 2026-01-01T00:00:00Z
- Representable time-span (seconds)
- 1,048.576
- Worker capacity
- 16
- IDs per worker per tick
- 256
- Cluster-wide IDs per tick
- 4096
- Last representable timestamp (UTC)
- 2026-01-01T00:17:28.575Z
- Total allocated bits
- 32
Try another scenario
- Timestamp bits
- 10
- Milliseconds per time tick
- 10
- Worker ID bits
- 2
- Sequence bits per worker per tick
- 2
- Epoch as UTC timestamp
- 2026-01-01T00:00:00Z
- Representable time-span (seconds)
- 10.24
- Worker capacity
- 4
- IDs per worker per tick
- 4
- Cluster-wide IDs per tick
- 16
- Last representable timestamp (UTC)
- 2026-01-01T00:00:10.230Z
- Total allocated bits
- 14
Calculation method
Calculation method
Representable time-span (seconds)
2^timestamp bits × milliseconds per tick / 1000.
Worker capacity
2^worker bits, computed using exact integer arithmetic.
IDs per worker per tick
2^sequence bits.
Cluster-wide IDs per tick
Worker capacity × sequence capacity.
Last representable timestamp (UTC)
Epoch + (2^timestamp bits − 1) × tick duration.
Total allocated bits
Timestamp bits + worker bits + sequence bits; no sign or reserved bits are included.
Symbols and units
- a
- Timestamp bits
- b
- Milliseconds per time tick
- c
- Worker ID bits
- d
- Sequence bits per worker per tick
- e
- Epoch as UTC timestamp
Use the units shown. A list keeps the order in which you enter its values. The symbol ^ means “raised to the power of”.
Assumptions & limits
Assumptions & limits
- Bit-capacity worksheet, not a distributed ID generator. Assumes every tick and worker/sequence value is usable, clocks do not roll back and worker IDs are uniquely assigned. Extra sign/reserved bits must be budgeted separately.
Are these inputs private?
These calculations run in your browser. A shared link contains the values you choose to share. Only questions submitted to the separate AI finder are sent to OpenAI.
Further reading
OpenStax: arithmetic and geometry ↗
Background reading; this does not imply endorsement or independent review of SumFizz.