loadbearing 0.1.0__tar.gz

loadbearing-0.1.0/.gitignore

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

loadbearing-0.1.0/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.

loadbearing-0.1.0/PKG-INFO

@@ -0,0 +1,188 @@
+Metadata-Version: 2.5
+Name: loadbearing
+Version: 0.1.0
+Summary: Separate what a claim asserts from what its derivation consumed.
+Project-URL: Homepage, https://github.com/vince-gonzalez/loadbearing
+Project-URL: Source, https://github.com/vince-gonzalez/loadbearing
+Project-URL: Issues, https://github.com/vince-gonzalez/loadbearing/issues
+Author-email: Vincent Gonzalez <vincegonzalez@me.com>
+License-Expression: Apache-2.0
+License-File: LICENSE
+Keywords: axioms,epistemology,lean,metamath,provenance,reproducibility
+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.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Requires-Python: >=3.10
+Provides-Extra: formal
+Requires-Dist: gonzalgo>=0.5.3; extra == 'formal'
+Requires-Dist: mmforge>=0.1.1; extra == 'formal'
+Description-Content-Type: text/markdown
+
+```
+╔════════════════════════════════════════════════════════════════════════════════════════════╗
+║                                                                                            ║
+║  ██╗      ██████╗  █████╗ ██████╗ ██████╗ ███████╗ █████╗ ██████╗ ██╗███╗   ██╗ ██████╗    ║
+║  ██║     ██╔═══██╗██╔══██╗██╔══██╗██╔══██╗██╔════╝██╔══██╗██╔══██╗██║████╗  ██║██╔════╝    ║
+║  ██║     ██║   ██║███████║██║  ██║██████╔╝█████╗  ███████║██████╔╝██║██╔██╗ ██║██║  ███╗   ║
+║  ██║     ██║   ██║██╔══██║██║  ██║██╔══██╗██╔══╝  ██╔══██║██╔══██╗██║██║╚██╗██║██║   ██║   ║
+║  ███████╗╚██████╔╝██║  ██║██████╔╝██████╔╝███████╗██║  ██║██║  ██║██║██║ ╚████║╚██████╔╝   ║
+║  ╚══════╝ ╚═════╝ ╚═╝  ╚═╝╚═════╝ ╚═════╝ ╚══════╝╚═╝  ╚═╝╚═╝  ╚═╝╚═╝╚═╝  ╚═══╝ ╚═════╝    ║
+║                                                                                            ║
+║                                   what a claim rests on                                    ║
+║                                                                                            ║
+╚════════════════════════════════════════════════════════════════════════════════════════════╝
+```
+`loadbearing` separates two things that look alike. What a claim says it rests
+on is one set. What its derivation actually used is another. In a formal
+library both are machine-readable, so the distance between them can be
+measured instead of argued about.
+
+## Install
+
+```bash
+pip install loadbearing
+```
+
+The core has no dependencies. Reading a library needs one more:
+
+```bash
+pip install "loadbearing[formal]"
+```
+
+That pulls `mmforge` for Metamath databases and `gonzalgo` for Lean 4
+environment dumps.
+
+## 633 of the 1,016 hold up nothing
+
+1,016 theorems in set.mm have a route to the axiom of countable choice. Remove
+any one of 633 of them and every other theorem still gets there, because those
+633 hold up nothing except themselves.
+
+```
+seam           reaches  carries  carries nothing  idle share  heaviest  holds up
+-------------  -------  -------  ---------------  ----------  --------  --------
+ax-cc             1016      383              633  62.3%       axcc2lem       937
+ax-ac, ax-ac2      524      247              277  52.9%       axac3          514
+ax-13              494      188              306  61.9%       ax13v          493
+```
+
+`reaches` counts every theorem with a route to the seam. `carries` counts the
+ones holding up at least one other theorem. The remainder are leaves of the
+cone: real users of the axiom that no other proof passes through.
+
+The load is concentrated. One statement, `axcc2lem`, holds up 937 of the 1,016.
+
+```bash
+python scripts/severing.py path/to/set.mm
+```
+
+Measured on set.mm at ledger digest `ee3fc0f7`, with syntax excluded: 49,237
+nodes and 904,702 consumed edges, in about forty seconds.
+
+## Every answer carries the command that re-derives it
+
+```python
+from loadbearing.sever import capture
+
+w = capture("set.mm", ["ax-ac", "ax-ac2"])
+w.write_script("reproduce.py")
+```
+
+The script that comes out digests the database, the version of `mmforge` that
+read it, and the answer itself. Run it on another machine and point it at your
+own copy:
+
+```bash
+python reproduce.py --source database=/your/set.mm
+```
+
+It exits non-zero if the database moved, if `mmforge` is a different build
+under the same version number, or if the recomputed answer disagrees with the
+recorded one. Standard output only ever carries an answer that matched.
+
+## The model
+
+A `Ledger` holds `Node`s and `Edge`s. Every edge is `ASSERTED` or `CONSUMED`:
+what the author declared, against what the derivation pulled in. A `Node`
+carries a sort — `SYNTAX`, `AXIOM`, `DEFINITION`, `DERIVED`, `UNKNOWN` — which
+is a property of the target and is orthogonal to the edge kind.
+
+Sort matters before any count is taken. In set.mm 40.0% of all consumed edges
+point at notation, and ten of the twelve most-cited labels are syntax
+constructors. A centrality figure over the raw edge set measures the grammar of
+the language. `SupportGraph` therefore excludes syntax by default and reports
+the exclusion in every summary, so a number cannot be read without the
+population it came from.
+
+`Split` gives the surplus and the deficit for one claim: cited and unused
+against used and uncited. In Lean, `Classical.propDecidable` arrives through
+instance resolution and appears in a proof's dependencies with nothing matching
+on the statement side, which is what a pure deficit looks like.
+
+## What it reads
+
+| substrate | via | asserted | consumed |
+|---|---|---|---|
+| Metamath | `mmforge` | — | proof citations |
+| Lean 4 | `gonzalgo` | statement dependencies | proof dependencies |
+
+A Metamath proof records what it used and says nothing about intent, so that
+adapter produces consumed edges alone.
+
+## Checking this yourself
+
+```bash
+git clone https://github.com/vince-gonzalez/loadbearing
+cd loadbearing
+python -m unittest discover -s tests
+```
+
+188 tests, no test dependency. The severing measurement is checked twice by
+different means: a dominator tree over the reversed graph, and a plain closure
+recomputed with the candidate removed. Every run certifies a sample of the
+first against the second and raises on a disagreement.
+
+Determinism is checked by running the same measurement in two subprocesses at
+different `PYTHONHASHSEED` values and comparing the bytes.
+
+## Author
+
+Vincent Gonzalez — [0009-0005-3640-014X](https://orcid.org/0009-0005-3640-014X)
+· vincegonzalez@me.com
+
+Apache-2.0.
+
+---
+
+---
+
+```
+╔════════════════════════════════════════════════════════════╗
+║                                                            ║
+║      ███████╗      ██╗  ██╗███████╗██╗   ██╗███████╗       ║
+║      ██╔════╝      ██║ ██╔╝██╔════╝╚██╗ ██╔╝██╔════╝       ║
+║      █████╗  █████╗█████╔╝ █████╗   ╚████╔╝ ███████╗       ║
+║      ██╔══╝  ╚════╝██╔═██╗ ██╔══╝    ╚██╔╝  ╚════██║       ║
+║      ██║           ██║  ██╗███████╗   ██║   ███████║       ║
+║      ╚═╝           ╚═╝  ╚═╝╚══════╝   ╚═╝   ╚══════╝       ║
+║                                                            ║
+║               ·   C  R  E  A  T  I  V  E   ·               ║
+║                                                            ║
+║          ────────────────────────────────────────          ║
+║                                                            ║
+║                      Vincent Gonzalez                      ║
+║                         f-keys.com                         ║
+║                 ORCID 0009-0005-3640-014X                  ║
+║                                                            ║
+╚════════════════════════════════════════════════════════════╝
+```
+
+Part of [F-Keys](https://f-keys.com) — independent hardware, software
+and internet products. See the [working log](https://f-keys.com/log/)
+and [live status](https://f-keys.com/status/).

loadbearing-0.1.0/README.md

@@ -0,0 +1,162 @@
+```
+╔════════════════════════════════════════════════════════════════════════════════════════════╗
+║                                                                                            ║
+║  ██╗      ██████╗  █████╗ ██████╗ ██████╗ ███████╗ █████╗ ██████╗ ██╗███╗   ██╗ ██████╗    ║
+║  ██║     ██╔═══██╗██╔══██╗██╔══██╗██╔══██╗██╔════╝██╔══██╗██╔══██╗██║████╗  ██║██╔════╝    ║
+║  ██║     ██║   ██║███████║██║  ██║██████╔╝█████╗  ███████║██████╔╝██║██╔██╗ ██║██║  ███╗   ║
+║  ██║     ██║   ██║██╔══██║██║  ██║██╔══██╗██╔══╝  ██╔══██║██╔══██╗██║██║╚██╗██║██║   ██║   ║
+║  ███████╗╚██████╔╝██║  ██║██████╔╝██████╔╝███████╗██║  ██║██║  ██║██║██║ ╚████║╚██████╔╝   ║
+║  ╚══════╝ ╚═════╝ ╚═╝  ╚═╝╚═════╝ ╚═════╝ ╚══════╝╚═╝  ╚═╝╚═╝  ╚═╝╚═╝╚═╝  ╚═══╝ ╚═════╝    ║
+║                                                                                            ║
+║                                   what a claim rests on                                    ║
+║                                                                                            ║
+╚════════════════════════════════════════════════════════════════════════════════════════════╝
+```
+`loadbearing` separates two things that look alike. What a claim says it rests
+on is one set. What its derivation actually used is another. In a formal
+library both are machine-readable, so the distance between them can be
+measured instead of argued about.
+
+## Install
+
+```bash
+pip install loadbearing
+```
+
+The core has no dependencies. Reading a library needs one more:
+
+```bash
+pip install "loadbearing[formal]"
+```
+
+That pulls `mmforge` for Metamath databases and `gonzalgo` for Lean 4
+environment dumps.
+
+## 633 of the 1,016 hold up nothing
+
+1,016 theorems in set.mm have a route to the axiom of countable choice. Remove
+any one of 633 of them and every other theorem still gets there, because those
+633 hold up nothing except themselves.
+
+```
+seam           reaches  carries  carries nothing  idle share  heaviest  holds up
+-------------  -------  -------  ---------------  ----------  --------  --------
+ax-cc             1016      383              633  62.3%       axcc2lem       937
+ax-ac, ax-ac2      524      247              277  52.9%       axac3          514
+ax-13              494      188              306  61.9%       ax13v          493
+```
+
+`reaches` counts every theorem with a route to the seam. `carries` counts the
+ones holding up at least one other theorem. The remainder are leaves of the
+cone: real users of the axiom that no other proof passes through.
+
+The load is concentrated. One statement, `axcc2lem`, holds up 937 of the 1,016.
+
+```bash
+python scripts/severing.py path/to/set.mm
+```
+
+Measured on set.mm at ledger digest `ee3fc0f7`, with syntax excluded: 49,237
+nodes and 904,702 consumed edges, in about forty seconds.
+
+## Every answer carries the command that re-derives it
+
+```python
+from loadbearing.sever import capture
+
+w = capture("set.mm", ["ax-ac", "ax-ac2"])
+w.write_script("reproduce.py")
+```
+
+The script that comes out digests the database, the version of `mmforge` that
+read it, and the answer itself. Run it on another machine and point it at your
+own copy:
+
+```bash
+python reproduce.py --source database=/your/set.mm
+```
+
+It exits non-zero if the database moved, if `mmforge` is a different build
+under the same version number, or if the recomputed answer disagrees with the
+recorded one. Standard output only ever carries an answer that matched.
+
+## The model
+
+A `Ledger` holds `Node`s and `Edge`s. Every edge is `ASSERTED` or `CONSUMED`:
+what the author declared, against what the derivation pulled in. A `Node`
+carries a sort — `SYNTAX`, `AXIOM`, `DEFINITION`, `DERIVED`, `UNKNOWN` — which
+is a property of the target and is orthogonal to the edge kind.
+
+Sort matters before any count is taken. In set.mm 40.0% of all consumed edges
+point at notation, and ten of the twelve most-cited labels are syntax
+constructors. A centrality figure over the raw edge set measures the grammar of
+the language. `SupportGraph` therefore excludes syntax by default and reports
+the exclusion in every summary, so a number cannot be read without the
+population it came from.
+
+`Split` gives the surplus and the deficit for one claim: cited and unused
+against used and uncited. In Lean, `Classical.propDecidable` arrives through
+instance resolution and appears in a proof's dependencies with nothing matching
+on the statement side, which is what a pure deficit looks like.
+
+## What it reads
+
+| substrate | via | asserted | consumed |
+|---|---|---|---|
+| Metamath | `mmforge` | — | proof citations |
+| Lean 4 | `gonzalgo` | statement dependencies | proof dependencies |
+
+A Metamath proof records what it used and says nothing about intent, so that
+adapter produces consumed edges alone.
+
+## Checking this yourself
+
+```bash
+git clone https://github.com/vince-gonzalez/loadbearing
+cd loadbearing
+python -m unittest discover -s tests
+```
+
+188 tests, no test dependency. The severing measurement is checked twice by
+different means: a dominator tree over the reversed graph, and a plain closure
+recomputed with the candidate removed. Every run certifies a sample of the
+first against the second and raises on a disagreement.
+
+Determinism is checked by running the same measurement in two subprocesses at
+different `PYTHONHASHSEED` values and comparing the bytes.
+
+## Author
+
+Vincent Gonzalez — [0009-0005-3640-014X](https://orcid.org/0009-0005-3640-014X)
+· vincegonzalez@me.com
+
+Apache-2.0.
+
+---
+
+---
+
+```
+╔════════════════════════════════════════════════════════════╗
+║                                                            ║
+║      ███████╗      ██╗  ██╗███████╗██╗   ██╗███████╗       ║
+║      ██╔════╝      ██║ ██╔╝██╔════╝╚██╗ ██╔╝██╔════╝       ║
+║      █████╗  █████╗█████╔╝ █████╗   ╚████╔╝ ███████╗       ║
+║      ██╔══╝  ╚════╝██╔═██╗ ██╔══╝    ╚██╔╝  ╚════██║       ║
+║      ██║           ██║  ██╗███████╗   ██║   ███████║       ║
+║      ╚═╝           ╚═╝  ╚═╝╚══════╝   ╚═╝   ╚══════╝       ║
+║                                                            ║
+║               ·   C  R  E  A  T  I  V  E   ·               ║
+║                                                            ║
+║          ────────────────────────────────────────          ║
+║                                                            ║
+║                      Vincent Gonzalez                      ║
+║                         f-keys.com                         ║
+║                 ORCID 0009-0005-3640-014X                  ║
+║                                                            ║
+╚════════════════════════════════════════════════════════════╝
+```
+
+Part of [F-Keys](https://f-keys.com) — independent hardware, software
+and internet products. See the [working log](https://f-keys.com/log/)
+and [live status](https://f-keys.com/status/).

loadbearing-0.1.0/pyproject.toml

@@ -0,0 +1,40 @@
+[build-system]
+requires = ["hatchling"]
+build-backend = "hatchling.build"
+
+[project]
+name = "loadbearing"
+version = "0.1.0"
+description = "Separate what a claim asserts from what its derivation consumed."
+readme = "README.md"
+requires-python = ">=3.10"
+license = "Apache-2.0"
+authors = [{ name = "Vincent Gonzalez", email = "vincegonzalez@me.com" }]
+keywords = ["provenance", "reproducibility", "metamath", "lean", "axioms", "epistemology"]
+classifiers = [
+    "Development Status :: 3 - Alpha",
+    "Intended Audience :: Science/Research",
+    "License :: OSI Approved :: Apache Software License",
+    "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 :: Mathematics",
+]
+dependencies = []
+
+[project.optional-dependencies]
+# mmforge 0.1.1 is a correctness floor: 0.1.0 misses 24 set.mm statements
+formal = ["gonzalgo>=0.5.3", "mmforge>=0.1.1"]
+
+[project.urls]
+Homepage = "https://github.com/vince-gonzalez/loadbearing"
+Source = "https://github.com/vince-gonzalez/loadbearing"
+Issues = "https://github.com/vince-gonzalez/loadbearing/issues"
+
+[tool.hatch.build.targets.wheel]
+packages = ["src/loadbearing"]
+
+[tool.hatch.build.targets.sdist]
+include = ["src/", "tests/", "scripts/", "README.md", "LICENSE", "pyproject.toml"]