plumial 0.1.0__tar.gz

plumial-0.1.0/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 Your Name
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

plumial-0.1.0/PKG-INFO

@@ -0,0 +1,220 @@
+Metadata-Version: 2.4
+Name: plumial
+Version: 0.1.0
+Summary: A Python package for exploring cyclic structures in polynomial rings
+Author-email: Jon Seymour <jon@wildducktheories.com>
+Maintainer-email: Jon Seymour <jon@wuldducktheories.com>
+License: MIT
+Project-URL: Homepage, https://github.com/wildducktheories/plumial
+Project-URL: Repository, https://github.com/wildducktheories/plumial
+Project-URL: Documentation, https://plumial.readthedocs.io
+Project-URL: Bug Tracker, https://github.com/wildducktheories/plumial/issues
+Keywords: collatz,conjecture,mathematics,number-theory
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.8
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: sympy
+Requires-Dist: numpy
+Provides-Extra: dev
+Requires-Dist: pytest>=7.0; extra == "dev"
+Requires-Dist: pytest-cov>=4.0; extra == "dev"
+Requires-Dist: black>=22.0; extra == "dev"
+Requires-Dist: isort>=5.0; extra == "dev"
+Requires-Dist: flake8>=5.0; extra == "dev"
+Requires-Dist: mypy>=1.0; extra == "dev"
+Requires-Dist: pre-commit>=2.0; extra == "dev"
+Requires-Dist: jupyter; extra == "dev"
+Provides-Extra: docs
+Requires-Dist: sphinx>=5.0; extra == "docs"
+Requires-Dist: sphinx-rtd-theme>=1.0; extra == "docs"
+Dynamic: license-file
+
+# Plumial: Collatz Conjecture Analysis
+
+[![Documentation Status](https://img.shields.io/badge/docs-latest-brightgreen.svg)](https://your-docs-url.com)
+[![PyPI version](https://badge.fury.io/py/plumial.svg)](https://badge.fury.io/py/plumial)
+[![Python 3.8+](https://img.shields.io/badge/python-3.8+-blue.svg)](https://www.python.org/downloads/)
+[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
+
+Plumial is a powerful Python library for mathematical analysis of the Collatz conjecture using polynomial representations. It transforms the discrete dynamics of Collatz sequences into algebraic operations on polynomial spaces, enabling systematic analysis of cycle structures and their properties.
+
+## ✨ Key Features
+
+- **Path Objects (P class)**: Hydrated path identifiers that encode Collatz sequence paths
+- **Polynomial Representations**: UV polynomials and k polynomials for algebraic analysis
+- **Cycle Analysis**: Complete cycle navigation, detection, and mathematical properties
+- **Symbolic Mathematics**: Full SymPy integration with comprehensive mathematical operations
+- **Performance Optimized**: LRU caching and efficient algorithms for large-scale analysis
+- **Type Safe**: Comprehensive type hints and modern Python practices
+
+## 🌀 The Mystery Revealed
+
+<div align="center">
+
+![Plumial Animation](https://raw.githubusercontent.com/yourusername/plumial/main/docs/_static/watch-animation.gif)
+
+*Witness the hypnotic σ₂₈₁(u,v) polynomial visualization - a glimpse into the hidden mathematical beauty of "glitched" Collatz cycles*
+
+</div>
+
+This mesmerizing animation reveals something remarkable: **p=281** represents a glitched Collatz cycle that challenges our understanding of the 3x+1 conjecture. The visualization shows σ₂₈₁(u,v) = u² + uv² + v⁴ evaluated with complex roots of unity, transforming discrete binary patterns into continuous geometric flows.
+
+## 🔗 Mathematical Foundations
+
+**[📖 Read the Complete Mathematical Foundations](docs/mathematical_foundations.html)**
+
+Dive deep into the theoretical framework that powers Plumial:
+- **UV-Polynomial Theory**: Bijection between natural numbers and algebraic forms
+- **Cycle Element Identity**: The fundamental relationship x·d = a·k for cycle elements
+- **Binary Decomposition**: How p = 2^(n_p) + Σb_{p,i}2^i encodes path structure
+- **Successor Operations**: Bit rotation operations that preserve polynomial structure
+- **Advanced Topics**: Cyclotomic connections, forced vs unforced cycles, and more
+
+## 🚀 Quick Start
+
+### Installation
+
+```bash
+pip install plumial
+```
+
+### Basic Usage
+
+```python
+from plumial import P
+from plumial.core import B
+from plumial.utils import S, I, F
+
+# Create a polynomial for p-value 133
+p = P(133)
+
+# Get bit counts and binary representation
+print(f"n={p.n()}, o={p.o()}, e={p.e()}")  # n=7, o=2, e=5
+print(f"Binary: {p.b()}")                   # Binary: 10000101
+
+# Work with polynomial representations
+print(p.d())    # h**5 - g**2 (d-polynomial)
+print(p.k())    # k polynomial (symbolic)
+print(p.uv())   # UV polynomial representation
+
+# Evaluate numerically using basis encoding
+print(p.encode(B.Collatz).d())              # Evaluates with g=3, h=2: 23
+
+# Cycle operations with functional style
+collatz_p293 = P(293).encode(B.Collatz)
+odd_k_values = list(collatz_p293.cycle(map=F.k(), filter=F.isodd))
+
+# Binary string constructor
+assert P(133) == P("10000101")               # Equivalent results
+```
+
+### Advanced Analysis
+
+```python
+# Explore the famous glitched cycle
+p281 = P(281)
+cycle = list(p281.cycle())
+print(f"Cycle length: {len(cycle)}")
+print(f"Sigma polynomial: {p281.uv()}")  # u**2 + u*v**2 + v**4
+
+# Mathematical verification
+for p in cycle:
+    print(f"{p.p():3d}: forced={p.isforced()}")
+
+# Symbolic mathematics
+import sympy as sy
+a, x = p.ax()  # Get reduced cycle polynomials
+assert sy.expand(x * p.d()) == sy.expand(a * p.k())  # Verify identity
+```
+
+## 📚 Documentation
+
+- **[Mathematical Foundations](docs/mathematical_foundations.html)** - Complete theoretical framework
+- **[API Reference](docs/api_reference.html)** - Comprehensive function documentation
+- **[Tutorial](docs/tutorial.html)** - Step-by-step learning guide
+- **[Examples](docs/examples.html)** - Interactive Jupyter notebooks
+
+## 🧮 Mathematical Capabilities
+
+### Polynomial Representations
+- **σ-polynomials**: Binary path encoding as σₚ(u,v) polynomials
+- **k-polynomials**: Transformation polynomials for cycle analysis
+- **d-polynomials**: d-polynomials - d(g,h) = h^e - g^o an important term in the cycle element identity
+
+### Cycle Analysis
+- **Complete cycle enumeration** with efficient navigation
+- **Forced vs unforced cycle classification**
+- **Cycle element identity verification**: x·d = a·k relationships
+- **Multiple Collatz variants**: (3x+1,x/2), (5x+1,x/2), (7x+1,x/2), etc.
+
+### Advanced Mathematics
+- **Cyclotomic polynomial factorization** for d-polynomials
+- **Matrix representations** for polynomial manipulation
+- **GCD analysis** and solution theory for cycle constraints
+- **Binary operations** with complete bit-level analysis
+
+## 🔬 Research Applications
+
+Plumial enables systematic investigation of:
+- **Cycle existence theorems** through polynomial constraint analysis
+- **Uniqueness proofs** using GH-form canonical representations
+- **Statistical analysis** of cycle length distributions
+- **Visualization** of polynomial surfaces and cycle behavior
+
+## 🛠 Development Installation
+
+```bash
+git clone https://github.com/yourusername/plumial.git
+cd plumial
+pip install -e ".[dev]"
+```
+
+### Running Tests
+
+```bash
+pytest                    # Run all tests
+pytest tests/test_p_class.py  # Run specific test file
+```
+
+### Building Documentation
+
+```bash
+cd docs
+make html                 # HTML documentation
+make latexpdf            # PDF documentation
+```
+
+## 🤝 Contributing
+
+We welcome contributions! Please see our [Contributing Guide](CONTRIBUTING.md) for details.
+
+1. Fork the repository
+2. Create a feature branch (`git checkout -b feature/amazing-feature`)
+3. Make your changes with tests
+4. Run the test suite (`pytest`)
+5. Submit a pull request
+
+## 📄 License
+
+This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.
+
+## 🙏 Acknowledgments
+
+- Built with [SymPy](https://www.sympy.org/) for symbolic mathematics
+- Documentation powered by [Sphinx](https://www.sphinx-doc.org/)
+- Inspired by decades of Collatz conjecture research
+
+---
+
+*"The polynomial framework transforms Collatz analysis from computational iteration to algebraic constraint solving, revealing deep mathematical structures while maintaining computational accessibility."*

plumial-0.1.0/README.md

@@ -0,0 +1,178 @@
+# Plumial: Collatz Conjecture Analysis
+
+[![Documentation Status](https://img.shields.io/badge/docs-latest-brightgreen.svg)](https://your-docs-url.com)
+[![PyPI version](https://badge.fury.io/py/plumial.svg)](https://badge.fury.io/py/plumial)
+[![Python 3.8+](https://img.shields.io/badge/python-3.8+-blue.svg)](https://www.python.org/downloads/)
+[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
+
+Plumial is a powerful Python library for mathematical analysis of the Collatz conjecture using polynomial representations. It transforms the discrete dynamics of Collatz sequences into algebraic operations on polynomial spaces, enabling systematic analysis of cycle structures and their properties.
+
+## ✨ Key Features
+
+- **Path Objects (P class)**: Hydrated path identifiers that encode Collatz sequence paths
+- **Polynomial Representations**: UV polynomials and k polynomials for algebraic analysis
+- **Cycle Analysis**: Complete cycle navigation, detection, and mathematical properties
+- **Symbolic Mathematics**: Full SymPy integration with comprehensive mathematical operations
+- **Performance Optimized**: LRU caching and efficient algorithms for large-scale analysis
+- **Type Safe**: Comprehensive type hints and modern Python practices
+
+## 🌀 The Mystery Revealed
+
+<div align="center">
+
+![Plumial Animation](https://raw.githubusercontent.com/yourusername/plumial/main/docs/_static/watch-animation.gif)
+
+*Witness the hypnotic σ₂₈₁(u,v) polynomial visualization - a glimpse into the hidden mathematical beauty of "glitched" Collatz cycles*
+
+</div>
+
+This mesmerizing animation reveals something remarkable: **p=281** represents a glitched Collatz cycle that challenges our understanding of the 3x+1 conjecture. The visualization shows σ₂₈₁(u,v) = u² + uv² + v⁴ evaluated with complex roots of unity, transforming discrete binary patterns into continuous geometric flows.
+
+## 🔗 Mathematical Foundations
+
+**[📖 Read the Complete Mathematical Foundations](docs/mathematical_foundations.html)**
+
+Dive deep into the theoretical framework that powers Plumial:
+- **UV-Polynomial Theory**: Bijection between natural numbers and algebraic forms
+- **Cycle Element Identity**: The fundamental relationship x·d = a·k for cycle elements
+- **Binary Decomposition**: How p = 2^(n_p) + Σb_{p,i}2^i encodes path structure
+- **Successor Operations**: Bit rotation operations that preserve polynomial structure
+- **Advanced Topics**: Cyclotomic connections, forced vs unforced cycles, and more
+
+## 🚀 Quick Start
+
+### Installation
+
+```bash
+pip install plumial
+```
+
+### Basic Usage
+
+```python
+from plumial import P
+from plumial.core import B
+from plumial.utils import S, I, F
+
+# Create a polynomial for p-value 133
+p = P(133)
+
+# Get bit counts and binary representation
+print(f"n={p.n()}, o={p.o()}, e={p.e()}")  # n=7, o=2, e=5
+print(f"Binary: {p.b()}")                   # Binary: 10000101
+
+# Work with polynomial representations
+print(p.d())    # h**5 - g**2 (d-polynomial)
+print(p.k())    # k polynomial (symbolic)
+print(p.uv())   # UV polynomial representation
+
+# Evaluate numerically using basis encoding
+print(p.encode(B.Collatz).d())              # Evaluates with g=3, h=2: 23
+
+# Cycle operations with functional style
+collatz_p293 = P(293).encode(B.Collatz)
+odd_k_values = list(collatz_p293.cycle(map=F.k(), filter=F.isodd))
+
+# Binary string constructor
+assert P(133) == P("10000101")               # Equivalent results
+```
+
+### Advanced Analysis
+
+```python
+# Explore the famous glitched cycle
+p281 = P(281)
+cycle = list(p281.cycle())
+print(f"Cycle length: {len(cycle)}")
+print(f"Sigma polynomial: {p281.uv()}")  # u**2 + u*v**2 + v**4
+
+# Mathematical verification
+for p in cycle:
+    print(f"{p.p():3d}: forced={p.isforced()}")
+
+# Symbolic mathematics
+import sympy as sy
+a, x = p.ax()  # Get reduced cycle polynomials
+assert sy.expand(x * p.d()) == sy.expand(a * p.k())  # Verify identity
+```
+
+## 📚 Documentation
+
+- **[Mathematical Foundations](docs/mathematical_foundations.html)** - Complete theoretical framework
+- **[API Reference](docs/api_reference.html)** - Comprehensive function documentation
+- **[Tutorial](docs/tutorial.html)** - Step-by-step learning guide
+- **[Examples](docs/examples.html)** - Interactive Jupyter notebooks
+
+## 🧮 Mathematical Capabilities
+
+### Polynomial Representations
+- **σ-polynomials**: Binary path encoding as σₚ(u,v) polynomials
+- **k-polynomials**: Transformation polynomials for cycle analysis
+- **d-polynomials**: d-polynomials - d(g,h) = h^e - g^o an important term in the cycle element identity
+
+### Cycle Analysis
+- **Complete cycle enumeration** with efficient navigation
+- **Forced vs unforced cycle classification**
+- **Cycle element identity verification**: x·d = a·k relationships
+- **Multiple Collatz variants**: (3x+1,x/2), (5x+1,x/2), (7x+1,x/2), etc.
+
+### Advanced Mathematics
+- **Cyclotomic polynomial factorization** for d-polynomials
+- **Matrix representations** for polynomial manipulation
+- **GCD analysis** and solution theory for cycle constraints
+- **Binary operations** with complete bit-level analysis
+
+## 🔬 Research Applications
+
+Plumial enables systematic investigation of:
+- **Cycle existence theorems** through polynomial constraint analysis
+- **Uniqueness proofs** using GH-form canonical representations
+- **Statistical analysis** of cycle length distributions
+- **Visualization** of polynomial surfaces and cycle behavior
+
+## 🛠 Development Installation
+
+```bash
+git clone https://github.com/yourusername/plumial.git
+cd plumial
+pip install -e ".[dev]"
+```
+
+### Running Tests
+
+```bash
+pytest                    # Run all tests
+pytest tests/test_p_class.py  # Run specific test file
+```
+
+### Building Documentation
+
+```bash
+cd docs
+make html                 # HTML documentation
+make latexpdf            # PDF documentation
+```
+
+## 🤝 Contributing
+
+We welcome contributions! Please see our [Contributing Guide](CONTRIBUTING.md) for details.
+
+1. Fork the repository
+2. Create a feature branch (`git checkout -b feature/amazing-feature`)
+3. Make your changes with tests
+4. Run the test suite (`pytest`)
+5. Submit a pull request
+
+## 📄 License
+
+This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.
+
+## 🙏 Acknowledgments
+
+- Built with [SymPy](https://www.sympy.org/) for symbolic mathematics
+- Documentation powered by [Sphinx](https://www.sphinx-doc.org/)
+- Inspired by decades of Collatz conjecture research
+
+---
+
+*"The polynomial framework transforms Collatz analysis from computational iteration to algebraic constraint solving, revealing deep mathematical structures while maintaining computational accessibility."*

plumial-0.1.0/pyproject.toml

@@ -0,0 +1,127 @@
+[build-system]
+requires = ["setuptools>=61.0", "wheel"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "plumial"
+version = "0.1.0"
+description = "A Python package for exploring cyclic structures in polynomial rings"
+readme = "README.md"
+requires-python = ">=3.8"
+license = {text = "MIT"}
+authors = [
+    {name = "Jon Seymour", email = "jon@wildducktheories.com"},
+]
+maintainers = [
+    {name = "Jon Seymour", email = "jon@wuldducktheories.com"},
+]
+keywords = ["collatz", "conjecture", "mathematics", "number-theory"]
+classifiers = [
+    "Development Status :: 3 - Alpha",
+    "Intended Audience :: Science/Research",
+    "License :: OSI Approved :: MIT License",
+    "Operating System :: OS Independent",
+    "Programming Language :: Python :: 3",
+    "Programming Language :: Python :: 3.8",
+    "Programming Language :: Python :: 3.9",
+    "Programming Language :: Python :: 3.10",
+    "Programming Language :: Python :: 3.11",
+    "Programming Language :: Python :: 3.12",
+    "Topic :: Scientific/Engineering :: Mathematics",
+]
+dependencies = [
+    "sympy",
+    "numpy",
+]
+
+[project.optional-dependencies]
+dev = [
+    "pytest>=7.0",
+    "pytest-cov>=4.0",
+    "black>=22.0",
+    "isort>=5.0",
+    "flake8>=5.0",
+    "mypy>=1.0",
+    "pre-commit>=2.0",
+    "jupyter",
+]
+docs = [
+    "sphinx>=5.0",
+    "sphinx-rtd-theme>=1.0",
+]
+
+[project.urls]
+Homepage = "https://github.com/wildducktheories/plumial"
+Repository = "https://github.com/wildducktheories/plumial"
+Documentation = "https://plumial.readthedocs.io"
+"Bug Tracker" = "https://github.com/wildducktheories/plumial/issues"
+
+[tool.setuptools]
+package-dir = {"" = "src"}
+
+[tool.setuptools.packages.find]
+where = ["src"]
+
+[tool.pytest.ini_options]
+testpaths = ["tests"]
+python_files = ["test_*.py", "*_test.py"]
+python_classes = ["Test*"]
+python_functions = ["test_*"]
+
+[tool.black]
+line-length = 88
+target-version = ['py38']
+include = '\.pyi?$'
+extend-exclude = '''
+/(
+  # directories
+  \.eggs
+  | \.git
+  | \.hg
+  | \.mypy_cache
+  | \.tox
+  | \.venv
+  | build
+  | dist
+)/
+'''
+
+[tool.isort]
+profile = "black"
+multi_line_output = 3
+line_length = 88
+include_trailing_comma = true
+force_grid_wrap = 0
+use_parentheses = true
+ensure_newline_before_comments = true
+
+[tool.mypy]
+python_version = "3.8"
+warn_return_any = true
+warn_unused_configs = true
+disallow_untyped_defs = true
+disallow_incomplete_defs = true
+check_untyped_defs = true
+disallow_untyped_decorators = true
+no_implicit_optional = true
+warn_redundant_casts = true
+warn_unused_ignores = true
+warn_no_return = true
+warn_unreachable = true
+strict_equality = true
+
+[tool.coverage.run]
+source = ["src"]
+omit = ["tests/*"]
+
+[tool.coverage.report]
+exclude_lines = [
+    "pragma: no cover",
+    "def __repr__",
+    "if self.debug:",
+    "if settings.DEBUG",
+    "raise AssertionError",
+    "raise NotImplementedError",
+    "if 0:",
+    "if __name__ == .__main__.:",
+]

plumial-0.1.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

plumial-0.1.0/src/plumial/__init__.py

@@ -0,0 +1,83 @@
+"""
+Plumial: A Python package for Collatz conjecture analysis and computation.
+
+This package provides comprehensive tools and mathematical frameworks for analyzing
+the Collatz conjecture through polynomial representations, d-polynomials,
+and binary path analysis.
+
+Key Features:
+    - Path Polynomials (P class): Represent Collatz sequence paths as mathematical polynomials
+    - D Objects (D class): Analyze d-polynomials d_p(g,h) = h^e - g^o fundamental to Collatz analysis
+    - Binary Operations: Comprehensive bit-level analysis and cycle navigation
+    - Symbolic Mathematics: Full SymPy integration for symbolic computation
+    - High Performance: LRU caching and optimized algorithms
+    - Type Safety: Comprehensive type hints and modern Python practices
+
+Core Classes:
+    P: path object class for sequence analysis
+        - uv polynomial representations
+        - Mathematical relationships (x*d = a*k)
+        - Cycle navigation and analysis
+
+    D: d-polynomial class for algebraic analysis
+        - Symbolic form h^e - g^o
+        - GCD computation and factorization
+        - Polynomial evaluation and manipulation
+
+Mathematical Background:
+    The Collatz conjecture studies sequences defined by:
+    - If n is even: n → n/2
+    - If n is odd: n → 3n+1
+
+    This package encodes these operations using polynomial representations where:
+    - h represents halving operations (typically h=2)
+    - g represents the 3x+1 operation (typically g=3)
+    - Path polynomials encode the sequence of operations
+    - Difference polynomials h^e - g^o capture cycle behavior
+
+Examples:
+    >>> from plumial import P, D
+    >>>
+    >>> # Create a path polynomial for p-value 133
+    >>> p = P(133)
+    >>> print(f"Path bits: n={p.n()}, odd={p.o()}, even={p.e()}")
+    >>>
+    >>> # Get uv polynomial representation
+    >>> uv_poly = p.uv()
+    >>> print(f"uv polynomial: {uv_poly}")
+    >>>
+    >>> # Evaluate k polynomial using modern encoding approach
+    >>> collatz_p = p.encode(g=3, h=2)
+    >>> k_value = collatz_p.k()
+    >>> print(f"k(3,2) = {k_value}")
+    >>>
+    >>> # Create d-polynomial
+    >>> d = D(2, 5)
+    >>> print(f"Difference polynomial: {d.d()}")  # h^5 - g^2
+    >>> collatz_d = d.encode(g=3, h=2)
+    >>> print(f"Evaluated at g=3, h=2: {collatz_d.d()}")  # 23
+
+Installation:
+    pip install plumial
+
+Dependencies:
+    - sympy: Symbolic mathematics
+    - numpy: Numerical computing
+    - typing: Type hints (Python 3.8+)
+
+Author: Jon Seymour <jon@wildducktheories.com>
+License: MIT
+Version: 0.1.0
+"""
+
+__version__ = "0.1.0"
+__author__ = "Jon Seymour"
+__email__ = "jon@wildducktheories.com"
+
+from .core import D, P
+
+__all__ = [
+    "__version__",
+    "P",
+    "D",
+]