@velvetmonkey/vault-core 2.1.4 → 2.2.0

package/LICENSE

@@ -1,661 +1,201 @@
-                    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/>.
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/dist/index.d.ts

@@ -10,7 +10,7 @@ export { COMMON_ENGLISH_WORDS } from './common-words.js';
 export { STOPWORDS_EN, isStopword } from './stopwords.js';
 export { stem } from './stemmer.js';
 export { scanVaultEntities, getAllEntities, getAllEntitiesWithTypes, getEntityName, getEntityAliases, loadEntityCache, saveEntityCache, ENTITY_CACHE_VERSION, } from './entities.js';
-export { applyWikilinks, processWikilinks, resolveAliasWikilinks, suggestWikilinks, detectImplicitEntities, findEntityMatches, IMPLICIT_EXCLUDE_WORDS, } from './wikilinks.js';
+export { applyWikilinks, processWikilinks, resolveAliasWikilinks, suggestWikilinks, detectImplicitEntities, findEntityMatches, isCommonWordEntity, ALWAYS_CAPITALIZED, IMPLICIT_EXCLUDE_WORDS, } from './wikilinks.js';
 export { getProtectedZones, getProtectedZonesRegex, isInProtectedZone, mergeOverlappingZones, rangeOverlapsProtectedZone, } from './protectedZones.js';
 export { parseMarkdown } from './parseMarkdown.js';
 export { getProtectedZonesFromAst } from './astProtectedZones.js';

package/dist/index.js

@@ -15,7 +15,7 @@ export { stem } from './stemmer.js';
 // Entity scanning
 export { scanVaultEntities, getAllEntities, getAllEntitiesWithTypes, getEntityName, getEntityAliases, loadEntityCache, saveEntityCache, ENTITY_CACHE_VERSION, } from './entities.js';
 // Wikilinks
-export { applyWikilinks, processWikilinks, resolveAliasWikilinks, suggestWikilinks, detectImplicitEntities, findEntityMatches, IMPLICIT_EXCLUDE_WORDS, } from './wikilinks.js';
+export { applyWikilinks, processWikilinks, resolveAliasWikilinks, suggestWikilinks, detectImplicitEntities, findEntityMatches, isCommonWordEntity, ALWAYS_CAPITALIZED, IMPLICIT_EXCLUDE_WORDS, } from './wikilinks.js';
 // Protected zones
 export { getProtectedZones, getProtectedZonesRegex, isInProtectedZone, mergeOverlappingZones, rangeOverlapsProtectedZone, } from './protectedZones.js';
 // AST parsing

package/dist/migrations.d.ts

@@ -8,7 +8,7 @@
 import Database from 'better-sqlite3';
 export declare const BACKUP_ROTATION_COUNT = 3;
 /** High-value tables whose data should survive a corruption recovery. */
-export declare const SALVAGE_TABLES: readonly ["wikilink_feedback", "wikilink_applications", "suggestion_events", "wikilink_suppressions", "note_links", "note_link_history", "memories", "session_summaries", "corrections"];
+export declare const SALVAGE_TABLES: readonly ["wikilink_feedback", "wikilink_applications", "suggestion_events", "wikilink_suppressions", "note_links", "note_link_history", "memories", "session_summaries", "corrections", "tool_selection_feedback"];
 /**
  * Get the database path for a vault
  */

package/dist/migrations.js

@@ -24,6 +24,7 @@ export const SALVAGE_TABLES = [
     'memories',
     'session_summaries',
     'corrections',
+    'tool_selection_feedback',
 ];
 // =============================================================================
 // Database Path Resolution
@@ -314,6 +315,14 @@ export function initSchema(db) {
             }
             db.prepare('INSERT OR REPLACE INTO schema_version (version) VALUES (?)').run(35);
         }
+        // v36: tool_selection_feedback table + query_context on tool_invocations
+        if (currentVersion < 36) {
+            const hasQueryContext = db.prepare(`SELECT COUNT(*) as cnt FROM pragma_table_info('tool_invocations') WHERE name = 'query_context'`).get();
+            if (hasQueryContext.cnt === 0) {
+                db.exec('ALTER TABLE tool_invocations ADD COLUMN query_context TEXT');
+            }
+            db.prepare('INSERT OR REPLACE INTO schema_version (version) VALUES (?)').run(36);
+        }
         db.prepare('INSERT OR IGNORE INTO schema_version (version) VALUES (?)').run(SCHEMA_VERSION);
     }
 }

package/dist/schema.d.ts

@@ -5,10 +5,10 @@
  * for the flywheel state database.
  */
 /** Current schema version - bump when schema changes */
-export declare const SCHEMA_VERSION = 35;
+export declare const SCHEMA_VERSION = 36;
 /** State database filename */
 export declare const STATE_DB_FILENAME = "state.db";
 /** Directory for flywheel state */
 export declare const FLYWHEEL_DIR = ".flywheel";
-export declare const SCHEMA_SQL = "\n-- Schema version tracking\nCREATE TABLE IF NOT EXISTS schema_version (\n  version INTEGER PRIMARY KEY,\n  applied_at TEXT DEFAULT (datetime('now'))\n);\n\n-- Metadata key-value store\nCREATE TABLE IF NOT EXISTS metadata (\n  key TEXT PRIMARY KEY,\n  value TEXT NOT NULL,\n  updated_at TEXT DEFAULT (datetime('now'))\n);\n\n-- Entity index (replaces wikilink-entities.json)\nCREATE TABLE IF NOT EXISTS entities (\n  id INTEGER PRIMARY KEY,\n  name TEXT NOT NULL,\n  name_lower TEXT NOT NULL,\n  path TEXT NOT NULL,\n  category TEXT NOT NULL,\n  aliases_json TEXT,\n  hub_score INTEGER DEFAULT 0,\n  description TEXT\n);\nCREATE INDEX IF NOT EXISTS idx_entities_name_lower ON entities(name_lower);\nCREATE INDEX IF NOT EXISTS idx_entities_category ON entities(category);\n\n-- FTS5 for entity search with porter stemmer (contentless \u2014 triggers handle sync)\nCREATE VIRTUAL TABLE IF NOT EXISTS entities_fts USING fts5(\n  name, aliases, category,\n  content='',\n  tokenize='porter unicode61'\n);\n\n-- Auto-sync triggers for entities_fts\nCREATE TRIGGER IF NOT EXISTS entities_ai AFTER INSERT ON entities BEGIN\n  INSERT INTO entities_fts(rowid, name, aliases, category)\n  VALUES (\n    new.id,\n    new.name,\n    COALESCE((SELECT group_concat(value, ' ') FROM json_each(new.aliases_json)), ''),\n    new.category\n  );\nEND;\n\nCREATE TRIGGER IF NOT EXISTS entities_ad AFTER DELETE ON entities BEGIN\n  INSERT INTO entities_fts(entities_fts, rowid, name, aliases, category)\n  VALUES (\n    'delete',\n    old.id,\n    old.name,\n    COALESCE((SELECT group_concat(value, ' ') FROM json_each(old.aliases_json)), ''),\n    old.category\n  );\nEND;\n\nCREATE TRIGGER IF NOT EXISTS entities_au AFTER UPDATE ON entities BEGIN\n  INSERT INTO entities_fts(entities_fts, rowid, name, aliases, category)\n  VALUES (\n    'delete',\n    old.id,\n    old.name,\n    COALESCE((SELECT group_concat(value, ' ') FROM json_each(old.aliases_json)), ''),\n    old.category\n  );\n  INSERT INTO entities_fts(rowid, name, aliases, category)\n  VALUES (\n    new.id,\n    new.name,\n    COALESCE((SELECT group_concat(value, ' ') FROM json_each(new.aliases_json)), ''),\n    new.category\n  );\nEND;\n\n-- Recency tracking (replaces entity-recency.json)\nCREATE TABLE IF NOT EXISTS recency (\n  entity_name_lower TEXT PRIMARY KEY,\n  last_mentioned_at INTEGER NOT NULL,\n  mention_count INTEGER DEFAULT 1\n);\n\n-- Write state (replaces last-commit.json and other write state)\nCREATE TABLE IF NOT EXISTS write_state (\n  key TEXT PRIMARY KEY,\n  value TEXT NOT NULL,\n  updated_at TEXT DEFAULT (datetime('now'))\n);\n\n-- Content search FTS5 (migrated from vault-search.db)\n-- v11: Added frontmatter column for weighted search (path, title, frontmatter, content)\nCREATE VIRTUAL TABLE IF NOT EXISTS notes_fts USING fts5(\n  path, title, frontmatter, content,\n  tokenize='porter'\n);\n\n-- FTS5 build metadata (consolidated from vault-search.db)\nCREATE TABLE IF NOT EXISTS fts_metadata (\n  key TEXT PRIMARY KEY,\n  value TEXT\n);\n\n-- Vault index cache (for fast startup)\n-- Stores serialized VaultIndex to avoid full rebuild on startup\nCREATE TABLE IF NOT EXISTS vault_index_cache (\n  id INTEGER PRIMARY KEY CHECK (id = 1),\n  data BLOB NOT NULL,\n  built_at INTEGER NOT NULL,\n  note_count INTEGER NOT NULL,\n  version INTEGER DEFAULT 1\n);\n\n-- Flywheel configuration (replaces .flywheel.json)\nCREATE TABLE IF NOT EXISTS flywheel_config (\n  key TEXT PRIMARY KEY,\n  value TEXT NOT NULL,\n  updated_at TEXT DEFAULT (datetime('now'))\n);\n\n-- Vault metrics (v4: growth tracking)\nCREATE TABLE IF NOT EXISTS vault_metrics (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  timestamp INTEGER NOT NULL,\n  metric TEXT NOT NULL,\n  value REAL NOT NULL\n);\nCREATE INDEX IF NOT EXISTS idx_vault_metrics_ts ON vault_metrics(timestamp);\nCREATE INDEX IF NOT EXISTS idx_vault_metrics_m ON vault_metrics(metric, timestamp);\n\n-- Wikilink feedback (v4: quality tracking)\nCREATE TABLE IF NOT EXISTS wikilink_feedback (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  entity TEXT NOT NULL,\n  context TEXT NOT NULL,\n  note_path TEXT NOT NULL,\n  correct INTEGER NOT NULL,\n  confidence REAL NOT NULL DEFAULT 1.0,\n  matched_term TEXT,\n  created_at TEXT DEFAULT (datetime('now'))\n);\nCREATE INDEX IF NOT EXISTS idx_wl_feedback_entity ON wikilink_feedback(entity);\nCREATE INDEX IF NOT EXISTS idx_wl_feedback_note_path ON wikilink_feedback(note_path);\n\n-- Wikilink suppressions (v4: auto-suppress false positives)\nCREATE TABLE IF NOT EXISTS wikilink_suppressions (\n  entity TEXT PRIMARY KEY,\n  false_positive_rate REAL NOT NULL,\n  updated_at TEXT DEFAULT (datetime('now'))\n);\n\n-- Wikilink applications tracking (v5: implicit feedback)\nCREATE TABLE IF NOT EXISTS wikilink_applications (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  entity TEXT NOT NULL,\n  note_path TEXT NOT NULL,\n  matched_term TEXT,\n  applied_at TEXT DEFAULT (datetime('now')),\n  status TEXT DEFAULT 'applied'\n);\nCREATE UNIQUE INDEX IF NOT EXISTS idx_wl_apps_unique ON wikilink_applications(entity COLLATE NOCASE, note_path);\n\n-- Index events tracking (v6: index activity history)\nCREATE TABLE IF NOT EXISTS index_events (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  timestamp INTEGER NOT NULL,\n  trigger TEXT NOT NULL,\n  duration_ms INTEGER NOT NULL,\n  success INTEGER NOT NULL DEFAULT 1,\n  note_count INTEGER,\n  files_changed INTEGER,\n  changed_paths TEXT,\n  error TEXT,\n  steps TEXT\n);\nCREATE INDEX IF NOT EXISTS idx_index_events_ts ON index_events(timestamp);\n\n-- Tool invocation tracking (v7: usage analytics)\nCREATE TABLE IF NOT EXISTS tool_invocations (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  timestamp INTEGER NOT NULL,\n  tool_name TEXT NOT NULL,\n  session_id TEXT,\n  note_paths TEXT,\n  duration_ms INTEGER,\n  success INTEGER NOT NULL DEFAULT 1,\n  response_tokens INTEGER,\n  baseline_tokens INTEGER\n);\nCREATE INDEX IF NOT EXISTS idx_tool_inv_ts ON tool_invocations(timestamp);\nCREATE INDEX IF NOT EXISTS idx_tool_inv_tool ON tool_invocations(tool_name, timestamp);\nCREATE INDEX IF NOT EXISTS idx_tool_inv_session ON tool_invocations(session_id, timestamp);\n\n-- Graph topology snapshots (v8: structural evolution)\nCREATE TABLE IF NOT EXISTS graph_snapshots (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  timestamp INTEGER NOT NULL,\n  metric TEXT NOT NULL,\n  value REAL NOT NULL,\n  details TEXT\n);\nCREATE INDEX IF NOT EXISTS idx_graph_snap_ts ON graph_snapshots(timestamp);\nCREATE INDEX IF NOT EXISTS idx_graph_snap_m ON graph_snapshots(metric, timestamp);\n\n-- Note embeddings for semantic search (v9)\nCREATE TABLE IF NOT EXISTS note_embeddings (\n  path TEXT PRIMARY KEY,\n  embedding BLOB NOT NULL,\n  content_hash TEXT NOT NULL,\n  model TEXT NOT NULL,\n  updated_at INTEGER NOT NULL\n);\n\n-- Entity embeddings for semantic entity search (v10)\nCREATE TABLE IF NOT EXISTS entity_embeddings (\n  entity_name TEXT PRIMARY KEY,\n  embedding BLOB NOT NULL,\n  source_hash TEXT NOT NULL,\n  model TEXT NOT NULL,\n  updated_at INTEGER NOT NULL\n);\n\n-- Task cache for fast task queries (v12)\nCREATE TABLE IF NOT EXISTS tasks (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  path TEXT NOT NULL,\n  line INTEGER NOT NULL,\n  text TEXT NOT NULL,\n  status TEXT NOT NULL,\n  raw TEXT NOT NULL,\n  context TEXT,\n  tags_json TEXT,\n  due_date TEXT,\n  UNIQUE(path, line)\n);\nCREATE INDEX IF NOT EXISTS idx_tasks_status ON tasks(status);\nCREATE INDEX IF NOT EXISTS idx_tasks_path ON tasks(path);\nCREATE INDEX IF NOT EXISTS idx_tasks_due ON tasks(due_date);\n\n-- Merge dismissals (v13: persistent merge pair suppression)\nCREATE TABLE IF NOT EXISTS merge_dismissals (\n  pair_key TEXT PRIMARY KEY,\n  source_path TEXT NOT NULL,\n  target_path TEXT NOT NULL,\n  source_name TEXT NOT NULL,\n  target_name TEXT NOT NULL,\n  reason TEXT NOT NULL,\n  dismissed_at TEXT DEFAULT (datetime('now'))\n);\n\n-- Suggestion events audit log (v15: pipeline observability)\nCREATE TABLE IF NOT EXISTS suggestion_events (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  timestamp INTEGER NOT NULL,\n  note_path TEXT NOT NULL,\n  entity TEXT NOT NULL,\n  total_score REAL NOT NULL,\n  breakdown_json TEXT NOT NULL,\n  threshold REAL NOT NULL,\n  passed INTEGER NOT NULL,\n  strictness TEXT NOT NULL,\n  applied INTEGER DEFAULT 0,\n  pipeline_event_id INTEGER,\n  UNIQUE(timestamp, note_path, entity)\n);\nCREATE INDEX IF NOT EXISTS idx_suggestion_entity ON suggestion_events(entity);\nCREATE INDEX IF NOT EXISTS idx_suggestion_note ON suggestion_events(note_path);\n\n-- Forward-link persistence for diff-based feedback (v16), edge weights (v22)\nCREATE TABLE IF NOT EXISTS note_links (\n  note_path TEXT NOT NULL,\n  target TEXT NOT NULL,\n  weight REAL NOT NULL DEFAULT 1.0,\n  weight_updated_at INTEGER,\n  PRIMARY KEY (note_path, target)\n);\n\n-- Entity field change audit log (v17, rowid PK since v32)\nCREATE TABLE IF NOT EXISTS entity_changes (\n  entity TEXT NOT NULL,\n  field TEXT NOT NULL,\n  old_value TEXT,\n  new_value TEXT,\n  changed_at TEXT NOT NULL DEFAULT (datetime('now'))\n);\n\n-- Note tag persistence for diff-based feedback (v18)\nCREATE TABLE IF NOT EXISTS note_tags (\n  note_path TEXT NOT NULL,\n  tag TEXT NOT NULL,\n  PRIMARY KEY (note_path, tag)\n);\n\n-- Wikilink survival tracking for positive feedback signals (v19)\nCREATE TABLE IF NOT EXISTS note_link_history (\n  note_path TEXT NOT NULL,\n  target TEXT NOT NULL,\n  first_seen_at TEXT NOT NULL DEFAULT (datetime('now')),\n  edits_survived INTEGER NOT NULL DEFAULT 0,\n  last_positive_at TEXT,\n  PRIMARY KEY (note_path, target)\n);\n\n-- Note move history (v20): records when files are moved/renamed to a different folder\nCREATE TABLE IF NOT EXISTS note_moves (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  old_path TEXT NOT NULL,\n  new_path TEXT NOT NULL,\n  moved_at TEXT NOT NULL DEFAULT (datetime('now')),\n  old_folder TEXT,\n  new_folder TEXT\n);\nCREATE INDEX IF NOT EXISTS idx_note_moves_old_path ON note_moves(old_path);\nCREATE INDEX IF NOT EXISTS idx_note_moves_new_path ON note_moves(new_path);\nCREATE INDEX IF NOT EXISTS idx_note_moves_moved_at ON note_moves(moved_at);\n\n-- Corrections (v24): persistent correction records from user/engine feedback\nCREATE TABLE IF NOT EXISTS corrections (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  entity TEXT,\n  note_path TEXT,\n  correction_type TEXT NOT NULL,\n  description TEXT NOT NULL,\n  source TEXT NOT NULL DEFAULT 'user',\n  status TEXT DEFAULT 'pending',\n  created_at TEXT DEFAULT (datetime('now')),\n  resolved_at TEXT\n);\nCREATE INDEX IF NOT EXISTS idx_corrections_status ON corrections(status);\nCREATE INDEX IF NOT EXISTS idx_corrections_entity ON corrections(entity);\n\n-- Memories (v26): lightweight key-value working memory for agents\nCREATE TABLE IF NOT EXISTS memories (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  key TEXT NOT NULL,\n  value TEXT NOT NULL,\n  memory_type TEXT NOT NULL,\n  entity TEXT,\n  entities_json TEXT,\n  source_agent_id TEXT,\n  source_session_id TEXT,\n  confidence REAL NOT NULL DEFAULT 1.0,\n  created_at INTEGER NOT NULL,\n  updated_at INTEGER NOT NULL,\n  accessed_at INTEGER NOT NULL,\n  ttl_days INTEGER,\n  superseded_by INTEGER REFERENCES memories(id),\n  visibility TEXT NOT NULL DEFAULT 'shared'\n);\nCREATE INDEX IF NOT EXISTS idx_memories_key ON memories(key);\nCREATE INDEX IF NOT EXISTS idx_memories_entity ON memories(entity);\nCREATE INDEX IF NOT EXISTS idx_memories_type ON memories(memory_type);\n\nCREATE VIRTUAL TABLE IF NOT EXISTS memories_fts USING fts5(\n  key, value,\n  content=memories, content_rowid=id,\n  tokenize='porter unicode61'\n);\n\n-- Auto-sync triggers for memories_fts\nCREATE TRIGGER IF NOT EXISTS memories_ai AFTER INSERT ON memories BEGIN\n  INSERT INTO memories_fts(rowid, key, value)\n  VALUES (new.id, new.key, new.value);\nEND;\n\nCREATE TRIGGER IF NOT EXISTS memories_ad AFTER DELETE ON memories BEGIN\n  INSERT INTO memories_fts(memories_fts, rowid, key, value)\n  VALUES ('delete', old.id, old.key, old.value);\nEND;\n\nCREATE TRIGGER IF NOT EXISTS memories_au AFTER UPDATE ON memories BEGIN\n  INSERT INTO memories_fts(memories_fts, rowid, key, value)\n  VALUES ('delete', old.id, old.key, old.value);\n  INSERT INTO memories_fts(rowid, key, value)\n  VALUES (new.id, new.key, new.value);\nEND;\n\n-- Co-occurrence cache (v27): persist co-occurrence index to avoid full vault scan on restart\nCREATE TABLE IF NOT EXISTS cooccurrence_cache (\n  id INTEGER PRIMARY KEY CHECK (id = 1),\n  data TEXT NOT NULL,\n  built_at INTEGER NOT NULL,\n  entity_count INTEGER NOT NULL,\n  association_count INTEGER NOT NULL\n);\n\n-- Content hashes (v28): persist watcher content hashes across restarts\nCREATE TABLE IF NOT EXISTS content_hashes (\n  path TEXT PRIMARY KEY,\n  hash TEXT NOT NULL,\n  updated_at INTEGER NOT NULL\n);\n\n-- Session summaries (v26): agent session tracking\nCREATE TABLE IF NOT EXISTS session_summaries (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  session_id TEXT NOT NULL UNIQUE,\n  summary TEXT NOT NULL,\n  topics_json TEXT,\n  notes_modified_json TEXT,\n  agent_id TEXT,\n  started_at INTEGER,\n  ended_at INTEGER NOT NULL,\n  tool_count INTEGER\n);\n\n-- Retrieval co-occurrence (v30): notes retrieved together build implicit edges\nCREATE TABLE IF NOT EXISTS retrieval_cooccurrence (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  note_a TEXT NOT NULL,\n  note_b TEXT NOT NULL,\n  session_id TEXT NOT NULL,\n  timestamp INTEGER NOT NULL,\n  weight REAL NOT NULL DEFAULT 1.0,\n  UNIQUE(note_a, note_b, session_id)\n);\nCREATE INDEX IF NOT EXISTS idx_retcooc_notes ON retrieval_cooccurrence(note_a, note_b);\nCREATE INDEX IF NOT EXISTS idx_retcooc_ts ON retrieval_cooccurrence(timestamp);\n\n-- Deferred proactive linking queue (v31)\nCREATE TABLE IF NOT EXISTS proactive_queue (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  note_path TEXT NOT NULL,\n  entity TEXT NOT NULL,\n  score REAL NOT NULL,\n  confidence TEXT NOT NULL,\n  queued_at INTEGER NOT NULL,\n  expires_at INTEGER NOT NULL,\n  status TEXT NOT NULL DEFAULT 'pending',\n  applied_at INTEGER,\n  UNIQUE(note_path, entity)\n);\nCREATE INDEX IF NOT EXISTS idx_pq_status ON proactive_queue(status, expires_at);\n\n-- Performance benchmarks (v33: longitudinal tracking)\nCREATE TABLE IF NOT EXISTS performance_benchmarks (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  timestamp INTEGER NOT NULL,\n  version TEXT NOT NULL,\n  benchmark TEXT NOT NULL,\n  mean_ms REAL NOT NULL,\n  p50_ms REAL,\n  p95_ms REAL,\n  iterations INTEGER NOT NULL DEFAULT 1\n);\nCREATE INDEX IF NOT EXISTS idx_perf_bench_ts ON performance_benchmarks(timestamp);\nCREATE INDEX IF NOT EXISTS idx_perf_bench_name ON performance_benchmarks(benchmark, timestamp);\n";
+export declare const SCHEMA_SQL = "\n-- Schema version tracking\nCREATE TABLE IF NOT EXISTS schema_version (\n  version INTEGER PRIMARY KEY,\n  applied_at TEXT DEFAULT (datetime('now'))\n);\n\n-- Metadata key-value store\nCREATE TABLE IF NOT EXISTS metadata (\n  key TEXT PRIMARY KEY,\n  value TEXT NOT NULL,\n  updated_at TEXT DEFAULT (datetime('now'))\n);\n\n-- Entity index (replaces wikilink-entities.json)\nCREATE TABLE IF NOT EXISTS entities (\n  id INTEGER PRIMARY KEY,\n  name TEXT NOT NULL,\n  name_lower TEXT NOT NULL,\n  path TEXT NOT NULL,\n  category TEXT NOT NULL,\n  aliases_json TEXT,\n  hub_score INTEGER DEFAULT 0,\n  description TEXT\n);\nCREATE INDEX IF NOT EXISTS idx_entities_name_lower ON entities(name_lower);\nCREATE INDEX IF NOT EXISTS idx_entities_category ON entities(category);\n\n-- FTS5 for entity search with porter stemmer (contentless \u2014 triggers handle sync)\nCREATE VIRTUAL TABLE IF NOT EXISTS entities_fts USING fts5(\n  name, aliases, category,\n  content='',\n  tokenize='porter unicode61'\n);\n\n-- Auto-sync triggers for entities_fts\nCREATE TRIGGER IF NOT EXISTS entities_ai AFTER INSERT ON entities BEGIN\n  INSERT INTO entities_fts(rowid, name, aliases, category)\n  VALUES (\n    new.id,\n    new.name,\n    COALESCE((SELECT group_concat(value, ' ') FROM json_each(new.aliases_json)), ''),\n    new.category\n  );\nEND;\n\nCREATE TRIGGER IF NOT EXISTS entities_ad AFTER DELETE ON entities BEGIN\n  INSERT INTO entities_fts(entities_fts, rowid, name, aliases, category)\n  VALUES (\n    'delete',\n    old.id,\n    old.name,\n    COALESCE((SELECT group_concat(value, ' ') FROM json_each(old.aliases_json)), ''),\n    old.category\n  );\nEND;\n\nCREATE TRIGGER IF NOT EXISTS entities_au AFTER UPDATE ON entities BEGIN\n  INSERT INTO entities_fts(entities_fts, rowid, name, aliases, category)\n  VALUES (\n    'delete',\n    old.id,\n    old.name,\n    COALESCE((SELECT group_concat(value, ' ') FROM json_each(old.aliases_json)), ''),\n    old.category\n  );\n  INSERT INTO entities_fts(rowid, name, aliases, category)\n  VALUES (\n    new.id,\n    new.name,\n    COALESCE((SELECT group_concat(value, ' ') FROM json_each(new.aliases_json)), ''),\n    new.category\n  );\nEND;\n\n-- Recency tracking (replaces entity-recency.json)\nCREATE TABLE IF NOT EXISTS recency (\n  entity_name_lower TEXT PRIMARY KEY,\n  last_mentioned_at INTEGER NOT NULL,\n  mention_count INTEGER DEFAULT 1\n);\n\n-- Write state (replaces last-commit.json and other write state)\nCREATE TABLE IF NOT EXISTS write_state (\n  key TEXT PRIMARY KEY,\n  value TEXT NOT NULL,\n  updated_at TEXT DEFAULT (datetime('now'))\n);\n\n-- Content search FTS5 (migrated from vault-search.db)\n-- v11: Added frontmatter column for weighted search (path, title, frontmatter, content)\nCREATE VIRTUAL TABLE IF NOT EXISTS notes_fts USING fts5(\n  path, title, frontmatter, content,\n  tokenize='porter'\n);\n\n-- FTS5 build metadata (consolidated from vault-search.db)\nCREATE TABLE IF NOT EXISTS fts_metadata (\n  key TEXT PRIMARY KEY,\n  value TEXT\n);\n\n-- Vault index cache (for fast startup)\n-- Stores serialized VaultIndex to avoid full rebuild on startup\nCREATE TABLE IF NOT EXISTS vault_index_cache (\n  id INTEGER PRIMARY KEY CHECK (id = 1),\n  data BLOB NOT NULL,\n  built_at INTEGER NOT NULL,\n  note_count INTEGER NOT NULL,\n  version INTEGER DEFAULT 1\n);\n\n-- Flywheel configuration (replaces .flywheel.json)\nCREATE TABLE IF NOT EXISTS flywheel_config (\n  key TEXT PRIMARY KEY,\n  value TEXT NOT NULL,\n  updated_at TEXT DEFAULT (datetime('now'))\n);\n\n-- Vault metrics (v4: growth tracking)\nCREATE TABLE IF NOT EXISTS vault_metrics (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  timestamp INTEGER NOT NULL,\n  metric TEXT NOT NULL,\n  value REAL NOT NULL\n);\nCREATE INDEX IF NOT EXISTS idx_vault_metrics_ts ON vault_metrics(timestamp);\nCREATE INDEX IF NOT EXISTS idx_vault_metrics_m ON vault_metrics(metric, timestamp);\n\n-- Wikilink feedback (v4: quality tracking)\nCREATE TABLE IF NOT EXISTS wikilink_feedback (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  entity TEXT NOT NULL,\n  context TEXT NOT NULL,\n  note_path TEXT NOT NULL,\n  correct INTEGER NOT NULL,\n  confidence REAL NOT NULL DEFAULT 1.0,\n  matched_term TEXT,\n  created_at TEXT DEFAULT (datetime('now'))\n);\nCREATE INDEX IF NOT EXISTS idx_wl_feedback_entity ON wikilink_feedback(entity);\nCREATE INDEX IF NOT EXISTS idx_wl_feedback_note_path ON wikilink_feedback(note_path);\n\n-- Wikilink suppressions (v4: auto-suppress false positives)\nCREATE TABLE IF NOT EXISTS wikilink_suppressions (\n  entity TEXT PRIMARY KEY,\n  false_positive_rate REAL NOT NULL,\n  updated_at TEXT DEFAULT (datetime('now'))\n);\n\n-- Wikilink applications tracking (v5: implicit feedback)\nCREATE TABLE IF NOT EXISTS wikilink_applications (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  entity TEXT NOT NULL,\n  note_path TEXT NOT NULL,\n  matched_term TEXT,\n  applied_at TEXT DEFAULT (datetime('now')),\n  status TEXT DEFAULT 'applied'\n);\nCREATE UNIQUE INDEX IF NOT EXISTS idx_wl_apps_unique ON wikilink_applications(entity COLLATE NOCASE, note_path);\n\n-- Index events tracking (v6: index activity history)\nCREATE TABLE IF NOT EXISTS index_events (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  timestamp INTEGER NOT NULL,\n  trigger TEXT NOT NULL,\n  duration_ms INTEGER NOT NULL,\n  success INTEGER NOT NULL DEFAULT 1,\n  note_count INTEGER,\n  files_changed INTEGER,\n  changed_paths TEXT,\n  error TEXT,\n  steps TEXT\n);\nCREATE INDEX IF NOT EXISTS idx_index_events_ts ON index_events(timestamp);\n\n-- Tool invocation tracking (v7: usage analytics)\nCREATE TABLE IF NOT EXISTS tool_invocations (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  timestamp INTEGER NOT NULL,\n  tool_name TEXT NOT NULL,\n  session_id TEXT,\n  note_paths TEXT,\n  duration_ms INTEGER,\n  success INTEGER NOT NULL DEFAULT 1,\n  response_tokens INTEGER,\n  baseline_tokens INTEGER,\n  query_context TEXT\n);\nCREATE INDEX IF NOT EXISTS idx_tool_inv_ts ON tool_invocations(timestamp);\nCREATE INDEX IF NOT EXISTS idx_tool_inv_tool ON tool_invocations(tool_name, timestamp);\nCREATE INDEX IF NOT EXISTS idx_tool_inv_session ON tool_invocations(session_id, timestamp);\n\n-- Graph topology snapshots (v8: structural evolution)\nCREATE TABLE IF NOT EXISTS graph_snapshots (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  timestamp INTEGER NOT NULL,\n  metric TEXT NOT NULL,\n  value REAL NOT NULL,\n  details TEXT\n);\nCREATE INDEX IF NOT EXISTS idx_graph_snap_ts ON graph_snapshots(timestamp);\nCREATE INDEX IF NOT EXISTS idx_graph_snap_m ON graph_snapshots(metric, timestamp);\n\n-- Note embeddings for semantic search (v9)\nCREATE TABLE IF NOT EXISTS note_embeddings (\n  path TEXT PRIMARY KEY,\n  embedding BLOB NOT NULL,\n  content_hash TEXT NOT NULL,\n  model TEXT NOT NULL,\n  updated_at INTEGER NOT NULL\n);\n\n-- Entity embeddings for semantic entity search (v10)\nCREATE TABLE IF NOT EXISTS entity_embeddings (\n  entity_name TEXT PRIMARY KEY,\n  embedding BLOB NOT NULL,\n  source_hash TEXT NOT NULL,\n  model TEXT NOT NULL,\n  updated_at INTEGER NOT NULL\n);\n\n-- Task cache for fast task queries (v12)\nCREATE TABLE IF NOT EXISTS tasks (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  path TEXT NOT NULL,\n  line INTEGER NOT NULL,\n  text TEXT NOT NULL,\n  status TEXT NOT NULL,\n  raw TEXT NOT NULL,\n  context TEXT,\n  tags_json TEXT,\n  due_date TEXT,\n  UNIQUE(path, line)\n);\nCREATE INDEX IF NOT EXISTS idx_tasks_status ON tasks(status);\nCREATE INDEX IF NOT EXISTS idx_tasks_path ON tasks(path);\nCREATE INDEX IF NOT EXISTS idx_tasks_due ON tasks(due_date);\n\n-- Merge dismissals (v13: persistent merge pair suppression)\nCREATE TABLE IF NOT EXISTS merge_dismissals (\n  pair_key TEXT PRIMARY KEY,\n  source_path TEXT NOT NULL,\n  target_path TEXT NOT NULL,\n  source_name TEXT NOT NULL,\n  target_name TEXT NOT NULL,\n  reason TEXT NOT NULL,\n  dismissed_at TEXT DEFAULT (datetime('now'))\n);\n\n-- Suggestion events audit log (v15: pipeline observability)\nCREATE TABLE IF NOT EXISTS suggestion_events (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  timestamp INTEGER NOT NULL,\n  note_path TEXT NOT NULL,\n  entity TEXT NOT NULL,\n  total_score REAL NOT NULL,\n  breakdown_json TEXT NOT NULL,\n  threshold REAL NOT NULL,\n  passed INTEGER NOT NULL,\n  strictness TEXT NOT NULL,\n  applied INTEGER DEFAULT 0,\n  pipeline_event_id INTEGER,\n  UNIQUE(timestamp, note_path, entity)\n);\nCREATE INDEX IF NOT EXISTS idx_suggestion_entity ON suggestion_events(entity);\nCREATE INDEX IF NOT EXISTS idx_suggestion_note ON suggestion_events(note_path);\n\n-- Forward-link persistence for diff-based feedback (v16), edge weights (v22)\nCREATE TABLE IF NOT EXISTS note_links (\n  note_path TEXT NOT NULL,\n  target TEXT NOT NULL,\n  weight REAL NOT NULL DEFAULT 1.0,\n  weight_updated_at INTEGER,\n  PRIMARY KEY (note_path, target)\n);\n\n-- Entity field change audit log (v17, rowid PK since v32)\nCREATE TABLE IF NOT EXISTS entity_changes (\n  entity TEXT NOT NULL,\n  field TEXT NOT NULL,\n  old_value TEXT,\n  new_value TEXT,\n  changed_at TEXT NOT NULL DEFAULT (datetime('now'))\n);\n\n-- Note tag persistence for diff-based feedback (v18)\nCREATE TABLE IF NOT EXISTS note_tags (\n  note_path TEXT NOT NULL,\n  tag TEXT NOT NULL,\n  PRIMARY KEY (note_path, tag)\n);\n\n-- Wikilink survival tracking for positive feedback signals (v19)\nCREATE TABLE IF NOT EXISTS note_link_history (\n  note_path TEXT NOT NULL,\n  target TEXT NOT NULL,\n  first_seen_at TEXT NOT NULL DEFAULT (datetime('now')),\n  edits_survived INTEGER NOT NULL DEFAULT 0,\n  last_positive_at TEXT,\n  PRIMARY KEY (note_path, target)\n);\n\n-- Note move history (v20): records when files are moved/renamed to a different folder\nCREATE TABLE IF NOT EXISTS note_moves (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  old_path TEXT NOT NULL,\n  new_path TEXT NOT NULL,\n  moved_at TEXT NOT NULL DEFAULT (datetime('now')),\n  old_folder TEXT,\n  new_folder TEXT\n);\nCREATE INDEX IF NOT EXISTS idx_note_moves_old_path ON note_moves(old_path);\nCREATE INDEX IF NOT EXISTS idx_note_moves_new_path ON note_moves(new_path);\nCREATE INDEX IF NOT EXISTS idx_note_moves_moved_at ON note_moves(moved_at);\n\n-- Corrections (v24): persistent correction records from user/engine feedback\nCREATE TABLE IF NOT EXISTS corrections (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  entity TEXT,\n  note_path TEXT,\n  correction_type TEXT NOT NULL,\n  description TEXT NOT NULL,\n  source TEXT NOT NULL DEFAULT 'user',\n  status TEXT DEFAULT 'pending',\n  created_at TEXT DEFAULT (datetime('now')),\n  resolved_at TEXT\n);\nCREATE INDEX IF NOT EXISTS idx_corrections_status ON corrections(status);\nCREATE INDEX IF NOT EXISTS idx_corrections_entity ON corrections(entity);\n\n-- Memories (v26): lightweight key-value working memory for agents\nCREATE TABLE IF NOT EXISTS memories (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  key TEXT NOT NULL,\n  value TEXT NOT NULL,\n  memory_type TEXT NOT NULL,\n  entity TEXT,\n  entities_json TEXT,\n  source_agent_id TEXT,\n  source_session_id TEXT,\n  confidence REAL NOT NULL DEFAULT 1.0,\n  created_at INTEGER NOT NULL,\n  updated_at INTEGER NOT NULL,\n  accessed_at INTEGER NOT NULL,\n  ttl_days INTEGER,\n  superseded_by INTEGER REFERENCES memories(id),\n  visibility TEXT NOT NULL DEFAULT 'shared'\n);\nCREATE INDEX IF NOT EXISTS idx_memories_key ON memories(key);\nCREATE INDEX IF NOT EXISTS idx_memories_entity ON memories(entity);\nCREATE INDEX IF NOT EXISTS idx_memories_type ON memories(memory_type);\n\nCREATE VIRTUAL TABLE IF NOT EXISTS memories_fts USING fts5(\n  key, value,\n  content=memories, content_rowid=id,\n  tokenize='porter unicode61'\n);\n\n-- Auto-sync triggers for memories_fts\nCREATE TRIGGER IF NOT EXISTS memories_ai AFTER INSERT ON memories BEGIN\n  INSERT INTO memories_fts(rowid, key, value)\n  VALUES (new.id, new.key, new.value);\nEND;\n\nCREATE TRIGGER IF NOT EXISTS memories_ad AFTER DELETE ON memories BEGIN\n  INSERT INTO memories_fts(memories_fts, rowid, key, value)\n  VALUES ('delete', old.id, old.key, old.value);\nEND;\n\nCREATE TRIGGER IF NOT EXISTS memories_au AFTER UPDATE ON memories BEGIN\n  INSERT INTO memories_fts(memories_fts, rowid, key, value)\n  VALUES ('delete', old.id, old.key, old.value);\n  INSERT INTO memories_fts(rowid, key, value)\n  VALUES (new.id, new.key, new.value);\nEND;\n\n-- Co-occurrence cache (v27): persist co-occurrence index to avoid full vault scan on restart\nCREATE TABLE IF NOT EXISTS cooccurrence_cache (\n  id INTEGER PRIMARY KEY CHECK (id = 1),\n  data TEXT NOT NULL,\n  built_at INTEGER NOT NULL,\n  entity_count INTEGER NOT NULL,\n  association_count INTEGER NOT NULL\n);\n\n-- Content hashes (v28): persist watcher content hashes across restarts\nCREATE TABLE IF NOT EXISTS content_hashes (\n  path TEXT PRIMARY KEY,\n  hash TEXT NOT NULL,\n  updated_at INTEGER NOT NULL\n);\n\n-- Session summaries (v26): agent session tracking\nCREATE TABLE IF NOT EXISTS session_summaries (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  session_id TEXT NOT NULL UNIQUE,\n  summary TEXT NOT NULL,\n  topics_json TEXT,\n  notes_modified_json TEXT,\n  agent_id TEXT,\n  started_at INTEGER,\n  ended_at INTEGER NOT NULL,\n  tool_count INTEGER\n);\n\n-- Retrieval co-occurrence (v30): notes retrieved together build implicit edges\nCREATE TABLE IF NOT EXISTS retrieval_cooccurrence (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  note_a TEXT NOT NULL,\n  note_b TEXT NOT NULL,\n  session_id TEXT NOT NULL,\n  timestamp INTEGER NOT NULL,\n  weight REAL NOT NULL DEFAULT 1.0,\n  UNIQUE(note_a, note_b, session_id)\n);\nCREATE INDEX IF NOT EXISTS idx_retcooc_notes ON retrieval_cooccurrence(note_a, note_b);\nCREATE INDEX IF NOT EXISTS idx_retcooc_ts ON retrieval_cooccurrence(timestamp);\n\n-- Deferred proactive linking queue (v31)\nCREATE TABLE IF NOT EXISTS proactive_queue (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  note_path TEXT NOT NULL,\n  entity TEXT NOT NULL,\n  score REAL NOT NULL,\n  confidence TEXT NOT NULL,\n  queued_at INTEGER NOT NULL,\n  expires_at INTEGER NOT NULL,\n  status TEXT NOT NULL DEFAULT 'pending',\n  applied_at INTEGER,\n  UNIQUE(note_path, entity)\n);\nCREATE INDEX IF NOT EXISTS idx_pq_status ON proactive_queue(status, expires_at);\n\n-- Performance benchmarks (v33: longitudinal tracking)\nCREATE TABLE IF NOT EXISTS performance_benchmarks (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  timestamp INTEGER NOT NULL,\n  version TEXT NOT NULL,\n  benchmark TEXT NOT NULL,\n  mean_ms REAL NOT NULL,\n  p50_ms REAL,\n  p95_ms REAL,\n  iterations INTEGER NOT NULL DEFAULT 1\n);\nCREATE INDEX IF NOT EXISTS idx_perf_bench_ts ON performance_benchmarks(timestamp);\nCREATE INDEX IF NOT EXISTS idx_perf_bench_name ON performance_benchmarks(benchmark, timestamp);\n\n-- Tool selection feedback (v36: tool selection quality tracking)\nCREATE TABLE IF NOT EXISTS tool_selection_feedback (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  timestamp INTEGER NOT NULL,\n  tool_invocation_id INTEGER,\n  tool_name TEXT NOT NULL,\n  query_context TEXT,\n  expected_tool TEXT,\n  expected_category TEXT,\n  correct INTEGER,\n  source TEXT NOT NULL DEFAULT 'explicit',\n  rule_id TEXT,\n  rule_version INTEGER,\n  session_id TEXT,\n  created_at TEXT DEFAULT (datetime('now'))\n);\nCREATE INDEX IF NOT EXISTS idx_tsf_tool ON tool_selection_feedback(tool_name);\nCREATE INDEX IF NOT EXISTS idx_tsf_ts ON tool_selection_feedback(timestamp);\n";
 //# sourceMappingURL=schema.d.ts.map

package/dist/schema.js

@@ -8,7 +8,7 @@
 // Constants
 // =============================================================================
 /** Current schema version - bump when schema changes */
-export const SCHEMA_VERSION = 35;
+export const SCHEMA_VERSION = 36;
 /** State database filename */
 export const STATE_DB_FILENAME = 'state.db';
 /** Directory for flywheel state */
@@ -202,7 +202,8 @@ CREATE TABLE IF NOT EXISTS tool_invocations (
   duration_ms INTEGER,
   success INTEGER NOT NULL DEFAULT 1,
   response_tokens INTEGER,
-  baseline_tokens INTEGER
+  baseline_tokens INTEGER,
+  query_context TEXT
 );
 CREATE INDEX IF NOT EXISTS idx_tool_inv_ts ON tool_invocations(timestamp);
 CREATE INDEX IF NOT EXISTS idx_tool_inv_tool ON tool_invocations(tool_name, timestamp);
@@ -462,5 +463,24 @@ CREATE TABLE IF NOT EXISTS performance_benchmarks (
 );
 CREATE INDEX IF NOT EXISTS idx_perf_bench_ts ON performance_benchmarks(timestamp);
 CREATE INDEX IF NOT EXISTS idx_perf_bench_name ON performance_benchmarks(benchmark, timestamp);
+
+-- Tool selection feedback (v36: tool selection quality tracking)
+CREATE TABLE IF NOT EXISTS tool_selection_feedback (
+  id INTEGER PRIMARY KEY AUTOINCREMENT,
+  timestamp INTEGER NOT NULL,
+  tool_invocation_id INTEGER,
+  tool_name TEXT NOT NULL,
+  query_context TEXT,
+  expected_tool TEXT,
+  expected_category TEXT,
+  correct INTEGER,
+  source TEXT NOT NULL DEFAULT 'explicit',
+  rule_id TEXT,
+  rule_version INTEGER,
+  session_id TEXT,
+  created_at TEXT DEFAULT (datetime('now'))
+);
+CREATE INDEX IF NOT EXISTS idx_tsf_tool ON tool_selection_feedback(tool_name);
+CREATE INDEX IF NOT EXISTS idx_tsf_ts ON tool_selection_feedback(timestamp);
 `;
 //# sourceMappingURL=schema.js.map

package/dist/wikilinks.d.ts

@@ -9,6 +9,18 @@
  * - Alias resolution for existing wikilinks (resolves [[alias]] to [[Entity|alias]])
  */
 import type { WikilinkOptions, WikilinkResult, Entity, ExtendedWikilinkOptions, ImplicitEntityMatch, ImplicitEntityConfig, ResolveAliasOptions } from './types.js';
+/**
+ * Words that are always capitalized in English — case-sensitive matching
+ * cannot distinguish proper-noun vs common usage for these.
+ */
+export declare const ALWAYS_CAPITALIZED: Set<string>;
+/**
+ * True when entity's lowercase form is a common word but its casing is distinctive
+ * AND the word is not always-capitalized in English (like Monday, January, American).
+ * These terms are allowed through exclusion but matched case-sensitively.
+ * e.g. "REST" (common word "rest") → match only "REST" in content, not "rest"
+ */
+export declare function isCommonWordEntity(entity: string): boolean;
 export declare function findEntityMatches(content: string, entity: string, caseInsensitive: boolean): Array<{
     start: number;
     end: number;

package/dist/wikilinks.js

@@ -149,7 +149,7 @@ const EXCLUDE_WORDS_BASE = new Set([
     'read', 'realize', 'receive', 'recognize', 'recommend', 'record',
     'reduce', 'reflect', 'refuse', 'regard', 'reject', 'relate', 'release',
     'rely', 'remain', 'remember', 'remove', 'repeat', 'replace', 'report',
-    'represent', 'request', 'require', 'respond', 'rest', 'restore', 'result',
+    'represent', 'request', 'require', 'respond', 'rest', 'restore', 'result', 'rust',
     'retain', 'retire', 'return', 'reveal', 'review', 'ring', 'rise', 'risk',
     'roll', 'run', 'rush', 'save', 'say', 'search', 'seek', 'seem',
     'select', 'sell', 'send', 'serve', 'set', 'settle', 'shake', 'shape',
@@ -277,6 +277,39 @@ function shouldExcludeEntity(entity, isAlias = false) {
         return true;
     return false;
 }
+/**
+ * Words that are always capitalized in English — case-sensitive matching
+ * cannot distinguish proper-noun vs common usage for these.
+ */
+export const ALWAYS_CAPITALIZED = new Set([
+    // Day names
+    'monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday',
+    // Month names
+    'january', 'february', 'march', 'april', 'may', 'june', 'july', 'august',
+    'september', 'october', 'november', 'december',
+    // Nationalities / demonyms
+    'american', 'british', 'french', 'german', 'chinese', 'japanese',
+    'indian', 'russian', 'australian', 'canadian', 'italian', 'spanish',
+    'dutch', 'swiss', 'irish', 'scottish', 'welsh', 'english',
+]);
+/**
+ * True when entity's lowercase form is a common word but its casing is distinctive
+ * AND the word is not always-capitalized in English (like Monday, January, American).
+ * These terms are allowed through exclusion but matched case-sensitively.
+ * e.g. "REST" (common word "rest") → match only "REST" in content, not "rest"
+ */
+export function isCommonWordEntity(entity) {
+    const lower = entity.toLowerCase();
+    if (!getMergedExcludeWords().has(lower))
+        return false;
+    if (entity === lower)
+        return false; // all-lowercase → stay excluded
+    if (lower.includes(' '))
+        return false; // multi-word phrases → stay excluded
+    if (ALWAYS_CAPITALIZED.has(lower))
+        return false; // always capitalized in English
+    return true;
+}
 /**
  * Find all matches of an entity in content with word boundaries
  */
@@ -346,9 +379,15 @@ export function applyWikilinks(content, entities, options = {}) {
             // Skip ambiguous aliases (shared by multiple entities)
             if (t.isAlias && ambiguousAliases.has(t.term.toLowerCase()))
                 continue;
-            if (!shouldExcludeEntity(t.term, t.isAlias)) {
-                allSearchTerms.push(t);
+            if (shouldExcludeEntity(t.term, t.isAlias)) {
+                // Rescue common-word entities with distinctive casing (REST, Go, Rust, Swift)
+                // They will be matched case-sensitively to avoid false positives
+                if (isCommonWordEntity(t.term)) {
+                    allSearchTerms.push({ ...t, needsCasingCheck: true });
+                }
+                continue;
             }
+            allSearchTerms.push({ ...t, needsCasingCheck: false });
         }
     }
     // Sort by term length (longest first) to avoid partial matches
@@ -364,12 +403,14 @@ export function applyWikilinks(content, entities, options = {}) {
         // Also need to handle overlapping matches between different entities
         // First, collect ALL valid matches for each entity (name + aliases combined)
         const entityAllMatches = new Map();
-        for (const { term, entityName, isAlias } of allSearchTerms) {
+        for (const { term, entityName, isAlias, needsCasingCheck } of allSearchTerms) {
             const entityKey = entityName.toLowerCase();
             // Short uppercase aliases (≤4 chars, all-caps) match case-sensitively
             // so "CI" matches "CI" but not "ci" or "Ci"
             const useCaseInsensitive = !(isAlias && term.length <= 4 && term === term.toUpperCase());
-            const matches = findEntityMatches(result, term, useCaseInsensitive ? caseInsensitive : false);
+            // Common-word entities (REST, Go, Rust, Swift) always match case-sensitively
+            const effectiveCaseInsensitive = needsCasingCheck ? false : (useCaseInsensitive ? caseInsensitive : false);
+            const matches = findEntityMatches(result, term, effectiveCaseInsensitive);
             // Filter out matches in protected zones
             const validMatches = matches.filter(match => !rangeOverlapsProtectedZone(match.start, match.end, zones));
             if (validMatches.length === 0) {
@@ -518,9 +559,11 @@ export function applyWikilinks(content, entities, options = {}) {
     }
     else {
         // For all occurrences mode, process each term
-        for (const { term, entityName } of allSearchTerms) {
+        for (const { term, entityName, needsCasingCheck } of allSearchTerms) {
             // Find all matches of the search term
-            const matches = findEntityMatches(result, term, caseInsensitive);
+            // Common-word entities (REST, Go, Rust, Swift) always match case-sensitively
+            const effectiveCaseInsensitive = needsCasingCheck ? false : caseInsensitive;
+            const matches = findEntityMatches(result, term, effectiveCaseInsensitive);
             // Filter out matches in protected zones
             const validMatches = matches.filter(match => !rangeOverlapsProtectedZone(match.start, match.end, zones));
             if (validMatches.length === 0) {
@@ -582,9 +625,13 @@ export function suggestWikilinks(content, entities, options = {}) {
     for (const entity of entities) {
         const terms = getSearchTerms(entity);
         for (const t of terms) {
-            if (!shouldExcludeEntity(t.term, t.isAlias)) {
-                allSearchTerms.push(t);
+            if (shouldExcludeEntity(t.term, t.isAlias)) {
+                if (isCommonWordEntity(t.term)) {
+                    allSearchTerms.push({ ...t, needsCasingCheck: true });
+                }
+                continue;
             }
+            allSearchTerms.push({ ...t, needsCasingCheck: false });
         }
     }
     // Sort by term length (longest first) to prioritize longer matches
@@ -595,10 +642,11 @@ export function suggestWikilinks(content, entities, options = {}) {
         // For firstOccurrenceOnly mode, find the earliest match across all terms
         // for each entity, similar to applyWikilinks behavior
         const entityAllMatches = new Map();
-        for (const { term, entityName, isAlias } of allSearchTerms) {
+        for (const { term, entityName, isAlias, needsCasingCheck } of allSearchTerms) {
             const entityKey = entityName.toLowerCase();
             const useCaseInsensitive = !(isAlias && term.length <= 4 && term === term.toUpperCase());
-            const matches = findEntityMatches(content, term, useCaseInsensitive ? caseInsensitive : false);
+            const effectiveCaseInsensitive = needsCasingCheck ? false : (useCaseInsensitive ? caseInsensitive : false);
+            const matches = findEntityMatches(content, term, effectiveCaseInsensitive);
             // Filter out matches in protected zones
             const validMatches = matches.filter(match => !rangeOverlapsProtectedZone(match.start, match.end, zones));
             if (validMatches.length === 0)
@@ -631,8 +679,9 @@ export function suggestWikilinks(content, entities, options = {}) {
         return selectedSuggestions;
     }
     // For all occurrences mode, process each term
-    for (const { term, entityName } of allSearchTerms) {
-        const matches = findEntityMatches(content, term, caseInsensitive);
+    for (const { term, entityName, needsCasingCheck } of allSearchTerms) {
+        const effectiveCaseInsensitive = needsCasingCheck ? false : caseInsensitive;
+        const matches = findEntityMatches(content, term, effectiveCaseInsensitive);
         for (const match of matches) {
             // Skip if in protected zone
             if (rangeOverlapsProtectedZone(match.start, match.end, zones)) {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@velvetmonkey/vault-core",
-  "version": "2.1.4",
+  "version": "2.2.0",
   "description": "Shared vault utilities for Flywheel ecosystem (entity scanning, wikilinks, protected zones)",
   "type": "module",
   "main": "dist/index.js",