ArchytasZX 0.9.1__tar.gz

archytaszx-0.9.1/ArchytasZX.egg-info/PKG-INFO

@@ -0,0 +1,362 @@
+Metadata-Version: 2.4
+Name: ArchytasZX
+Version: 0.9.1
+Summary: A qufinite ZX-calculus engine with symbolic qudit count and dimension
+Author: Arkhip Alekseyevich Dmitriev
+License: Apache-2.0
+Project-URL: Homepage, https://github.com/Arhip-Dmitriev/ArchytasZX
+Project-URL: Repository, https://github.com/Arhip-Dmitriev/ArchytasZX
+Project-URL: Issues, https://github.com/Arhip-Dmitriev/ArchytasZX/issues
+Keywords: zx-calculus,qufinite,qudit,quantum computing,symbolic algebra,graph rewriting,quantum algorithms,symbolic quantum,graphical calculus
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.14
+Classifier: Topic :: Scientific/Engineering :: Physics
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Classifier: Topic :: Scientific/Engineering :: Quantum Computing
+Requires-Python: >=3.11
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: numpy
+Requires-Dist: sympy
+Provides-Extra: dev
+Requires-Dist: pytest; extra == "dev"
+Requires-Dist: ruff; extra == "dev"
+Requires-Dist: mypy; extra == "dev"
+Dynamic: license-file
+
+# ArchytasZX
+
+**A qufinite ZX-calculus engine for reasoning and interacting with quantum states that
+leverages symbolic algebra to remove qudit-count and dimensionality limits.**
+
+[![License: Apache 2.0](https://img.shields.io/badge/license-Apache%202.0-blue.svg)](LICENSE)
+[![Python 3.11+](https://img.shields.io/badge/python-3.11%2B-blue.svg)](https://www.python.org/downloads/)
+[![Status: research prototype](https://img.shields.io/badge/status-research%20prototype-orange.svg)](#project-status)
+
+Example:
+
+```python
+prove_by_induction(boxed, fused, witness={"d": 2})
+# proved=True  verdict=proved_uniform  index='m'  held_symbolic={'d'}
+```
+
+One call, one proof, an entire doubly indexed family of identities for every qudit count and
+every qudit dimension at once.
+
+---
+
+## Why
+
+*Coming soon.*
+
+## Install
+
+Python ≥ 3.11. `numpy` and `sympy` are the only runtime dependencies.
+
+```bash
+git clone https://github.com/Arhip-Dmitriev/ArchytasZX.git
+cd ArchytasZX
+python -m venv .venv && source .venv/bin/activate
+pip install -e '.[dev]'
+python -m pytest
+```
+
+The distribution is named `ArchytasZX`; the importable package is `archytaszx`. There is
+**no REPL and no command-line entry point yet** — `archytaszx/repl/shell.py` is a skeleton
+awaiting implementation. The engine can currently only be used as a Python library, and has
+generally limited use.
+
+### Imports
+
+The sub-package `__init__.py` files are empty. There are **no re-exports**, so
+`from archytaszx import Diagram` will fail — import by full module path. It is verbose during the
+development phase:
+
+```python
+# Layer A -- symbolic algebra
+from archytaszx.algebra.dimension import Dim, unify_all
+from archytaszx.algebra.phase import Phase, PhaseVector
+from archytaszx.algebra.scalar import Scalar
+
+# Layer B -- diagram data model
+from archytaszx.diagram.graph import Diagram, Direction, PortRef
+from archytaszx.diagram.generators import Z_SPIDER, X_SPIDER, FOURIER_BOX
+from archytaszx.diagram.bangbox import abstract_subgraph_count, abstract_port_count, peel_one
+from archytaszx.diagram.validate import validate, validate_or_raise
+
+# Layer C -- rewriting
+from archytaszx.rewrite.match import find_matches
+from archytaszx.rewrite.engine import apply
+from archytaszx.rewrite.rules_library import SPIDER_FUSION, FOURIER_CANCELLATION, ZX_CAP
+
+# Layer D -- semantics, proof, certificates
+from archytaszx.semantics.check import compare, score, compare_symbolic
+from archytaszx.semantics.contract_symbolic import contract_symbolic
+from archytaszx.semantics.induction import prove_by_induction
+from archytaszx.semantics.certificate import certify, verify
+
+# The restricted Dirac front end
+from archytaszx.repl.parser import parse_dirac_source
+```
+
+### Errors
+
+Every module raises only its own hierarchy, under a base `<Area>Error`:
+
+| Exception | Meaning |
+|---|---|
+| `<Area>GrammarError` | Wrong call |
+| `<Area>DomainError` | Unimplemented as of now |
+
+## Quickstart
+
+### 1. Fuse two spiders over a symbolic dimension
+
+Build a state-prep Z spider whose output feeds a copy spider, with the dimension left as the
+symbol `d`, and fuse them.
+
+```python
+from archytaszx.algebra.dimension import Dim
+from archytaszx.diagram.generators import Z_SPIDER
+from archytaszx.diagram.graph import Diagram, Direction, PortRef
+from archytaszx.rewrite.match import find_matches
+from archytaszx.rewrite.engine import apply
+from archytaszx.rewrite.rules_library import SPIDER_FUSION
+
+d = Dim.symbol("d")
+
+g = Diagram()
+a = g.add_node(Z_SPIDER, input_dims=[], output_dims=[d, d])
+b = g.add_node(Z_SPIDER, input_dims=[d], output_dims=[d, d])
+g.add_wire(PortRef(a, Direction.OUTPUT, 0), PortRef(b, Direction.INPUT, 0))
+g.set_boundary_outputs([
+    PortRef(a, Direction.OUTPUT, 1),
+    PortRef(b, Direction.OUTPUT, 0),
+    PortRef(b, Direction.OUTPUT, 1),
+])
+
+result = apply(g, SPIDER_FUSION, find_matches(g)[0])
+
+len(result.diagram.nodes)             # 1         -- two spiders became one
+len(result.diagram.boundary_outputs)  # 3         -- the boundary is unchanged
+result.diagram.scalar                 # Scalar(1) -- exact, never discarded
+```
+
+`d` was never given a value. The exact scalar the rule introduces is tracked rather than
+dropped, which is what makes the result an equality rather than a proportionality.
+
+### 2. Check it, and get a replayable certificate
+
+```python
+from archytaszx.semantics.check import compare
+from archytaszx.semantics.certificate import certify, verify
+
+compare(g, result.diagram, {"d": 5}).matched   # True -- numeric oracle at d = 5
+
+certificate = certify(g, [result], label="fuse A into B")
+verify(certificate, {"d": 3}).verified         # True
+```
+
+`verify` **replays** the derivation from the recorded steps and oracle-checks the input
+against the re-derived output. Tampering with any recorded field (the scalar, the rule name,
+a consumed wire, a side-condition outcome, a multiplicity) fails the replay.
+
+### 3. Prove it for every count at once
+
+Wrap the same graph in a bang box with symbolic multiplicity `m`, and discharge the identity
+for every value of `m` with `d` still symbolic.
+
+```python
+from archytaszx.diagram.bangbox import abstract_subgraph_count
+from archytaszx.semantics.induction import prove_by_induction
+
+boxed, box_id, mult = abstract_subgraph_count(g, frozenset({a, b}), 1, stem="m")
+fused = apply(boxed, SPIDER_FUSION, find_matches(boxed)[0]).diagram
+
+proof = prove_by_induction(boxed, fused, witness={"d": 2})
+
+proof.proved          # True
+proof.verdict         # Verdict.PROVED_UNIFORM
+proof.index           # 'm': the multiplicity inducted on
+proof.discharge       # StepDischarge.UNIFORM_REWRITE -- which tier settled it
+proof.held_symbolic   # frozenset({'d'}) -- what stayed universally quantified
+```
+
+The verdict distinguishes a proof for all `n` from a finite schema check, and `discharge`
+names the tier that did the work. `SCHEMA_CHECKED` is reported separately from the two
+`PROVED_*` verdicts.
+
+### 4. Dirac in, with concrete numbers
+
+```python
+from archytaszx.repl.parser import parse_dirac_source
+
+p = parse_dirac_source("sum_{k=0}^{3-1} |k>^{30}; copy")
+
+len(p.nodes)         # 2
+len(p.bang_boxes)    # 1
+dict(p.parameters)   # {'d': 3, 'n': 29}
+```
+
+The user typed `3` and `30`. What came back is symbolic in **both** axes, with the values
+recorded in the parameter environment for substitution back on output. The tensor power costs
+*one* leg under a bang box, not thirty, and stays open to induction. Prefix a numeral with
+`literal` to suppress abstraction.
+
+### The full tour
+
+Every layer end to end — validation, matching, certificates, the numeric and symbolic
+oracles, the Dirac front end, and a proof by induction:
+
+```bash
+python examples/api_tour.py
+```
+
+[`docs/TUTORIAL.md`](docs/TUTORIAL.md) is the matching API reference, section for section.
+[`examples/demo_visual.py`](examples/demo_visual.py) is a wide-terminal walkthrough that
+prints the full unfiltered trace next to the diagram pictures (working, but outdated).
+
+## Architecture
+
+Four layers, with the dependency direction running downward:
+`algebra` ← `diagram` ← `rewrite` ← `semantics`.
+
+**A — Symbolic algebra substrate** ([`archytaszx/algebra/`](archytaszx/algebra/))
+Dimension expressions — a concrete integer, a symbol such as `d`, or arithmetic such as `d^n`
+or `d1·d2` — normalised through one canonical form with a unifier that decides or constrains
+when two must agree, and `abstract`/`substitute` as inverse directions. Phases as concrete
+values, root-of-unity indices, or free symbolic parameters, carried in vectors whose length is
+tied to `d`. Exact scalars built from roots of unity `ω_d = e^{2πi/d}` and free symbols, with
+a character-sum simplifier that knows `Σ_{k=0}^{d-1} ω_d^{jk} = d·[j ≡ 0 mod d]`.
+
+**B — Diagram data model** ([`archytaszx/diagram/`](archytaszx/diagram/))
+Ports carrying their own dimension label; nodes carrying a generator type, ordered input and
+output ports, and a symbolic phase slot; diagrams holding nodes, wires, ordered boundary
+lists, a parameter environment, and an exact scalar accumulator. Bang boxes annotate a scoped
+subgraph with a multiplicity symbol and support instantiate, copy, kill, merge and peel.
+
+**C — Rewrite engine** ([`archytaszx/rewrite/`](archytaszx/rewrite/))
+A rule bundles a left-hand pattern, a right-hand builder, side conditions, quantifiers over
+counts and dimensions, and the exact scalar it introduces. The matcher finds occurrences and
+checks every side condition before a rule may fire. The engine applies a rule at a match,
+returns a new diagram, and records structured provenance from which a certificate is emitted.
+
+**D — Semantics oracle and proof** ([`archytaszx/semantics/`](archytaszx/semantics/))
+Three rungs in order of preference: rewriting first; symbolic contraction with `d` kept formal
+as the general fallback, and the path by which a supplied concrete value of any size is
+evaluated; numeric contraction at small concrete instantiations as the verification oracle of
+last resort. Alongside them, induction over bang-box multiplicities and replayable
+certificates.
+
+Numeric contraction is the oracle. A spider's denotation is `d^rank` entries, so it saturates
+within single digits of legs. Large concrete values are answered by substituting the parameter
+environment into the closed symbolic form, which costs nothing in the size of the value.
+
+## Project status
+
+This is a **research prototype under active development**. The API is unstable, the rule
+library is very limited, and nothing here should be treated as a useful, finished tool at this
+moment.
+
+### Working today
+
+| Area | State |
+|---|---|
+| Dimension algebra | Integers, symbols, products, powers; one canonical form; `abstract`/`substitute` both directions |
+| Phase and scalar algebra | Symbolic phase vectors tied to `d`; exact scalars with no silent global factors |
+| Diagram model | Per-port dimensions, ordered boundaries, parameter environment, deep copy |
+| Validation | Joint (leg-order independent) dimension resolution, boundary and port checks, symbol-role separation; typed finding kinds |
+| Generators | Z spider, X spider, Fourier box |
+| Rewrite core | Rule/pattern/builder abstraction, matcher, engine, structured provenance |
+| Rule library | `spider_fusion`, `fourier_cancellation`, `zx_cap` |
+| Numeric oracle | Denotation, contraction, exact comparison, opt-in up-to-global-phase mode |
+| Symbolic contraction | Arbitrary diagram closed with `d` formal, through the character-sum simplifier |
+| Induction | Base + step over a bang-box multiplicity, four-tier step ladder, five distinct verdicts |
+| Certificates | Per-step provenance, independent replay, tamper detection |
+| Dirac front end | One restricted grammar: a summed ket family |
+
+### Not yet implemented
+
+Mixed dimensions across a diagram and the full qufinite generator set (triangle, W, dimension
+connectives) · the broader rule library and strategy layer · the normal-form decision
+procedure · equality saturation and the e-graph · tactics and proof search · match and
+denotation caching · scalable sheet-wire notation · the diagram-to-Dirac printer · the general
+declaration syntax and the interactive REPL · diagram-wide dimension-constraint propagation.
+
+### Known limits inside what is implemented
+
+- The dimension unifier is still a placeholder: it decides simple cases, and reports
+  `DEFERRED` otherwise. Deferred and bound dimension findings are recorded as
+  assumptions, and both reach the certificate.
+- Symbolic contraction handles a symbolic multiplicity only where the bang box is **closed off**
+  from the rest of the diagram; a box meeting a wire or a boundary slot has a rank that varies
+  with the count.
+- `compare_symbolic` has **three** outcomes, not two — equal, unequal, and *indeterminate*
+  (the residual still carries an undecided index sum). Read `.reason` whenever a comparison
+  comes back unmatched.
+- The induction step case settles a family whose peeled copies the scalar layer can close; the
+  rest falls through to rewriting at symbolic `n` or to a finite schema check, which reports
+  itself as one.
+
+## Development
+
+```bash
+python -m pytest          # default tier: 1408 tests, ~45s
+python -m pytest -m slow  # 28 multi-thousand-seed fuzz sweeps and oracle differentials, ~15m
+python -m pytest -m ""    # both tiers together
+ruff format . && ruff check . && mypy archytaszx
+```
+
+`ruff format` is authoritative for layout; `mypy` runs in strict mode. Counts and timings
+measured 2026-09-08.
+
+## References
+
+- Wang, *Qufinite ZX-calculus: a unified framework of qudit ZX-calculi* —
+  [arXiv:2104.06429](https://arxiv.org/abs/2104.06429)
+- Kissinger et al., on bang boxes and scalable notation —
+  [arXiv:2204.11702](https://arxiv.org/abs/2204.11702)
+- van de Wetering, *ZX-calculus for the working quantum computer scientist* —
+  [arXiv:2012.13966](https://arxiv.org/abs/2012.13966)
+
+## Citation
+
+If you use ArchytasZX in academic work, please cite it via [`CITATION.cff`](CITATION.cff), or:
+
+```bibtex
+@software{dmitriev_archytaszx,
+  author  = {Dmitriev, Arkhip Alekseyevich},
+  title   = {ArchytasZX: a qufinite ZX-calculus engine with symbolic qudit count and dimension},
+  year    = {2026},
+  url     = {https://github.com/Arhip-Dmitriev/ArchytasZX},
+  license = {Apache-2.0}
+}
+```
+
+## Contributing
+
+Issues — bug reports, counterexamples, questions about the mathematics — are a vital part of
+the development process. See [`CONTRIBUTING.md`](CONTRIBUTING.md) for setup, the required
+checks, and how to report a soundness bug.
+
+## License
+
+Apache License 2.0 — see [`LICENSE`](LICENSE).
+
+<!--
+Copyright 2026 Arkhip A. Dmitriev
+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.
+-->

archytaszx-0.9.1/ArchytasZX.egg-info/SOURCES.txt

@@ -0,0 +1,74 @@
+LICENSE
+README.md
+pyproject.toml
+ArchytasZX.egg-info/PKG-INFO
+ArchytasZX.egg-info/SOURCES.txt
+ArchytasZX.egg-info/dependency_links.txt
+ArchytasZX.egg-info/requires.txt
+ArchytasZX.egg-info/top_level.txt
+archytaszx/__init__.py
+archytaszx/algebra/__init__.py
+archytaszx/algebra/dimension.py
+archytaszx/algebra/phase.py
+archytaszx/algebra/scalar.py
+archytaszx/diagram/__init__.py
+archytaszx/diagram/bangbox.py
+archytaszx/diagram/generators.py
+archytaszx/diagram/graph.py
+archytaszx/diagram/scalable.py
+archytaszx/diagram/validate.py
+archytaszx/repl/__init__.py
+archytaszx/repl/commands.py
+archytaszx/repl/parser.py
+archytaszx/repl/printer.py
+archytaszx/repl/shell.py
+archytaszx/rewrite/__init__.py
+archytaszx/rewrite/cache.py
+archytaszx/rewrite/egraph.py
+archytaszx/rewrite/engine.py
+archytaszx/rewrite/match.py
+archytaszx/rewrite/normal_form.py
+archytaszx/rewrite/rule.py
+archytaszx/rewrite/rules_library.py
+archytaszx/rewrite/tactics.py
+archytaszx/semantics/__init__.py
+archytaszx/semantics/certificate.py
+archytaszx/semantics/check.py
+archytaszx/semantics/contract_numeric.py
+archytaszx/semantics/contract_symbolic.py
+archytaszx/semantics/denote.py
+archytaszx/semantics/induction.py
+tests/test_bangbox.py
+tests/test_certificate.py
+tests/test_check.py
+tests/test_contract_numeric.py
+tests/test_contract_symbolic.py
+tests/test_denote.py
+tests/test_diagram_graph.py
+tests/test_dimension.py
+tests/test_docstring_policy.py
+tests/test_engine.py
+tests/test_fusion_properties.py
+tests/test_generators.py
+tests/test_induction.py
+tests/test_match.py
+tests/test_phase.py
+tests/test_phase2_oracle.py
+tests/test_phase3_oracle.py
+tests/test_phase4_oracle.py
+tests/test_phase5_certificate_sweep.py
+tests/test_phase5_dirac_oracle.py
+tests/test_phase5_exhaustive_oracle.py
+tests/test_phase5_oracle.py
+tests/test_phase6_oracle.py
+tests/test_phase7_oracle.py
+tests/test_phase8_oracle.py
+tests/test_phase9_oracle.py
+tests/test_rule.py
+tests/test_rules_library.py
+tests/test_scalar.py
+tests/test_symbolic_dimension_sweep.py
+tests/test_three_node_oracle_sweep.py
+tests/test_three_parallel_wire_arm.py
+tests/test_unify_all.py
+tests/test_validate.py

archytaszx-0.9.1/ArchytasZX.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

archytaszx-0.9.1/ArchytasZX.egg-info/requires.txt

@@ -0,0 +1,7 @@
+numpy
+sympy
+
+[dev]
+pytest
+ruff
+mypy

archytaszx-0.9.1/ArchytasZX.egg-info/top_level.txt

@@ -0,0 +1 @@
+archytaszx

archytaszx-0.9.1/LICENSE

@@ -0,0 +1,190 @@
+  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
+
+   Copyright 2026 Arkhip A. Dmitriev
+
+   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.