RIL about how the ebpf verifier attempts to prevent infinite loops given rule ordering and rewriting transformations. There are many open query planners; mayb

RIL about how the ebpf verifier attempts to prevent infinite loops given rule ordering and rewriting transformations. There are many open query planners; maybe most are hardly reusable. There's a wasm-bpf; and also duckdb-wasm, sqlite in WASM with replication and synchronization, datasette-lite, JupyterLite wasm-bpf: https://github.com/eunomia-bpf/wasm-bpf#how-it-works https://github.com/eunomia-bpf/wasm-bpf#how-it-works Does this make databases faster or more efficient? Is there process or query isolation?