padic-ml 0.0.1__tar.gz

padic_ml-0.0.1/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.

padic_ml-0.0.1/PKG-INFO

@@ -0,0 +1,51 @@
+Metadata-Version: 2.4
+Name: padic-ml
+Version: 0.0.1
+Summary: JAX library for differentiable training of p-adic neural networks
+Author: Padic ML Authors
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/google-deepmind/padic-ml
+Project-URL: Repository, https://github.com/google-deepmind/padic-ml
+Keywords: jax,p-adic,berkovich,machine learning,optimization
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: Programming Language :: Python :: 3
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: jax
+Requires-Dist: jaxtyping
+Requires-Dist: sympy
+Provides-Extra: test
+Requires-Dist: absl-py; extra == "test"
+Requires-Dist: numpy; extra == "test"
+Dynamic: license-file
+
+# padic-ml
+
+**WORK IN PROGRESS. Paper code is being refactored into this library.
+Thanks for your patience!**
+
+This is a JAX library for differentiable training of _p_-adic neural networks,
+implementing methods described in *Continuous Optimization for p-adic Models*
+(arXiv 2026).
+
+Install with `pip install padic-ml`.
+
+**Disclaimer:** This is not an officially supported Google product.
+
+## Usage
+
+`PArray` is an array primitive for "learnable" _p_-adic numbers (points in the _p_-adic injective hull $\Gamma_p$ in Berkovich space).
+
+With radius 0 (no second argument), these become ordinary _p_-adic numbers $\mathbb{Q}_p$.
+
+```python
+>>> import padic_ml as pml
+>>> p1 = pml.array([3, 4], radius=[1, 3], p=3)
+>>> p2 = pml.array([7, 1], p=3)
+>>> p1*p2
+PArray(unit=Array([7, 4], dtype=int32), valuation=Array([1, 0], dtype=int32), log_radius=Array([0., 1.], dtype=float32), p=3)
+```

padic_ml-0.0.1/README.md

@@ -0,0 +1,26 @@
+# padic-ml
+
+**WORK IN PROGRESS. Paper code is being refactored into this library.
+Thanks for your patience!**
+
+This is a JAX library for differentiable training of _p_-adic neural networks,
+implementing methods described in *Continuous Optimization for p-adic Models*
+(arXiv 2026).
+
+Install with `pip install padic-ml`.
+
+**Disclaimer:** This is not an officially supported Google product.
+
+## Usage
+
+`PArray` is an array primitive for "learnable" _p_-adic numbers (points in the _p_-adic injective hull $\Gamma_p$ in Berkovich space).
+
+With radius 0 (no second argument), these become ordinary _p_-adic numbers $\mathbb{Q}_p$.
+
+```python
+>>> import padic_ml as pml
+>>> p1 = pml.array([3, 4], radius=[1, 3], p=3)
+>>> p2 = pml.array([7, 1], p=3)
+>>> p1*p2
+PArray(unit=Array([7, 4], dtype=int32), valuation=Array([1, 0], dtype=int32), log_radius=Array([0., 1.], dtype=float32), p=3)
+```

padic_ml-0.0.1/padic_ml/__init__.py

@@ -0,0 +1,31 @@
+# Copyright 2026 Google LLC
+#
+# 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.
+
+"""padic_ml: continuous p-adic optimization on Berkovich spaces."""
+
+from padic_ml import _array
+from padic_ml import ops
+
+__version__ = '0.0.1'
+
+PArray = _array.PArray
+array = _array.array
+asarray = _array.asarray
+
+__all__ = [
+    'PArray',
+    'array',
+    'asarray',
+    'ops',
+]

padic_ml-0.0.1/padic_ml/_array.py

@@ -0,0 +1,284 @@
+# Copyright 2026 Google LLC
+#
+# 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.
+
+"""Data structures for Berkovich space representation and auto-diff."""
+
+from __future__ import annotations
+
+import dataclasses
+import functools
+
+import jax
+import jax.numpy as jnp
+import jaxtyping as jt
+import sympy
+
+
+@functools.cache
+def _is_prime(p: int) -> bool:
+  """Cached primality check using sympy.isprime."""
+  return bool(sympy.isprime(p))
+
+
+def _matching_float_dtype(int_dtype: jnp.dtype) -> jnp.dtype:
+  """Returns the floating-point dtype of equal bitwidth to an integer dtype."""
+  return jnp.dtype(f'float{int_dtype.itemsize * 8}')
+
+
+class IntOperand:
+  """Union type alias for int | jt.Int[jt.Array, Shape].
+
+  Usage:
+    IntOperand['*N']   -> int | jt.Int[jt.Array, '*N']
+    IntOperand['*#N']  -> int | jt.Int[jt.Array, '*#N']
+    IntOperand['...']  -> int | jt.Int[jt.Array, '...']
+  """
+
+  def __class_getitem__(cls, shape):
+    return int | jt.Int[jt.Array, shape]
+
+
+class FloatOperand:
+  """Union type alias for float | jt.Float[jt.Array, Shape].
+
+  Usage:
+    FloatOperand['*N']   -> float | jt.Float[jt.Array, '*N']
+    FloatOperand['*#N']  -> float | jt.Float[jt.Array, '*#N']
+    FloatOperand['...']  -> float | jt.Float[jt.Array, '...']
+  """
+
+  def __class_getitem__(cls, shape):
+    return float | jt.Float[jt.Array, shape]
+
+
+@functools.partial(
+    jax.tree_util.register_dataclass,
+    data_fields=('unit', 'valuation', 'log_radius'),
+    meta_fields=('p',),
+)
+@dataclasses.dataclass(eq=False, frozen=True, kw_only=True)
+class PArray:
+  """DO NOT INIT DIRECTLY; use `(as)array()`. Array of 'continuous' p-adics.
+
+  These are elements zeta_{unit * p^valuation, p^log_radius} of the p-adic
+  convex hull of Qp. In a normalized (unit, valuation) pair, unit is coprime to
+  p, or (0,0) if c = 0, such that c = unit * p^valuation. Details on this
+  representation:
+  https://doc.sagemath.org/html/en/reference/padics/sage/rings/padics/tutorial.html#terminology-and-types-of-p-adics
+  https://flintlib.org/doc/padic.html
+
+  NOTE: With integer units, we can only represent Z[1/p] in Qp exactly. However,
+  this set is dense, so for non-zero radii, we can choose the center to be in
+  Z[1/p].
+
+  Attributes:
+    unit: Integer unit representative coprime to p (or 0 if center is 0). int.
+    valuation: Exact p-adic valuation v_p(c) (or 0 if center is 0). int.
+    log_radius: Log-radius of the disk. float.
+    p: Prime base p.
+  """
+
+  unit: jt.Int[jt.Array, '*N']
+  valuation: jt.Int[jt.Array, '*N']
+  log_radius: jt.Float[jt.Array, '*N']
+  p: int
+
+  @property
+  def center(self) -> jt.Int[jt.Array, '*N']:
+    """Reconstructs the integer center u * p^v. Requires valuation >= 0."""
+    p_pow = jnp.asarray(self.p, dtype=self.unit.dtype) ** jnp.maximum(
+        0, self.valuation
+    )
+    return self.unit * p_pow
+
+  # The below two properties (shape and dtype) give a duck-typed array for JAX
+  # typing. See: https://docs.kidger.site/jaxtyping/api/array/#array
+
+  @property
+  def shape(self) -> tuple[int, ...]:
+    """Returns the shape of the array."""
+    return self.unit.shape
+
+  @property
+  def dtype(self) -> jnp.dtype:
+    """Returns the data type of the unit array."""
+    return self.unit.dtype
+
+  # Imports of ops are inside the functions to avoid circular dependency.
+  #
+  # We do not add shape annotations for these wrappers, as such annotations only
+  # get used in runtime type checking. We consolidate those in `ops`. Also see
+  # warning which discourages strings or from __future__ import annotations as
+  # array terms of the jt type annotation.
+  # https://docs.kidger.site/jaxtyping/api/runtime-type-checking/.
+  #
+  # pylint: disable=g-import-not-at-top
+
+  def __add__(self, other: PArray | IntOperand['...']) -> PArray:
+    from padic_ml import ops
+
+    return ops.add(self, other)
+
+  def __radd__(self, other: PArray | IntOperand['...']) -> PArray:
+    return self.__add__(other)
+
+  def __mul__(self, other: PArray | IntOperand['...']) -> PArray:
+    from padic_ml import ops
+
+    return ops.mul(self, other)
+
+  def __rmul__(self, other: PArray | IntOperand['...']) -> PArray:
+    return self.__mul__(other)
+
+  def __neg__(self) -> PArray:
+    from padic_ml import ops
+
+    return ops.neg(self)
+
+  def __pow__(self, power: int) -> PArray:
+    from padic_ml import ops
+
+    return ops.power(self, power)
+
+  def __sub__(self, other: PArray | IntOperand['...']) -> PArray:
+    from padic_ml import ops
+
+    return ops.sub(self, other)
+
+  def abs(self) -> jax.Array:
+    from padic_ml import ops
+
+    return ops.absolute(self)
+
+  def is_padic(self) -> jax.Array:
+    from padic_ml import ops
+
+    return ops.is_padic(self)
+
+  # pylint: enable=g-import-not-at-top
+
+
+def array(
+    center: IntOperand['*N'] | None = None,
+    radius: FloatOperand['*#N'] | None = None,
+    *,
+    p: int,
+    log_radius: FloatOperand['*#N'] | None = None,
+    unit: IntOperand['*N'] | None = None,
+    valuation: IntOperand['*#N'] | None = None,
+) -> PArray:
+  """Constructs a PArray, validating and canonicalizing its arguments.
+
+  This is the eager entry point for building a PArray, analogous to `jnp.array`.
+  All validation and casework lives here rather than in `PArray.__init__`, which
+  must stay free of logic because JAX calls it to rebuild the pytree on every
+  transformation boundary.
+
+  Supported invocation modes:
+    1. From an integer center:
+       `array(center, radius=None, *, p, log_radius=None)`
+    2. From pre-decomposed unit and valuation (e.g. elements of Z[1/p]):
+       `array(radius=None, *, p, log_radius=None, unit=..., valuation=...)`
+
+  Args:
+    center: Integer center of the disk, u * p^v. If provided, unit and valuation
+      are computed automatically via `decompose(center, p)`.
+    radius: Non-negative radius r = p^log_radius of the disk. Mutually exclusive
+      with `log_radius`. Converted internally to `log_radius`.
+    p: Prime base p (must be a prime integer >= 2).
+    log_radius: Log-radius of the disk (base p). Defaults to -inf (a strictly
+      p-adic point) if both `radius` and `log_radius` are omitted.
+    unit: Integer unit representative coprime to p (or 0 if center is 0). Must
+      be provided together with `valuation` when `center` is omitted.
+    valuation: Exact p-adic valuation v_p(c) (or 0 if center is 0). Must be
+      provided together with `unit` when `center` is omitted.
+
+  Returns:
+    A PArray in canonical (unit, valuation, log_radius) form.
+
+  Raises:
+    ValueError: If p is not prime, if both `radius` and `log_radius` are given,
+      if `radius` is negative, if the integer arguments are not of integer
+      dtype, or if neither `center` nor `(unit, valuation)` is provided.
+  """
+  if p < 2 or not _is_prime(p):
+    raise ValueError(f'Prime base p must be a prime >= 2, got {p}.')
+  if radius is not None and log_radius is not None:
+    raise ValueError('Cannot specify both radius and log_radius.')
+
+  # Resolve the canonical (unit, valuation) pair.
+  if unit is not None and valuation is not None:
+    u = jnp.asarray(unit)
+    v = jnp.asarray(valuation)
+    if not jnp.issubdtype(u.dtype, jnp.integer):
+      raise ValueError(f'unit must have integer dtype, got {u.dtype}.')
+    if not jnp.issubdtype(v.dtype, jnp.integer):
+      raise ValueError(f'valuation must have integer dtype, got {v.dtype}.')
+    # Zero has no valuation; pin it to 0 so equal values compare equal.
+    v = jnp.broadcast_to(jnp.where(u == 0, 0, v), u.shape)
+  elif center is not None:
+    c = jnp.asarray(center)
+    if not jnp.issubdtype(c.dtype, jnp.integer):
+      raise ValueError(f'center must have integer dtype, got {c.dtype}.')
+    # Deferred to break the _array <-> ops cycle, as in the PArray operator
+    # methods above.
+    from padic_ml import ops  # pylint: disable=g-import-not-at-top
+
+    u, v = ops.decompose(c, p)
+  else:
+    raise ValueError('Either center or (unit, valuation) must be provided.')
+
+  # Resolve the log-radius, matching the bitwidth of the integer payload so that
+  # 32-bit inputs do not silently incur 64-bit intermediates under jit.
+  float_dtype = _matching_float_dtype(u.dtype)
+  if log_radius is not None:
+    r = jnp.asarray(log_radius, dtype=float_dtype)
+  elif radius is not None:
+    rad = jnp.asarray(radius, dtype=float_dtype)
+    if jnp.any(rad < 0):
+      raise ValueError('Radius must be non-negative.')
+    log_p = jnp.log(jnp.asarray(p, dtype=float_dtype))
+    r = jnp.where(
+        rad == 0,
+        jnp.asarray(-jnp.inf, dtype=float_dtype),
+        jnp.log(rad) / log_p,
+    )
+  else:
+    r = jnp.full(u.shape, -jnp.inf, dtype=float_dtype)
+
+  return PArray(
+      unit=u, valuation=v, log_radius=jnp.broadcast_to(r, u.shape), p=p
+  )
+
+
+@jt.jaxtyped
+def asarray(
+    x: jt.Shaped[PArray, '*N'] | IntOperand['*N'],
+    *,
+    p: int,
+) -> jt.Shaped[PArray, '*N']:
+  """Converts an integer or integer array operand to a PArray with prime base p.
+
+  Idempotent on PArray inputs, analogous to `jnp.asarray`.
+
+  Raises:
+    ValueError: If x is a PArray whose prime base differs from p.
+  """
+  if isinstance(x, PArray):
+    if x.p != p:
+      raise ValueError(
+          f'Cannot convert PArray with prime base p={x.p} to p={p}.'
+      )
+    return x
+  return array(x, p=p)