# The lex records whose category is causality-ordering-distributed-time

This index as JSON: https://banes-lab.com/json/api/facets/lex/category/causality-ordering-distributed-time

## Entries

- [Causation Tracking](https://banes-lab.com/records/lex/causation-tracking.md): Recording which event caused which, so cause-and-effect chains can be reconstructed later.
- [Correct Workflow Reasoning](https://banes-lab.com/records/lex/correct-workflow-reasoning.md): The ability to reason correctly about a workflow's steps by knowing their causal relationships.
- [Unordered Side Effects](https://banes-lab.com/records/lex/unordered-side-effects.md): Applying side effects in an order that ignores their causal dependencies, producing incorrect outcomes.
- [Arbitrary Reordering](https://banes-lab.com/records/lex/arbitrary-reordering.md): Reordering causally related operations freely, so effects can appear before their causes.
- [Causal Ordering](https://banes-lab.com/records/lex/causal-ordering.md): The requirement that operations be applied in an order consistent with their cause-and-effect relationships.
- [Eventual Consistency Safety](https://banes-lab.com/records/lex/eventual-consistency-safety.md): The degree to which replicas can converge over time without ever exposing a causally impossible state.
- [Latency/Availability](https://banes-lab.com/records/lex/latency-availability.md): The degree to which enforcing causal ordering across replicas costs added latency and reduced availability.
- [User-Visible Ordering Guarantees](https://banes-lab.com/records/lex/user-visible-ordering-guarantees.md): The ability to guarantee that users never observe an effect before its cause.
- [Causal Reasoning](https://banes-lab.com/records/lex/causal-reasoning.md): Reasoning about which events must precede others based on their causal relationships.
- [Ordering Semantics](https://banes-lab.com/records/lex/ordering-semantics.md): The requirement that a defined semantics specify when one event is considered to happen before another.
- [Parallel Execution](https://banes-lab.com/records/lex/parallel-execution.md): The degree to which enforcing a happens-before order constrains how much work can run in parallel.
- [Race Detection](https://banes-lab.com/records/lex/race-detection.md): The ability to detect data races by finding accesses with no happens-before ordering between them.
- [Correct Stateful Processing](https://banes-lab.com/records/lex/correct-stateful-processing.md): The ability to process a stream statefully with correct results by handling events in their proper order.
- [Ordering Key or Sequence](https://banes-lab.com/records/lex/ordering-key-or-sequence.md): The requirement that each event carry a key or sequence number that fixes its position in order.
- [Unordered Parallel Consumption](https://banes-lab.com/records/lex/unordered-parallel-consumption.md): Consuming an ordered event stream in parallel without preserving order, so state is updated out of sequence.
- [Dependency Declaration](https://banes-lab.com/records/lex/dependency-declaration.md): The requirement that each operation declare the operations it causally depends on.
- [Graph Complexity](https://banes-lab.com/records/lex/graph-complexity.md): The degree to which tracking fine-grained causal dependencies grows the dependency graph large and hard to reason about.
- [Hidden Dependency](https://banes-lab.com/records/lex/hidden-dependency.md): An unstated dependency between operations, so order-sensitive code breaks when the hidden ordering is not preserved.
- [Cycle Detection](https://banes-lab.com/records/lex/cycle-detection.md): The ability to detect cycles in a dependency graph before they cause deadlock or infinite resolution.
- [Dependency Extraction](https://banes-lab.com/records/lex/dependency-extraction.md): The requirement that dependencies between units be discovered and represented explicitly as a graph.
- [Dynamic Loading](https://banes-lab.com/records/lex/dynamic-loading.md): The degree to which resolving dependencies dynamically at runtime undermines a statically analyzable dependency graph.
- [Bidirectional Collaboration](https://banes-lab.com/records/lex/bidirectional-collaboration.md): The degree to which forbidding cycles prevents two components from depending on each other bidirectionally.
- [Build Order](https://banes-lab.com/records/lex/build-order.md): The ability to derive a correct build or execution order from a graph that contains no cycles.
- [Directed Dependencies](https://banes-lab.com/records/lex/directed-dependencies.md): The requirement that dependencies point in one direction only, forming no cycles.
- [Layering](https://banes-lab.com/records/lex/layering.md): A convention of organizing components into ordered layers where each may depend only on the layers beneath it.
- [Topological Ordering](https://banes-lab.com/records/lex/topological-ordering.md): The ability to linearize a directed acyclic graph into an order where every node follows its dependencies.
- [Concurrent Update Detection](https://banes-lab.com/records/lex/concurrent-update-detection.md): The ability to detect when two updates happened concurrently rather than one causally after the other.
- [Metadata Size](https://banes-lab.com/records/lex/metadata-size.md): The degree to which carrying a per-node counter for every node grows the ordering metadata with cluster size.
- [Node Identity](https://banes-lab.com/records/lex/node-identity.md): The requirement that each participating node have a distinct identity to index its own counter.
- [Single Global Clock Assumption](https://banes-lab.com/records/lex/single-global-clock-assumption.md): Assuming a single global clock orders all events, which fails across distributed nodes with independent clocks.
- [Version Vector](https://banes-lab.com/records/lex/version-vector.md): A set of per-node counters that together capture the causal history of a replicated item.
- [Happens-Before Reasoning](https://banes-lab.com/records/lex/happens-before-reasoning.md): Reasoning about event order using logical timestamps that respect the happens-before relation.
- [Logical Counter](https://banes-lab.com/records/lex/logical-counter.md): A monotonically increasing counter each process maintains to stamp events for logical ordering.
- [No Concurrent Causality Distinction](https://banes-lab.com/records/lex/no-concurrent-causality-distinction.md): The degree to which a single logical counter cannot tell concurrent events apart from causally ordered ones.
- [Partial Ordering](https://banes-lab.com/records/lex/partial-ordering.md): The ability to establish a consistent partial order over events without a shared physical clock.
- [Wall-Clock Ordering Assumption](https://banes-lab.com/records/lex/wall-clock-ordering-assumption.md): Ordering distributed events by wall-clock timestamps, which clock skew makes unreliable.
- [Clock Skew](https://banes-lab.com/records/lex/clock-skew.md): The degree to which physical clocks on different nodes drift apart, distorting time-based ordering.
- [Physical-Clock-Only Ordering](https://banes-lab.com/records/lex/physical-clock-only-ordering.md): Ordering events by physical clocks alone, which clock skew renders inconsistent across nodes.
- [Wall-Clock-Correlated Causal Order](https://banes-lab.com/records/lex/wall-clock-correlated-causal-order.md): The ability to order events causally while keeping timestamps close to wall-clock time.
- [Commutative Merge](https://banes-lab.com/records/lex/commutative-merge.md): The requirement that concurrent updates merge in any order to the same result.
- [Conflict-Free Replica Convergence](https://banes-lab.com/records/lex/conflict-free-replica-convergence.md): The ability for replicas to converge to one state automatically without conflict resolution.
- [Last-Write-Wins Overwrite](https://banes-lab.com/records/lex/last-write-wins-overwrite.md): Resolving concurrent updates by keeping the most recent write, rather than merging all updates.
- [Metadata Overhead](https://banes-lab.com/records/lex/metadata-overhead.md): The degree to which the bookkeeping a conflict-free type carries per value adds storage and transmission cost.
- [Identical Delivery Order Across Nodes](https://banes-lab.com/records/lex/identical-delivery-order-across-nodes.md): The ability to deliver messages to every node in the same total order.
- [Per-Node Independent Ordering](https://banes-lab.com/records/lex/per-node-independent-ordering.md): Letting each node decide message order independently, so replicas diverge on sequence.
- [Assumed Total Consistency And Availability](https://banes-lab.com/records/lex/assumed-total-consistency-and-availability.md): Assuming a distributed system can be fully consistent and available at once, ignoring partitions that force a choice.
- [Explicit Consistency/Availability Choice Under Partition](https://banes-lab.com/records/lex/explicit-consistency-availability-choice-under-partition.md): The ability to choose deliberately between consistency and availability when a network partition occurs.
- [Network Partition Possibility](https://banes-lab.com/records/lex/network-partition-possibility.md): The requirement that a distributed design account for the possibility of network partitions.
- [Consistency Assumed Free When Healthy](https://banes-lab.com/records/lex/consistency-assumed-free-when-healthy.md): Assuming consistency carries no cost while the network is healthy, ignoring the latency it still imposes.
- [Latency-Consistency Trade-off When Healthy](https://banes-lab.com/records/lex/latency-consistency-trade-off-when-healthy.md): The ability to weigh the latency-versus-consistency trade-off that remains even when the network is healthy.