scientific-computing-system 2.2.5__tar.gz → 2.2.6__tar.gz

{scientific_computing_system-2.2.5 → scientific_computing_system-2.2.6}/CHANGELOG.md

@@ -5,7 +5,23 @@ All notable changes to **scientific-computing-system** will be documented in thi
 The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.1.0/),
 and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
 
+## [v2.2.6] - 2026-10-13
+
+### Housekeeping — second-round neighbour sweep
+
+- `transpose` shares the ragged-input contract the rest of the matrix API has
+  held since 2.2.5. It indexed only the leading row's width, so a short row
+  lost entries silently (`[[1.0],[2.0,3.0]]` became `[[1.0, 2.0]]`): the
+  result described a matrix nobody supplied. It now fails closed through the
+  same `_require_rectangular` check `mat_mul` and Cholesky use.
+- Geometric PMF boundary pinned: `geometric_pmf(0, p)` is 0 (no trial counted
+  1-based), and extreme `(k, p)` stays finite.
+- `poisson_pmf(0, 0)` is 1 and the log-space PMFs were probed at their
+  previously-crashing inputs; no remaining overflow class found in the
+  probability module.
+
 ## [v2.2.5] - 2026-10-12
+
 ### Housekeeping — audit hardening
 
 - Closes the findings of the full-repository audit: patched the concrete

{scientific_computing_system-2.2.5 → scientific_computing_system-2.2.6}/CITATION.cff

@@ -5,7 +5,7 @@ title: "scientific-computing-system"
 # Keep `version` in lockstep with pyproject.toml [project].version and
 # src/cds/_version.py. scripts/check_version_discipline.py and
 # scripts/check_version_lockstep.py enforce this.
-version: 2.2.5
+version: 2.2.6
 authors:
   - name: "Furox-Art"
     email: "furkanarkn1451@gmail.com"
@@ -50,5 +50,5 @@ preferred-citation:
   authors:
     - name: "Furox-Art"
   year: 2026
-  version: 2.2.5
+  version: 2.2.6
   url: "https://github.com/Furox-Art/scientific-computing-system"

{scientific_computing_system-2.2.5 → scientific_computing_system-2.2.6}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.5
 Name: scientific-computing-system
-Version: 2.2.5
+Version: 2.2.6
 Summary: A pure-Python computational science platform for numerical methods, modeling, validation, uncertainty, scientific workflows, dimensional analysis, and optional research-data backends. Zero runtime dependencies.
 Project-URL: Homepage, https://github.com/Furox-Art/scientific-computing-system
 Project-URL: Repository, https://github.com/Furox-Art/scientific-computing-system

{scientific_computing_system-2.2.5 → scientific_computing_system-2.2.6}/codemeta.json

@@ -2,7 +2,7 @@
   "@context": "https://doi.org/10.5063/schema/codemeta-2.0",
   "@type": "SoftwareSourceCode",
   "name": "scientific-computing-system",
-  "version": "2.2.5",
+  "version": "2.2.6",
   "description": "Pure-Python computational science platform for numerical methods, modeling, validation, uncertainty, and scientific workflows. Zero runtime dependencies. This is the front door; scientific-computing-system-2.0 is the NumPy build of the same work.",
   "license": "https://spdx.org/licenses/MIT",
   "codeRepository": "https://github.com/Furox-Art/scientific-computing-system",

{scientific_computing_system-2.2.5 → scientific_computing_system-2.2.6}/package.json

@@ -1,6 +1,6 @@
 {
   "name": "scientific-computing-system",
-  "version": "2.2.5",
+  "version": "2.2.6",
   "description": "Scientific Computing System launcher - a thin Node wrapper that forwards to the pure-Python `cds` CLI. This npm package ships NO Python code: it requires the Python distribution to be installed (`pip install scientific-computing-system`), otherwise `scs` exits non-zero with an actionable message.",
   "main": "index.js",
   "bin": {

{scientific_computing_system-2.2.5 → scientific_computing_system-2.2.6}/pyproject.toml

@@ -2,7 +2,7 @@
 # Distribution name. Formerly published as "cognitive-discovery-system";
 # the import name stays `cds`. Keep the old PyPI project alive as an alias.
 name = "scientific-computing-system"
-version = "2.2.5"
+version = "2.2.6"
 description = "A pure-Python computational science platform for numerical methods, modeling, validation, uncertainty, scientific workflows, dimensional analysis, and optional research-data backends. Zero runtime dependencies."
 readme = "README.md"
 license = "MIT"

{scientific_computing_system-2.2.5 → scientific_computing_system-2.2.6}/src/cds/_version.py

@@ -5,5 +5,5 @@ from __future__ import annotations
 
 __all__ = ["__version__", "version", "__version_tuple__", "version_tuple"]
 
-__version__ = version = "2.2.5"
+__version__ = version = "2.2.6"
 __version_tuple__ = version_tuple = (2, 2, 0)

{scientific_computing_system-2.2.5 → scientific_computing_system-2.2.6}/src/cds/math_utils/linalg.py

@@ -99,10 +99,17 @@ def mat_mul(a: Matrix, b: Matrix) -> Matrix:
 
 
 def transpose(m: Matrix) -> Matrix:
-    """Return the transpose of a 2-D matrix (rows <-> columns)."""
+    """Return the transpose of a 2-D matrix (rows <-> columns).
+
+    Ragged input used to be silently flattened to the leading row's width
+    (``[[1.0],[2.0,3.0]]`` became ``[[1.0, 2.0]]``): row 1's second entry
+    vanished and the result described a matrix nobody supplied. The shape
+    check is the same one mat_mul and Cholesky use.
+    """
     if not m:
         return []
-    return [[m[i][j] for i in range(len(m))] for j in range(len(m[0]))]
+    rows, cols = _require_rectangular(m, "matrix")
+    return [[m[i][j] for i in range(rows)] for j in range(cols)]
 
 
 def determinant(m: Matrix) -> float:

{scientific_computing_system-2.2.5 → scientific_computing_system-2.2.6}/tests/test_audit_hardening_c1.py

@@ -12,6 +12,7 @@ import math
 import pytest
 
 from cds.math_utils.linalg import Matrix, mat_mul, transpose
+from cds.probability.distributions import geometric_pmf
 
 
 def _reference_product(a: Matrix, b: Matrix) -> Matrix:
@@ -160,3 +161,40 @@ class TestMatMulTransposedProducts:
         assert mat_mul(a, eye) == a
         assert mat_mul(eye, a) == a
         assert mat_mul(transpose(a), a) == _reference_product(transpose(a), a)
+
+
+# --- second-round sweep: neighbouring shapes of the same defect class --------
+#
+# mat_mul and Cholesky reject ragged input since 2.2.5. transpose did not: it
+# indexed only the leading row's width, so a short row lost entries without a
+# sound. This pins the same contract for the remaining matrix entry point,
+# and for the geometric PMF's k=0 boundary.
+
+
+def test_transpose_rejects_ragged_matrix() -> None:
+    with pytest.raises(ValueError, match="ragged"):
+        transpose([[1.0], [2.0, 3.0]])
+
+
+def test_transpose_empty_matrix_returns_empty() -> None:
+    assert transpose([]) == []
+
+
+def test_transpose_rectangular_matrix() -> None:
+    assert transpose([[1.0, 2.0, 3.0]]) == [[1.0], [2.0], [3.0]]
+
+
+def test_transpose_preserves_all_entries() -> None:
+    matrix = [[1.0, 2.0], [3.0, 4.0]]
+    assert transpose(matrix) == [[1.0, 3.0], [2.0, 4.0]]
+
+
+def test_geometric_pmf_zero_trials_is_zero() -> None:
+    # k counts 1-based trials; k=0 has no trial and must be zero.
+    assert geometric_pmf(0, 0.5) == 0.0
+
+
+def test_geometric_pmf_extreme_probability_does_not_overflow() -> None:
+    value = geometric_pmf(5000, 0.001)
+    assert 0.0 < value < 1.0
+    assert math.isfinite(value)