October 2026 main drop: mirror from GitHub

.gitattributes

@@ -33,3 +33,4 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
 *.zip filter=lfs diff=lfs merge=lfs -text
 *.zst filter=lfs diff=lfs merge=lfs -text
 *tfevents* filter=lfs diff=lfs merge=lfs -text
+alloy.jar filter=lfs diff=lfs merge=lfs -text

LICENSE

@@ -0,0 +1,666 @@
+PIRTM — Prime-Indexed Recursive Tensor Mathematics
+Copyright (C) 2026 Ahmad Ali Parr
+Licensed under the GNU Affero General Public License v3 only (AGPL-3.0-only).
+Full text follows.
+
+                    GNU AFFERO GENERAL PUBLIC LICENSE
+                       Version 3, 19 November 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU Affero General Public License is a free, copyleft license for
+software and other kinds of works, specifically designed to ensure
+cooperation with the community in the case of network server software.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+our General Public Licenses are intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  Developers that use our General Public Licenses protect your rights
+with two steps: (1) assert copyright on the software, and (2) offer
+you this License which gives you legal permission to copy, distribute
+and/or modify the software.
+
+  A secondary benefit of defending all users' freedom is that
+improvements made in alternate versions of the program, if they
+receive widespread use, become available for other developers to
+incorporate.  Many developers of free software are heartened and
+encouraged by the resulting cooperation.  However, in the case of
+software used on network servers, this result may fail to come about.
+The GNU General Public License permits making a modified version and
+letting the public access it on a server without ever releasing its
+source code to the public.
+
+  The GNU Affero General Public License is designed specifically to
+ensure that, in such cases, the modified source code becomes available
+to the community.  It requires the operator of a network server to
+provide the source code of the modified version running there to the
+users of that server.  Therefore, public use of a modified version, on
+a publicly accessible server, gives the public access to the source
+code of the modified version.
+
+  An older license, called the Affero General Public License and
+published by Affero, was designed to accomplish similar goals.  This is
+a different license, not a version of the Affero GPL, but Affero has
+released a new version of the Affero GPL which permits relicensing under
+this license.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU Affero General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Remote Network Interaction; Use with the GNU General Public License.
+
+  Notwithstanding any other provision of this License, if you modify the
+Program, your modified version must prominently offer all users
+interacting with it remotely through a computer network (if your version
+supports such interaction) an opportunity to receive the Corresponding
+Source of your version by providing access to the Corresponding Source
+from a network server at no charge, through some standard or customary
+means of facilitating copying of software.  This Corresponding Source
+shall include the Corresponding Source for any work covered by version 3
+of the GNU General Public License that is incorporated pursuant to the
+following paragraph.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the work with which it is combined will remain governed by version
+3 of the GNU General Public License.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU Affero General Public License from time to time.  Such new versions
+will be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU Affero General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU Affero General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU Affero General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Affero General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Affero General Public License for more details.
+
+    You should have received a copy of the GNU Affero General Public License
+    along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If your software can interact with users remotely through a computer
+network, you should also make sure that it provides a way for users to
+get its source.  For example, if your program is a web application, its
+interface could display a "Source" link that leads users to an archive
+of the code.  There are many ways you could offer source, and different
+solutions will be better for different programs; see section 13 for the
+specific requirements.
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU AGPL, see
+<https://www.gnu.org/licenses/>.

README.md

@@ -0,0 +1,87 @@
+---
+license: agpl-3.0
+tags:
+- snapkitty
+- october-2026-drop
+- alloy
+- formal-methods
+- formal-verification
+- model-checking
+- counter-paper
+- goldilocks-field
+- research
+---
+
+> Mirrored from [https://github.com/AHMADALIPARR/PIRTM](https://github.com/AHMADALIPARR/PIRTM) at commit `784ed88`. Part of the **SnapKitty October 2026 main drop**.
+
+<!--
+  Copyright (C) 2026 Ahmad Ali Parr
+  SPDX-License-Identifier: AGPL-3.0-only
+-->
+
+# PIRTM
+
+[![License: AGPL-3.0](https://img.shields.io/badge/license-AGPL--3.0-blue.svg)](LICENSE)
+[![Alloy 6.2.0](https://img.shields.io/badge/Alloy-6.2.0-orange.svg)](https://alloytools.org/)
+[![Reproducible](https://img.shields.io/badge/reproducible-yes-green.svg)](paper/counter-paper.md#reproduction)
+
+**Prime-Indexed Recursive Tensor Mathematics** — a compiler IR for tensor
+programs lowering to Goldilocks field arithmetic circuits (`p = 2⁶⁴ − 2³² + 1`).
+
+This repo hosts an Alloy counter-paper against the HCALC verification logs.
+
+---
+
+## The claim, in full
+
+`github.com/AHMADALIPARR/hcalc` ships Alloy 6.2.0 logs reporting
+`UNSAT (PASS)` for **A1–A7**, **P1–P8**, and ten **`INV_*`** invariants —
+presented as verification of the sealed properties.
+
+**Documented findings** (all reproduced, see
+[`paper/counter-paper.md`](paper/counter-paper.md)):
+
+1. **Every assertion is formula-identical to an enforced fact.** A1 asserts
+   `declaredCard = 64`; the fact sets `declaredCard = 64`. P2 asserts
+   `isDiagonal = 1 ∧ alphaLaw = SpecAlphaLaw`; the fact sets both. Same
+   for A6, A7, P4, INV_converge, INV_evolution_total — see §2 of the paper.
+2. **The model checks flags, not mathematics.** The 64 primes are an Int
+   constant; the "Gershgorin bound" and "operator norm ≤ 1−ε" are Int
+   flags (`opBoundOK = 1`); `αⱼ = 1/(1+log pⱼ)` is an uninterpreted atom
+   `SpecAlphaLaw`. No prime value, logarithm, or norm is ever computed.
+3. **The method cannot distinguish truth from falsehood.** Exhibit A
+   (`alloy/vacuity-demo.als`) runs the identical pattern on a **false**
+   claim — `Moon.madeOfCheese = 1` — and Alloy returns `UNSAT`.
+4. **Falsifiability is what's missing.** Exhibit B
+   (`alloy/hcalc-mirror.als`) mirrors the real A7/P2 pairs and adds a
+   control check whose fact models a *generator*, not the conclusion —
+   the shape a genuine verification takes.
+5. **What is NOT disputed:** the HCALC definitions, the mathematics, or
+   the Lean 4 formalization (1968 jobs, zero `sorry` — genuine proof,
+   credited in full). Only what the *Alloy logs* are claimed to establish.
+
+Until the checks can fail, every `UNSAT (PASS)` reads as
+`TAUTOLOGY (UNINFORMATIVE)`.
+
+---
+
+## Reproduce
+
+```sh
+java -jar alloy.jar exec -f -t text alloy/vacuity-demo.als
+java -jar alloy.jar exec -f -t text alloy/hcalc-mirror.als
+```
+
+Alloy 6.2.0 jar bundled. Full argument:
+[`paper/counter-paper.md`](paper/counter-paper.md).
+
+## License
+
+[AGPL-3.0-only](LICENSE). Copyright (C) 2026 Ahmad Ali Parr.
+
+### 💼 Commercial License
+
+SnapKitty code is free and open under **AGPL-3.0** for open-source use. Building a commercial product or service? A **proprietary commercial license** from Snapkitty Collective LLC lets you ship this code without the AGPL's source-sharing and network-use obligations.
+
+**[→ Get a commercial license](mailto:A.parr@belespritdaccord.uk?subject=Commercial%20license:%20PIRTM)** · A.parr@belespritdaccord.uk
+

alloy.jar

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6b8c1cb5bc93bedfc7c61435c4e1ab6e688a242dc702a394628d9a9801edb78d
+size 21062377

alloy/hcalc-mirror.als

@@ -0,0 +1,88 @@
+/*
+ * hcalc-mirror.als — PIRTM counter-paper, Exhibit B
+ *
+ * A structural mirror of two real HCALC checks, annotated to show the
+ * fact/assert identity. Names and shapes follow the originals:
+ *   - A7 (HCALC.als): GapRecord statuses forced to SpecDefined by fact,
+ *     then asserted SpecDefined.
+ *   - P2 (modules/Transform.als): TpMap flags forced to (1, SpecAlphaLaw)
+ *     by fact, then asserted identical.
+ *
+ * The substantive mathematics (prime values, log weights, operator norms)
+ * never enters the Alloy model; it is replaced by Int/enum flags.
+ * Alloy therefore checks flag bookkeeping, not mathematics.
+ */
+
+module hcalc_mirror
+
+-- ============ Mirror of HCALC A7 ============
+abstract sig DefStatus {}
+one sig SpecDefined extends DefStatus {}
+
+one sig GapRecord_Tp {
+  status: one DefStatus
+}
+
+-- Original: "fact A7_production_all_spec_defined { GapRecord_Tp.status = SpecDefined ... }"
+fact hcalc_A7_fact {
+  GapRecord_Tp.status = SpecDefined
+}
+
+-- Original: "assert A7_production_defined_records { ... GapRecord_Tp.status = SpecDefined ... }"
+assert hcalc_A7_assert {
+  GapRecord_Tp.status = SpecDefined
+}
+
+check hcalc_A7_assert for 3
+-- UNSAT. Inevitable: the fact admits no instance where status differs.
+
+-- ============ Mirror of HCALC P2 ============
+abstract sig AlphaLawKind {}
+one sig SpecAlphaLaw extends AlphaLawKind {}
+
+sig TpMap {
+  isDiagonal: Int,
+  alphaLaw: one AlphaLawKind
+}
+
+-- Original: "fact fact_P2_tp_diag_spec_alpha {
+--              all tp: TpMap | tp.isDiagonal = 1 and tp.alphaLaw = SpecAlphaLaw }"
+fact hcalc_P2_fact {
+  all tp: TpMap | tp.isDiagonal = 1 and tp.alphaLaw = SpecAlphaLaw
+}
+
+-- Original: "assert P2_tp_diag_spec_alpha { tp_diag_spec_alpha_ok }"
+-- where tp_diag_spec_alpha_ok is the identical formula.
+assert hcalc_P2_assert {
+  all tp: TpMap | tp.isDiagonal = 1 and tp.alphaLaw = SpecAlphaLaw
+}
+
+check hcalc_P2_assert for 3
+-- UNSAT. Inevitable: same formula as the fact.
+--
+-- NOTE what is NOT modeled: alpha_j = 1/(1+log p_{j mod 64}).
+-- No logarithm, no prime values, no real arithmetic appear anywhere.
+-- "SpecAlphaLaw" is an uninterpreted atom. The check confirms the atom
+-- is attached where the fact attached it. That is bookkeeping, not proof.
+
+-- ============ What a non-vacuous check would look like ============
+-- A real check would DERIVE the flag from independently modeled structure,
+-- e.g.: model actual small primes, compute a weight law in Int arithmetic,
+-- and assert the diagonal property FOLLOWS. Then a counterexample would be
+-- possible in principle, and UNSAT would mean something.
+--
+-- Minimal sketch (integers stand in for the weight law):
+sig Cell { w: Int }
+
+-- Suppose the SPEC claims: every weight is positive.
+-- A non-vacuous model does NOT fact this in; it facts the GENERATOR:
+fact generator {
+  all c: Cell | c.w = 2   -- stand-in for "computed by the weight law"
+}
+assert weights_positive {
+  all c: Cell | c.w > 0
+}
+check weights_positive for 3
+-- UNSAT, and this time it MEANS something: had the generator been
+-- "c.w = -5", the check would have found the counterexample.
+-- Falsifiability is the difference between verification and transcription.

alloy/vacuity-demo.als

@@ -0,0 +1,46 @@
+/*
+ * vacuity-demo.als — PIRTM counter-paper, Exhibit A
+ *
+ * Demonstrates that the verification pattern used in the HCALC Alloy model
+ * (github.com/AHMADALIPARR/hcalc) cannot distinguish true claims from false
+ * ones, because every "check" asserts a formula already enforced as a fact.
+ *
+ * Pattern under test (one instance per HCALC check A1-A7, P1-P8, INV_*):
+ *   fact  F { P }      -- P enforced on all instances, no counterexample possible
+ *   assert A { P }      -- the "verification": is P true in all instances?
+ *   check A            -- UNSAT, reported as "PASS"
+ *
+ * Here P is a claim about the real world that is FALSE. If the pattern still
+ * reports UNSAT ("PASS"), the pattern verifies nothing.
+ */
+
+module vacuity_demo
+
+-- A false real-world claim, encoded exactly the way HCALC encodes its
+-- "source-claims": as an Int flag on a singleton signature.
+one sig Moon {
+  madeOfCheese: Int
+}
+
+-- Step 1, the HCALC move: install the claim as an uncheckable fact.
+-- (Compare: hcalc alloy/modules/PrimeIndex.als,
+--  "fact A1_declared_cardinality_64 { P64Carrier.declaredCard = 64 }".)
+fact claim_as_fact {
+  Moon.madeOfCheese = 1
+}
+
+-- Step 2, the HCALC "verification": assert the identical formula.
+-- (Compare: "assert A1_P64_cardinality_and_distinct { prime_index_integrity }"
+--  where prime_index_integrity restates the fact's content.)
+assert MoonIsCheese {
+  Moon.madeOfCheese = 1
+}
+
+check MoonIsCheese for 3
+-- EXPECTED: UNSAT. The log will say "no counterexample found".
+-- CONCLUSION: the check passed for a false claim. The method is vacuous:
+-- it can only ever re-confirm the facts it was given.
+
+-- Control experiment: WITHOUT the fact, the same assertion is refutable.
+-- (Uncomment the fact above -> check passes; comment it out -> check fails.
+--  That is the whole content of every HCALC "UNSAT (PASS)" line.)

hcalc-mirror/receipt.json

@@ -0,0 +1 @@
+{"commands":{"hcalc_A7_assert":{"bitwidth":4,"expects":-1,"maxprefix":-1,"maxseq":-1,"minprefix":-1,"name":"hcalc_A7_assert","overall":3,"source":"check hcalc_A7_assert for 3","type":"check"},"hcalc_P2_assert":{"bitwidth":4,"expects":-1,"maxprefix":-1,"maxseq":-1,"minprefix":-1,"name":"hcalc_P2_assert","overall":3,"source":"check hcalc_P2_assert for 3","type":"check"},"weights_positive":{"bitwidth":4,"expects":-1,"maxprefix":-1,"maxseq":-1,"minprefix":-1,"name":"weights_positive","overall":3,"source":"check weights_positive for 3","type":"check"}},"coreMinimization":2,"inferPartialInstance":true,"repeat":1,"sigs":{"univ":{"builtin":true,"cardinality":"set","name":"univ","type":"{univ}"},"Int":{"builtin":true,"cardinality":"set","name":"Int","type":"{Int}"},"seq/Int":{"builtin":true,"cardinality":"set","name":"seq/Int","type":"{seq/Int}"},"String":{"builtin":true,"cardinality":"set","name":"String","type":"{String}"},"none":{"builtin":true,"cardinality":"set","name":"none","type":"{none}"},"DefStatus":{"cardinality":"none","name":"DefStatus","type":"{DefStatus}"},"SpecDefined":{"cardinality":"one","name":"SpecDefined","type":"{DefStatus}"},"GapRecord_Tp":{"cardinality":"one","fields":{"status":{"arity":2,"name":"status","type":"{GapRecord_Tp->DefStatus}"}},"name":"GapRecord_Tp","type":"{GapRecord_Tp}"},"AlphaLawKind":{"cardinality":"none","name":"AlphaLawKind","type":"{AlphaLawKind}"},"SpecAlphaLaw":{"cardinality":"one","name":"SpecAlphaLaw","type":"{AlphaLawKind}"},"TpMap":{"cardinality":"set","fields":{"isDiagonal":{"arity":2,"name":"isDiagonal","type":"{TpMap->Int}"},"alphaLaw":{"arity":2,"name":"alphaLaw","type":"{TpMap->AlphaLawKind}"}},"name":"TpMap","type":"{TpMap}"},"Cell":{"cardinality":"set","fields":{"w":{"arity":2,"name":"w","type":"{Cell->Int}"}},"name":"Cell","type":"{Cell}"}},"solver":"sat4j","symmetry":20,"timestamp":1791676059462,"unrolls":-1}

paper/counter-paper.md

@@ -0,0 +1,251 @@
+<!--
+  Copyright (C) 2026 Ahmad Ali Parr
+  SPDX-License-Identifier: AGPL-3.0-only
+-->
+
+# On the Vacuity of Fact/Assert-Identical Verification
+
+## An Alloy counter-paper on the HCALC verification logs
+
+**PIRTM — Prime-Indexed Recursive Tensor Mathematics**
+Ahmad Ali Parr · 2026-10-10
+
+---
+
+## 0. Abstract
+
+The HCALC repository (`github.com/AHMADALIPARR/hcalc`) ships Alloy 6.2.0
+verification logs in which every check — A1–A7, P1–P8, and ten `INV_*`
+invariants — reports `UNSAT (PASS)`. We show that these results are
+**vacuous**: in every case we examined, the assertion under check is
+formula-identical to (a fragment of) a `fact` already enforced on the
+model, so no counterexample is possible by construction. We prove the
+method cannot distinguish true claims from false ones by exhibiting a
+runnable Alloy model in which a **false** real-world claim passes with
+`UNSAT` under the identical pattern. We close by crediting what is
+genuinely verified (the Lean 4 formalization: 1968 jobs, zero `sorry`)
+and stating what non-vacuous Alloy verification would require.
+
+Nothing in this paper disputes the HCALC *definitions* (PRODUCTION.md).
+It disputes what the Alloy logs *establish*.
+
+---
+
+## 1. The claim under test
+
+`hcalc/alloy/logs/alloy-check.txt` (2026-10-07) reports, for Alloy 6.2.0:
+
+```
+=== A1-A7 sealed PROPERTY_MAP (UNSAT = pass) ===
+A1_P64_cardinality_and_distinct              UNSAT (PASS)
+...
+A7_production_defined_records                UNSAT (PASS)
+
+=== Production P1-P8 (UNSAT = pass) ===
+P1_carrier_linf_dim                          UNSAT (PASS)
+...
+P8_contractalg_gershgorin_then_c             UNSAT (PASS)
+
+=== INV_* checks (UNSAT = pass) ===
+... (10 more) ...
+```
+
+The governing note reads: *"UNSAT = PASS for checks"*. The reader is
+invited to conclude that Alloy verified the sealed properties. It did
+not. It re-confirmed its own input.
+
+---
+
+## 2. The pattern
+
+Every check we inspected follows one shape. Using A7 as the canonical
+example (`alloy/HCALC.als`):
+
+```alloy
+fact A7_production_all_spec_defined {
+  GapRecord_LambdaM.status = SpecDefined
+  ...                                   -- P enforced on all instances
+}
+
+assert A7_production_defined_records {
+  ...
+  GapRecord_LambdaM.status = SpecDefined
+  ...                                   -- P asserted
+}
+
+check A7_production_defined_records     -- UNSAT, logged as "PASS"
+```
+
+The `assert` is formula-identical to the `fact`. Alloy's `check`
+searches for an instance satisfying all facts and violating the
+assertion. The facts *define* the assertion's content, so the search
+space of counterexamples is empty *a priori*. `UNSAT` is not a
+discovery; it is a restatement of the input.
+
+The same identity holds, verbatim, across the model:
+
+| Check | Fact enforces | Assert restates | File |
+|---|---|---|---|
+| A1 | `P64Carrier.declaredCard = 64` | `declaredCard = 64` + index ranges | `modules/PrimeIndex.als` |
+| P2 | `tp.isDiagonal = 1 ∧ tp.alphaLaw = SpecAlphaLaw` | identical formula | `modules/Transform.als` |
+| INV_converge | `convergence_hyps_production` | `convergence_hyps_production` | `modules/Converge.als` |
+| A6 | guardian verdict implications | identical implications | `modules/Converge.als` |
+| INV_evolution_total | `all s: State \| some t: Time \| t.at = s` | identical formula | `modules/State.als` |
+| A7 | all GapRecords `= SpecDefined` | identical conjunction | `HCALC.als` |
+
+In no case does the assertion *derive* anything from independently
+modeled structure. In no case could a counterexample exist without
+contradicting a fact.
+
+---
+
+## 3. What the flags hide
+
+Even where the pattern were sound, the model checks **flags, not
+mathematics**:
+
+- **A1** does not verify 64 primes. It sets the integer constant
+  `declaredCard = 64` and checks the constant equals 64. The prime
+  *values* are explicitly deferred: *"Numeric prime VALUES remain
+  Lean L1; here we only constrain indices 0..63 distinct."* The
+  comment is honest; the `UNSAT (PASS)` line is not.
+- **P2** does not verify `αⱼ = 1/(1+log p_{j mod 64})`. No logarithm,
+  no prime value, no real arithmetic appears in the model.
+  `SpecAlphaLaw` is an uninterpreted atom; the check confirms the atom
+  is attached where the fact attached it. That is bookkeeping.
+- **A2** ("contractive ↔ Gershgorin bound") never computes a
+  Gershgorin disc. The operator norm is an `Int` flag.
+- **A6** ("guardian rejects spectral_radius ≥ 1") never computes a
+  spectral radius. The radius is an `Int` flag (`spectralRadiusGeOne`).
+
+A check that cannot see the mathematics cannot verify the
+mathematics. What Alloy verified, at most, is that the flag
+bookkeeping is self-consistent — which the facts already guaranteed.
+
+---
+
+## 4. Exhibit A — the method passes a false claim
+
+`alloy/vacuity-demo.als` (runnable, Alloy 6.2.0):
+
+```alloy
+one sig Moon { madeOfCheese: Int }
+
+fact claim_as_fact { Moon.madeOfCheese = 1 }   -- the HCALC move
+
+assert MoonIsCheese { Moon.madeOfCheese = 1 }  -- the HCALC "verification"
+
+check MoonIsCheese for 3
+```
+
+Result, reproduced 2026-10-10:
+
+```
+00. check MoonIsCheese             0       UNSAT
+```
+
+The moon is not made of cheese. The check "passed." **Any** claim
+installed as a fact passes. The HCALC `UNSAT (PASS)` lines therefore
+carry zero bits of information about the world, the primes, the
+contraction bounds, or the guardian. They carry exactly one bit: *the
+facts were read successfully.*
+
+---
+
+## 5. Exhibit B — structural mirrors of A7 and P2
+
+`alloy/hcalc-mirror.als` reproduces the A7 and P2 fact/assert pairs
+with renamed signatures and the identical logical shape, plus a
+non-vacuous control:
+
+```
+00. check hcalc_A7_assert          0       UNSAT
+01. check hcalc_P2_assert          0       UNSAT
+02. check weights_positive         0       UNSAT
+```
+
+Checks 00 and 01 are the tautologies. Check 02 is different: its fact
+models a *generator* (`c.w = 2`, standing in for a computed weight
+law) while the assertion (`all c: Cell | c.w > 0`) is *not* among the
+facts. Had the generator been `c.w = -5`, Alloy would have produced a
+counterexample. **Falsifiability is the difference between
+verification and transcription.** Checks 00/01 (and every HCALC check
+in §2) lack it; check 02 has it.
+
+---
+
+## 6. What is genuinely verified — credited in full
+
+The Lean 4 formalization is the real thing:
+
+- `lean/build.log`: **build completed successfully (1968 jobs)**
+- `grep -rn "sorry"`: **zero** occurrences
+- Toolchain pinned: `leanprover/lean4:v4.34.1`
+
+A zero-`sorry` Lean build is machine-checked proof, not bookkeeping.
+The convergence lemmas (L5), the `InstanceBridge` non-identity
+morphism (L7), and the prime-indexed definitions (L1/L6) stand on this
+ground. This paper does not touch them. The flaw is localized
+entirely to what the *Alloy logs* are claimed to establish — and,
+by extension, to any downstream claim that "Alloy verified" the
+sealed properties A1–A7 / P1–P8.
+
+---
+
+## 7. What non-vacuous Alloy verification would require
+
+1. **Facts model generators, not conclusions.** Model the prime list
+   (or a faithful finite fragment), the weight-law computation, the
+   norm estimates — then assert the *consequences*.
+2. **Assertions must be falsifiable in principle.** For each `check`,
+   exhibit (or argue) an instance class the facts admit in which the
+   assertion fails. If none exists, the check is transcription.
+3. **No flag-encoding of the thing to be proved.** An uninterpreted
+   atom named `SpecAlphaLaw` cannot verify `αⱼ = 1/(1+log pⱼ)`.
+4. **Separate the harness from the honor.** A log line `UNSAT (PASS)`
+   must mean "no counterexample exists in scope," not "the fact was
+   restated correctly."
+
+---
+
+## 8. Conclusion
+
+The HCALC Alloy logs prove that the HCALC Alloy model is consistent
+with itself. They do not verify A1–A7, P1–P8, or any `INV_*`
+invariant in any sense that could fail. Exhibit A shows the method
+passes false claims; Exhibit B shows the exact structural identity
+between HCALC's facts and its assertions, alongside a falsifiable
+control that demonstrates what the missing property looks like.
+
+The mathematics may well be correct — the Lean build suggests much
+of it is — but correctness *of the definitions* and verification
+*by the Alloy logs* are different claims, and only the first is
+earned. Until the Alloy model is rewritten so its checks can fail,
+every `UNSAT (PASS)` should be read as `TAUTOLOGY (UNINFORMATIVE)`.
+
+---
+
+## Reproduction
+
+```sh
+# Exhibits A and B (Alloy 6.2.0, bundled jar):
+java -jar alloy.jar exec -f -t text alloy/vacuity-demo.als
+java -jar alloy.jar exec -f -t text alloy/hcalc-mirror.als
+
+# Expected:
+#   00. check MoonIsCheese             0       UNSAT
+#   00. check hcalc_A7_assert          0       UNSAT
+#   01. check hcalc_P2_assert          0       UNSAT
+#   02. check weights_positive         0       UNSAT
+```
+
+Model under test: `github.com/AHMADALIPARR/hcalc` (Alloy sources as of
+2026-10-07; log `alloy/logs/alloy-check.txt`).
+
+---
+
+*PIRTM is Prime-Indexed Recursive Tensor Mathematics: the compiler IR
+for tensor programs lowering to Goldilocks field arithmetic. This
+paper is issued from inside that program, against the HCALC
+instantiation's verification claims — not against its definitions,
+its Lean proofs, or its authors' mathematics.*

vacuity-demo/receipt.json

@@ -0,0 +1 @@
+{"commands":{"MoonIsCheese":{"bitwidth":4,"expects":-1,"maxprefix":-1,"maxseq":-1,"minprefix":-1,"name":"MoonIsCheese","overall":3,"source":"check MoonIsCheese for 3","type":"check"}},"coreMinimization":2,"inferPartialInstance":true,"repeat":1,"sigs":{"univ":{"builtin":true,"cardinality":"set","name":"univ","type":"{univ}"},"Int":{"builtin":true,"cardinality":"set","name":"Int","type":"{Int}"},"seq/Int":{"builtin":true,"cardinality":"set","name":"seq/Int","type":"{seq/Int}"},"String":{"builtin":true,"cardinality":"set","name":"String","type":"{String}"},"none":{"builtin":true,"cardinality":"set","name":"none","type":"{none}"},"Moon":{"cardinality":"one","fields":{"madeOfCheese":{"arity":2,"name":"madeOfCheese","type":"{Moon->Int}"}},"name":"Moon","type":"{Moon}"}},"solver":"sat4j","symmetry":20,"timestamp":1791676053312,"unrolls":-1}