Optimization at every layer.
Vadyl's optimization is distributed, not centralized. The DAG planner coalesces redundant operations. The read plan compiler produces deterministic plans. The schema transition strategy is selected by capability matrix. The Plane Capability Graph is content-hashed. Branching commits dedupe by SHA-256. Compensation orders by deterministic priority. There is no opt-in tuning. There is no separate optimizer module. The optimization happens at every site, automatically.
Coalescing. Memoization. Strategy selection.
OperationCoalescer
Deduplicates redundant same-provider, same-entity mutations within a DAG tier. Capability-gated by SupportsMultiRowInsert. No separate optimizer call — coalescing happens during planning.
ReadPlanCompiler
Deterministic compile-time read plan. No dynamic plan rewrites — same inputs, same plan. Memoized by canonical descriptor; unchanged inputs return cached plans.
AstSemanticLowering
Pre-rendering normalization at every plan boundary. Cmp(Eq, x, null) → IsNull(x). Renderers never see ambiguous null comparisons; provider-side query optimizers see the canonical shape.
Inline COUNT batching
List reads with IncludeTotalCount = true batch the COUNT(*) into a single provider round-trip. No second query. No double-pagination drift. Single trip; canonical.
Schema transition strategy
TransitionClassifier picks among 6 strategies based on the migration shape × the provider's DbCapabilities. NativeOnline if the provider supports it; ExpandThenBackfill otherwise; never a weaker fallback silent.
Content-hashed PCG
PlaneCapabilityGraphCompiler memoizes by content hash. Unchanged inputs skip recompilation. Coherent across instances via the canonical cache invalidation bus.
Branching commit dedup
SHA-256 of canonical sorted-key JSON. Identical commits don't double-store. Sandboxes share blobs with their parent until divergence.
Compensation ordering
Priority constants (DELETE=30, UPDATE=20, INSERT=10) yield deterministic LIFO rollback. Constraint violations during rollback minimized by construction.
Descriptor-fingerprinted caches
TenantCacheProviderFactory keys instance cache by (Project, Alias, DescriptorFingerprint). Secret rotation bumps the fingerprint, the next resolve constructs fresh, the old disposes deterministically.
The optimizer plane is a property, not a feature.
There is no optimizer module to enable. There are no perf tuning flags to set. The optimization happens because every layer is built capability-aware, fingerprint-memoized, deterministically ordered, and content-addressed. The result: a backend that scales without you reaching for query hints, cache configs, or scheduling tweaks.
Every layer optimizes independently
PCG, branching, descriptors
Schema, transactions, RLS, vectors
No knobs, no opt-in
Performance you don't have to think about.
Vadyl optimizes at every layer. You write the entity, the policy, the handler. The platform takes care of the strategy, the coalescing, the memoization, the ordering.