quant-curve 0.1.0__py3-none-any.whl

quant_curve/gates.py

@@ -0,0 +1,126 @@
+"""
+Promotion gates for quantization levels. Five-state contract, same family
+as retrieval-bench: MEASURED / BLOCKED / INVALID / FAILED / PROMOTED.
+
+A level is PROMOTED only if, against a measured FP16-class baseline of the
+SAME weights revision and SAME metric:
+- quality_retention >= min_retention (default 0.98)
+- memory_reduction >= min_memory_reduction (default 0.25)
+- the exact candidate sits on the Pareto frontier formed only from measured
+  points for that same weights revision and quality metric
+
+Missing baseline or zero measured points -> BLOCKED. Metric or revision
+mismatch -> INVALID. Never fabricates a number.
+"""
+import hashlib
+import json
+import time
+import uuid
+from dataclasses import dataclass
+from typing import List, Optional
+
+from .pareto import (QuantPoint, pareto_frontier, quality_retention,
+                     memory_reduction, _finite_number, _validate_point)
+
+
+def _hash(obj) -> str:
+    return hashlib.sha256(json.dumps(obj, sort_keys=True, allow_nan=False).encode()).hexdigest()
+
+
+@dataclass
+class GateReceipt:
+    gate_id: str
+    status: str
+    candidate_level: Optional[str]
+    baseline_level: Optional[str]
+    retention: Optional[float]
+    mem_reduction: Optional[float]
+    on_frontier: Optional[bool]
+    thresholds: dict
+    inputs_hash: str
+    timestamp: float
+    detail: str = ""
+
+    def to_dict(self):
+        return self.__dict__.copy()
+
+
+def evaluate_level(candidate: QuantPoint, baseline: Optional[QuantPoint],
+                   all_points: List[QuantPoint],
+                   min_retention: float = 0.98,
+                   min_memory_reduction: float = 0.25) -> GateReceipt:
+    points = list(all_points)
+    # Malformed inputs cannot form measured evidence or a canonical receipt.
+    # Validate the entire hashed population, including incomparable points.
+    _validate_point(candidate)
+    if baseline is not None:
+        _validate_point(baseline)
+    for point in points:
+        _validate_point(point)
+    _finite_number(min_retention, "min_retention", nonnegative=True)
+    _finite_number(min_memory_reduction, "min_memory_reduction", nonnegative=True)
+    if min_memory_reduction > 1:
+        raise ValueError("min_memory_reduction must not exceed 1")
+    thresholds = {"min_retention": min_retention,
+                  "min_memory_reduction": min_memory_reduction}
+    # Bind every value that can affect the gate decision. The previous contract
+    # hashed only n_points, which allowed different frontier populations of the
+    # same length to share an inputs_hash even when they changed promotion.
+    inputs_hash = _hash({
+        "candidate": candidate.__dict__,
+        "baseline": baseline.__dict__ if baseline else None,
+        "all_points": [p.__dict__ for p in points],
+        "thresholds": thresholds,
+    })
+    ts = time.time()
+
+    if not candidate.measured:
+        return GateReceipt(gate_id=str(uuid.uuid4()), status="BLOCKED",
+                           candidate_level=candidate.level, baseline_level=None,
+                           retention=None, mem_reduction=None, on_frontier=None,
+                           thresholds=thresholds, inputs_hash=inputs_hash,
+                           timestamp=ts, detail="candidate is not a measured point")
+
+    if baseline is None or not baseline.measured:
+        return GateReceipt(gate_id=str(uuid.uuid4()), status="BLOCKED",
+                           candidate_level=candidate.level, baseline_level=None,
+                           retention=None, mem_reduction=None, on_frontier=None,
+                           thresholds=thresholds, inputs_hash=inputs_hash,
+                           timestamp=ts, detail="no measured baseline available")
+
+    try:
+        if candidate.model_revision != baseline.model_revision:
+            return GateReceipt(gate_id=str(uuid.uuid4()), status="INVALID",
+                               candidate_level=candidate.level, baseline_level=baseline.level,
+                               retention=None, mem_reduction=None, on_frontier=None,
+                               thresholds=thresholds, inputs_hash=inputs_hash,
+                               timestamp=ts,
+                               detail="weights revision mismatch — cross-revision comparison is not evidence")
+        ret = quality_retention(candidate, baseline)
+        red = memory_reduction(candidate, baseline)
+    except ValueError as e:
+        return GateReceipt(gate_id=str(uuid.uuid4()), status="INVALID",
+                           candidate_level=candidate.level, baseline_level=baseline.level,
+                           retention=None, mem_reduction=None, on_frontier=None,
+                           thresholds=thresholds, inputs_hash=inputs_hash,
+                           timestamp=ts, detail=str(e))
+
+    # Pareto dominance is meaningful only inside one weights revision and one
+    # quality metric. Cross-revision or cross-metric points must not veto or
+    # confer frontier membership. Match the exact immutable candidate rather
+    # than accepting any different point that happens to share its level name.
+    comparable_points = [
+        p for p in points
+        if p.model_revision == candidate.model_revision
+        and p.quality_metric == candidate.quality_metric
+    ]
+    on_frontier = candidate in pareto_frontier(comparable_points)
+    promoted = ret >= min_retention and red >= min_memory_reduction and on_frontier
+    return GateReceipt(
+        gate_id=str(uuid.uuid4()),
+        status="PROMOTED" if promoted else "MEASURED",
+        candidate_level=candidate.level, baseline_level=baseline.level,
+        retention=ret, mem_reduction=red, on_frontier=on_frontier,
+        thresholds=thresholds, inputs_hash=inputs_hash, timestamp=ts,
+        detail="" if promoted else "measured but did not clear all promotion thresholds",
+    )

quant_curve/pareto.py

@@ -0,0 +1,94 @@
+"""
+Pareto frontier for quantization quality-vs-resource trade-offs.
+
+A point is Pareto-optimal if no other point has both strictly-better quality
+AND strictly-lower memory. Pure math over measured inputs only — the module
+never invents a measurement.
+"""
+from dataclasses import dataclass
+import math
+from typing import List, Optional
+
+
+@dataclass(frozen=True)
+class QuantPoint:
+    level: str              # e.g. "FP16", "Q8_0", "Q6_K", "Q4_K_M"
+    model_revision: str     # exact weights revision measured
+    quality: float          # quality metric value (higher = better), e.g. task accuracy
+    quality_metric: str     # name of the metric, e.g. "mmlu_acc", "winogrande_acc"
+    memory_gb: float        # measured resident memory (lower = better)
+    throughput_tok_s: Optional[float] = None
+    measured: bool = True   # False marks an UNMEASURED placeholder — never frontier-eligible
+
+
+def _finite_number(value, name: str, *, positive: bool = False,
+                   nonnegative: bool = False) -> None:
+    """Reject coercions and non-finite values before they influence evidence."""
+    if type(value) not in (int, float):
+        raise ValueError(f"{name} must be a finite number, not a boolean or string")
+    try:
+        finite = math.isfinite(value)
+    except OverflowError:
+        finite = False
+    if not finite:
+        raise ValueError(f"{name} must be finite")
+    if positive and value <= 0:
+        raise ValueError(f"{name} must be positive")
+    if nonnegative and value < 0:
+        raise ValueError(f"{name} must be nonnegative")
+
+
+def _validate_point(point: QuantPoint) -> None:
+    if not isinstance(point, QuantPoint):
+        raise ValueError("each point must be a QuantPoint")
+    if type(point.measured) is not bool:
+        raise ValueError("measured must be a boolean")
+    _finite_number(point.quality, "quality")
+    _finite_number(point.memory_gb, "memory_gb", positive=point.measured,
+                   nonnegative=True)
+    if point.throughput_tok_s is not None:
+        _finite_number(point.throughput_tok_s, "throughput_tok_s", nonnegative=True)
+
+
+def pareto_frontier(points: List[QuantPoint]) -> List[QuantPoint]:
+    """Return the subset of measured points that are Pareto-optimal
+    (maximize quality, minimize memory), sorted by memory ascending."""
+    points = list(points)
+    for point in points:
+        _validate_point(point)
+    measured = [p for p in points if p.measured]
+    frontier = []
+    for p in measured:
+        dominated = any(
+            q is not p and q.quality >= p.quality and q.memory_gb <= p.memory_gb
+            and (q.quality > p.quality or q.memory_gb < p.memory_gb)
+            for q in measured
+        )
+        if not dominated:
+            frontier.append(p)
+    return sorted(frontier, key=lambda p: p.memory_gb)
+
+
+def quality_retention(candidate: QuantPoint, baseline: QuantPoint) -> float:
+    """candidate.quality / baseline.quality. Caller guarantees same metric."""
+    _validate_point(candidate)
+    _validate_point(baseline)
+    if candidate.quality_metric != baseline.quality_metric:
+        raise ValueError("cannot compare different quality metrics")
+    if baseline.quality <= 0:
+        raise ValueError("baseline quality must be positive")
+    retention = candidate.quality / baseline.quality
+    _finite_number(retention, "quality retention")
+    return retention
+
+
+def memory_reduction(candidate: QuantPoint, baseline: QuantPoint) -> float:
+    """1 - candidate.memory/baseline.memory (0.75 = candidate uses 75% less)."""
+    _validate_point(candidate)
+    _validate_point(baseline)
+    if baseline.memory_gb <= 0:
+        raise ValueError("baseline memory must be positive")
+    reduction = 1 - candidate.memory_gb / baseline.memory_gb
+    if not math.isfinite(reduction):
+        raise ValueError("memory reduction must be finite")
+    return reduction

quant_curve-0.1.0.dist-info/METADATA

@@ -0,0 +1,182 @@
+Metadata-Version: 2.4
+Name: quant-curve
+Version: 0.1.0
+Summary: Quant Curve — quantization quality-vs-resource Pareto frontier and promotion gates. Quality retention vs memory reduction, five-state receipts (MEASURED/BLOCKED/INVALID/FAILED/PROMOTED)
+Author-email: Stephen Lutar <stephen@szlholdings.com>
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/szl-holdings/quant-curve
+Project-URL: Source, https://github.com/szl-holdings/quant-curve
+Project-URL: Issues, https://github.com/szl-holdings/quant-curve/issues
+Keywords: quantization,pareto-frontier,benchmarking,receipts,governed-ai
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Developers
+Classifier: Intended Audience :: Science/Research
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3 :: Only
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Python :: 3.14
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Requires-Python: >=3.11
+Description-Content-Type: text/markdown
+License-File: LICENSE
+License-File: NOTICE
+Provides-Extra: api
+Requires-Dist: fastapi>=0.162.0; extra == "api"
+Requires-Dist: uvicorn[standard]>=0.54.0; extra == "api"
+Provides-Extra: test
+Requires-Dist: fastapi>=0.162.0; extra == "test"
+Requires-Dist: httpx2>=2.16.0; extra == "test"
+Requires-Dist: pytest>=9.2.0; extra == "test"
+Dynamic: license-file
+
+# Quant Curve
+
+<!-- szl:header v1 -->
+<!-- Native identity: szl-brand@4309f6fce89179331b0b3ed8c99494e76c5be256; Orbit v2 icon. -->
+<p>
+  <a href="https://github.com/szl-holdings">
+    <img src="https://raw.githubusercontent.com/szl-holdings/szl-brand/4309f6fce89179331b0b3ed8c99494e76c5be256/kit/logos/orbit-v2/suite/szl-icon-32.svg" alt="SZL Holdings — Orbit v2" width="32" height="32" />
+  </a>
+</p>
+
+**Control before action. Evidence after.**
+
+[Product](https://a-11-oy.com) · [Proof](https://a11oy.net) · [GitHub organization](https://github.com/szl-holdings)
+<!-- /szl:header -->
+
+Measured quantization evidence for the SZL stack — quality vs precision, admitted only from verifiable runs.
+
+## What this is
+
+The honest companion to quantization claims: quality-vs-precision curves and throughput numbers may be published only when they are traceable to reviewed run receipts. Unmeasured or unverifiable data stays absent rather than being rendered as measured evidence.
+
+| Path | Role |
+|---|---|
+| `quant_curve/` | Pareto frontier (`pareto.py`) and promotion gates (`gates.py`) over caller-supplied measured points. Standard library only. |
+| `verify/verifier.py` | Fail-closed integrity check of a receipt chain: schema, strict JSON, per-receipt SHA-256, `prev_hash` links. |
+| `tools/sync_results.py` | Exports the MEASURED receipts of a verified chain to `site/results.json`; on any error it exits 1 and writes nothing. |
+| `app/main.py` | Read-only FastAPI surface for that export (`/healthz`, `/api/results`). Deployment: [deploy/RUNBOOK.md](deploy/RUNBOOK.md). |
+| `receipts/` | The receipt chain. Today it holds only the BLOCKED genesis receipt. |
+
+## Guarantees
+
+- **Measured rows only** — publication accepts actual measured-run receipts; fixtures, projections, and BLOCKED genesis records are not benchmark rows.
+- **Quality and throughput together** — when a measured row is admitted, quality and tokens/sec remain bound to the same machine/date/method evidence.
+- **Receipts** — every admitted point is hash-chained into the run ledger, so editing or reordering a receipt breaks verification. The chain is unsigned: tamper evidence holds against a head hash recorded elsewhere, not on its own (see [Proof boundary](#proof-boundary)).
+- **Comparable frontiers only** — promotion compares the exact candidate only against points from the same weights revision and quality metric.
+- **Decision-bound evidence** — gate input hashes bind the candidate, baseline, full frontier population, and thresholds that can affect promotion.
+- **Fail-closed display** — unverifiable runs appear as absent.
+
+## Install
+
+Python 3.11 to 3.14. The `quant_curve` library has no third-party dependencies.
+
+```bash
+python -m pip install -e '.[test]'   # library + test tools (pytest, httpx2, fastapi)
+python -m pip install -e '.[api]'    # library + fastapi/uvicorn to serve app/main.py
+```
+
+The container does not use these extras: it installs the hash-locked `requirements.txt`, compiled from `requirements.in`.
+
+## Usage
+
+Gate a candidate level against a baseline. The numbers are illustrative fixture values, not measurements of any model:
+
+```python
+from quant_curve.gates import evaluate_level
+from quant_curve.pareto import QuantPoint
+
+fp16 = QuantPoint("FP16", "rev-a", 0.700, "task_acc", 16.0)
+q4 = QuantPoint("Q4_K_M", "rev-a", 0.685, "task_acc", 4.9)
+r = evaluate_level(q4, fp16, [fp16, q4])
+print(r.status, round(r.retention, 4), round(r.mem_reduction, 4), r.on_frontier)
+# MEASURED 0.9786 0.6937 True
+```
+
+Retention 0.9786 is below the default `min_retention` of 0.98, so the level is MEASURED, not PROMOTED; with `min_retention=0.97` the same call returns PROMOTED. `evaluate_level` returns BLOCKED, INVALID, MEASURED or PROMOTED. FAILED is part of the receipt schema the verifier accepts; these gates never emit it.
+
+Verify the committed chain, export it, and serve the export:
+
+```bash
+python verify/verifier.py receipts/*.json
+# checked=1 measured=0 errors=0
+python tools/sync_results.py receipts site/results.json
+# published 0 measured rows -> site/results.json
+uvicorn app.main:app --port 7860          # needs the api extra; then, in a second shell:
+curl -s http://127.0.0.1:7860/api/results
+# {"plane":"quant","state":"EMPTY_HONEST","generated_at":"...","count":0,"results":[],"served_at":"..."}
+```
+
+`/api/results` reports one of three states, always with HTTP 200 and never with invented rows:
+
+- `MEASURED`: the export contains quant rows.
+- `EMPTY_HONEST`: a valid export with no quant rows (today's state).
+- `UNAVAILABLE`: the results file is missing, unreadable or malformed. No rows are served and the reason is logged.
+
+## Tests
+
+```bash
+python -m pytest -q
+```
+
+CI ([`.github/workflows/ci.yml`](.github/workflows/ci.yml)) runs on Python 3.11 to 3.14. It first runs the stdlib-only test files with no third-party package installed, then installs the hash-locked [`requirements/ci/test.txt`](requirements/ci/test.txt) and runs the full suite, including the HTTP route. The `receipt-verification` workflow ([`bench.yml`](.github/workflows/bench.yml)) re-verifies `receipts/*.json` on every push to `main` and on every pull request.
+
+## Proof boundary
+
+What the code establishes:
+
+- `verify/verifier.py`: each receipt is strict JSON with the schema fields, its declared `hash` equals the SHA-256 of its canonical body, and its `prev_hash` links it to the receipt before it.
+- `evaluate_level`: a deterministic decision over the points it is given. `inputs_hash` binds the candidate, the baseline, the whole population and the thresholds.
+
+What it does not establish:
+
+- Authorship, time or hardware. Receipts are unsigned, so a chain rewritten from the start with every hash recomputed still verifies. Tamper evidence depends on a head hash recorded elsewhere, such as the revision pin in the consolidated publisher.
+- That a receipt came from a real run. The verifier cannot tell a fixture from a measurement. Hardware identity and receipt authentication are checked by the consolidated publisher in frontier-bench, not here.
+- Any measurement at all. Nothing in this repository runs a model, and there are zero measured rows.
+- Re-verification at serve time. `/api/results` serves the file `tools/sync_results.py` exported; it does not re-check receipts.
+
+[`evidence/eclipse-native-repaired-20260905.json`](evidence/eclipse-native-repaired-20260905.json) is a historical szl-eclipse control report: 10 of 10 local-fixture mutations caught by an earlier verifier. Its recorded `verifier_sha256` matches no committed version of `verify/verifier.py`, so it is not evidence about the current verifier.
+
+## Public surface
+
+The consolidated bench targets the Hugging Face Space [SZLHOLDINGS/szl-bench-suite](https://huggingface.co/spaces/SZLHOLDINGS/szl-bench-suite) (Quantization tab) — one evidence surface for engine, retrieval, and quantization claims. As of 2026-11-06 that Space is private on the Hub: anonymous requests to the link return HTTP 401, so it is not yet publicly viewable.
+
+Hardware identity is declared by benchmark receipts and checked by the consolidated publisher's dedicated-node policy. Receipt authentication proves an operator assertion; this repository does **not** claim an independent hardware witness.
+
+**Division of labor:** this repo owns quantization receipts and their fail-closed verifier. The single Space publisher lives in [szl-holdings/frontier-bench](https://github.com/szl-holdings/frontier-bench), which verifies and combines all three planes before one atomic Space commit. The measurement harness that produces receipted quantization runs lives in [szl-holdings/szl-quant-bench](https://github.com/szl-holdings/szl-quant-bench); the Wave 1 consolidated bakeoff report is [szl-holdings/szl-wave1-report](https://github.com/szl-holdings/szl-wave1-report).
+
+Source admission, Hugging Face publication, product/runtime status, and proof/evaluation status are separate evidence layers. Repository CI alone is not a publication or runtime claim.
+
+## Numeric admission
+
+The Python gate and Pareto helpers reject malformed inputs with `ValueError`
+before hashing or comparison. Numeric evidence must be finite Python integers
+or floats; booleans and numeric strings are not measurements. Measured memory
+must be positive, optional throughput must be nonnegative, and `measured` must
+be an actual boolean. Unmeasured placeholders may use zero memory. Quality is
+not restricted to a particular metric's range; baseline quality must still be
+positive for a retention ratio.
+
+Retention thresholds are finite and nonnegative (values above one can require
+improvement). Memory-reduction thresholds are finite fractions from zero to
+one. Validation covers the complete population bound by `inputs_hash`, including
+incomparable rows. Valid inputs retain the existing evidence states; arithmetic
+overflow produces `INVALID`, never a promoted point with an infinite receipt.
+These functions are a library API and are not invoked by the HTTP results route.
+
+## Status
+
+Current source state contains only the BLOCKED genesis receipt: **zero admitted measured quantization rows**. Real benchmark execution and signed raw evidence remain the responsibility of the dedicated-node measurement producer before any measured point can be published.
+
+## Links
+
+- Source: [szl-holdings/quant-curve](https://github.com/szl-holdings/quant-curve) · [SECURITY.md](SECURITY.md) · [CITATION.cff](CITATION.cff)
+- Publisher: [szl-holdings/frontier-bench](https://github.com/szl-holdings/frontier-bench) · measurement harness: [szl-holdings/szl-quant-bench](https://github.com/szl-holdings/szl-quant-bench)
+- Hugging Face: models, datasets and Spaces are published under the [SZLHOLDINGS](https://huggingface.co/SZLHOLDINGS) org.
+
+## License
+
+Apache-2.0 — see [LICENSE](LICENSE) and [NOTICE](NOTICE).

quant_curve-0.1.0.dist-info/RECORD

@@ -0,0 +1,9 @@
+quant_curve/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+quant_curve/gates.py,sha256=3PH67OS3iXd9x0sjFk_c632t3-A5_VTIUdTtJrIVfGI,5808
+quant_curve/pareto.py,sha256=AOqSHwJyQlaz06eDosigopto6lnKQaINSRakG65PbBw,3863
+quant_curve-0.1.0.dist-info/licenses/LICENSE,sha256=oioMSVVmzpsJslqj_quNVKWxLGom6z3LUyTq2aWG2mY,11361
+quant_curve-0.1.0.dist-info/licenses/NOTICE,sha256=QeRwAf4so-HQQSLdAz-6jW-4crOM_CHK8UmjXdTxzU0,196
+quant_curve-0.1.0.dist-info/METADATA,sha256=SjwTvl5VtYKxHIGfnPamOQ-8rhAD40086FRxMUvW6Kc,11448
+quant_curve-0.1.0.dist-info/WHEEL,sha256=mOdXR9C3wMVov7cSY8PY-XCzo3SmmWCHvGQr5csJoao,91
+quant_curve-0.1.0.dist-info/top_level.txt,sha256=CU6Gnlmt3SFBLoO2g33BmuEPKNQGod0k6YQpYom_Sso,12
+quant_curve-0.1.0.dist-info/RECORD,,

quant_curve-0.1.0.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (84.2.1)
+Root-Is-Purelib: true
+Tag: py3-none-any
+

quant_curve-0.1.0.dist-info/licenses/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 [yyyy] [name of copyright owner]
+
+   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.

quant_curve-0.1.0.dist-info/licenses/NOTICE

@@ -0,0 +1,7 @@
+Quant Curve
+Copyright 2026 SZL Holdings
+
+This product includes software developed at SZL Holdings
+(https://github.com/szl-holdings).
+
+Licensed under the Apache License, Version 2.0 (see LICENSE).

quant_curve-0.1.0.dist-info/top_level.txt

@@ -0,0 +1 @@
+quant_curve