mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Energy, industry and public infrastructure
reactor-protection
nuclear reactor protection system
safety I&C
System
Techniques · 10
Primitives · 37
reactor-protection
Fault tree analysis
embedded · medium: Write the unwanted top event as AND/OR logic over component failures, reduce it to minimal cut sets, then compute its probability and each failure's share.
›
Model checking and formal proof
embedded · medium: Exhaustively explore a model's reachable states (or prove its invariants with a solver or proof assistant) to find rule violations with a shortest counterexample trace.
›
Industrial network segmentation
embedded · medium: Zones and conduits (IEC 62443/Purdue) with firewalls and protocol allow-lists for OT
Safety-critical coding standards
embedded · medium: Which rule sets (MISRA C, CERT C, JPL Power of Ten, Rust lint subsets) apply when software must not fail, what they forbid, and how to enforce them in CI.
›
Dataflow analysis
compilers · medium: Compute a fact per program point (live variables, reaching definitions, available expressions) by iterating transfer functions over the CFG to a fixed point.
›
Packet classification
networking · medium: Multi-field rule matching (tuple space search, decision trees) and flow caches
CDCL SAT solving
optimization · medium: Search for a satisfying assignment, learn a new constraint from every dead end, and jump back past irrelevant choices; handles industrial formulas with millions of clauses.
›
Data diode unidirectional transfer
embedded · low: One-way network transfer with FEC and no back channel between safety and IT zones
End to end protection e2e
embedded · low: Per-message counter, ID and CRC over a black channel to detect loss, repetition, corruption, delay
Fixed-rate control loop
embedded · low: Run a controller at an exact period using absolute deadlines and a fixed dt, so jitter never accumulates and the math stays valid.
›
Memory self test march
embedded · low: March RAM tests, ROM CRCs and CPU self-tests required by safety standards
Redundancy voting
embedded · low: N-modular redundancy and MooN voting (2oo3, TMR) with discrepancy detection
Time triggered scheduling
embedded · low: Static cyclic schedules where every task and message has a precomputed time slot
Watchdog timer
embedded · low: A hardware down-counter that resets the chip unless software proves, in time and in a plausible pattern, that it is still healthy.
›
Deterministic fixed-point math
game-networking · low: Bit-identical simulation math across CPUs, compilers and builds: integer fixed-point formats, the float traps (FMA, x87, fast-math, libm), deterministic trig, sqrt and RNG.
›
CRC32C checksums
hardware-os · low: The Castagnoli CRC-32 with dedicated instructions on x86 (SSE4.2) and ARMv8. It is the standard fast integrity check for storage blocks, logs and network frames.
›
BFS and DFS
graphs · low: The two basic graph traversals; BFS gives hop distances and levels, DFS gives discovery/finish order for cycles, components and topological order.
›
Binary decision diagrams
optimization · low: A reduced ordered BDD stores a Boolean function as a shared DAG that is unique per variable order, so equivalence is one integer compare and counting is one pass.
›
Swiss table
data-structures · low: Open-addressing hash table that filters 8-16 slots at once with 1-byte hash tags and SIMD, giving fast lookups at 87.5 % load.
›
Deep packet inspection
networking · low: Classify flows by payload/SNI/protocol signatures for application-aware policy
Code coverage instrumentation
compilers · low: Insert counters into compiled code to record which blocks, edges or lines ran; a spanning tree of the control-flow graph cuts the counters needed.
›
Control-flow graph
compilers · low: Split a linear instruction list into basic blocks and connect them by jumps; the graph every optimizer, SSA builder and dataflow pass walks.
›
Topological sort
graphs · low: Order the vertices of a DAG so every edge points forward; the core of build systems, schedulers and dependency resolution, with cycle detection for free.
›
+ 3 more techniques
+ 21 more primitives
System
Techniques · 10
Primitives · 37
reactor-protection
Fault tree analysis
embedded · medium: Write the unwanted top event as AND/OR logic over component failures, reduce it to minimal cut sets, then compute its probability and each failure's share.
›
Model checking and formal proof
embedded · medium: Exhaustively explore a model's reachable states (or prove its invariants with a solver or proof assistant) to find rule violations with a shortest counterexample trace.
›
Industrial network segmentation
embedded · medium: Zones and conduits (IEC 62443/Purdue) with firewalls and protocol allow-lists for OT
Safety-critical coding standards
embedded · medium: Which rule sets (MISRA C, CERT C, JPL Power of Ten, Rust lint subsets) apply when software must not fail, what they forbid, and how to enforce them in CI.
›
Dataflow analysis
compilers · medium: Compute a fact per program point (live variables, reaching definitions, available expressions) by iterating transfer functions over the CFG to a fixed point.
›
Packet classification
networking · medium: Multi-field rule matching (tuple space search, decision trees) and flow caches
CDCL SAT solving
optimization · medium: Search for a satisfying assignment, learn a new constraint from every dead end, and jump back past irrelevant choices; handles industrial formulas with millions of clauses.
›
Dpll t
optimization · medium: SMT architecture: CDCL over boolean abstraction plus theory solvers, theory propagation, Nelson-Oppen
Congruence closure
compilers · medium: Union-find over terms with congruence propagation; decides equality with uninterpreted functions
Bit blasting
optimization · medium: Reduce bit-vector constraints to CNF via adder, multiplier and comparator circuits
Data diode unidirectional transfer
embedded · low: One-way network transfer with FEC and no back channel between safety and IT zones
End to end protection e2e
embedded · low: Per-message counter, ID and CRC over a black channel to detect loss, repetition, corruption, delay
Fixed-rate control loop
embedded · low: Run a controller at an exact period using absolute deadlines and a fixed dt, so jitter never accumulates and the math stays valid.
›
Memory self test march
embedded · low: March RAM tests, ROM CRCs and CPU self-tests required by safety standards
Redundancy voting
embedded · low: N-modular redundancy and MooN voting (2oo3, TMR) with discrepancy detection
Time triggered scheduling
embedded · low: Static cyclic schedules where every task and message has a precomputed time slot
Watchdog timer
embedded · low: A hardware down-counter that resets the chip unless software proves, in time and in a plausible pattern, that it is still healthy.
›
Deterministic fixed-point math
game-networking · low: Bit-identical simulation math across CPUs, compilers and builds: integer fixed-point formats, the float traps (FMA, x87, fast-math, libm), deterministic trig, sqrt and RNG.
›
CRC32C checksums
hardware-os · low: The Castagnoli CRC-32 with dedicated instructions on x86 (SSE4.2) and ARMv8. It is the standard fast integrity check for storage blocks, logs and network frames.
›
BFS and DFS
graphs · low: The two basic graph traversals; BFS gives hop distances and levels, DFS gives discovery/finish order for cycles, components and topological order.
›
Binary decision diagrams
optimization · low: A reduced ordered BDD stores a Boolean function as a shared DAG that is unique per variable order, so equivalence is one integer compare and counting is one pass.
›
Swiss table
data-structures · low: Open-addressing hash table that filters 8-16 slots at once with 1-byte hash tags and SIMD, giving fast lookups at 87.5 % load.
›
Deep packet inspection
networking · low: Classify flows by payload/SNI/protocol signatures for application-aware policy
Code coverage instrumentation
compilers · low: Insert counters into compiled code to record which blocks, edges or lines ran; a spanning tree of the control-flow graph cuts the counters needed.
›
Control-flow graph
compilers · low: Split a linear instruction list into basic blocks and connect them by jumps; the graph every optimizer, SSA builder and dataflow pass walks.
›
Topological sort
graphs · low: Order the vertices of a DAG so every edge points forward; the core of build systems, schedulers and dependency resolution, with cycle detection for free.
›
Interval tree
data-structures · low: Index of ranges that answers "which intervals overlap this point or range?" in O(log n + k); static sorted-array form is the compact, cache-friendly choice.
›
Packet header parsing
networking · low: Parse graph state machines for Ethernet, IP, TCP and UDP headers in hardware and software
Tcam ternary matching
networking · low: TCAM ternary match tables: priorities, range expansion, power and capacity trade-offs
LRU and CLOCK
systems · low: LRU evicts the least recently used entry via hash map plus linked list; CLOCK approximates it with a reference bit, so hits take no lock.
›
d-ary heap
data-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.
›
Drat proof certificates
optimization · low: DRAT and LRAT proofs emitted by SAT solvers and checked independently
Two watched literals
optimization · low: Unit propagation for SAT that watches just two literals per clause, so backtracking costs nothing and long clauses are rarely touched.
›
Arena allocator
systems · low: Allocate by bumping a pointer through big chunks and free everything at once: a few instructions per allocation for objects sharing a lifetime.
›
Simplex method
optimization · low: Solves linear programs by walking along the edges of the feasible polytope from vertex to vertex, one basis swap (pivot) at a time; the workhorse behind MIP solvers.
›
Hash consing
data-structures · low: Intern structurally equal immutable terms so equality is pointer comparison and sharing is maximal
Union-find
graphs · low: Disjoint-set forest with union by size and path compression; merges sets and answers same-set queries in effectively constant time.
›
Arithmetic circuits
hardware-os · low: Adder and multiplier circuits: carry-lookahead, prefix adders, Booth encoding, Wallace and Dadda trees
Tseitin transformation
optimization · low: Linear-size CNF encoding of formulas with auxiliary variables
Dma transfers
embedded · low: DMA controllers: descriptors, circular buffers, cache coherence for zero-CPU data movement
PWM generation
embedded · low: A timer's counter, period and compare registers draw the pulse train; preload, dead time and DMA make duty changes glitch-free, shoot-through-free and cheap.
›
Minimum spanning tree
graphs · low: Cheapest set of edges connecting all vertices; Kruskal sorts edges and joins components with union-find, Prim grows one tree, Boruvka merges in parallel rounds.
›
SIMD programming
hardware-os · low: Process 4-16 lanes per instruction with AVX2, AVX-512 or NEON via Rust std::arch, with runtime dispatch and a portable fallback.
›
Floating-point error
numerics · low: How IEEE 754 rounding error accumulates and how to contain it: compensated (Kahan/Neumaier) and pairwise summation, error-free transformations with FMA, ULP comparisons.
›
LU and Cholesky factorization
numerics · low: Factor A = PLU (any square matrix, partial pivoting) or A = LLᵀ (SPD) once in O(n³), then solve each right-hand side in O(n²).
›
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
Sparse matrices (CSR)
numerics · low: Compressed sparse row stores only nonzeros as row pointers, column indices and values; SpMV streams them once, so it is memory-bandwidth bound.
›
Copy for AI
Similar systems
Share the most building blocks with this one.
safety-instrumented-system
47 %
battery-management
33 %
medical-device-firmware
33 %
rail-signalling
32 %
fly-by-wire-flight-control
30 %