tigrbl_engine_membloom 0.1.10.dev1__tar.gz

tigrbl_engine_membloom-0.1.10.dev1/.gitignore

@@ -0,0 +1,22 @@
+__pycache__/
+.pytest_cache/
+.ruff_cache/
+.mypy_cache/
+.tox/
+.nox/
+.venv/
+.coverage
+htmlcov/
+build/
+dist/
+site/
+target/
+*.egg-info/
+*.pyc
+*.zip
+/.vendor
+/.tmp
+*.body
+.pip-cache/
+*.pyd
+.tmp-release-plan-check.json

tigrbl_engine_membloom-0.1.10.dev1/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+   "License" shall mean the terms and conditions for use, reproduction,
+   and distribution as defined by Sections 1 through 9 of this document.
+
+   "Licensor" shall mean the copyright owner or entity authorized by
+   the copyright owner that is granting the License.
+
+   "Legal Entity" shall mean the union of the acting entity and all
+   other entities that control, are controlled by, or are under common
+   control with that entity. For the purposes of this definition,
+   "control" means (i) the power, direct or indirect, to cause the
+   direction or management of such entity, whether by contract or
+   otherwise, or (ii) ownership of fifty percent (50%) or more of the
+   outstanding shares, or (iii) beneficial ownership of such entity.
+
+   "You" (or "Your") shall mean an individual or Legal Entity
+   exercising permissions granted by this License.
+
+   "Source" form shall mean the preferred form for making modifications,
+   including but not limited to software source code, documentation
+   source, and configuration files.
+
+   "Object" form shall mean any form resulting from mechanical
+   transformation or translation of a Source form, including but
+   not limited to compiled object code, generated documentation,
+   and conversions to other media types.
+
+   "Work" shall mean the work of authorship, whether in Source or
+   Object form, made available under the License, as indicated by a
+   copyright notice that is included in or attached to the work
+   (an example is provided in the Appendix below).
+
+   "Derivative Works" shall mean any work, whether in Source or Object
+   form, that is based on (or derived from) the Work and for which the
+   editorial revisions, annotations, elaborations, or other modifications
+   represent, as a whole, an original work of authorship. For the purposes
+   of this License, Derivative Works shall not include works that remain
+   separable from, or merely link (or bind by name) to the interfaces of,
+   the Work and Derivative Works thereof.
+
+   "Contribution" shall mean any work of authorship, including
+   the original version of the Work and any modifications or additions
+   to that Work or Derivative Works thereof, that is intentionally
+   submitted to Licensor for inclusion in the Work by the copyright owner
+   or by an individual or Legal Entity authorized to submit on behalf of
+   the copyright owner. For the purposes of this definition, "submitted"
+   means any form of electronic, verbal, or written communication sent
+   to the Licensor or its representatives, including but not limited to
+   communication on electronic mailing lists, source code control systems,
+   and issue tracking systems that are managed by, or on behalf of, the
+   Licensor for the purpose of discussing and improving the Work, but
+   excluding communication that is conspicuously marked or otherwise
+   designated in writing by the copyright owner as "Not a Contribution."
+
+   "Contributor" shall mean Licensor and any individual or Legal Entity
+   on behalf of whom a Contribution has been received by Licensor and
+   subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   copyright license to reproduce, prepare Derivative Works of,
+   publicly display, publicly perform, sublicense, and distribute the
+   Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   (except as stated in this section) patent license to make, have made,
+   use, offer to sell, sell, import, and otherwise transfer the Work,
+   where such license applies only to those patent claims licensable
+   by such Contributor that are necessarily infringed by their
+   Contribution(s) alone or by combination of their Contribution(s)
+   with the Work to which such Contribution(s) was submitted. If You
+   institute patent litigation against any entity (including a
+   cross-claim or counterclaim in a lawsuit) alleging that the Work
+   or a Contribution incorporated within the Work constitutes direct
+   or contributory patent infringement, then any patent licenses
+   granted to You under this License for that Work shall terminate
+   as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the
+   Work or Derivative Works thereof in any medium, with or without
+   modifications, and in Source or Object form, provided that You
+   meet the following conditions:
+
+   (a) You must give any other recipients of the Work or
+       Derivative Works a copy of this License; and
+
+   (b) You must cause any modified files to carry prominent notices
+       stating that You changed the files; and
+
+   (c) You must retain, in the Source form of any Derivative Works
+       that You distribute, all copyright, patent, trademark, and
+       attribution notices from the Source form of the Work,
+       excluding those notices that do not pertain to any part of
+       the Derivative Works; and
+
+   (d) If the Work includes a "NOTICE" text file as part of its
+       distribution, then any Derivative Works that You distribute must
+       include a readable copy of the attribution notices contained
+       within such NOTICE file, excluding those notices that do not
+       pertain to any part of the Derivative Works, in at least one
+       of the following places: within a NOTICE text file distributed
+       as part of the Derivative Works; within the Source form or
+       documentation, if provided along with the Derivative Works; or,
+       within a display generated by the Derivative Works, if and
+       wherever such third-party notices normally appear. The contents
+       of the NOTICE file are for informational purposes only and
+       do not modify the License. You may add Your own attribution
+       notices within Derivative Works that You distribute, alongside
+       or as an addendum to the NOTICE text from the Work, provided
+       that such additional attribution notices cannot be construed
+       as modifying the License.
+
+   You may add Your own copyright statement to Your modifications and
+   may provide additional or different license terms and conditions
+   for use, reproduction, or distribution of Your modifications, or
+   for any such Derivative Works as a whole, provided Your use,
+   reproduction, and distribution of the Work otherwise complies with
+   the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise,
+   any Contribution intentionally submitted for inclusion in the Work
+   by You to the Licensor shall be under the terms and conditions of
+   this License, without any additional terms or conditions.
+   Notwithstanding the above, nothing herein shall supersede or modify
+   the terms of any separate license agreement you may have executed
+   with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade
+   names, trademarks, service marks, or product names of the Licensor,
+   except as required for reasonable and customary use in describing the
+   origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or
+   agreed to in writing, Licensor provides the Work (and each
+   Contributor provides its Contributions) on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+   implied, including, without limitation, any warranties or conditions
+   of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+   PARTICULAR PURPOSE. You are solely responsible for determining the
+   appropriateness of using or redistributing the Work and assume any
+   risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory,
+   whether in tort (including negligence), contract, or otherwise,
+   unless required by applicable law (such as deliberate and grossly
+   negligent acts) or agreed to in writing, shall any Contributor be
+   liable to You for damages, including any direct, indirect, special,
+   incidental, or consequential damages of any character arising as a
+   result of this License or out of the use or inability to use the
+   Work (including but not limited to damages for loss of goodwill,
+   work stoppage, computer failure or malfunction, or any and all
+   other commercial damages or losses), even if such Contributor
+   has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing
+   the Work or Derivative Works thereof, You may choose to offer,
+   and charge a fee for, acceptance of support, warranty, indemnity,
+   or other liability obligations and/or rights consistent with this
+   License. However, in accepting such obligations, You may act only
+   on Your own behalf and on Your sole responsibility, not on behalf
+   of any other Contributor, and only if You agree to indemnify,
+   defend, and hold each Contributor harmless for any liability
+   incurred by, or claims asserted against, such Contributor by reason
+   of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
+
+APPENDIX: How to apply the Apache License to your work.
+
+   To apply the Apache License to your work, attach the following
+   boilerplate notice, with the fields enclosed by brackets "[]"
+   replaced with your own identifying information. (Don't include
+   the brackets!)  The text should be enclosed in the appropriate
+   comment syntax for the file format. We also recommend that a
+   file or class name and description of purpose be included on the
+   same "printed page" as the copyright notice for easier
+   identification within third-party archives.
+
+   Copyright [2025] [Swarmauri Team]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

tigrbl_engine_membloom-0.1.10.dev1/PKG-INFO

@@ -0,0 +1,41 @@
+Metadata-Version: 2.4
+Name: tigrbl_engine_membloom
+Version: 0.1.10.dev1
+Summary: Process-local Bloom filter engine plugin for Tigrbl with optional rotating TTL windows.
+Project-URL: Homepage, https://github.com/swarmauri/swarmauri-sdk
+Author-email: Jacob Stewart <jacob@swarmauri.com>
+License-Expression: Apache-2.0
+License-File: LICENSE
+Keywords: bloom,engine,idempotency,membership,tigrbl,ttl
+Classifier: Development Status :: 1 - Planning
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Requires-Python: <3.14,>=3.10
+Requires-Dist: tigrbl>=0.3.0.dev4
+Description-Content-Type: text/markdown
+
+# tigrbl_engine_membloom
+
+This file is a package-local distribution entry point.
+It is not the authoritative location for repository governance, current target status, current state reporting, certification claims, or release evidence.
+
+## Canonical repository docs
+
+- `README.md`
+- `docs/README.md`
+- `docs/conformance/CURRENT_TARGET.md`
+- `docs/conformance/CURRENT_STATE.md`
+- `docs/conformance/NEXT_STEPS.md`
+- `docs/governance/DOC_POINTERS.md`
+- `docs/developer/PACKAGE_CATALOG.md`
+- `docs/developer/PACKAGE_LAYOUT.md`
+
+## Package identity
+
+- workspace path: `pkgs/engines/tigrbl_engine_membloom`
+- workspace class: engine package
+- implementation layout: `src/tigrbl_engine_membloom/`
+
+Long-form repository documentation is governed from `docs/`.

tigrbl_engine_membloom-0.1.10.dev1/README.md

@@ -0,0 +1,23 @@
+# tigrbl_engine_membloom
+
+This file is a package-local distribution entry point.
+It is not the authoritative location for repository governance, current target status, current state reporting, certification claims, or release evidence.
+
+## Canonical repository docs
+
+- `README.md`
+- `docs/README.md`
+- `docs/conformance/CURRENT_TARGET.md`
+- `docs/conformance/CURRENT_STATE.md`
+- `docs/conformance/NEXT_STEPS.md`
+- `docs/governance/DOC_POINTERS.md`
+- `docs/developer/PACKAGE_CATALOG.md`
+- `docs/developer/PACKAGE_LAYOUT.md`
+
+## Package identity
+
+- workspace path: `pkgs/engines/tigrbl_engine_membloom`
+- workspace class: engine package
+- implementation layout: `src/tigrbl_engine_membloom/`
+
+Long-form repository documentation is governed from `docs/`.

tigrbl_engine_membloom-0.1.10.dev1/pyproject.toml

@@ -0,0 +1,35 @@
+[build-system]
+requires = ["hatchling>=1.25.0"]
+build-backend = "hatchling.build"
+
+[project]
+name = "tigrbl_engine_membloom"
+version = "0.1.10.dev1"
+description = "Process-local Bloom filter engine plugin for Tigrbl with optional rotating TTL windows."
+readme = "README.md"
+license = "Apache-2.0"
+authors = [{ name = "Jacob Stewart", email = "jacob@swarmauri.com" }]
+keywords = ["tigrbl", "engine", "bloom", "membership", "idempotency", "ttl"]
+requires-python = ">=3.10,<3.14"
+classifiers = [
+    "Development Status :: 1 - Planning",
+    "Programming Language :: Python :: 3.10",
+    "Programming Language :: Python :: 3.11",
+    "Programming Language :: Python :: 3.12",
+    "Programming Language :: Python :: 3.13",
+]
+dependencies = ["tigrbl>=0.3.0.dev4"]
+
+[project.urls]
+Homepage = "https://github.com/swarmauri/swarmauri-sdk"
+
+[project.entry-points."tigrbl.engine"]
+membloom = "tigrbl_engine_membloom.plugin:register"
+
+[dependency-groups]
+dev = [
+    "ruff>=0.11.0",
+]
+
+[tool.uv.sources]
+tigrbl = { workspace = true }

tigrbl_engine_membloom-0.1.10.dev1/src/tigrbl_engine_membloom/__init__.py

@@ -0,0 +1,6 @@
+"""tigrbl_engine_membloom package."""
+
+__all__ = ["__version__", "register"]
+__version__ = "0.1.0"
+
+from .plugin import register

tigrbl_engine_membloom-0.1.10.dev1/src/tigrbl_engine_membloom/bloom.py

@@ -0,0 +1,238 @@
+from __future__ import annotations
+
+import hashlib
+import math
+import threading
+import time
+from dataclasses import dataclass
+from typing import Any
+
+
+def _as_bytes(x: bytes | str) -> bytes:
+    if isinstance(x, bytes):
+        return x
+    if isinstance(x, str):
+        return x.encode("utf-8", errors="strict")
+    raise TypeError("key must be bytes or str")
+
+
+def _optimal_m_bits(n: int, p: float) -> int:
+    if n <= 0:
+        raise ValueError("capacity must be > 0")
+    if not (0.0 < p < 1.0):
+        raise ValueError("fp_rate must be in (0, 1)")
+    return max(8, int(math.ceil((-n * math.log(p)) / (math.log(2) ** 2))))
+
+
+def _optimal_k_hashes(m_bits: int, n: int) -> int:
+    k = int(round((m_bits / n) * math.log(2)))
+    return max(1, k)
+
+
+def _bitset_size_bytes(m_bits: int) -> int:
+    return (m_bits + 7) // 8
+
+
+def _set_bit(buf: bytearray, bit: int) -> None:
+    idx = bit >> 3
+    mask = 1 << (bit & 7)
+    buf[idx] |= mask
+
+
+def _get_bit(buf: bytearray, bit: int) -> bool:
+    idx = bit >> 3
+    mask = 1 << (bit & 7)
+    return (buf[idx] & mask) != 0
+
+
+def _hash64_pair(seed: bytes, key: bytes) -> tuple[int, int]:
+    h = hashlib.blake2b(key, digest_size=16, key=seed).digest()
+    h1 = int.from_bytes(h[0:8], "little", signed=False)
+    h2 = int.from_bytes(h[8:16], "little", signed=False)
+    if h2 == 0:
+        h2 = 0x9E3779B97F4A7C15
+    return h1, h2
+
+
+@dataclass(frozen=True)
+class BloomParams:
+    m_bits: int
+    k_hashes: int
+    capacity: int
+    fp_rate: float
+    seed: bytes
+
+
+class BloomFilter:
+    def __init__(self, *, params: BloomParams) -> None:
+        self._p = params
+        self._buf = bytearray(_bitset_size_bytes(params.m_bits))
+        self._lock = threading.RLock()
+        self._adds = 0
+
+    @classmethod
+    def from_capacity(
+        cls, *, capacity: int, fp_rate: float, seed: str | bytes
+    ) -> "BloomFilter":
+        seed_b = (
+            seed if isinstance(seed, bytes) else seed.encode("utf-8", errors="strict")
+        )
+        m_bits = _optimal_m_bits(capacity, fp_rate)
+        k_hashes = _optimal_k_hashes(m_bits, capacity)
+        params = BloomParams(
+            m_bits=m_bits,
+            k_hashes=k_hashes,
+            capacity=capacity,
+            fp_rate=fp_rate,
+            seed=seed_b,
+        )
+        return cls(params=params)
+
+    def add(self, key: bytes | str) -> None:
+        kb = _as_bytes(key)
+        h1, h2 = _hash64_pair(self._p.seed, kb)
+        m = self._p.m_bits
+        with self._lock:
+            for i in range(self._p.k_hashes):
+                bit = (h1 + i * h2) % m
+                _set_bit(self._buf, bit)
+            self._adds += 1
+
+    def __contains__(self, key: bytes | str) -> bool:
+        return self.contains(key)
+
+    def contains(self, key: bytes | str) -> bool:
+        kb = _as_bytes(key)
+        h1, h2 = _hash64_pair(self._p.seed, kb)
+        m = self._p.m_bits
+        with self._lock:
+            for i in range(self._p.k_hashes):
+                bit = (h1 + i * h2) % m
+                if not _get_bit(self._buf, bit):
+                    return False
+            return True
+
+    def add_if_absent(self, key: bytes | str) -> bool:
+        kb = _as_bytes(key)
+        h1, h2 = _hash64_pair(self._p.seed, kb)
+        m = self._p.m_bits
+        with self._lock:
+            absent = False
+            bits = []
+            for i in range(self._p.k_hashes):
+                bit = (h1 + i * h2) % m
+                bits.append(bit)
+                if not _get_bit(self._buf, bit):
+                    absent = True
+            for bit in bits:
+                _set_bit(self._buf, bit)
+            if absent:
+                self._adds += 1
+            return absent
+
+    def reset(self) -> None:
+        with self._lock:
+            self._buf[:] = b"\x00" * len(self._buf)
+            self._adds = 0
+
+    def stats(self) -> dict[str, Any]:
+        with self._lock:
+            return {
+                "mode": "single",
+                "m_bits": self._p.m_bits,
+                "k_hashes": self._p.k_hashes,
+                "capacity": self._p.capacity,
+                "fp_rate_target": self._p.fp_rate,
+                "adds_approx": self._adds,
+                "bytes": len(self._buf),
+            }
+
+
+class BloomRing:
+    def __init__(self, *, filters: list[BloomFilter], window_seconds: float) -> None:
+        if window_seconds <= 0:
+            raise ValueError("window_seconds must be > 0")
+        if len(filters) < 2:
+            raise ValueError("BloomRing requires at least 2 windows")
+        self._filters = filters
+        self._window_seconds = float(window_seconds)
+        self._lock = threading.RLock()
+        self._epoch = time.monotonic()
+        self._index = 0
+
+    @classmethod
+    def from_capacity(
+        cls,
+        *,
+        capacity: int,
+        fp_rate: float,
+        seed: str | bytes,
+        windows: int,
+        window_seconds: float,
+    ) -> "BloomRing":
+        seed_s = (
+            seed if isinstance(seed, str) else seed.decode("utf-8", errors="strict")
+        )
+        filters = [
+            BloomFilter.from_capacity(
+                capacity=capacity,
+                fp_rate=fp_rate,
+                seed=f"{seed_s}:w{i}",
+            )
+            for i in range(windows)
+        ]
+        return cls(filters=filters, window_seconds=window_seconds)
+
+    def _rotate_if_needed(self) -> None:
+        elapsed = time.monotonic() - self._epoch
+        if elapsed < self._window_seconds:
+            return
+        steps = int(elapsed // self._window_seconds)
+        if steps <= 0:
+            return
+        for _ in range(min(steps, len(self._filters))):
+            self._index = (self._index + 1) % len(self._filters)
+            self._filters[self._index].reset()
+        self._epoch += steps * self._window_seconds
+
+    def add(self, key: bytes | str) -> None:
+        with self._lock:
+            self._rotate_if_needed()
+            self._filters[self._index].add(key)
+
+    def __contains__(self, key: bytes | str) -> bool:
+        return self.contains(key)
+
+    def contains(self, key: bytes | str) -> bool:
+        with self._lock:
+            self._rotate_if_needed()
+            for j in range(len(self._filters)):
+                i = (self._index - j) % len(self._filters)
+                if self._filters[i].contains(key):
+                    return True
+            return False
+
+    def add_if_absent(self, key: bytes | str) -> bool:
+        with self._lock:
+            self._rotate_if_needed()
+            present = any(filter_.contains(key) for filter_ in self._filters)
+            self._filters[self._index].add(key)
+            return not present
+
+    def reset(self) -> None:
+        with self._lock:
+            for filter_ in self._filters:
+                filter_.reset()
+            self._epoch = time.monotonic()
+            self._index = 0
+
+    def stats(self) -> dict[str, Any]:
+        with self._lock:
+            self._rotate_if_needed()
+            return {
+                "mode": "ring",
+                "windows": len(self._filters),
+                "window_seconds": self._window_seconds,
+                "current_index": self._index,
+                "per_window": self._filters[self._index].stats(),
+            }

tigrbl_engine_membloom-0.1.10.dev1/src/tigrbl_engine_membloom/plugin.py

@@ -0,0 +1,67 @@
+from __future__ import annotations
+
+from tigrbl.engine.registry import register_engine
+
+from .bloom import BloomFilter, BloomRing
+from .session import AsyncBloomSession, BloomSession
+
+
+def register() -> None:
+    register_engine(
+        kind="membloom",
+        build=build_membloom,
+        capabilities=capabilities,
+    )
+
+
+def capabilities() -> dict:
+    return {
+        "engine": "membloom",
+        "transactional": False,
+        "async_native": True,
+        "persistence": "process",
+        "features": {"bloom", "approx_membership", "ttl_optional"},
+        "notes": "Probabilistic set membership; false positives possible, false negatives not possible until expiry/reset.",
+    }
+
+
+def build_membloom(*, mapping=None, spec=None, dsn=None, **_) -> tuple[object, object]:
+    mapping = dict(mapping or {})
+    async_ = bool(getattr(spec, "async_", False))
+
+    capacity = int(mapping.get("capacity", 1_000_000))
+    fp_rate = float(mapping.get("fp_rate", 1e-4))
+    seed = str(mapping.get("seed", "tigrbl:membloom:v1"))
+    namespace = str(mapping.get("namespace", "default"))
+
+    windows = int(mapping.get("windows", 1))
+    window_seconds = float(mapping.get("window_seconds", 0.0)) or None
+
+    if windows < 1:
+        raise ValueError("windows must be >= 1")
+
+    if windows == 1 or window_seconds is None:
+        engine = BloomFilter.from_capacity(
+            capacity=capacity,
+            fp_rate=fp_rate,
+            seed=f"{seed}:{namespace}",
+        )
+    else:
+        engine = BloomRing.from_capacity(
+            capacity=capacity,
+            fp_rate=fp_rate,
+            seed=f"{seed}:{namespace}",
+            windows=windows,
+            window_seconds=window_seconds,
+        )
+
+    if async_:
+
+        def sessionmaker():
+            return AsyncBloomSession(engine)
+    else:
+
+        def sessionmaker():
+            return BloomSession(engine)
+
+    return engine, sessionmaker

tigrbl_engine_membloom-0.1.10.dev1/src/tigrbl_engine_membloom/session.py

@@ -0,0 +1,62 @@
+from __future__ import annotations
+
+from typing import Any
+
+
+class BloomSession:
+    def __init__(self, engine: Any) -> None:
+        self._engine = engine
+        self._closed = False
+
+    def close(self) -> None:
+        self._closed = True
+
+    def add(self, key: bytes | str) -> None:
+        self._require_open()
+        self._engine.add(key)
+
+    def contains(self, key: bytes | str) -> bool:
+        self._require_open()
+        return self._engine.contains(key)
+
+    def __contains__(self, key: bytes | str) -> bool:
+        return self.contains(key)
+
+    def add_if_absent(self, key: bytes | str) -> bool:
+        self._require_open()
+        return self._engine.add_if_absent(key)
+
+    def reset(self) -> None:
+        self._require_open()
+        self._engine.reset()
+
+    def stats(self) -> dict:
+        self._require_open()
+        return self._engine.stats()
+
+    def _require_open(self) -> None:
+        if self._closed:
+            raise RuntimeError("session is closed")
+
+    async def begin(self) -> None:
+        return
+
+    async def commit(self) -> None:
+        return
+
+    async def rollback(self) -> None:
+        return
+
+    async def flush(self) -> None:
+        return
+
+    async def refresh(self, obj: Any) -> None:
+        return
+
+    async def get(self, model: type, ident: Any) -> Any | None:
+        return None
+
+
+class AsyncBloomSession(BloomSession):
+    async def close(self) -> None:  # type: ignore[override]
+        super().close()