Category Deterministic Computing

Deterministic Computing

Fixed-point arithmetic, reproducible containers, rollback, replay and network sessions.

• Fixed-Point Scalars — Signed and unsigned 32/64-bit fixed-point numbers share configurable precision, rounding, overflow and special-value policies.
• FixedMath — Deterministic fixed-point math exposes arithmetic helpers, roots, trigonometry and other functions with status-returning variants.
• Fixed Vectors — Fixed64-based 2D/3D vectors provide geometry, normalization, interpolation and movement helpers.
• Fixed-Point Network Codecs — Scalar and vector codecs support fixed-width, varint and range-based bit-packed payloads with compatibility profiles.
• FixedRandom — Philox-based deterministic random streams expose ranges, chances, dice, sampling, shuffling and state capture/restore.
• Deterministic Weighted Selection — Builds fixed-point weight tables and chooses weighted indexes using FixedRandom.
• Deterministic Spatial Random — Samples fixed-point points inside or on circles, spheres, boxes, rectangles and triangles.
• FixedRandom Network State — Encodes random state and negotiates algorithm, sampler and numeric compatibility descriptors.
• Fixed-Point Unity Integration — Managed/Burst batch operations, Native random APIs, vector conversion and serialized vector wrappers bridge fixed-point code to Unity.
• Deterministic Sequence Collections — Managed and Native arrays, cells, lists, queues, deques, stacks and ring buffers expose defined order and allocation policies.
• Deterministic Hash Collections — Dictionary and HashSet variants preserve insertion order with explicit deterministic equality/hash policies.
• Deterministic Sorted Collections — SortedList uses ordered arrays; SortedDictionary and SortedSet use indexed AVL storage, with Managed and Native variants.
• Deterministic Priority Queue — Minimum-priority queue preserves FIFO order for equal priorities and snapshots its ordering counter.
• Deterministic BitSet — Indexed bit storage supports counting and finding active bits in both memory backends.
• Deterministic SlotMap — Generational handles identify pooled slots with defined reuse and snapshot behavior.
• Deterministic SparseSet — Dense component storage uses explicit swap-removal and offers entity-ID ordering.
• Deterministic LinkedList — Pool-backed linked nodes use generational handles and preserve their links in snapshots.
• Deterministic MultiMap — Keys and each key's values retain insertion order through shared Managed/Native algorithms.
• Deterministic Graphs — Mutable Managed and Native graph storage uses stable graph handles and deterministic topology operations.
• Frozen Deterministic Graphs — Frozen graph variants and canonical bindings provide immutable graph topology for queries and transport.
• Deterministic Graph Algorithms — Reachability, breadth/depth-first traversal, cycle detection, topological order and component analysis use explicit scratch/output storage.
• Deterministic Collection Snapshots — Bounded snapshot slots and leases capture/restore collections with full-copy or copy-on-write storage.
• Canonical Checkpoints and Codecs — Versioned binary readers/writers, field codecs and canonical collection bindings preserve logical state and validate data before import.
• Fixed-Point Deterministic Adapters — Fixed numeric policies, RNG state codecs and compatibility fingerprints integrate FixedPoint with deterministic containers/runtime.
• Deterministic Runtime Context — Selects an explicit backend and a compatible memory factory for host-side orchestration.
• Deterministic State Registry — Registers state by stable IDs, freezes compatibility signatures and captures/restores canonical world checkpoints.
• Deterministic World History — Retains bounded world boundaries as full checkpoints, keyframes/deltas or shared canonical pages.
• Deterministic Input History — Tracks immutable real inputs, predicted inputs and historical player participation by tick.
• Deterministic Command Buffers — Producer partitions merge commands in a defined total order; the Native variant supplies job writers and dependency checks.
• Lockstep and Rollback Simulation — A tick runner advances lockstep or predicted simulation, restores checkpoints, resimulates and confirms progress.
• Deterministic Event Ledger — Tracks speculative events, retractions and once-only confirmed delivery.
• Deterministic Replay Archive — Stores real inputs, hashes and versioned checkpoints with restoration and seeking.
• Deterministic Network Sessions — Coordinates inputs, commits, late join, reconnect and migration around the simulation runtime.
• Deterministic Raft Coordination — Elections, replicated logs, snapshots and joint membership changes coordinate session consensus.
• Deterministic Transport and Loopback Network — Datagram contracts and a loopback network simulate delivery, loss, duplication and delay.

Start here · Full catalog · Common combinations

---

Documentation snapshot: 2026-10-11

Tags: legendarytools/category