rahuketu 0.1.0__tar.gz

rahuketu-0.1.0/.github/workflows/publish.yml

@@ -0,0 +1,23 @@
+name: Publish to PyPI
+
+on:
+  release:
+    types: [published]
+
+jobs:
+  publish:
+    runs-on: ubuntu-latest
+    permissions:
+      id-token: write
+      contents: read
+    steps:
+      - uses: actions/checkout@v4
+      - uses: actions/setup-python@v5
+        with:
+          python-version: "3.12"
+      - name: Build distributions
+        run: |
+          python -m pip install --upgrade build
+          python -m build
+      - name: Publish to PyPI
+        uses: pypa/gh-action-pypi-publish@release/v1

rahuketu-0.1.0/.gitignore

@@ -0,0 +1,12 @@
+__pycache__/
+*.py[cod]
+*.egg-info/
+.eggs/
+build/
+dist/
+.pytest_cache/
+.ruff_cache/
+.venv/
+venv/
+*.onnx
+*.pt

rahuketu-0.1.0/CITATION.cff

@@ -0,0 +1,14 @@
+cff-version: 1.2.0
+message: "If you use this software, please cite it as below."
+title: "rahuketu: a zero-free encoding framework"
+authors:
+  - family-names: Ramakrishnan
+    email: human@setc.dev
+    orcid: "https://orcid.org/0009-0006-0905-7275"
+version: 0.1.0
+license: Apache-2.0
+repository-code: "https://github.com/DecipherPunk/rahuketu"
+keywords:
+  - encoding
+  - bijective-numeration
+  - arithmetic-coding

rahuketu-0.1.0/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 2026 Ramakrishnan
+
+   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.

rahuketu-0.1.0/NOTICE

@@ -0,0 +1,14 @@
+rahuketu
+Copyright 2026 Ramakrishnan
+
+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
+
+Original Rahu-Ketu software framing and implementation by Ramakrishnan. This
+package uses classical signed and bijective numeration and arithmetic coding
+inside a zero-free log-space API. Those underlying methods are not claimed as
+new. The specific Rahu-Ketu framing and this implementation are original. No
+third-party source code is included.

rahuketu-0.1.0/PKG-INFO

@@ -0,0 +1,63 @@
+Metadata-Version: 2.4
+Name: rahuketu
+Version: 0.1.0
+Summary: Zero-free encoding framework: signed bijective numeration (Rahu) and arithmetic coding (Ketu).
+Project-URL: Homepage, https://github.com/DecipherPunk/rahuketu
+Author-email: Ramakrishnan <human@setc.dev>
+License-Expression: Apache-2.0
+License-File: LICENSE
+Keywords: arithmetic-coding,bijective-numeration,encoding,rahuketu
+Classifier: Intended Audience :: Science/Research
+Classifier: Programming Language :: Python :: 3
+Classifier: Topic :: Scientific/Engineering
+Requires-Python: >=3.10
+Provides-Extra: dev
+Requires-Dist: pytest; extra == 'dev'
+Requires-Dist: ruff; extra == 'dev'
+Description-Content-Type: text/markdown
+
+# rahuketu
+
+rahuketu is a small zero-free encoding package. It combines a signed bijective
+number path (Rahu) with an arithmetic-coding path (Ketu), and records both as a
+log-space trace. Pure Python, no dependencies.
+
+## Install
+
+```
+pip install rahuketu
+```
+
+## Usage
+
+```python
+from rahuketu import Alphabet, roundtrip, trace
+
+ab = Alphabet.lowercase()
+
+r = roundtrip("hello", ab)
+assert r["agrees"]            # encode -> decode is lossless
+
+steps = trace("hello", ab)
+last = steps[-1]
+print(last.tau, last.upsilon, last.redundancy)
+```
+
+## Components
+
+- `Alphabet` - no-zero symbol/digit mapping (digits in `[1, b]`).
+- `Rahu` - signed bijective numeration (`RahuState`, `rahu_encode`, `rahu_decode`).
+- `Ketu` - arithmetic coding as `(midpoint, scale)` (`KetuState`, `ketu_encode`, `ketu_decode`).
+- `trace` - records `(tau, upsilon, a)` over the input.
+- `roundtrip` - checks lossless encode/decode.
+
+## Provenance / AI assistance
+
+Built by Ramakrishnan (ORCID 0009-0006-0905-7275). Signed and bijective
+numeration and arithmetic coding are classical methods. The zero-free Rahu-Ketu
+framing and this implementation are original. AI tools helped with tests,
+automation, and QA. The idea and direction are the author's.
+
+## License
+
+Apache-2.0. See `LICENSE` and `NOTICE`.

rahuketu-0.1.0/README.md

@@ -0,0 +1,45 @@
+# rahuketu
+
+rahuketu is a small zero-free encoding package. It combines a signed bijective
+number path (Rahu) with an arithmetic-coding path (Ketu), and records both as a
+log-space trace. Pure Python, no dependencies.
+
+## Install
+
+```
+pip install rahuketu
+```
+
+## Usage
+
+```python
+from rahuketu import Alphabet, roundtrip, trace
+
+ab = Alphabet.lowercase()
+
+r = roundtrip("hello", ab)
+assert r["agrees"]            # encode -> decode is lossless
+
+steps = trace("hello", ab)
+last = steps[-1]
+print(last.tau, last.upsilon, last.redundancy)
+```
+
+## Components
+
+- `Alphabet` - no-zero symbol/digit mapping (digits in `[1, b]`).
+- `Rahu` - signed bijective numeration (`RahuState`, `rahu_encode`, `rahu_decode`).
+- `Ketu` - arithmetic coding as `(midpoint, scale)` (`KetuState`, `ketu_encode`, `ketu_decode`).
+- `trace` - records `(tau, upsilon, a)` over the input.
+- `roundtrip` - checks lossless encode/decode.
+
+## Provenance / AI assistance
+
+Built by Ramakrishnan (ORCID 0009-0006-0905-7275). Signed and bijective
+numeration and arithmetic coding are classical methods. The zero-free Rahu-Ketu
+framing and this implementation are original. AI tools helped with tests,
+automation, and QA. The idea and direction are the author's.
+
+## License
+
+Apache-2.0. See `LICENSE` and `NOTICE`.

rahuketu-0.1.0/pyproject.toml

@@ -0,0 +1,32 @@
+[build-system]
+requires = ["hatchling"]
+build-backend = "hatchling.build"
+
+[project]
+name = "rahuketu"
+version = "0.1.0"
+description = "Zero-free encoding framework: signed bijective numeration (Rahu) and arithmetic coding (Ketu)."
+readme = "README.md"
+requires-python = ">=3.10"
+license = "Apache-2.0"
+license-files = ["LICENSE"]
+authors = [{ name = "Ramakrishnan", email = "human@setc.dev" }]
+keywords = ["encoding", "bijective-numeration", "arithmetic-coding", "rahuketu"]
+classifiers = [
+  "Programming Language :: Python :: 3",
+  "Intended Audience :: Science/Research",
+  "Topic :: Scientific/Engineering",
+]
+dependencies = []
+
+[project.optional-dependencies]
+dev = ["pytest", "ruff"]
+
+[project.urls]
+Homepage = "https://github.com/DecipherPunk/rahuketu"
+
+[tool.hatch.build.targets.wheel]
+packages = ["src/rahuketu"]
+
+[tool.ruff]
+line-length = 100

rahuketu-0.1.0/requirements-dev.txt

@@ -0,0 +1,6 @@
+iniconfig==2.3.0
+packaging==26.2
+pluggy==1.6.0
+Pygments==2.20.0
+pytest==9.1.1
+ruff==0.15.18

rahuketu-0.1.0/src/rahuketu/__init__.py

@@ -0,0 +1,26 @@
+"""RahuKetu: a zero-free encoding framework.
+
+Signed bijective numeration (Rahu, ascending) and arithmetic coding
+(Ketu, descending), unified by a (tau, upsilon, a) log-space trajectory.
+"""
+
+from .alphabet import Alphabet
+from .ketu import KetuState, cdf, ketu_decode, ketu_encode
+from .rahu import RahuState, rahu_decode, rahu_encode
+from .trace import Step, roundtrip, trace
+
+__version__ = "0.1.0"
+
+__all__ = [
+    "Alphabet",
+    "RahuState",
+    "rahu_encode",
+    "rahu_decode",
+    "KetuState",
+    "ketu_encode",
+    "ketu_decode",
+    "cdf",
+    "Step",
+    "trace",
+    "roundtrip",
+]

rahuketu-0.1.0/src/rahuketu/alphabet.py

@@ -0,0 +1,28 @@
+"""No-zero alphabet: maps symbols to digits in [1, b]."""
+
+from __future__ import annotations
+
+from typing import Iterable
+
+
+class Alphabet:
+    def __init__(self, symbols: Iterable[str]):
+        syms = list(symbols)
+        if not syms:
+            raise ValueError("alphabet cannot be empty")
+        if len(set(syms)) != len(syms):
+            raise ValueError("alphabet symbols must be unique")
+        self.symbols = syms
+        self.b = len(syms)
+        self._to_digit = {s: i + 1 for i, s in enumerate(syms)}
+        self._to_symbol = {i + 1: s for i, s in enumerate(syms)}
+
+    def to_digits(self, s: str) -> list[int]:
+        return [self._to_digit[c] for c in s]
+
+    def from_digits(self, digits: Iterable[int]) -> str:
+        return "".join(self._to_symbol[d] for d in digits)
+
+    @classmethod
+    def lowercase(cls) -> "Alphabet":
+        return cls([chr(ord("a") + i) for i in range(26)])

rahuketu-0.1.0/src/rahuketu/ketu.py

@@ -0,0 +1,97 @@
+"""Ketu: descending arithmetic coding as (midpoint, scale). Zero-free interval."""
+
+from __future__ import annotations
+
+import math
+from dataclasses import dataclass
+from fractions import Fraction
+
+
+@dataclass(frozen=True)
+class KetuState:
+    midpoint: Fraction
+    scale: Fraction
+
+    @classmethod
+    def initial(cls) -> "KetuState":
+        return cls(midpoint=Fraction(1, 2), scale=Fraction(1))
+
+    def step(self, digit: int, table: list[Fraction]) -> "KetuState":
+        if not (1 <= digit < len(table)):
+            raise ValueError(f"digit {digit} outside [1,{len(table) - 1}]")
+        w = self.scale
+        low = self.midpoint - w / 2
+        new_low = low + w * table[digit - 1]
+        new_scale = w * (table[digit] - table[digit - 1])
+        new_midpoint = new_low + new_scale / 2
+        return KetuState(midpoint=new_midpoint, scale=new_scale)
+
+    @property
+    def low(self) -> Fraction:
+        return self.midpoint - self.scale / 2
+
+    @property
+    def high(self) -> Fraction:
+        return self.midpoint + self.scale / 2
+
+    @property
+    def width(self) -> Fraction:
+        return self.scale
+
+    @property
+    def upsilon(self) -> float:
+        """Shrink-as-growth coordinate: -log2 of scale. Finite, positive after step 1.
+
+        Computed as log2(den) - log2(num) on the exact Fraction. math.log2 accepts
+        big ints, so this stays valid for long sequences where float(scale) would
+        underflow to 0.0 (and -log2(0.0) is undefined)."""
+        return math.log2(self.scale.denominator) - math.log2(self.scale.numerator)
+
+
+def cdf(probs: list[Fraction]) -> list[Fraction]:
+    out = [Fraction(0)] * (len(probs) + 1)
+    for i, p in enumerate(probs):
+        if p <= 0:
+            raise ValueError("probabilities must be strictly positive (no zero)")
+        out[i + 1] = out[i] + p
+    if out[-1] != 1:
+        raise ValueError(f"probabilities must sum to 1, got {out[-1]}")
+    return out
+
+
+def ketu_encode(digits: list[int], probs: list[Fraction], sigma: int = +1) -> KetuState:
+    """Encode digits into a Ketu interval. sigma=-1 processes right-to-left."""
+    if sigma not in (-1, +1):
+        raise ValueError("sigma must be +1 or -1 (no zero)")
+    table = cdf(probs)
+    b = len(probs)
+    stream = digits if sigma == +1 else list(reversed(digits))
+    state = KetuState.initial()
+    for d in stream:
+        if not (1 <= d <= b):
+            raise ValueError(f"digit {d} outside [1,{b}]")
+        state = state.step(d, table)
+    return state
+
+
+def ketu_decode(point: Fraction, length: int, probs: list[Fraction], sigma: int = +1) -> list[int]:
+    """Recover digits in original order from a point inside the interval."""
+    if sigma not in (-1, +1):
+        raise ValueError("sigma must be +1 or -1 (no zero)")
+    table = cdf(probs)
+    b = len(probs)
+    state = KetuState.initial()
+    decoded: list[int] = []
+    for _ in range(length):
+        w = state.scale
+        low = state.low
+        for d in range(1, b + 1):
+            lo_d = low + w * table[d - 1]
+            hi_d = low + w * table[d]
+            if lo_d <= point < hi_d:
+                decoded.append(d)
+                state = state.step(d, table)
+                break
+        else:
+            raise ValueError(f"point {point} outside the current interval")
+    return decoded if sigma == +1 else list(reversed(decoded))

rahuketu-0.1.0/src/rahuketu/rahu.py

@@ -0,0 +1,71 @@
+"""Rahu: ascending signed bijective numeration. Zero-free integer state."""
+
+from __future__ import annotations
+
+import math
+from dataclasses import dataclass
+
+
+@dataclass(frozen=True)
+class RahuState:
+    magnitude: int
+    sigma: int
+    length: int
+
+    @classmethod
+    def seed(cls, digit: int, sigma: int) -> "RahuState":
+        if sigma not in (-1, +1):
+            raise ValueError("sigma must be +1 or -1 (no zero)")
+        if digit < 1:
+            raise ValueError("digit must be >= 1 (no zero)")
+        return cls(magnitude=digit, sigma=sigma, length=1)
+
+    def step(self, digit: int, b: int) -> "RahuState":
+        if not (1 <= digit <= b):
+            raise ValueError(f"digit {digit} outside [1,{b}]")
+        return RahuState(
+            magnitude=self.magnitude * b + digit,
+            sigma=self.sigma,
+            length=self.length + 1,
+        )
+
+    @property
+    def signed_value(self) -> int:
+        return self.sigma * self.magnitude
+
+    @property
+    def tau(self) -> float:
+        """Growth coordinate: log2 of magnitude. Finite, strictly positive."""
+        return math.log2(self.magnitude)
+
+
+def rahu_encode(digits: list[int], b: int, sigma: int = +1) -> int:
+    if b < 1:
+        raise ValueError("base must be >= 1")
+    if not digits:
+        raise ValueError("empty string has no bijective encoding")
+    for d in digits:
+        if not (1 <= d <= b):
+            raise ValueError(f"digit {d} outside [1,{b}]")
+    state = RahuState.seed(digits[0], sigma)
+    for d in digits[1:]:
+        state = state.step(d, b)
+    return state.signed_value
+
+
+def rahu_decode(n: int, b: int) -> tuple[list[int], int]:
+    if b < 1:
+        raise ValueError("base must be >= 1")
+    if n == 0:
+        raise ValueError("0 is not in the image of rahu_encode")
+    sigma = 1 if n > 0 else -1
+    x = abs(n)
+    digits: list[int] = []
+    while x > 0:
+        x, r = divmod(x, b)
+        if r == 0:  # bijective base-b: remainder 0 maps to digit b, borrow 1
+            r = b
+            x -= 1
+        digits.append(r)
+    digits.reverse()
+    return digits, sigma

rahuketu-0.1.0/src/rahuketu/trace.py

@@ -0,0 +1,135 @@
+"""Compound map: the (tau, upsilon, a) log-space trajectory and roundtrip."""
+
+from __future__ import annotations
+
+import math
+from dataclasses import dataclass
+from fractions import Fraction
+
+from .alphabet import Alphabet
+from .ketu import KetuState, cdf, ketu_decode, ketu_encode
+from .rahu import RahuState, rahu_decode, rahu_encode
+
+
+@dataclass
+class Step:
+    k: int
+    symbol: str
+    digit: int
+    rahu_value: int
+    tau: float
+    upsilon: float
+    a: float
+    ketu_midpoint: Fraction
+    ketu_scale: Fraction
+
+    @property
+    def ketu_low(self) -> Fraction:
+        return self.ketu_midpoint - self.ketu_scale / 2
+
+    @property
+    def ketu_high(self) -> Fraction:
+        return self.ketu_midpoint + self.ketu_scale / 2
+
+    @property
+    def ketu_width(self) -> Fraction:
+        return self.ketu_scale
+
+    @property
+    def redundancy(self) -> float:
+        """tau - upsilon: cumulative redundancy of bijective vs arithmetic coding."""
+        return self.tau - self.upsilon
+
+
+def trace(
+    s: str,
+    alphabet: Alphabet,
+    probs: list[Fraction] | None = None,
+    sigma_rahu: int = +1,
+    sigma_ketu: int = +1,
+) -> list[Step]:
+    """Per-step (tau, upsilon, a) trajectory.
+
+    Rahu always advances in forward string order, so each Step's symbol/digit/
+    rahu_value/tau are forward-indexed. With sigma_ketu=-1 the Ketu stream is
+    processed in reverse, so that step's a (info term) and upsilon refer to the
+    reverse-order position, NOT the same original index as the Rahu fields. With
+    the default sigma_ketu=+1 the two align.
+    """
+    if sigma_rahu not in (-1, +1) or sigma_ketu not in (-1, +1):
+        raise ValueError("sigmas must be +1 or -1 (no zero)")
+    if not s:
+        raise ValueError("empty string has no trajectory")
+    digits = alphabet.to_digits(s)
+    b = alphabet.b
+    if probs is None:
+        probs = [Fraction(1, b)] * b
+    if len(probs) != b:
+        raise ValueError("probs length must match alphabet size")
+    table = cdf(probs)
+
+    ketu_stream = digits if sigma_ketu == +1 else list(reversed(digits))
+    rahu = RahuState.seed(digits[0], sigma_rahu)
+    ketu = KetuState.initial().step(ketu_stream[0], table)
+    log2_b = math.log2(b)
+
+    def info(digit: int) -> float:
+        return -math.log2(float(probs[digit - 1])) / log2_b
+
+    def snapshot(k: int, sym: str, d_rahu: int, d_ketu: int) -> Step:
+        return Step(
+            k=k,
+            symbol=sym,
+            digit=d_rahu,
+            rahu_value=rahu.signed_value,
+            tau=rahu.tau,
+            upsilon=ketu.upsilon,
+            a=info(d_ketu),
+            ketu_midpoint=ketu.midpoint,
+            ketu_scale=ketu.scale,
+        )
+
+    steps = [snapshot(1, s[0], digits[0], ketu_stream[0])]
+    for k, ((sym, d_rahu), d_ketu) in enumerate(
+        zip(zip(s[1:], digits[1:]), ketu_stream[1:]), start=2
+    ):
+        rahu = rahu.step(d_rahu, b)
+        ketu = ketu.step(d_ketu, table)
+        steps.append(snapshot(k, sym, d_rahu, d_ketu))
+    return steps
+
+
+def roundtrip(
+    s: str,
+    alphabet: Alphabet,
+    probs: list[Fraction] | None = None,
+    sigma_rahu: int = +1,
+    sigma_ketu: int = +1,
+) -> dict:
+    digits = alphabet.to_digits(s)
+    b = alphabet.b
+
+    n = rahu_encode(digits, b, sigma=sigma_rahu)
+    rahu_digits, sigma_back = rahu_decode(n, b)
+    rahu_s = alphabet.from_digits(rahu_digits)
+
+    if probs is None:
+        probs = [Fraction(1, b)] * b
+    ketu_state = ketu_encode(digits, probs, sigma=sigma_ketu)
+    ketu_digits = ketu_decode(ketu_state.midpoint, len(digits), probs, sigma=sigma_ketu)
+    ketu_s = alphabet.from_digits(ketu_digits)
+
+    return {
+        "input": s,
+        "rahu_integer": n,
+        "rahu_decoded": rahu_s,
+        "rahu_sigma_recovered": sigma_back,
+        "ketu_interval": (ketu_state.low, ketu_state.high),
+        "ketu_width": ketu_state.width,
+        "ketu_midpoint": ketu_state.midpoint,
+        "ketu_decoded": ketu_s,
+        "tau_final": math.log2(abs(n)),
+        "upsilon_final": (math.log2(ketu_state.scale.denominator)
+                          - math.log2(ketu_state.scale.numerator)),
+        "agrees": rahu_s == s and ketu_s == s and sigma_back == sigma_rahu,
+    }

rahuketu-0.1.0/tests/test_core.py

@@ -0,0 +1,201 @@
+import math
+from fractions import Fraction
+
+import pytest
+
+from rahuketu import (
+    Alphabet,
+    KetuState,
+    RahuState,
+    Step,
+    cdf,
+    ketu_decode,
+    ketu_encode,
+    rahu_decode,
+    rahu_encode,
+    roundtrip,
+    trace,
+)
+
+
+def test_alphabet_lowercase_mapping_is_one_based_and_roundtrips():
+    ab = Alphabet.lowercase()
+    assert ab.b == 26
+    assert ab.to_digits("az") == [1, 26]
+    assert ab.from_digits([1, 26]) == "az"
+    assert ab.from_digits(ab.to_digits("rahuketu")) == "rahuketu"
+
+
+def test_alphabet_rejects_empty_and_duplicate_symbols():
+    with pytest.raises(ValueError):
+        Alphabet([])
+    with pytest.raises(ValueError):
+        Alphabet(["a", "a"])
+
+
+def test_alphabet_rejects_unknown_symbol_or_digit():
+    ab = Alphabet.lowercase()
+    with pytest.raises(KeyError):
+        ab.to_digits("A")
+    with pytest.raises(KeyError):
+        ab.from_digits([0])
+    with pytest.raises(KeyError):
+        ab.from_digits([27])
+
+
+def test_rahu_state_seed_step_tau_and_signed_value():
+    state = RahuState.seed(2, -1)
+    assert state.magnitude == 2
+    assert state.sigma == -1
+    assert state.length == 1
+    assert state.signed_value == -2
+    assert state.tau == math.log2(2)
+    state = state.step(3, 10)
+    assert state.magnitude == 23
+    assert state.sigma == -1
+    assert state.length == 2
+    assert state.signed_value == -23
+
+
+def test_rahu_state_rejects_zero_and_invalid_sigma():
+    with pytest.raises(ValueError):
+        RahuState.seed(0, 1)
+    with pytest.raises(ValueError):
+        RahuState.seed(1, 0)
+    with pytest.raises(ValueError):
+        RahuState.seed(1, 2)
+    with pytest.raises(ValueError):
+        RahuState.seed(1, 1).step(0, 10)
+    with pytest.raises(ValueError):
+        RahuState.seed(1, 1).step(11, 10)
+
+
+def test_rahu_encode_decode_roundtrip_positive_negative_and_boundary_digits():
+    for digits in ([1], [26], [1, 26], [26, 26], [18, 1, 8, 21]):
+        n = rahu_encode(list(digits), 26)
+        back, sigma = rahu_decode(n, 26)
+        assert back == list(digits)
+        assert sigma == 1
+        n = rahu_encode(list(digits), 26, sigma=-1)
+        back, sigma = rahu_decode(n, 26)
+        assert back == list(digits)
+        assert sigma == -1
+
+
+def test_rahu_encode_decode_rejects_invalid_values():
+    with pytest.raises(ValueError):
+        rahu_encode([], 26)
+    with pytest.raises(ValueError):
+        rahu_decode(0, 26)
+    with pytest.raises(ValueError):
+        rahu_encode([0], 26)
+    with pytest.raises(ValueError):
+        rahu_encode([27], 26)
+    with pytest.raises(ValueError):
+        rahu_encode([1], 26, sigma=0)
+    with pytest.raises(ValueError):
+        rahu_decode(1, 0)
+
+
+def test_cdf_builds_exact_distribution_and_rejects_invalid_probabilities():
+    probs = [Fraction(1, 4)] * 4
+    assert cdf(probs) == [Fraction(0), Fraction(1, 4), Fraction(1, 2), Fraction(3, 4), Fraction(1)]
+    with pytest.raises(ValueError):
+        cdf([Fraction(0), Fraction(1)])
+    with pytest.raises(ValueError):
+        cdf([Fraction(1, 3), Fraction(1, 3)])
+
+
+def test_ketu_initial_state_and_step_interval_properties():
+    table = cdf([Fraction(1, 2), Fraction(1, 2)])
+    state = KetuState.initial()
+    assert state.midpoint == Fraction(1, 2)
+    assert state.scale == Fraction(1)
+    assert state.low == Fraction(0)
+    assert state.high == Fraction(1)
+    assert state.width == Fraction(1)
+    state = state.step(2, table)
+    assert state.low == Fraction(1, 2)
+    assert state.high == Fraction(1)
+    assert state.midpoint == Fraction(3, 4)
+    assert state.scale == Fraction(1, 2)
+    assert state.width == Fraction(1, 2)
+    assert state.upsilon == 1.0
+    with pytest.raises(ValueError):
+        state.step(0, table)
+    with pytest.raises(ValueError):
+        state.step(3, table)
+
+
+def test_ketu_encode_decode_uniform_and_skewed_roundtrip():
+    uniform = [Fraction(1, 4)] * 4
+    assert ketu_decode(ketu_encode([1, 4, 2], uniform).midpoint, 3, uniform) == [1, 4, 2]
+    skewed = [Fraction(1, 2), Fraction(1, 4), Fraction(1, 8), Fraction(1, 8)]
+    encoded = ketu_encode([1, 2, 4, 3], skewed)
+    assert ketu_decode(encoded.midpoint, 4, skewed) == [1, 2, 4, 3]
+    assert encoded.low < encoded.midpoint < encoded.high
+
+
+def test_ketu_sigma_minus_processes_reverse_stream_but_decodes_original_order():
+    probs = [Fraction(1, 4)] * 4
+    digits = [1, 2, 3, 4]
+    fwd = ketu_encode(digits, probs, sigma=1)
+    rev = ketu_encode(digits, probs, sigma=-1)
+    assert fwd.midpoint != rev.midpoint
+    assert ketu_decode(rev.midpoint, len(digits), probs, sigma=-1) == digits
+
+
+def test_ketu_rejects_invalid_sigma_digit_and_outside_point():
+    probs = [Fraction(1, 2), Fraction(1, 2)]
+    with pytest.raises(ValueError):
+        ketu_encode([1], probs, sigma=0)
+    with pytest.raises(ValueError):
+        ketu_decode(Fraction(1, 2), 1, probs, sigma=0)
+    with pytest.raises(ValueError):
+        ketu_encode([3], probs)
+    with pytest.raises(ValueError):
+        ketu_decode(Fraction(2), 1, probs)
+
+
+def test_trace_reports_one_step_per_symbol_and_roundtrip_agrees():
+    ab = Alphabet.lowercase()
+    steps = trace("hello", ab)
+    assert len(steps) == 5
+    assert isinstance(steps[0], Step)
+    assert [s.k for s in steps] == [1, 2, 3, 4, 5]
+    assert [s.symbol for s in steps] == list("hello")
+    assert [s.digit for s in steps] == ab.to_digits("hello")
+    assert steps[-1].ketu_low < steps[-1].ketu_midpoint < steps[-1].ketu_high
+    assert steps[-1].ketu_width == steps[-1].ketu_scale
+    assert steps[-1].redundancy == pytest.approx(steps[-1].tau - steps[-1].upsilon)
+    assert roundtrip("hello", ab)["agrees"]
+
+
+def test_trace_supports_nonuniform_information_coordinate():
+    ab = Alphabet(["a", "b"])
+    probs = [Fraction(3, 4), Fraction(1, 4)]
+    steps = trace("ab", ab, probs=probs)
+    assert steps[0].a == pytest.approx(-math.log2(3 / 4) / math.log2(2))
+    assert steps[1].a == pytest.approx(2.0)
+
+
+def test_trace_and_roundtrip_respect_sigma_choices():
+    ab = Alphabet.lowercase()
+    rt = roundtrip("abc", ab, sigma_rahu=-1, sigma_ketu=-1)
+    assert rt["agrees"]
+    assert rt["rahu_integer"] < 0
+    assert rt["rahu_sigma_recovered"] == -1
+    steps = trace("abc", ab, sigma_rahu=-1, sigma_ketu=-1)
+    assert all(s.rahu_value < 0 for s in steps)
+
+
+def test_trace_rejects_invalid_inputs():
+    ab = Alphabet.lowercase()
+    with pytest.raises(ValueError):
+        trace("", ab)
+    with pytest.raises(ValueError):
+        trace("a", ab, sigma_rahu=0)
+    with pytest.raises(ValueError):
+        trace("a", ab, sigma_ketu=0)
+    with pytest.raises(ValueError):
+        trace("a", ab, probs=[Fraction(1)])