Built at 654c517babda6d1b645b762d17251550d22ef9c8

LICENSE

@@ -0,0 +1,661 @@
+                    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/>.

NOTICE.md

@@ -0,0 +1,48 @@
+# Notice
+
+Copyright (C) 2026 Datamine Network Inc.
+
+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 in [LICENSE](LICENSE) for more details.
+
+## What the licence covers
+
+- The code: the Rust crates under `model/crates/`, the page under `chat/`, the scripts under
+  `scripts/`, and the documents in this repository.
+- The quiz, the curriculum, the facts and the seeds, which are the source the weights are compiled
+  from: `model/data/quiz/`, `model/data/train/`, `model/data/facts/` and `model/data/seeds/`.
+- The weights: every cursor network (its weights file and the classes file beside it) and the
+  page's `network.bin`, `network.json` and `seeds.txt` built from this repository, with or without a
+  notice in the file. A release of weights names the commit it was built from, so the source it was
+  compiled from is the repository at that commit.
+
+The licence applies per file only where a file says otherwise. No file in this repository does.
+
+## What it does not cover
+
+- The names. "Datamine Network", "DAM1" and the Datamine logo are the names and mark of Datamine
+  Network Inc. Under section 7(e) of the licence, no right is granted to use them. You may say that your
+  work is derived from DAM1. You may not call a modified version DAM1, or present it as coming
+  from Datamine Network.
+
+## Running it for others
+
+Section 13 of the licence: if you run a modified version and users interact with it through a
+network, you must offer those users the source of your version. Serving the page from a site is
+conveying it, so the site must also make its source available, as section 6 says. The unmodified
+page satisfies this by pointing at this repository and the commit it was built from.
+
+## No notice in the Rust files
+
+The Rust is written under Premise, which forbids comments: the checker fails the build on one.
+The per-file header that the licence suggests is therefore not in the Rust files. This file and
+`LICENSE` carry the notice for every file in the repository.
+
+## Contributions
+
+A contribution to this repository is accepted under the same licence, with no separate agreement.

README.md

@@ -1,3 +1,359 @@
 ---
 license: agpl-3.0
+language:
+- en
+library_name: dam1
+pipeline_tag: question-answering
+tags:
+- dam-word
+- llm
+- symbolic
+- reading-comprehension
+- safetensors
+- rust
+- webassembly
 ---
+
+# 🧠 DAM1
+
+DAM1 is an LLM of a different design. You tell it things and ask it questions in English, as you
+do with any LLM. It reads English one word at a time into a tree of things, places and the
+relations between them, the world the words describe, and answers from that tree. Like any LLM
+it reads a context of tokens and predicts the next token, one at a time. Its tokens are steps,
+not pieces of text: grab a thing, drop it into a place, write a property, find what a question
+names, get the answer, work a number, until it chooses to continue to the next word. The steps
+are fixed operations of the engine; the network only chooses between them.
+
+What it knows is in the tree, where it can be read and changed, and not in the weights. The
+network learns only how to shape and read that memory. That is why it is small: it is not a
+transformer, it was not trained on a large corpus, and it does not write free text. These files
+hold 5,593,620 numbers, three networks of 1,864,540 numbers each that read by vote, and the
+permanent state the project's seeds make. It runs on a processor, and in a browser through
+WebAssembly, where the Datamine Network chat runs it with nothing sent to a server.
+
+## 📊 How it compares
+
+Every model was asked the same 2,669 questions: the questions of the held-out lines of DAM1's
+curriculum, which no network was trained on. Each item is a short text and one question about it.
+One rule scores every reply. The other models are also given an order and two worked examples,
+which DAM1 is not; they run in float16 on an NVIDIA RTX 3080 Ti, DAM1 on the processor.
+
+| Model | Parameters | Weights | Memory | Answered | Exact | One answer |
+|---|---:|---:|---:|---:|---:|---:|
+| **DAM1** | **5,593,620** | **22 MB** | **43 MB** | **99.6%** | **99.6%** | **3 ms** |
+| Qwen2.5-0.5B-Instruct | 494,032,768 | 988 MB | 1.01 GB | 63.8% | 39.6% | 109 ms |
+| Qwen3-0.6B | 596,049,920 | 1.50 GB | 1.22 GB | 52.7% | 41.4% | 80 ms |
+| LFM2-350M | 354,483,968 | 709 MB | 727 MB | 52.2% | 44.1% | 53 ms |
+| SmolLM2-360M-Instruct | 361,821,120 | 724 MB | 760 MB | 51.4% | 34.1% | 114 ms |
+| SmolLM2-135M-Instruct | 134,515,008 | 269 MB | 285 MB | 36.0% | 14.5% | 228 ms |
+
+**Weights** is the file the hub publishes. DAM1's page downloads the same network written
+small, 10 MB. **Memory** is what answering one question takes: for DAM1 the one block of
+WebAssembly memory that holds the network, the state, the tree and the stack; for the others the
+most the card held over the same questions. **Answered** is the share of replies that say the
+answer. **Exact** is the share that begin with the answer and put nothing before it. **One answer**
+is the middle wait for a single question, for DAM1 on the processor and for the others on the card.
+
+The item set is DAM1's own curriculum. The words, the names and the numbers of a held-out line are
+new, but its sentence shapes are shapes DAM1 was taught, so this measures reading of a taught shape
+and not general knowledge. Ask about the capital of Peru and these models answer while DAM1 does
+not. The harness is in
+[benchmarks/](https://github.com/Datamine-Crypto/DAM1/blob/main/benchmarks/README.md).
+
+## 📋 Model details
+
+- **Made by:** Datamine Network Inc.
+- **Model type:** an LLM built as a reader of one word at a time over a tree, driven by networks
+  over a stack: an embedding per feature place, a block of weights per stack slot, one hidden
+  layer of rectified units, an output per step class and a pointer over the words of the
+  sentence. Three networks of one shape, trained from different starts, read by vote. They are
+  trained from nothing; there is no base model.
+- **Language:** English.
+- **Licence:** AGPL-3.0-or-later.
+- **Files built at:** the commit `config.json` records under `build`, which the publish writes as it exports.
+- **Layout:** version 5, described in
+  [FORMAT.md](https://github.com/Datamine-Crypto/DAM1/blob/main/huggingface/FORMAT.md).
+- **Source:** https://github.com/Datamine-Crypto/DAM1
+
+## ✨ What it does
+
+Tell it statements and ask it questions, across the turns of a conversation. It also knows what
+its seeds state: the number words, the measures, the clock, verb forms, opposites, what common
+things are and the like. These replies were said by these files with `dam1 talk`, each group one
+conversation. A statement is answered with nothing; the reply comes at the question.
+
+| You say | DAM1 says |
+|---|---|
+| tom has a red car. | |
+| who has the car? | tom |
+| what color is tom's car? | red |
+| what is 12 * 3? | 36 |
+| what is the opposite of hot? | cold |
+| how many legs does a dog have? | 4 |
+| the cat is in the box. the box is in the garden. | |
+| where is the cat? | box |
+| is the cat in the garden? | yes |
+| john took the ball. john went to the hall. | |
+| what is john carrying? | ball |
+| where is the ball? | hall |
+| ann has 3 apples. ben has 5 apples. | |
+| how many apples do they have together? | 8 |
+| who has more apples? | ben |
+| sam is taller than ann. ann is taller than bob. | |
+| who is the tallest? | sam |
+| is bob taller than sam? | no |
+| my sister lives in paris and she loves music. | |
+| where does my sister live? | paris |
+| what does she love? | music |
+
+It gets things wrong too, and a wrong reply looks the same as a right one:
+
+| You say | DAM1 says | Should be |
+|---|---|---|
+| there is a red box and a blue box. the red box is heavy. which box is heavy? | yes | the red box |
+| tom turned on the lamp. is the lamp on? | no | yes |
+| it rained all night. what happened last night? | (no reply) | it rained |
+
+## 🎯 Uses
+
+Intended uses:
+
+- Research on reading into a tree with learned steps, as an alternative to a transformer.
+- Short conversations in simple English about things the user tells it: who has what, where
+  things are, qualities, counts, sums, measures and time.
+- Running an LLM with no server and no graphics card: native or in a browser.
+
+Out of scope:
+
+- Any decision where a wrong answer causes harm: medical, legal, financial, safety or personal.
+- A source of truth. It does not know when it is wrong.
+- Free text generation, translation, summaries, or English outside the shapes its lessons taught.
+- Languages other than English.
+
+## ⚙️ How it works
+
+1. Text is split into sentences, and a sentence into words, numbers and marks. There is no
+   learned tokenizer.
+2. Memory is one tree, and the tree is a space: a thing is a node that stands inside its place or
+   its owner, a relation is a braced token such as `{is}` or `{has}`, a count or a time is a tag
+   on the thing, and a mention of a thing told before is a link to the same node.
+3. Each word is one input. A word that names a thing makes the thing appear, the known one of
+   its name or a new one carrying the flags the words before it set, such as `the` or a count.
+4. The stack holds one sentence: the cursor, each word heard, and two events for every step taken
+   (the step, and what it found or made). It is emptied at the next sentence. Each event is a set
+   of features hashed into a space of 2^64 places.
+5. A network reads the stack, one event per slot of 200. An event's embedding is the sum of the
+   16-wide embeddings of its places. Each slot has its own weights into 512 hidden rectified
+   units. The outputs take a softmax over the 92 step classes. A class is a move and its
+   properties, such as `{grab}`, `{drop @}`, `{children add: @ type: property}` or `{get owner}`.
+6. The three networks vote: the shares each gives every step are added and the step with the
+   largest sum is taken. When the step takes a word of the sentence (the `@`), the pointers score
+   every word on the stack the same way and the best one is taken.
+7. The step runs, its two events join the stack, and the networks choose again. `{continue}`
+   goes on to the next word. A word may take at most 50 steps.
+8. What a sentence wrote to the tree stays for the next sentence and the next turn, so a question
+   is answered from everything the conversation said and from the seeds.
+
+No rule decides an answer at reading time. Every step of every reading is the networks' choice.
+
+## 🏋️ Training
+
+### 📚 Data
+
+All training data is in the source repository, written for this project in plain English. None of
+it is a Hugging Face dataset, so the card lists no `datasets`.
+
+- `model/data/train`: 274 lesson files in 16 folders, from basics and Grade 1 to Grade 12 and
+  university, with the world lessons and the debug cases agreed while the design was made. Each
+  line is text with the shape its tree should take and the answers expected. A line is either
+  learned or held out of training: 2,565 learned lines and 942 held-out lines. The 12 debug
+  cases are graded and never trained on.
+- `model/data/facts` and `model/data/seeds`: plain fact sentences and the 60 seeds files built
+  from them, told into the tree before anything is read. They are not used to train the network.
+  They make the state every lesson and every chat starts from, which ships as `state.bin`.
+
+#### What the lessons teach
+
+One concept a file, from the basics up to a university exam:
+
+- **Basics:** simple statements and questions, places, changes over time, referring back, yes and no, adjectives, searching the tree, which one, partial views and partial searches, checking again, tricks, conclusions, actions, hidden things, conversation.
+- **Grade 1:** scenes with several things and owners, counts, forms of having, not having, decomposition.
+- **Grade 2:** places, time and owning, possessives, classes, days, greetings, indirect questions, negatives, have questions, our and their, family, animals and their sounds, shapes and sides, weather and seasons, a and an, plural counts, my things, them, whose, letters and vowels, changing hands, two things alike, about me, stronger and weaker qualities, going to, story openers, colored things, things that happen, another one, labels and traits, always and never, how much.
+- **Grade 3:** arithmetic in words, the number after, between, counting between, successors, odd and even, tens and hundreds, place value, greater and less, more and fewer, the biggest number, totals, counts over two owners, the next season, day, month and letter, alphabetical order, ordinal days, order and time words, order in a line, carrying a sum on, numbered ones, part of a group, on and off, my pocket.
+- **Grade 4:** tell me about, comparisons and their inverses, qualities and opposites, verbs and their objects, seeing, giving, moving and carrying, picking up and dropping, what was carried before, counting what is carried, before and after, they, earlier and later, longer and heavier, hotter and colder, the passive, relation words, that clauses, can do, lost things, done by, because, telling, kin somewhere.
+- **Grade 5:** costs, coins, dollars and cents, costs together, change, money left after buying, how many one can buy, unit prices, the clock, hours between, days and months apart, durations, parts of an hour, mixed time units, today from its neighbours, dozens and pairs, half and double, ages, amounts left, years and birthdays.
+- **Grade 6:** each, sharing, full groups and what is left over, remainders, multiples and factors, what fits in, units, metric units and mixed units, units back, scaling amounts, two-step problems, the missing number, sequences, digit sums, counting words.
+- **Grade 7:** fractions and comparing them, percent, discounts, percent increase, area and perimeter, the perimeter of a triangle, roman numerals, rounding, squares and cubes, square roots.
+- **Grade 8:** averages, median, mode, range, speed and distance, travel time, unknowns, functions, definitions.
+- **Grade 9:** capitals and materials, titles and languages, kind words, what kinds do, kinds with a quality, inherited kinds, superlative kinds, where countries are, what animals eat.
+- **Grade 10:** directions, positions, paths, the far end, kinship, grandparents.
+- **Grade 11:** deduction, induction, motives, choices, which is not, what is absent, yes or no after a place, many questions on one statement, a colour at the end of a question, plurals, numbers in words, chains of one relation, claims.
+- **Grade 12:** scenes of two to five statements with many questions each, from several wordings, both directions, yes and no, and things the scene does not name.
+- **University:** chains walked several steps, kinds three deep, counts summed, split or scaled, relations asked backwards, what follows from a rule, and arithmetic that needs a calculator.
+
+### 🔁 Procedure
+
+1. `dam word teach` is the teacher. It is deterministic: for every word of every line it writes
+   the moves that shape the tree the line expects and answer its questions, each move run on the
+   same world the network runs on. A line the teacher does not reach is never taught. It reaches
+   every learned line and, as a control, every held-out line. It writes the stack and the step
+   taken, at every step, as rows, and a second copy of each row with the names the lessons state
+   blanked, so a name never seen reads as they do.
+2. `dam word train` trains a network from the rows of the learned lines: 230,141 rows, item width
+   16, 512 hidden units, AdaGrad with a learning rate of 0.05, softmax cross-entropy over the
+   step classes and over the words the pointer may take. Three networks were trained, from seeds
+   1, 2 and 3. Each run stopped after 300 epochs with no fewer rows taken wrongly, at between
+   355 and 404 epochs, with 10 of the 230,141 rows not chosen as taught in each.
+
+The rows are not committed; `dam word teach` makes them again.
+
+### 🖥️ Compute
+
+Each network trains in minutes on one consumer graphics card. The place and the power drawn were
+not recorded, so the card gives no `co2_eq_emissions`.
+
+## 📁 Files
+
+| File | Holds |
+|---|---|
+| `config.json` | The step limit, the network's shape, its voters and its step classes, and the build commit |
+| `model.safetensors` | The eight tensors of each of the three voters, listed below |
+| `state.bin` | The permanent state every chat starts from: the tree the seeds make |
+| `LICENSE`, `NOTICE.md` | The licence and what it covers |
+
+The tensors of `model.safetensors`, for each voter `N` of 0, 1 and 2:
+
+| Tensor | Type | Shape |
+|---|---|---|
+| `network.N.items` | `U64` | 4,240 |
+| `network.N.item_table` | `F32` | 4,240 by 16 |
+| `network.N.slot_weights` | `F32` | 200 by 512 by 16 |
+| `network.N.fill_weights` | `F32` | 200 by 512 |
+| `network.N.hidden_bias` | `F32` | 512 |
+| `network.N.output_weights` | `F32` | 92 by 512 |
+| `network.N.output_bias` | `F32` | 92 |
+| `network.N.point_weights` | `F32` | 512 by 16 |
+
+No file contains code. A tensor runtime cannot run DAM1; it is read by the dam-core crate.
+
+## 🛠️ Use
+
+The crates are not on crates.io. Take them from the source repository. The repository must be
+public, or you must be signed in with `hf auth login`, for the download to work.
+
+From the command line, in a checkout of the source repository:
+
+```sh
+cd huggingface && cargo build --release
+target/release/dam1 pull --repo DatamineNetwork/DAM1
+target/release/dam1 talk --repo DatamineNetwork/DAM1 "tom has a red car." "what color is tom's car?"
+```
+
+Each text after `talk` is one turn of the same conversation. `--revision` picks a branch, tag or
+commit; `--model DIR` reads a folder already on disk. Each reply is printed as JSON: `output` is
+what the model said, `steps` is every step the networks chose at every word, `told` is what the
+turn wrote to the tree, and `ended` says whether every word continued within the step limit.
+
+From Rust:
+
+```toml
+[dependencies]
+dam1 = { git = "https://github.com/Datamine-Crypto/DAM1" }
+dam1-hub = { git = "https://github.com/Datamine-Crypto/DAM1" }
+dam-page = { git = "https://github.com/Datamine-Crypto/DAM1" }
+```
+
+```rust
+fn main() -> Result<(), String> {
+    let folder = dam1_hub::hub::pulled("DatamineNetwork/DAM1", "main")?;
+    let model = dam1::model::loaded(&folder)?;
+    dam_page::load(&model.network.weights, &model.network.classes)?;
+    dam_page::state(&model.state)?;
+    dam_page::read("tom has a red car.", model.reading.steps)?;
+    println!("{}", dam_page::read("what color is tom's car?", model.reading.steps)?);
+    Ok(())
+}
+```
+
+`dam_page` holds one conversation. `forget` takes it back to the seeds' state; `context` and
+`restore` save and load it.
+
+## 📊 Evaluation
+
+The lessons are the training data. Each file mixes learned lines with lines held out of training.
+Measured with `dam1 check` on these files, run from `model/`:
+
+```sh
+dam1 check --model ../huggingface/model --network data/network/release.bin
+```
+
+The check compares every tensor byte for byte with the network the files were exported from, and
+the state with the seeds told again. It then reads every line with the networks alone, no teacher
+and no search, from the state every seed makes. A line is right when every word of every input
+continued within the step limit and the tree holds the expected shape or the output says the
+expected answer.
+
+| Lessons | Learned lines | Held-out lines |
+|---|---:|---:|
+| Basics | 446 of 446 (100.0%) | 142 of 142 (100.0%) |
+| Grade 1 | 73 of 73 (100.0%) | 24 of 24 (100.0%) |
+| Grade 2 | 673 of 673 (100.0%) | 237 of 239 (99.2%) |
+| Grade 3 | 246 of 246 (100.0%) | 97 of 97 (100.0%) |
+| Grade 4 | 263 of 263 (100.0%) | 87 of 88 (98.9%) |
+| Grade 5 | 171 of 171 (100.0%) | 72 of 72 (100.0%) |
+| Grade 6 | 153 of 153 (100.0%) | 58 of 58 (100.0%) |
+| Grade 7 | 83 of 83 (100.0%) | 35 of 35 (100.0%) |
+| Grade 8 | 79 of 79 (100.0%) | 33 of 33 (100.0%) |
+| Grade 9 | 149 of 149 (100.0%) | 66 of 66 (100.0%) |
+| Grade 10 | 26 of 26 (100.0%) | 9 of 9 (100.0%) |
+| Grade 11 | 82 of 82 (100.0%) | 23 of 23 (100.0%) |
+| Grade 12 | 38 of 38 (100.0%) | 11 of 11 (100.0%) |
+| University | 47 of 47 (100.0%) | 13 of 13 (100.0%) |
+| World and debug cases | 36 of 36 (100.0%) | 32 of 32 (100.0%) |
+| **All** | **2565 of 2565 (100.0%)** | **939 of 942 (99.7%)** |
+
+It reads every learned line of the curriculum. The three held-out lines it misses are in the
+lessons on shapes and on verbs, where the line asks for a word the learned lines never state.
+
+The held-out lines use the same sentence shapes and many of the same words as the learned lines.
+They measure new words and numbers in taught shapes. They are not an independent benchmark. No
+result is given in the Hub's evaluation format, because the lessons are not a Hub benchmark
+dataset.
+
+## ⚠️ Limitations and risks
+
+- English only, and only the sentence shapes its lessons taught. A shape it was not taught often
+  reads wrong.
+- It knows what it is told and what the seeds state, nothing more. It has no general world
+  knowledge.
+- A wrong reply looks the same as a right one. Check what it says.
+- It accepts what it is told as true and says it back. It has no filter for false, harmful or
+  offensive statements.
+- The seeds are the project's own sentences and reflect what the project wrote.
+- The stack holds 200 events and one sentence, so a very long sentence loses its first words. A
+  word that does not continue within 50 steps ends the turn as not ended.
+
+## 📖 Citation
+
+```bibtex
+@software{dam1_2026,
+  author = {{Datamine Network Inc.}},
+  title  = {DAM1: an LLM that reads one word at a time into a tree, with networks over its stack},
+  year   = {2026},
+  url    = {https://github.com/Datamine-Crypto/DAM1},
+  note   = {Model files built at the commit the config records}
+}
+```
+
+There is no paper.
+
+## ✉️ Contact
+
+Open a discussion in the Community tab of this repository, or an issue in the source repository.
+
+## ⚖️ Licence
+
+Copyright 2026 Datamine Network Inc. The code, the lessons, the seeds and these weights are
+released under the GNU Affero General Public License, version 3 or later. If you run a modified
+version for users over a network, you must offer them its source. The names DAM1 and Datamine
+Network are not licensed for use by modified versions. See `LICENSE` and `NOTICE.md`.

config.json

@@ -0,0 +1,115 @@
+{
+  "architecture": "dam word network",
+  "format_version": 5,
+  "reading": {
+    "steps": 50
+  },
+  "network": {
+    "bits": 64,
+    "slots": 200,
+    "item": 16,
+    "hidden": 512,
+    "items": 4240,
+    "pointer": true,
+    "voters": 3,
+    "classes": [
+      "{continue}",
+      "{grab}",
+      "{drop @}",
+      "{setFlag type: the value: true}",
+      "{children add: @ type: property}",
+      "{step parent}",
+      "{give}",
+      "{setFlag type: a value: true}",
+      "{setProperty color: @}",
+      "{setProperty size: @}",
+      "{children add: @ type: question}",
+      "{children add: @}",
+      "{point to: {nothing}}",
+      "{find name: @ orderBy: lastMentioned}",
+      "{get owner}",
+      "{getPropertyValue withChild: @}",
+      "{get children}",
+      "{get location}",
+      "{setProperty age: @}",
+      "{contain}",
+      "{setProperty material: @}",
+      "{setFlag type: property value: @}",
+      "{find next}",
+      "{setProperty trait: @}",
+      "{setProperty speed: @}",
+      "{setProperty temperature: @}",
+      "{check @}",
+      "{step newest}",
+      "{step top}",
+      "{setProperty feeling: @}",
+      "{hand}",
+      "{get all with: @}",
+      "{setFlag type: quantity value: @}",
+      "{get count: @}",
+      "{step user: @}",
+      "{compute @}",
+      "{children add: @ type: relation}",
+      "{get amount}",
+      "{number set: @}",
+      "{number add: @}",
+      "{number say}",
+      "{get subject: @}",
+      "{setState @}",
+      "{take}",
+      "{release}",
+      "{get past}",
+      "{get relation: @}",
+      "{join}",
+      "{activity}",
+      "{children add: @ type: deed}",
+      "{get name}",
+      "{belong}",
+      "{children add: @ type: property time: past}",
+      "{setFlag type: owned value: @}",
+      "{possess}",
+      "{setFlag type: when value: @}",
+      "{with}",
+      "{setFlag type: time value: later}",
+      "{setFlag type: from value: true}",
+      "{leave}",
+      "{name result: @}",
+      "{get reply}",
+      "{get total: @}",
+      "{get difference: @}",
+      "{get most: @}",
+      "{grabAll}",
+      "{measure @}",
+      "{setFlag type: time value: past}",
+      "{group : @}",
+      "{get least: @}",
+      "{role}",
+      "{children role}",
+      "{get shifted}",
+      "{get about}",
+      "{get choice}",
+      "{get before: @}",
+      "{get given: @}",
+      "{get after: @}",
+      "{number subtract: @}",
+      "{number multiply: @}",
+      "{number negate}",
+      "{number divide: @}",
+      "{number whole}",
+      "{clock @}",
+      "{get distance: @}",
+      "{number remainder: @}",
+      "{number percent: @}",
+      "{number lessPercent: @}",
+      "{number addPercent: @}",
+      "{number root}",
+      "{regard}",
+      "{find with: @}"
+    ]
+  },
+  "build": {
+    "commit": "654c517babda6d1b645b762d17251550d22ef9c8",
+    "network": "data/network/release.bin",
+    "state": "data/seeds: all"
+  }
+}

model.safetensors

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

state.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:93fa09e6f138f1b145994f1f918f1454089656613234b0f07187b72521b00a2b
+size 212118