mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Productivity and collaboration
video-messaging
async screen and video messaging
Loom
System
Techniques · 22
Primitives · 79
video-messaging
CDN and edge
cloud · medium: CDNs cache content in hundreds of PoPs near users, cutting latency and egress bills; edge compute runs small code there. Bandwidth price spreads 10x between providers.
›
Deterministic simulation testing
distributed · medium: Run the whole system in one thread under a seeded scheduler with simulated network, disk and clock, so every failure replays from its seed.
›
Primary-backup replication
distributed · medium: One node orders all writes and ships them to standbys; the acknowledgement rule (none, one, all) sets what a crash loses, and an external arbiter decides who takes over.
›
Forced alignment
machine-learning · medium: Align transcripts to audio for word timestamps (CTC/Viterbi alignment)
Image segmentation
machine-learning · medium: Pixel/instance segmentation networks and promptable segmentation (Mask R-CNN, SAM-style)
RNN transducer (RNN-T)
machine-learning · medium: Streaming sequence model that sums all monotone alignments in a frame-by-label lattice and conditions each label on earlier ones.
›
Adaptive bitrate streaming
media · medium: The client fetches short HTTP segments and picks each segment's rendition from throughput estimates, buffer level, or both, trading stalls against quality and switches.
›
Adaptive streaming manifests
media · low: HLS playlists and DASH MPDs: renditions, segment timelines, codecs strings
Media containers
media · low: MP4/ISO BMFF, fragmented MP4/CMAF, Matroska and MPEG-TS mux/demux
Hardware video acceleration
media · low: GPU/ASIC encode and decode APIs (NVENC, VideoToolbox, VA-API) with zero-copy surfaces
Video codecs
media · low: H.264/HEVC/AV1 basics: frames, GOPs, hardware decode/encode APIs and latency settings
Object storage
cloud · low: S3-compatible blob storage at cents per GB-month with 11 nines durability; pick by egress price, request price and latency, not by storage price alone.
›
Screen capture
agentic-ai · low: Damage-region screen capture with GPU surfaces
Hdr histogram
data-structures · low: Log-linear bucketed histograms with bounded relative error for latency percentiles
Process supervision
hardware-os · low: A parent process starts services, reaps their exits and restarts them under a delay and burst-limit policy, then stops them with SIGTERM before SIGKILL.
›
Audio loudness normalization
media · low: EBU R128 / ITU BS.1770 integrated loudness measurement and gain
Subtitle formats webvtt
media · low: WebVTT/SRT cues, timing and line-breaking rules
Open and click tracking
networking · low: Tracking pixels and signed redirect links for engagement events
Resumable uploads
networking · low: Open an upload session, send the body in offset-addressed chunks, and after any failure ask the server how much it committed and continue from there.
›
Mutual TLS
security · low: TLS where the client also proves a certificate key, so every connection carries a verified, rotatable machine identity.
›
Signed URLs
security · low: A URL carrying its expiry and a MAC or signature over method, path and query, so a verifier holding the key needs no lookup.
›
Sessionization
storage · low: Group events into sessions by inactivity gaps
Graceful draining
systems · low: On a termination signal, stop taking new work, finish in-flight work until a deadline, tell clients to reconnect elsewhere, then exit; clients resume from a token.
›
+ 15 more techniques
+ 63 more primitives
System
Techniques · 22
Primitives · 79
video-messaging
CDN and edge
cloud · medium: CDNs cache content in hundreds of PoPs near users, cutting latency and egress bills; edge compute runs small code there. Bandwidth price spreads 10x between providers.
›
Deterministic simulation testing
distributed · medium: Run the whole system in one thread under a seeded scheduler with simulated network, disk and clock, so every failure replays from its seed.
›
Primary-backup replication
distributed · medium: One node orders all writes and ships them to standbys; the acknowledgement rule (none, one, all) sets what a crash loses, and an external arbiter decides who takes over.
›
Forced alignment
machine-learning · medium: Align transcripts to audio for word timestamps (CTC/Viterbi alignment)
Image segmentation
machine-learning · medium: Pixel/instance segmentation networks and promptable segmentation (Mask R-CNN, SAM-style)
RNN transducer (RNN-T)
machine-learning · medium: Streaming sequence model that sums all monotone alignments in a frame-by-label lattice and conditions each label on earlier ones.
›
Adaptive bitrate streaming
media · medium: The client fetches short HTTP segments and picks each segment's rendition from throughput estimates, buffer level, or both, trading stalls against quality and switches.
›
Low latency video encoding
media · medium: Video encoding tuned for latency: no B-frames, intra refresh, slice output, low-delay rate control
Noise suppression
media · medium: Spectral gain estimation (Wiener/RNN) to remove background noise from speech
Video transcoding ladder
media · medium: Turn one source into resolution x bitrate x codec renditions chosen from measured rate-quality points, cut on aligned keyframes so players can switch mid-stream.
›
Coverage-guided fuzzing
security · medium: Mutate inputs, run an instrumented target, and keep any input that reaches a new code edge; feedback turns blind guessing into incremental search.
›
Point-in-time recovery
storage · medium: Periodic base backups plus a continuously archived change log let you rebuild the state as of any instant, then branch from there.
›
Delta debugging
compilers · medium: Ddmin minimization of failing inputs or change sets
Fault injection
distributed · medium: Inject latency, errors, kills and partitions via proxies, netem or hooks
Chunked parallel encoding
media · medium: Split video at keyframes, encode chunks in parallel, stitch with rate consistency
Video rate control
media · medium: CBR/VBR/CRF rate control with VBV buffer model and lookahead
Beam search decoding
ml-training · medium: Keep the k best partial sequences by summed log-probability at every step, set finished ones aside, and return the best (n-best) by a length-normalised score.
›
Vision transformer
ml-training · medium: ViT: patch embeddings, position encodings, encoder blocks; vision-language connectors
TLS 1.3
security · medium: The standard encrypted, authenticated transport; one round trip, only forward-secret AEAD suites, and little left to misconfigure.
›
ARIES recovery
storage · medium: Three-pass crash recovery (analysis, redo, undo) for steal/no-force buffer pools; repeats history, then rolls back losers with compensation log records.
›
Syscall interception
security · medium: Intercept syscalls via ptrace, seccomp user notify or a user-space kernel
Buffer pool
storage · medium: The database's own page cache (frames, page table, pin counts, dirty bits, replacement) so it, not the OS, controls eviction, write order and I/O.
›
Adaptive streaming manifests
media · low: HLS playlists and DASH MPDs: renditions, segment timelines, codecs strings
Media containers
media · low: MP4/ISO BMFF, fragmented MP4/CMAF, Matroska and MPEG-TS mux/demux
Hardware video acceleration
media · low: GPU/ASIC encode and decode APIs (NVENC, VideoToolbox, VA-API) with zero-copy surfaces
Video codecs
media · low: H.264/HEVC/AV1 basics: frames, GOPs, hardware decode/encode APIs and latency settings
Object storage
cloud · low: S3-compatible blob storage at cents per GB-month with 11 nines durability; pick by egress price, request price and latency, not by storage price alone.
›
Screen capture
agentic-ai · low: Damage-region screen capture with GPU surfaces
Hdr histogram
data-structures · low: Log-linear bucketed histograms with bounded relative error for latency percentiles
Process supervision
hardware-os · low: A parent process starts services, reaps their exits and restarts them under a delay and burst-limit policy, then stops them with SIGTERM before SIGKILL.
›
Audio loudness normalization
media · low: EBU R128 / ITU BS.1770 integrated loudness measurement and gain
Subtitle formats webvtt
media · low: WebVTT/SRT cues, timing and line-breaking rules
Open and click tracking
networking · low: Tracking pixels and signed redirect links for engagement events
Resumable uploads
networking · low: Open an upload session, send the body in offset-addressed chunks, and after any failure ask the server how much it committed and continue from there.
›
Mutual TLS
security · low: TLS where the client also proves a certificate key, so every connection carries a verified, rotatable machine identity.
›
Signed URLs
security · low: A URL carrying its expiry and a MAC or signature over method, path and query, so a verifier holding the key needs no lookup.
›
Sessionization
storage · low: Group events into sessions by inactivity gaps
Graceful draining
systems · low: On a termination signal, stop taking new work, finish in-flight work until a deadline, tell clients to reconnect elsewhere, then exit; clients resume from a token.
›
HTTP caching semantics
networking · low: The rules (RFC 9111) that decide whether a stored response is still fresh, and how a cheap conditional request revalidates it when it is not.
›
Cooperative scheduling
concurrency · low: Green threads/coroutines yielding at await points on a user-space scheduler
Record replay
distributed · low: Record every nondeterministic input (time, randomness, I/O, model and tool outputs, per-tick player input) and re-execute deterministically for debugging, replays and state rebuild
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
Leases
distributed · low: A lock that expires on its own: bounded-time ownership that survives crashes and partitions, given bounded clock drift and fencing tokens on writes.
›
Write-ahead log
storage · low: Append each change to a checksummed sequential log and fsync it before touching data pages; the basis of crash durability in nearly every database.
›
Health checking
systems · low: Decide per backend whether to route to it using probes and real-traffic errors, with consecutive-count hysteresis, capped ejection and a panic fallback.
›
Connectionist temporal classificati…
machine-learning · low: Alignment-free sequence loss that sums the probability of every frame-to-label alignment with a blank symbol, using a dynamic program.
›
Grapheme to phoneme
machine-learning · low: Converting text to phonemes with lexicons plus a seq2seq model for unknown words
Convolutional codes and the Viterbi…
signal-processing · low: Streaming error-correcting code: each output bit is a parity of the last K input bits; the Viterbi decoder finds the most likely path through a 2^(K-1)-state trellis.
›
Loss functions
machine-learning · low: The scalar a model minimizes: cross-entropy for classes and tokens, MSE or Huber for values, each with a stable form and simple gradient.
›
Non-maximum suppression
machine-learning · low: Keep the best-scoring candidate in each neighbourhood and drop the rest; greedy NMS, Soft-NMS and 1-D peak picking share one loop.
›
Convolutional networks
ml-training · low: Layers that slide a small shared kernel over a grid, giving translation equivariance and few parameters; still the most compute-efficient choice for many vision tasks.
›
Recurrent networks
machine-learning · low: GRU and LSTM cells for streaming sequence models
Short-time Fourier transform and sp…
signal-processing · low: Slide a window over a signal and FFT each frame to get a time-frequency picture; the front end of audio ML, vibration and radar analysis.
›
GOP structure
media · low: How an encoder orders I, P and B frames into groups of pictures: the knob behind seekability, compression, latency and stream switching.
›
HTTP range requests
networking · low: Ask for byte offsets with Range and get a 206 slice back; the standard way to resume, seek and read big remote files piecewise.
›
Exponential smoothing (ETS, Holt-Wi…
statistics · low: Forecast by keeping a few running states (level, trend, seasonal) updated by a fraction of each forecast error; O(1) memory per series and a strong baseline.
›
Intra prediction
media · low: Predict a block from neighbouring pixels (directional, DC, planar modes)
Voice activity detection
machine-learning · low: Per-frame speech/non-speech decision with smoothing, from an energy threshold over a tracked noise floor up to small neural nets.
›
Parameter smoothing
media · low: Per-sample ramps of control parameters to avoid zipper noise
Image resampling filters
graphics · low: Resize an image by convolving with a kernel (box, triangle, cubic, Lanczos) whose width scales with the shrink factor, done as two separable 1-D passes with precomputed weights.
›
Perceptual quality metrics (PSNR, S…
media · low: Full-reference scores that say how bad a compressed picture looks: PSNR (pixel error), SSIM (structure), VMAF (learned fusion), and when each one lies.
›
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.
›
Fast hash functions
data-structures · low: Non-cryptographic hashes built from 64×64→128-bit multiplies and xor-shifts; pick by key size, trust level and whether the hash is persisted.
›
Sanitizers
security · low: ASan/UBSan/TSan shadow memory and instrumentation to catch memory bugs
Copy on write snapshots
storage · low: Point-in-time snapshots by sharing pages/extents and copying only on write
Failure bisection
search-sort · low: Binary search over commits, batches or inputs to isolate a failure
Transparent interception
networking · low: Redirect traffic to a local proxy (iptables TPROXY/REDIRECT, eBPF) without app changes
Scene cut detection
media · low: Detect shot changes from frame-difference statistics
Adaptive quantization
media · low: Per-block QP offsets driven by local texture energy: spend bits on flat areas where blocking shows, save them where texture masks the error.
›
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.
›
Top-k selection
search-sort · low: Keep the k best of n items without sorting all n - bounded min-heap for streams, quickselect for arrays, threshold pruning to skip most items.
›
Attention variants
machine-learning · low: Multi-head, multi-query, grouped-query, sliding-window and latent attention; same softmax(QKᵀ/√d)V core, different trade-offs between quality and KV-cache size.
›
Data augmentation
machine-learning · low: Generate label-preserving variants of each training example on the fly to enlarge the effective dataset and bake in invariances.
›
Embeddings
machine-learning · low: A learned table mapping discrete ids to dense vectors: gather forward, sparse scatter-add backward, row-wise optimizers to keep huge tables cheap.
›
Transformer block
ml-training · low: The decoder-only pre-norm block (attention plus MLP on a residual stream) behind every modern LLM, with exact shapes, parameter, FLOP and KV-cache counts.
›
AEAD (AES-GCM, ChaCha20-Poly1305)
security · low: Authenticated encryption that encrypts and detects tampering in one call; the only kind of symmetric encryption you should use.
›
Cryptographic hashes (SHA-2, BLAKE3)
security · low: Collision-resistant fingerprints of data; SHA-256 for interoperability, BLAKE3 for speed, HMAC/HKDF for keyed uses.
›
ECDH key exchange (X25519, P-256)
security · low: Each side multiplies the other's public curve point by its own scalar and both get the same point; always validate the peer key and run the result through a KDF.
›
HKDF key derivation (extract-and-ex…
security · low: HMAC-based two-step key derivation: extract a uniform pseudorandom key from any secret, then expand it into as many context-bound keys as you need.
›
X509 certificates
security · low: Certificate chains, path validation, SANs, revocation and short-lived issuance
Ebpf
hardware-os · low: Verified in-kernel programs on hooks (kprobes, XDP, tc) with maps
Ptrace process control
hardware-os · low: Ptrace: attach, read and write registers and memory, single-step, intercept signals
Seccomp bpf
security · low: Syscall filtering with seccomp BPF programs
fsync, O_DSYNC and O_DIRECT
hardware-os · low: What fsync, fdatasync, O_DSYNC, O_DIRECT and F_FULLFSYNC really guarantee on Linux and macOS, and the exact call sequences for crash-safe files.
›
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.
›
S3-FIFO
systems · low: Three FIFO queues (small, main, ghost) that evict one-hit wonders quickly and keep reused objects; low miss ratios with no list moves on hits.
›
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.
›
Fencing tokens
distributed · low: A number that grows with every lock grant and is checked by the protected resource, so a paused ex-holder's late write is rejected.
›
Convolution image filters
graphics · low: Separable 2D convolution kernels for blur, sharpen (unsharp mask) and edges with border handling
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.
›
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.
›
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.
›
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.
›
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.
›
AdamW
ml-training · low: Adam's per-parameter adaptive steps with weight decay applied directly to the weights; the default optimizer for transformers and LLM pretraining.
›
Reverse-mode automatic differentiat…
ml-training · low: Record the forward computation on a tape, then sweep it backwards once to get the gradient of a scalar loss for all inputs.
›
Discrete cosine transform
numerics · low: Fast integer DCT/DST block transforms used by image and video codecs
Fast Fourier transform
numerics · low: Computes the DFT in O(n log n) by recursively splitting into even and odd halves; the basis of fast convolution and spectral methods.
›
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.
›
Constant time code
security · low: Writing secret-dependent code without branches or memory lookups on secrets; constant-time compare and select
Csprng
security · low: OS-backed cryptographically secure random numbers (getrandom), and when a fast PRNG is not enough
Copy for AI
Similar systems
Share the most building blocks with this one.
cloud-video-editor
41 %
video-vod
38 %
webinar
38 %
digital-asset-management
38 %
podcast-hosting
37 %