ihelix 0.1.0__tar.gz

ihelix-0.1.0/.gitignore

@@ -0,0 +1,5 @@
+dist/
+build/
+*.egg-info/
+__pycache__/
+.pytest_cache/

ihelix-0.1.0/LICENSE

@@ -0,0 +1,203 @@
+Copyright 2018- The Hugging Face team. All rights reserved.
+
+                                 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.

ihelix-0.1.0/NOTICE

@@ -0,0 +1,24 @@
+ihelix
+Copyright 2026 Nathan
+
+Licensed under the Apache License, Version 2.0 (the "License"); you may not use
+these files except in compliance with the License. A copy of the License is in
+the LICENSE file.
+
+--------------------------------------------------------------------------------
+
+This product includes software developed at Hugging Face, Inc.
+
+`ihelix/kernels.py` carries over the RMS normalization layers, the depthwise
+causal convolution, the chunkwise-parallel and single-step gated delta-rule
+routines, the landmark pooler and `repeat_kv` from the `helix-lm` package, which
+in turn follows the reference implementations in HuggingFace Transformers
+(https://github.com/huggingface/transformers), licensed under the Apache
+License, Version 2.0.
+
+Original to this project: the geometry layer (metric-space embedding of
+spherical, periodic, linear and logarithmic axes, and the local frames built on
+them), the grid layer (neighbour graphs and principal-axis spatial hierarchies),
+geodesic neighbourhood attention with compactly supported physical receptive
+fields and quadrature weighting, the content-addressed regional index, the
+cross-grid reader, and the encode-process-decode model built from them.

ihelix-0.1.0/PKG-INFO

@@ -0,0 +1,179 @@
+Metadata-Version: 2.5
+Name: ihelix
+Version: 0.1.0
+Summary: One architecture for fields on any geometry: spheres, grids, volumes, periodic boxes and point clouds
+Project-URL: Homepage, https://github.com/Wisk-inc/transformers/tree/main/ihelix
+Project-URL: Source, https://github.com/Wisk-inc/transformers/tree/main/ihelix
+Project-URL: Issues, https://github.com/Wisk-inc/transformers/issues
+Author: Nathan
+Maintainer: Nathan
+License-Expression: Apache-2.0
+License-File: LICENSE
+License-File: NOTICE
+Keywords: attention,climate,fluid-dynamics,geometric-deep-learning,neural-operator,physics,point-cloud,pytorch,resolution-invariant,spherical,transformer,weather
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Developers
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Classifier: Topic :: Scientific/Engineering :: Atmospheric Science
+Classifier: Topic :: Scientific/Engineering :: Physics
+Requires-Python: >=3.10
+Requires-Dist: torch>=2.5
+Provides-Extra: dev
+Requires-Dist: pytest>=7; extra == 'dev'
+Requires-Dist: ruff>=0.6; extra == 'dev'
+Description-Content-Type: text/markdown
+
+# iHELIX
+
+**One architecture for fields on any geometry.** Spheres, images, volumes, periodic boxes, particle
+clouds, and whatever you describe next.
+
+```bash
+pip install ihelix
+```
+
+```python
+import torch
+from ihelix import Axis, Geometry, FieldGrid, IHelixConfig, IHelixField
+
+geometry = Geometry.atmosphere()                    # (latitude, longitude, pressure)
+grid = FieldGrid.from_points(coords, geometry, num_neighbours=64, cluster_size=64)
+model = IHelixField(IHelixConfig(in_channels=8), geometry)
+
+forecast = model(fields, grid)                      # (B, T, N, C) in, same out
+```
+
+```bash
+ihelix info       # what it is and which geometries it covers
+ihelix domains    # run every shape of problem through one class
+ihelix converge   # read one field at rising resolution
+ihelix demo       # build a model and check the invariances
+```
+
+---
+
+## The problem
+
+Flatten a 3-D atmosphere into a 1-D sequence and the model has to learn spherical topology from scratch,
+because nothing in an index tells it. Rotary embeddings do not help: they encode distance in *array
+steps*, and on a latitude-longitude grid an array step means different things in different places.
+
+- Cells one row apart sit `n_lon` positions apart in the sequence.
+- The date line becomes a cliff: longitude 359.9° and 0.1° are neighbours on the planet and thousands of
+  positions apart in the array.
+- The meridians converge. Near the pole, a step of longitude is a few hundred metres; at the equator it is
+  a hundred kilometres. The sequence calls both "one step".
+
+A multi-mesh GNN fixes the topology by building the geometry into the wiring, which is honest but rigid:
+the mesh is chosen up front, reaching across the domain costs hops, and a new resolution means a new mesh.
+
+## The approach
+
+Declare what your axes *are*. Everything downstream then works in a metric space where the geometry is
+already correct, and no part of the model ever sees an index.
+
+| you write | it becomes | which fixes |
+| --- | --- | --- |
+| `Axis("spherical")` | a point on a sphere in 3-D | the date line stops existing; the poles become ordinary points |
+| `Axis("periodic", period=L)` | a point on a circle | a channel-flow box wraps because it *is* wrapped |
+| `Axis("log", reference=1000)` | log-pressure | a factor of two in pressure is one distance, everywhere |
+| `Axis("linear", scale=s)` | itself, scaled | a kilometre up is not a kilometre sideways, and you say by how much |
+
+Three things follow, and they are what the package actually is:
+
+**Neighbours are the nearest samples on the manifold**, not the adjacent entries in an array. A sample
+beside the date line draws neighbours from both sides of it, because they are near.
+
+**Displacements are expressed in each sample's own local frame** — east, north, up. "300 km east" produces
+the same input vector at the equator and at 70°N. Polar distortion is not corrected; it is never
+introduced.
+
+**Receptive fields are lengths, and attention is weighted by area.** Each head carries a physical radius
+with compact support, and every sample is weighted by the share of the domain it stands for. Attention
+becomes a quadrature of a continuous operator,
+
+```
+out(x)  =  ∫ a(x,y) v(y) dμ(y)  /  ∫ a(x,y) dμ(y)
+```
+
+estimated on whatever samples you have. Refine the grid and it converges instead of drifting.
+
+## The three strands
+
+The braid from [`helix-lm`](../helix-lm), with "position in a sequence" replaced by "position on a
+manifold" in the two spatial strands:
+
+| strand | reads | cost |
+| --- | --- | --- |
+| **local** | nearest neighbours in metric space, per-head physical radii | `O(N · K)` |
+| **index** | whole regions of the domain, retrieved by content through a hierarchy | `O(N · topk · cluster)` |
+| **time** | a gated delta rule along the one axis that has an order | `O(T)`, fixed state per sample |
+
+The **index** strand is the part a fixed mesh cannot do. Message passing couples regions by distance along
+edges chosen in advance, so reaching the far side costs hops. Here the route is content-addressed and
+learned: a ridge over the Atlantic can read the Pacific in one step, and nothing in the wiring had to
+anticipate it. Teleconnections, distant vortices, the other side of an image — same mechanism.
+
+Space has no order, so nothing recurrent runs across it. **Time** does, and that is the only place a
+recurrence appears. Its state is a matrix per sample that does not grow with the rollout, so frame 1000
+costs what frame 1 costs.
+
+## What has been measured
+
+On untrained models — these are properties of the arithmetic, not of training.
+
+| property | result |
+| --- | --- |
+| **Sample order carries no information** | **exactly 0** difference under a full shuffle |
+| **Longitude shift changes nothing** (local strand) | `1.8e-08` — float64 round-off |
+| Refining 16×32 → 24×48 → 32×64, vs the finest | `0.455% → 0.174% → 0.090%`, halving each time |
+| One class over image / video / volume / periodic box / point cloud / 1-D / globe / atmosphere | all run, all at full coverage |
+| Time is causal; editing frame 5 leaves frames 0–4 | **exactly 0** |
+| Temporal state size across 4, 32, 128 frames | identical |
+
+The first row is the formal statement of "no flattening artefact", and it is exact rather than
+approximate. A sequence model reading a flattened grid cannot say the same at any precision.
+
+## The one precondition
+
+Fixed-count neighbourhoods and fixed-length receptive fields pull against each other: refine the grid and
+a fixed count covers less ground. Every attention module reports whether its neighbour list actually
+reaches its radius:
+
+```python
+grid = FieldGrid.from_points(coords, geometry, num_neighbours=grid.suggest_neighbours(radius))
+model.blocks[0].local.coverage(grid)     # 1.0 = every head decided by its radius, not by the list length
+```
+
+At `1.0` the invariances above are exact. Below it they degrade smoothly, and the number tells you so.
+The neighbour count is a preprocessing choice — the weights never change.
+
+## Honest limits
+
+- **No trained checkpoints.** Nothing here has been trained on real data. Every claim above is about
+  geometry, invariance and complexity, not about forecast skill or sample quality.
+- **The region partition is a discretization.** The index strand carves the domain into regions, and no
+  finite partition of a sphere commutes with arbitrary rotation — a fixed icosahedral mesh has exactly the
+  same property. A longitude shift moves the local strand by round-off and the full model by ~5e-2.
+- **Neighbour counts grow with density.** Holding a fixed physical reach at 4× the samples needs ~4× the
+  neighbours. That is inherent to fixed-count neighbourhoods; `suggest_neighbours` computes it.
+- **Vectors are not parallel-transported.** Components are read in each sample's local frame and the
+  frame rotation is supplied to the model, but nothing forces it to transport them correctly.
+- **Brute-force neighbour search.** Exact and cached per grid, which is right when the grid is static.
+  Pass a precomputed index for very large point sets.
+
+## License
+
+Apache-2.0. The normalization, convolution, delta-rule and pooling kernels carry over from `helix-lm` and
+ultimately from [HuggingFace Transformers](https://github.com/huggingface/transformers) (Apache-2.0); see
+`NOTICE`. The geometry, grid, geodesic attention, regional index and cross-grid reader are original.
+
+**Made by Nathan.**

ihelix-0.1.0/README.md

@@ -0,0 +1,146 @@
+# iHELIX
+
+**One architecture for fields on any geometry.** Spheres, images, volumes, periodic boxes, particle
+clouds, and whatever you describe next.
+
+```bash
+pip install ihelix
+```
+
+```python
+import torch
+from ihelix import Axis, Geometry, FieldGrid, IHelixConfig, IHelixField
+
+geometry = Geometry.atmosphere()                    # (latitude, longitude, pressure)
+grid = FieldGrid.from_points(coords, geometry, num_neighbours=64, cluster_size=64)
+model = IHelixField(IHelixConfig(in_channels=8), geometry)
+
+forecast = model(fields, grid)                      # (B, T, N, C) in, same out
+```
+
+```bash
+ihelix info       # what it is and which geometries it covers
+ihelix domains    # run every shape of problem through one class
+ihelix converge   # read one field at rising resolution
+ihelix demo       # build a model and check the invariances
+```
+
+---
+
+## The problem
+
+Flatten a 3-D atmosphere into a 1-D sequence and the model has to learn spherical topology from scratch,
+because nothing in an index tells it. Rotary embeddings do not help: they encode distance in *array
+steps*, and on a latitude-longitude grid an array step means different things in different places.
+
+- Cells one row apart sit `n_lon` positions apart in the sequence.
+- The date line becomes a cliff: longitude 359.9° and 0.1° are neighbours on the planet and thousands of
+  positions apart in the array.
+- The meridians converge. Near the pole, a step of longitude is a few hundred metres; at the equator it is
+  a hundred kilometres. The sequence calls both "one step".
+
+A multi-mesh GNN fixes the topology by building the geometry into the wiring, which is honest but rigid:
+the mesh is chosen up front, reaching across the domain costs hops, and a new resolution means a new mesh.
+
+## The approach
+
+Declare what your axes *are*. Everything downstream then works in a metric space where the geometry is
+already correct, and no part of the model ever sees an index.
+
+| you write | it becomes | which fixes |
+| --- | --- | --- |
+| `Axis("spherical")` | a point on a sphere in 3-D | the date line stops existing; the poles become ordinary points |
+| `Axis("periodic", period=L)` | a point on a circle | a channel-flow box wraps because it *is* wrapped |
+| `Axis("log", reference=1000)` | log-pressure | a factor of two in pressure is one distance, everywhere |
+| `Axis("linear", scale=s)` | itself, scaled | a kilometre up is not a kilometre sideways, and you say by how much |
+
+Three things follow, and they are what the package actually is:
+
+**Neighbours are the nearest samples on the manifold**, not the adjacent entries in an array. A sample
+beside the date line draws neighbours from both sides of it, because they are near.
+
+**Displacements are expressed in each sample's own local frame** — east, north, up. "300 km east" produces
+the same input vector at the equator and at 70°N. Polar distortion is not corrected; it is never
+introduced.
+
+**Receptive fields are lengths, and attention is weighted by area.** Each head carries a physical radius
+with compact support, and every sample is weighted by the share of the domain it stands for. Attention
+becomes a quadrature of a continuous operator,
+
+```
+out(x)  =  ∫ a(x,y) v(y) dμ(y)  /  ∫ a(x,y) dμ(y)
+```
+
+estimated on whatever samples you have. Refine the grid and it converges instead of drifting.
+
+## The three strands
+
+The braid from [`helix-lm`](../helix-lm), with "position in a sequence" replaced by "position on a
+manifold" in the two spatial strands:
+
+| strand | reads | cost |
+| --- | --- | --- |
+| **local** | nearest neighbours in metric space, per-head physical radii | `O(N · K)` |
+| **index** | whole regions of the domain, retrieved by content through a hierarchy | `O(N · topk · cluster)` |
+| **time** | a gated delta rule along the one axis that has an order | `O(T)`, fixed state per sample |
+
+The **index** strand is the part a fixed mesh cannot do. Message passing couples regions by distance along
+edges chosen in advance, so reaching the far side costs hops. Here the route is content-addressed and
+learned: a ridge over the Atlantic can read the Pacific in one step, and nothing in the wiring had to
+anticipate it. Teleconnections, distant vortices, the other side of an image — same mechanism.
+
+Space has no order, so nothing recurrent runs across it. **Time** does, and that is the only place a
+recurrence appears. Its state is a matrix per sample that does not grow with the rollout, so frame 1000
+costs what frame 1 costs.
+
+## What has been measured
+
+On untrained models — these are properties of the arithmetic, not of training.
+
+| property | result |
+| --- | --- |
+| **Sample order carries no information** | **exactly 0** difference under a full shuffle |
+| **Longitude shift changes nothing** (local strand) | `1.8e-08` — float64 round-off |
+| Refining 16×32 → 24×48 → 32×64, vs the finest | `0.455% → 0.174% → 0.090%`, halving each time |
+| One class over image / video / volume / periodic box / point cloud / 1-D / globe / atmosphere | all run, all at full coverage |
+| Time is causal; editing frame 5 leaves frames 0–4 | **exactly 0** |
+| Temporal state size across 4, 32, 128 frames | identical |
+
+The first row is the formal statement of "no flattening artefact", and it is exact rather than
+approximate. A sequence model reading a flattened grid cannot say the same at any precision.
+
+## The one precondition
+
+Fixed-count neighbourhoods and fixed-length receptive fields pull against each other: refine the grid and
+a fixed count covers less ground. Every attention module reports whether its neighbour list actually
+reaches its radius:
+
+```python
+grid = FieldGrid.from_points(coords, geometry, num_neighbours=grid.suggest_neighbours(radius))
+model.blocks[0].local.coverage(grid)     # 1.0 = every head decided by its radius, not by the list length
+```
+
+At `1.0` the invariances above are exact. Below it they degrade smoothly, and the number tells you so.
+The neighbour count is a preprocessing choice — the weights never change.
+
+## Honest limits
+
+- **No trained checkpoints.** Nothing here has been trained on real data. Every claim above is about
+  geometry, invariance and complexity, not about forecast skill or sample quality.
+- **The region partition is a discretization.** The index strand carves the domain into regions, and no
+  finite partition of a sphere commutes with arbitrary rotation — a fixed icosahedral mesh has exactly the
+  same property. A longitude shift moves the local strand by round-off and the full model by ~5e-2.
+- **Neighbour counts grow with density.** Holding a fixed physical reach at 4× the samples needs ~4× the
+  neighbours. That is inherent to fixed-count neighbourhoods; `suggest_neighbours` computes it.
+- **Vectors are not parallel-transported.** Components are read in each sample's local frame and the
+  frame rotation is supplied to the model, but nothing forces it to transport them correctly.
+- **Brute-force neighbour search.** Exact and cached per grid, which is right when the grid is static.
+  Pass a precomputed index for very large point sets.
+
+## License
+
+Apache-2.0. The normalization, convolution, delta-rule and pooling kernels carry over from `helix-lm` and
+ultimately from [HuggingFace Transformers](https://github.com/huggingface/transformers) (Apache-2.0); see
+`NOTICE`. The geometry, grid, geodesic attention, regional index and cross-grid reader are original.
+
+**Made by Nathan.**

ihelix-0.1.0/pyproject.toml

@@ -0,0 +1,72 @@
+[build-system]
+requires = ["hatchling"]
+build-backend = "hatchling.build"
+
+[project]
+name = "ihelix"
+version = "0.1.0"
+description = "One architecture for fields on any geometry: spheres, grids, volumes, periodic boxes and point clouds"
+readme = "README.md"
+requires-python = ">=3.10"
+license = "Apache-2.0"
+license-files = ["LICENSE", "NOTICE"]
+authors = [{ name = "Nathan" }]
+maintainers = [{ name = "Nathan" }]
+keywords = [
+    "geometric-deep-learning",
+    "attention",
+    "transformer",
+    "weather",
+    "climate",
+    "spherical",
+    "point-cloud",
+    "neural-operator",
+    "physics",
+    "fluid-dynamics",
+    "resolution-invariant",
+    "pytorch",
+]
+classifiers = [
+    "Development Status :: 3 - Alpha",
+    "Intended Audience :: Developers",
+    "Intended Audience :: Science/Research",
+    "License :: OSI Approved :: Apache Software License",
+    "Operating System :: OS Independent",
+    "Programming Language :: Python :: 3",
+    "Programming Language :: Python :: 3.10",
+    "Programming Language :: Python :: 3.11",
+    "Programming Language :: Python :: 3.12",
+    "Programming Language :: Python :: 3.13",
+    "Topic :: Scientific/Engineering :: Artificial Intelligence",
+    "Topic :: Scientific/Engineering :: Atmospheric Science",
+    "Topic :: Scientific/Engineering :: Physics",
+]
+dependencies = ["torch>=2.5"]
+
+[project.optional-dependencies]
+dev = ["pytest>=7", "ruff>=0.6"]
+
+[project.urls]
+Homepage = "https://github.com/Wisk-inc/transformers/tree/main/ihelix"
+Source = "https://github.com/Wisk-inc/transformers/tree/main/ihelix"
+Issues = "https://github.com/Wisk-inc/transformers/issues"
+
+[project.scripts]
+ihelix = "ihelix.cli:main"
+
+[tool.hatch.build.targets.wheel]
+packages = ["src/ihelix"]
+
+[tool.hatch.build.targets.sdist]
+include = ["src/ihelix", "tests", "README.md", "LICENSE", "NOTICE", "pyproject.toml"]
+
+[tool.ruff]
+line-length = 119
+target-version = "py310"
+
+[tool.ruff.lint]
+select = ["E", "F", "W", "I", "UP", "B", "C4", "SIM"]
+ignore = ["B008", "E741"]
+
+[tool.pytest.ini_options]
+testpaths = ["tests"]