robustrep 0.1.0__tar.gz

robustrep-0.1.0/LICENSE

@@ -0,0 +1,202 @@
+
+                                 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 2026 Dong Wang
+
+   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.

robustrep-0.1.0/PKG-INFO

@@ -0,0 +1,34 @@
+Metadata-Version: 2.4
+Name: robustrep
+Version: 0.1.0
+Summary: Robust, transport-agnostic reputation scoring for AI agents
+Author: Dong Wang
+License: Apache-2.0
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: pandas<4,>=2.0
+Requires-Dist: numpy>=1.24
+Requires-Dist: eth-abi>=5.0
+Requires-Dist: eth-hash[pycryptodome]>=0.5
+Requires-Dist: requests>=2.31
+Requires-Dist: urllib3>=2
+Requires-Dist: tabulate>=0.9
+Requires-Dist: matplotlib>=3.7
+Requires-Dist: typer>=0.12
+Provides-Extra: dev
+Requires-Dist: pytest>=8; extra == "dev"
+Requires-Dist: pytest-cov>=5; extra == "dev"
+Requires-Dist: build; extra == "dev"
+Requires-Dist: twine; extra == "dev"
+Dynamic: license-file
+
+# robustrep
+
+Robust, transport-agnostic reputation scoring for AI agents.
+
+Feed it any table of `(rater, ratee, value, scale, tag, ts, evidence_uri, source)` and it returns a
+robust score per ratee that resists Sybil raters and evidence-free ratings. Ships with a Base-chain
+ERC-8004 adapter and a reproducible report.
+
+Status: v0.1 in development. See `docs/` in the parent repo for the design.

robustrep-0.1.0/README.md

@@ -0,0 +1,9 @@
+# robustrep
+
+Robust, transport-agnostic reputation scoring for AI agents.
+
+Feed it any table of `(rater, ratee, value, scale, tag, ts, evidence_uri, source)` and it returns a
+robust score per ratee that resists Sybil raters and evidence-free ratings. Ships with a Base-chain
+ERC-8004 adapter and a reproducible report.
+
+Status: v0.1 in development. See `docs/` in the parent repo for the design.

robustrep-0.1.0/pyproject.toml

@@ -0,0 +1,45 @@
+[build-system]
+requires = ["setuptools>=68", "wheel"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "robustrep"
+version = "0.1.0"
+description = "Robust, transport-agnostic reputation scoring for AI agents"
+readme = "README.md"
+license = { text = "Apache-2.0" }
+authors = [{ name = "Dong Wang" }]
+requires-python = ">=3.10"
+dependencies = [
+  "pandas>=2.0,<4",
+  "numpy>=1.24",
+  "eth-abi>=5.0",
+  "eth-hash[pycryptodome]>=0.5",
+  "requests>=2.31",
+  "urllib3>=2",
+  "tabulate>=0.9",
+  "matplotlib>=3.7",
+  "typer>=0.12",
+]
+
+[project.optional-dependencies]
+dev = ["pytest>=8", "pytest-cov>=5", "build", "twine"]
+
+[project.scripts]
+robustrep = "robustrep.cli:app"
+
+[tool.setuptools.packages.find]
+include = ["robustrep*"]
+
+[tool.pytest.ini_options]
+testpaths = ["tests"]
+markers = ["live: needs network; run weekly, not on every push"]
+addopts = "-m 'not live'"
+filterwarnings = ["error"]
+
+[tool.coverage.run]
+source = ["robustrep"]
+
+[tool.coverage.report]
+fail_under = 80
+show_missing = true

robustrep-0.1.0/robustrep/__init__.py

@@ -0,0 +1,6 @@
+"""robustrep: robust, transport-agnostic reputation scoring for AI agents."""
+from .config import Config
+from .pipeline import score
+
+__all__ = ["Config", "score"]
+__version__ = "0.1.0"

robustrep-0.1.0/robustrep/aggregate.py

@@ -0,0 +1,262 @@
+"""Aggregators turn (values, weights) into (score, ci_low, ci_high).
+
+The arithmetic mean has breakdown point zero: a single extreme rating can move
+it arbitrarily far. The weighted median has breakdown point ~0.5 (roughly half
+the total weight must be adversarial to move it), so it is the default
+aggregator here. `Aggregator` is an abstract base so Bayesian and graph-based
+aggregators can be added later behind the same interface.
+"""
+from __future__ import annotations
+
+from abc import ABC, abstractmethod
+
+import numpy as np
+
+from .config import Config
+
+# Half-weight threshold is nudged down by this relative fraction so that
+# float64 cumsum drift at an exact tie doesn't step one element too far
+# (which would break scale invariance and bias the result upward).
+_TIE_EPS = 1e-9
+
+# Minimum fraction of bootstrap resamples that must carry non-zero total
+# weight for the CI to be considered meaningful.
+MIN_VALID_BOOT_FRACTION = 0.1
+
+# Cap on the number of (resample x vote) float64 cells materialized at once
+# by `bootstrap_ci`'s chunked multinomial draw, so peak memory stays bounded
+# even for a ratee with thousands of votes: a chunk holds at most this many
+# cells regardless of how large `n_boot` is.
+_MAX_BOOT_CHUNK_CELLS = 2_000_000
+
+
+def _validate(values: np.ndarray, weights: np.ndarray, name: str) -> tuple[np.ndarray, np.ndarray]:
+    """Shared input validation for `weighted_median` and `bootstrap_ci`.
+
+    Coerces both to 1-D float64 arrays and validates: 1-D, non-empty, equal
+    length, all-finite (no NaN/+/-inf), weights non-negative, and weights
+    summing to > 0. Returns the coerced `(values, weights)`. Raises
+    ValueError (messages prefixed with `name`, the caller's own name) on any
+    violation.
+    """
+    values = np.asarray(values, dtype=float)
+    weights = np.asarray(weights, dtype=float)
+    if values.ndim != 1 or weights.ndim != 1:
+        raise ValueError(f"{name}: values/weights must be 1-D")
+    if values.shape[0] == 0:
+        raise ValueError(f"{name}: values/weights must not be empty")
+    if values.shape != weights.shape:
+        raise ValueError(f"{name}: values and weights must have the same length")
+    if not np.isfinite(values).all() or not np.isfinite(weights).all():
+        raise ValueError(f"{name}: values/weights must not contain non-finite entries (NaN/inf)")
+    if (weights < 0).any():
+        raise ValueError(f"{name}: weights must be non-negative")
+    if weights.sum() <= 0:
+        raise ValueError(f"{name}: weights must sum to > 0")
+    return values, weights
+
+
+def _weighted_median_pos(cum: np.ndarray) -> int:
+    """Position in an ascending cumulative-weight array selected by the lower-weighted-
+    median convention: the first index at which cumulative weight reaches >= half the
+    total (`np.searchsorted(..., side="left")`), with the half-weight threshold nudged
+    down by `_TIE_EPS` to absorb float64 cumsum drift at exact ties. Shared by
+    `_weighted_median_sorted` and `weighted_median_index` so this tie-tolerance logic
+    lives in exactly one place. `cum` must be non-empty and non-decreasing (a cumsum).
+    """
+    half = 0.5 * cum[-1]
+    return int(np.searchsorted(cum, half * (1 - _TIE_EPS), side="left"))
+
+
+def _weighted_median_sorted(v: np.ndarray, w: np.ndarray) -> float:
+    """Weighted median of already-sorted, already-validated inputs.
+
+    Assumes `v` is sorted ascending and `w` is finite, non-negative, and sums
+    to > 0. Not for external use (no validation) — see `weighted_median`.
+    """
+    return float(v[_weighted_median_pos(np.cumsum(w))])
+
+
+def weighted_median(values: np.ndarray, weights: np.ndarray) -> float:
+    """Return the weighted median of `values` under `weights`.
+
+    Tie/even-count convention: this is the *lower* weighted median. Sorting
+    values ascending and walking cumulative weight, the returned value is the
+    first one at which cumulative weight reaches >= half the total weight
+    (`np.searchsorted(..., side="left")`, with the half-weight threshold
+    nudged down by a small epsilon to absorb float64 cumsum drift at exact
+    ties). For an even count with equal weights this picks the smaller of the
+    two middle values (e.g. [0.2, 0.8] with equal weights returns 0.2),
+    matching a robust, deterministic, order-independent convention rather
+    than numpy's mean-of-two-middles.
+
+    Raises ValueError if `values`/`weights` are not 1-D, are empty,
+    mismatched in length, contain NaN or +/-inf, or if any weight is
+    negative or all weights are zero (see `_validate`).
+    """
+    values, weights = _validate(values, weights, "weighted_median")
+    order = np.argsort(values, kind="stable")
+    return _weighted_median_sorted(values[order], weights[order])
+
+
+def weighted_median_index(values: np.ndarray, weights: np.ndarray) -> int:
+    """Return the *original* index of the element `weighted_median` would return.
+
+    Same validation, stable sort, and tie tolerance as `weighted_median` (see
+    `_validate` and `_weighted_median_sorted`) -- `values[weighted_median_index(values,
+    weights)] == weighted_median(values, weights)` always holds. Useful when a caller
+    needs to know *which* input element was selected (e.g. `explain()` marking the
+    vote/tag chosen by the weighted-median chain), not just its value.
+    """
+    values, weights = _validate(values, weights, "weighted_median_index")
+    order = np.argsort(values, kind="stable")
+    cum = np.cumsum(weights[order])
+    return int(order[_weighted_median_pos(cum)])
+
+
+def _bootstrap_draws(
+    v_sorted: np.ndarray,
+    w_sorted: np.ndarray,
+    n_boot: int,
+    rng: np.random.Generator,
+    chunk_size: int,
+) -> np.ndarray:
+    """The array of valid weighted-median bootstrap draws (length <= n_boot).
+
+    `v_sorted`/`w_sorted` must already be sorted ascending by value. Draws
+    are generated `chunk_size` resamples at a time via
+    `rng.multinomial(n, [1/n]*n, size=chunk_size)` (see `bootstrap_ci` for
+    why a multinomial count draw is equivalent to classic index resampling
+    with replacement) and accumulated, so peak memory is bounded by
+    `chunk_size * n` regardless of `n_boot`. A resample whose weights sum to
+    zero has an undefined weighted median and is dropped from the result
+    rather than counted.
+    """
+    n = len(v_sorted)
+    pvals = np.full(n, 1.0 / n)
+    boots = []
+    remaining = n_boot
+    while remaining > 0:
+        take = min(chunk_size, remaining)
+        remaining -= take
+        counts = rng.multinomial(n, pvals, size=take)
+        cum = np.cumsum(counts * w_sorted, axis=1)
+        valid = cum[:, -1] > 0
+        cum_valid = cum[valid]
+        half = 0.5 * cum_valid[:, -1:]
+        idx = (cum_valid >= half * (1 - _TIE_EPS)).argmax(axis=1)
+        boots.append(v_sorted[idx])
+    return np.concatenate(boots) if boots else np.array([], dtype=float)
+
+
+def bootstrap_ci(
+    values: np.ndarray,
+    weights: np.ndarray,
+    n_boot: int,
+    rng: np.random.Generator,
+    ci_level: float,
+) -> tuple[float, float]:
+    """Vectorized bootstrap (lo, hi) quantiles of the weighted median.
+
+    Equivalent to resampling n `(value, weight)` pairs with replacement
+    `n_boot` times and taking the weighted median of each resample, but
+    without a Python-level loop over resamples. A resample's weighted
+    median depends only on how many times each *position* was drawn (its
+    resample count), not on the order of the draws, so after sorting
+    `values` once (stable), `rng.multinomial(n, [1/n]*n, size=chunk)`
+    produces a batch of resamples' per-position counts in a single call --
+    equivalent to drawing n indices with replacement, once per resample --
+    and the cumulative sum of `counts * sorted_weights` along each row gives
+    every resample's weighted median in one vectorized pass (see
+    `_bootstrap_draws`). Processed in chunks of at most
+    `max(1, 2_000_000 // n)` resamples so peak memory stays bounded even for
+    a ratee with thousands of votes; this is what keeps the per-ratee
+    bootstrap affordable at ~28k ratees.
+
+    Inputs are validated exactly like `weighted_median` (see `_validate`).
+    A resample whose weights sum to zero has an undefined weighted median
+    and is skipped rather than counted. If fewer than `max(2, n_boot // 10)`
+    resamples remain valid, raises ValueError instead of silently reporting
+    a CI built from too few (or zero) samples. Skipping all-zero resamples
+    conditions the CI on non-zero weight; unreachable in-pipeline since
+    Config forbids zero weights.
+    """
+    values, weights = _validate(values, weights, "bootstrap_ci")
+    n = len(values)
+    order = np.argsort(values, kind="stable")
+    v_sorted, w_sorted = values[order], weights[order]
+
+    chunk_size = max(1, _MAX_BOOT_CHUNK_CELLS // n)
+    boots = _bootstrap_draws(v_sorted, w_sorted, n_boot, rng, chunk_size)
+
+    min_valid = max(2, int(n_boot * MIN_VALID_BOOT_FRACTION))
+    if boots.size < min_valid:
+        raise ValueError("bootstrap degenerate: too many zero-weight resamples")
+
+    alpha = (1 - ci_level) / 2
+    lo, hi = np.quantile(boots, [alpha, 1 - alpha])
+    return float(lo), float(hi)
+
+
+def _bootstrap_ci(
+    values: np.ndarray,
+    weights: np.ndarray,
+    n_boot: int,
+    seed: int,
+    ci_level: float,
+) -> tuple[float, float]:
+    """Bootstrap (lo, hi) quantiles of the weighted median, seeded by a plain
+    integer `seed`. Thin wrapper around `bootstrap_ci` (the one bootstrap
+    implementation) for callers that don't manage their own
+    `numpy.random.Generator`.
+    """
+    return bootstrap_ci(values, weights, n_boot, np.random.default_rng(seed), ci_level)
+
+
+class Aggregator(ABC):
+    """Abstract base for turning per-ratee (values, weights) into a score with a CI.
+
+    Concrete implementations (e.g. `WeightedMedian`, and future Bayesian or
+    graph-based aggregators) all expose the same `aggregate` interface so the
+    pipeline can swap aggregation strategies without changing callers.
+    """
+
+    @abstractmethod
+    def aggregate(self, values: np.ndarray, weights: np.ndarray) -> tuple[float, float, float]:
+        """Return (score, ci_low, ci_high)."""
+
+
+class WeightedMedian(Aggregator):
+    """Weighted-median aggregator with a bootstrap confidence interval.
+
+    `aggregate` resamples (values, weights) pairs with replacement `n_boot`
+    times, computes the weighted median of each resample, and reports the
+    `ci_level` central interval of the bootstrap distribution (widened if
+    needed so it always contains the point estimate). Note: with tied or
+    coarse-grained values the percentile bootstrap can legitimately return a
+    zero-width interval (every resample lands on the same value) — consumers
+    should read the CI together with the underlying vote count rather than
+    treating a narrow interval alone as high confidence.
+    """
+
+    def __init__(self, n_boot: int = 1000, seed: int = 0, ci_level: float = 0.95):
+        if n_boot < 0:
+            raise ValueError("WeightedMedian: n_boot must be >= 0")
+        if not 0 < ci_level < 1:
+            raise ValueError("WeightedMedian: ci_level must be in (0, 1)")
+        self.n_boot, self.seed, self.ci_level = n_boot, seed, ci_level
+
+    @classmethod
+    def from_config(cls, cfg: Config) -> "WeightedMedian":
+        """Build a WeightedMedian aggregator from a pipeline Config."""
+        return cls(n_boot=cfg.bootstrap_n, seed=cfg.bootstrap_seed, ci_level=cfg.ci_level)
+
+    def aggregate(self, values: np.ndarray, weights: np.ndarray) -> tuple[float, float, float]:
+        values = np.asarray(values, dtype=float)
+        weights = np.asarray(weights, dtype=float)
+        point = weighted_median(values, weights)
+        if len(values) == 1 or self.n_boot == 0:
+            return point, point, point
+        lo, hi = _bootstrap_ci(values, weights, self.n_boot, self.seed, self.ci_level)
+        # defensive; not expected to fire
+        return point, float(min(lo, point)), float(max(hi, point))