Bump version to 5.0.6

Delay Index Caching On Startup

LICENSE

@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 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 General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is 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.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  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.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  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 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. Use with the GNU Affero General Public License.
+
+  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 Affero 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 special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU 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 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 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 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 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 General Public License for more details.
+
+    You should have received a copy of the GNU 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 the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  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 GPL, see
+<https://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<https://www.gnu.org/licenses/why-not-lgpl.html>.

pom.xml

@@ -3,7 +3,7 @@
 	<modelVersion>4.0.0</modelVersion>
 	<groupId>org.qortal</groupId>
 	<artifactId>qortal</artifactId>
-	<version>5.0.5</version>
+	<version>5.0.6</version>
 	<packaging>jar</packaging>
 	<properties>
 		<project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>

src/main/java/org/qortal/api/resource/ArbitraryResource.java

@@ -30,6 +30,7 @@ import org.qortal.arbitrary.misc.Category;
 import org.qortal.arbitrary.misc.Service;
 import org.qortal.controller.Controller;
 import org.qortal.controller.arbitrary.ArbitraryDataCacheManager;
+import org.qortal.controller.arbitrary.ArbitraryDataHostMonitor;
 import org.qortal.controller.arbitrary.ArbitraryDataRenderManager;
 import org.qortal.controller.arbitrary.ArbitraryDataStorageManager;
 import org.qortal.controller.arbitrary.ArbitraryMetadataManager;
@@ -43,6 +44,8 @@ import org.qortal.data.arbitrary.ArbitraryResourceMetadata;
 import org.qortal.data.arbitrary.ArbitraryResourceStatus;
 import org.qortal.data.arbitrary.IndexCache;
 import org.qortal.data.naming.NameData;
+import org.qortal.data.transaction.ArbitraryHostedDataInfo;
+import org.qortal.data.transaction.ArbitraryHostedDataItemInfo;
 import org.qortal.data.transaction.ArbitraryTransactionData;
 import org.qortal.data.transaction.TransactionData;
 import org.qortal.list.ResourceListManager;
@@ -83,8 +86,8 @@ import java.util.Arrays;
 import java.util.Comparator;
 import java.util.List;
 import java.util.Map;
-import java.util.Objects;
 import java.util.stream.Collectors;
+import java.util.stream.Stream;
 import java.util.zip.GZIPOutputStream;
 
 import org.apache.tika.Tika;
@@ -94,7 +97,6 @@ import org.apache.tika.mime.MimeTypes;
 import javax.ws.rs.core.Response;
 
 import org.glassfish.jersey.media.multipart.FormDataParam;
-import static org.qortal.api.ApiError.REPOSITORY_ISSUE;
 
 @Path("/arbitrary")
 @Tag(name = "Arbitrary")
@@ -514,25 +516,33 @@ public class ArbitraryResource {
 			summary = "List arbitrary transactions hosted by this node",
 			responses = {
 					@ApiResponse(
-							content = @Content(mediaType = MediaType.APPLICATION_JSON, schema = @Schema(implementation = ArbitraryTransactionData.class))
+							content = @Content(mediaType = MediaType.APPLICATION_JSON, schema = @Schema(implementation = ArbitraryHostedDataInfo.class))
 					)
 			}
 	)
 	@ApiErrors({ApiError.REPOSITORY_ISSUE})
-	public List<ArbitraryTransactionData> getHostedTransactions(@HeaderParam(Security.API_KEY_HEADER) String apiKey,
-																@Parameter(ref = "limit") @QueryParam("limit") Integer limit,
-																@Parameter(ref = "offset") @QueryParam("offset") Integer offset) {
-		Security.checkApiCallAllowed(request);
+	public ArbitraryHostedDataInfo getHostedTransactions(@Parameter(ref = "limit") @QueryParam("limit") Integer limit,
+																@Parameter(ref = "offset") @QueryParam("offset") Integer offset,
+																   @QueryParam("name") String name) {
 
-		try (final Repository repository = RepositoryManager.getRepository()) {
+		Stream<ArbitraryHostedDataItemInfo> stream = ArbitraryDataHostMonitor.getInstance().getHostedDataItemInfos().stream();
 
-			List<ArbitraryTransactionData> hostedTransactions = ArbitraryDataStorageManager.getInstance().listAllHostedTransactions(repository, limit, offset);
-
-			return hostedTransactions;
-
-		} catch (DataException e) {
-			throw ApiExceptionFactory.INSTANCE.createException(request, ApiError.REPOSITORY_ISSUE, e);
+		// if name is set, then filter by name
+		if( name != null && !"".equals(name)) {
+			stream = stream.filter( info -> info.getName().startsWith(name));
 		}
+
+		// always sort from the greatest total space to the least total space
+		List<ArbitraryHostedDataItemInfo> hostedTransactions
+			= stream.sorted(Comparator.comparing(ArbitraryHostedDataItemInfo::getTotalSpace).reversed())
+				.collect(Collectors.toList());
+
+		int count = hostedTransactions.size();
+		long totalSpace = hostedTransactions.stream().collect(Collectors.summingLong(ArbitraryHostedDataItemInfo::getTotalSpace));
+
+		List<ArbitraryHostedDataItemInfo> items = ArbitraryTransactionUtils.limitOffsetTransactions(hostedTransactions, limit, offset);
+
+		return new ArbitraryHostedDataInfo(count, totalSpace, items);
 	}
 
 	@GET

src/main/java/org/qortal/controller/Controller.java

@@ -550,6 +550,7 @@ public class Controller extends Thread {
 		ArbitraryDataCleanupManager.getInstance().start();
 		ArbitraryDataStorageManager.getInstance().start();
 		ArbitraryDataRenderManager.getInstance().start();
+		ArbitraryDataHostMonitor.getInstance().start();
 
 		// start rebuild arbitrary resource cache timer task
 		if( Settings.getInstance().isRebuildArbitraryResourceCacheTaskEnabled() ) {
@@ -1136,6 +1137,7 @@ public class Controller extends Thread {
 				ArbitraryDataCleanupManager.getInstance().shutdown();
 				ArbitraryDataStorageManager.getInstance().shutdown();
 				ArbitraryDataRenderManager.getInstance().shutdown();
+				ArbitraryDataHostMonitor.getInstance().shutdown();
 
 				LOGGER.info("Shutting down online accounts manager");
 				OnlineAccountsManager.getInstance().shutdown();

src/main/java/org/qortal/controller/arbitrary/ArbitraryDataCleanupManager.java

@@ -93,7 +93,7 @@ public class ArbitraryDataCleanupManager extends Thread {
 			allArbitraryTransactionsInDescendingOrder = new ArrayList<>(0);
 		}
 
-		Set<ArbitraryTransactionData> processedTransactions = new HashSet<>();
+		Set<ArbitraryTransactionDataHashWrapper> processedTransactions = new HashSet<>();
 
 		try {
 			while (!isStopping) {
@@ -167,7 +167,7 @@ public class ArbitraryDataCleanupManager extends Thread {
 							continue;
 						}
 
-						boolean mostRecentTransaction = processedTransactions.add(arbitraryTransactionData);
+						boolean mostRecentTransaction = processedTransactions.add(new ArbitraryTransactionDataHashWrapper(arbitraryTransactionData));
 
 						// Check if we have the complete file
 						boolean completeFileExists = ArbitraryTransactionUtils.completeFileExists(arbitraryTransactionData);
@@ -215,7 +215,7 @@ public class ArbitraryDataCleanupManager extends Thread {
 
 							ArbitraryTransactionUtils.deleteCompleteFileAndChunks(arbitraryTransactionData);
 
-							Optional<ArbitraryTransactionData> moreRecentPutTransaction
+							Optional<ArbitraryTransactionDataHashWrapper> moreRecentPutTransaction
 								= processedTransactions.stream()
 									.filter(data -> data.equals(arbitraryTransactionData))
 									.findAny();
@@ -229,7 +229,7 @@ public class ArbitraryDataCleanupManager extends Thread {
 										arbitraryTransactionData.getService().name(),
 										"deleting data due to replacement",
 										arbitraryTransactionData.getTimestamp(),
-										moreRecentPutTransaction.get().getTimestamp()
+										moreRecentPutTransaction.get().getData().getTimestamp()
 									)
 								);
 							}

src/main/java/org/qortal/controller/arbitrary/ArbitraryDataFolderInfo.java

@@ -0,0 +1,21 @@
+package org.qortal.controller.arbitrary;
+
+public class ArbitraryDataFolderInfo {
+
+    private long totalSpace;
+
+    private int chunkCount;
+
+    public ArbitraryDataFolderInfo(long totalSpace, int chunkCount) {
+        this.totalSpace = totalSpace;
+        this.chunkCount = chunkCount;
+    }
+
+    public long getTotalSpace() {
+        return totalSpace;
+    }
+
+    public int getChunkCount() {
+        return chunkCount;
+    }
+}

src/main/java/org/qortal/controller/arbitrary/ArbitraryDataHostMonitor.java

@@ -0,0 +1,216 @@
+package org.qortal.controller.arbitrary;
+
+import org.apache.logging.log4j.LogManager;
+import org.apache.logging.log4j.Logger;
+import org.qortal.data.transaction.ArbitraryHostedDataItemInfo;
+import org.qortal.data.transaction.ArbitraryTransactionData;
+import org.qortal.data.transaction.TransactionData;
+import org.qortal.repository.Repository;
+import org.qortal.repository.RepositoryManager;
+import org.qortal.settings.Settings;
+import org.qortal.utils.Base58;
+
+import java.io.IOException;
+import java.io.UncheckedIOException;
+import java.nio.file.DirectoryStream;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.stream.Collectors;
+
+/**
+ * Class ArbitraryDataHostMonitor
+ */
+public class ArbitraryDataHostMonitor extends Thread{
+
+    private static final Logger LOGGER = LogManager.getLogger(ArbitraryDataHostMonitor.class);
+
+    /**
+     * Hosted Data Item Infos
+     *
+     * Where all the monitored data hosts are collected.
+     */
+    private List<ArbitraryHostedDataItemInfo> hostedDataItemInfos = new ArrayList<>();
+
+    private static ArbitraryDataHostMonitor instance;
+    private volatile boolean isStopping = false;
+
+    /**
+     * Get Instance
+     *
+     * @return the singleton for this class
+     */
+    public static ArbitraryDataHostMonitor getInstance() {
+        if (instance == null)
+            instance = new ArbitraryDataHostMonitor();
+
+        return instance;
+    }
+
+
+    @Override
+    public void run() {
+
+        if( !Settings.getInstance().isQdnEnabled() || !Settings.getInstance().isHostMonitorEnabled() ) return;
+
+        Thread.currentThread().setName("Arbitrary Data Host Manager");
+        Thread.currentThread().setPriority(MIN_PRIORITY);
+
+        final Path dataPath = Paths.get(Settings.getInstance().getDataPath());
+        final Path tempPath = Paths.get(Settings.getInstance().getTempDataPath());
+
+        while( true ) {
+
+            // Walk through 3 levels of the file tree and find directories that are greater than 32 characters in length
+            // Also exclude the _temp and _misc paths if present
+
+            try {
+                // Wait 10 minutes (600 seconds)
+                Thread.sleep(600_000);
+
+                if( isStopping ) break;
+
+                LOGGER.info("Collecting index paths ...");
+
+                List<Path> indexPaths
+                        = Files.walk(dataPath, 2)
+                        .filter(Files::isDirectory)
+                        .filter(path -> !path.toAbsolutePath().toString().contains(tempPath.toAbsolutePath().toString())
+                                && !path.toString().contains("_misc"))
+                        .collect(Collectors.toList());
+
+                LOGGER.info("Collected {} index paths", indexPaths.size());
+
+                Map<String,ArbitraryDataFolderInfo> currentSignatures = new HashMap<>();
+
+                // for each index path, pause and get the valid signatures and folder info
+                for (Path indexPath : indexPaths) {
+
+                    if( isStopping ) break;
+
+                    Thread.sleep(10);
+
+                    List<Path> paths = Files.walk(indexPath, 1)
+                            .filter(Files::isDirectory)
+                            .filter(path -> path.getFileName().toString().length() > 32)
+                            .collect(Collectors.toList());
+
+                    for (Path path : paths) {
+                        String[] contents = path.toFile().list();
+                        if (contents == null || contents.length == 0) {
+                            // Ignore empty directories
+                            continue;
+                        }
+
+                        String signature58 = path.getFileName().toString();
+
+                        currentSignatures.put(signature58, new ArbitraryDataFolderInfo(getDirectorySize(path), contents.length));
+                    }
+                }
+
+                if( isStopping ) break;
+
+                LOGGER.info("current signatures updated {}", currentSignatures.size());
+
+                List<byte[]> currentSignaturesDecoded = new ArrayList<>(currentSignatures.size());
+
+                // decode all current data signatures
+                for( String currentSignature : currentSignatures.keySet() ) {
+                    currentSignaturesDecoded.add(Base58.decode(currentSignature));
+                }
+
+                // get all transaction data for current signatures
+                List<TransactionData> currentTransactions;
+                try (final Repository repository = RepositoryManager.getRepository()) {
+
+                    currentTransactions = repository.getTransactionRepository().fromSignatures(currentSignaturesDecoded);
+
+                    LOGGER.info("data count = {}", currentTransactions.size());
+                }
+
+                List<ArbitraryHostedDataItemInfo> hostedTransactions = new ArrayList<>(currentTransactions.size());
+
+                // for each current transaction, create hosted data item info
+                for( TransactionData currentTransaction : currentTransactions ) {
+
+                    String signature58 = Base58.encode(currentTransaction.getSignature());
+                    ArbitraryDataFolderInfo dataFolderInfo = currentSignatures.get(signature58);
+
+                    hostedTransactions.add(new ArbitraryHostedDataItemInfo((ArbitraryTransactionData) currentTransaction, dataFolderInfo));
+                }
+
+                synchronized (this.hostedDataItemInfos) {
+                    this.hostedDataItemInfos.clear();
+                    this.hostedDataItemInfos.addAll(hostedTransactions);
+                }
+
+                // Wait 100 minutes (6,000 seconds)
+                Thread.sleep(6_000_000);
+            } catch (IOException | UncheckedIOException e) {
+                LOGGER.warn("Unable to walk through hosted data: {}", e.getMessage());
+            } catch(InterruptedException e) {
+                if(!isStopping) {
+                    LOGGER.error(e.getMessage());
+                }
+            } catch (Exception e) {
+                LOGGER.error(e.getMessage(), e);
+            }
+        }
+    }
+
+    /**
+     * Get Directory Size
+     *
+     * @param path the path to the directory
+     *
+     * @return the directory size in bytes
+     *
+     * @throws IOException
+     */
+    public static long getDirectorySize(Path path) throws IOException {
+        long totalSize = 0;
+
+        try (DirectoryStream<Path> stream = Files.newDirectoryStream(path)) {
+            for (Path entry : stream) {
+                if (Files.isDirectory(entry)) {
+                    totalSize += getDirectorySize(entry);
+                } else {
+                    totalSize += Files.size(entry);
+                }
+            }
+        }
+
+        return totalSize;
+    }
+
+    /**
+     * Get Hosted Data Item Infos
+     *
+     * @return a copy of the infos
+     */
+    public List<ArbitraryHostedDataItemInfo> getHostedDataItemInfos() {
+
+        List<ArbitraryHostedDataItemInfo> copy;
+
+        synchronized (this.hostedDataItemInfos){
+            copy = new ArrayList<>(this.hostedDataItemInfos);
+        }
+
+        return copy;
+    }
+
+    /**
+     * Shutdown
+     *
+     * Shutdown this thread.
+     */
+    public void shutdown() {
+        isStopping = true;
+        this.interrupt();
+        instance = null;
+    }
+}

src/main/java/org/qortal/crosschain/Bitcoin.java

@@ -78,7 +78,6 @@ public class Bitcoin extends Bitcoiny {
 					new Server("electrum.bitrefill.com", Server.ConnectionType.SSL, 50002),
 					new Server("electrum.brainshome.de", Server.ConnectionType.SSL, 50002),
 					new Server("electrum.emzy.de", Server.ConnectionType.SSL, 50002),
-					new Server("electrum.kcicom.net", Server.ConnectionType.SSL, 50002),
 					new Server("electrum.kendigisland.xyz", Server.ConnectionType.SSL, 50002),
 					new Server("electrum.thomasfischbach.de", Server.ConnectionType.SSL, 50002),
 					new Server("electrum-btc.leblancnet.us", Server.ConnectionType.SSL, 50002),
@@ -92,7 +91,6 @@ public class Bitcoin extends Bitcoiny {
 					new Server("electrumx-core.1209k.com", Server.ConnectionType.SSL, 50002),
 					new Server("elx.bitske.com", Server.ConnectionType.SSL, 50002),
 					new Server("exs.dyshek.org", Server.ConnectionType.SSL, 50002),
-					new Server("fortress.qtornado.com", Server.ConnectionType.SSL, 50002),
 					new Server("guichet.centure.cc", Server.ConnectionType.SSL, 50002),
 					new Server("hodl.artyomk13.me", Server.ConnectionType.SSL, 50002),
 					new Server("hodlers.beer", Server.ConnectionType.SSL, 50002),

src/main/java/org/qortal/crosschain/Bitcoiny.java

@@ -21,8 +21,6 @@ import org.qortal.utils.Amounts;
 import org.qortal.utils.BitTwiddling;
 import org.qortal.utils.NTP;
 
-import java.time.Duration;
-import java.time.Instant;
 import java.util.*;
 import java.util.concurrent.ExecutionException;
 import java.util.concurrent.ExecutorService;
@@ -69,6 +67,13 @@ public abstract class Bitcoiny implements ForeignBlockchain {
 	 */
 	private final BlockchainCache blockchainCache = new BlockchainCache();
 
+	/**
+	 * Executor
+	 *
+	 * Executor service to manage all Electrum server access.
+	 */
+	private static ExecutorService EXECUTOR = Executors.newFixedThreadPool(Settings.getInstance().getElectrumThreadCount());
+
 	// Constructors and instance
 
 	protected Bitcoiny(BitcoinyBlockchainProvider blockchainProvider, Context bitcoinjContext, String currencyCode, Coin feePerKb) {
@@ -225,79 +230,16 @@ public abstract class Bitcoiny implements ForeignBlockchain {
 	// TODO: don't return bitcoinj-based objects like TransactionOutput, use BitcoinyTransaction.Output instead
 	public List<TransactionOutput> getUnspentOutputs(String base58Address, boolean includeUnconfirmed) throws ForeignBlockchainException {
 
-		ExecutorService executor = Executors.newFixedThreadPool(5);
-
-		List<TransactionOutput> outputs = getUnspentOutputsWithExecutor(base58Address, includeUnconfirmed, executor);
-
-		// Shutdown the executor and wait for all tasks to complete
-		executor.shutdown();
-		try {
-			if (!executor.awaitTermination(60, TimeUnit.SECONDS)) {
-				executor.shutdownNow();
-			}
-		} catch (InterruptedException ex) {
-			executor.shutdownNow();
-			Thread.currentThread().interrupt();
-		}
-
-		return outputs;
-	}
-
-	/**
-	 * Get Unspent Outputs With Executor
-	 *
-	 * Get unspent outputs using an executor to get the outputs in parallel.
-	 *
-	 * @param base58Address the master foreign key for address generation
-	 * @param includeUnconfirmed true to include unconfirmed outputs, otherwise false
-	 * @param executor the executor to run the multi-threaded fetching
-	 *
-	 * @return the outputs
-	 *
-	 * @throws ForeignBlockchainException
-	 */
-	private List<TransactionOutput> getUnspentOutputsWithExecutor(String base58Address, boolean includeUnconfirmed, ExecutorService executor) throws ForeignBlockchainException {
-		List<Future<Optional<TransactionOutput>>> futures = getUnspentOutputsAsync(base58Address, includeUnconfirmed, executor);
-
-		List<TransactionOutput> outputs = new ArrayList<>(futures.size());
-
-		try {
-			for( Future<Optional<TransactionOutput>> future : futures) {
-
-				Optional<TransactionOutput> outputOptional = future.get();
-
-				if( outputOptional.isPresent() ) {
-					outputs.add(outputOptional.get());
-				}
-			}
-		} catch (InterruptedException | ExecutionException e) {
-			throw new ForeignBlockchainException(e.getMessage());
-		}
-		return outputs;
-	}
-
-	/**
-	 * Get Unspent Outputs Asynchronously
-	 *
-	 * Get unspent outputs using an executor to get the outputs in parallel.
-	 *
-	 * @param base58Address the master foreign key for address generation
-	 * @param includeUnconfirmed true to include unconfirmed outputs, otherwise false
-	 * @param executor the executor to run the multi-threaded fetching
-	 *
-	 * @return the outputs
-	 *
-	 * @throws ForeignBlockchainException
-	 */
-	private List<Future<Optional<TransactionOutput>>> getUnspentOutputsAsync(String base58Address, boolean includeUnconfirmed, ExecutorService executor) throws ForeignBlockchainException {
 		List<UnspentOutput> unspentOutputs = this.blockchainProvider.getUnspentOutputs(addressToScriptPubKey(base58Address), includeUnconfirmed);
 
-		List<Future<Optional<TransactionOutput>>> unspentTransactionOutputs = new ArrayList<>();
+		List<Optional<TransactionOutput>> unspentTransactionOutputs = new ArrayList<>();
 		for (UnspentOutput unspentOutput : unspentOutputs) {
-			unspentTransactionOutputs.add( executor.submit( () -> getTransactionOutput(unspentOutput)));
+			unspentTransactionOutputs.add( getTransactionOutput(unspentOutput));
 		}
 
-		return unspentTransactionOutputs;
+		return unspentTransactionOutputs.stream().filter(Optional::isPresent)
+				.map(Optional::get)
+				.collect(Collectors.toList());
 	}
 
 	/**
@@ -572,54 +514,49 @@ public abstract class Bitcoiny implements ForeignBlockchain {
 	 * @param key58 BIP32/HD extended Bitcoin private/public key
 	 * @return unspent BTC balance, or null if unable to determine balance
 	 */
-	public Long getWalletBalance(String key58) throws ForeignBlockchainException {
-		Long balance = 0L;
+public Long getWalletBalance(String key58) throws ForeignBlockchainException {
+	Long balance = 0L;
 
-		ExecutorService executor = Executors.newFixedThreadPool(50);
+	// Get all wallet addresses (via recursive gap-limit logic)
+	Set<String> walletAddresses = this.getWalletAddressesWithExecutor(key58, EXECUTOR);
 
-		List<Future<Optional<TransactionOutput>>> allUnspentOutputs = new ArrayList<>();
-		Set<String> walletAddresses = this.getWalletAddressesWithExecutor(key58, executor);
+	try {
+		List<Future<List<TransactionOutput>>> futures = new ArrayList<>();
 
-		try {
-			List<Future<List<Future<Optional<TransactionOutput>>>>> addressOutputLists = new ArrayList<>();
-
-			// for ech wallet address, spawn a thread to fetch unspent outputs
-			for (String address : walletAddresses) {
-				addressOutputLists.add(executor.submit(() -> this.getUnspentOutputsAsync(address, true, executor)));
-			}
-
-			// collect address outputs as they are ready
-			for( Future<List<Future<Optional<TransactionOutput>>>> addressOutputs : addressOutputLists) {
-				allUnspentOutputs.addAll( addressOutputs.get() );
-			}
-
-			// use the address outputs to sum up a balance
-			for (Future<Optional<TransactionOutput>> optionalFuture : allUnspentOutputs) {
-				Optional<TransactionOutput> transactionOutput = optionalFuture.get();
-				if (transactionOutput.isPresent() && !transactionOutput.get().isAvailableForSpending()) {
-					continue;
+		// Parallel fetch of unspent outputs per address
+		for (String address : walletAddresses) {
+			futures.add(EXECUTOR.submit(() -> {
+				try {
+					return this.getUnspentOutputs(address, true);
+				} catch (Exception e) {
+					LOGGER.warn("⚠️ Failed to fetch outputs for address {}", address, e);
+					return Collections.emptyList();
 				}
-				balance += transactionOutput.get().getValue().value;
-			}
-
-			// Shutdown the executor and wait for all tasks to complete
-			executor.shutdown();
-			try {
-				if (!executor.awaitTermination(60, TimeUnit.SECONDS)) {
-					executor.shutdownNow();
-				}
-			} catch (InterruptedException ex) {
-				LOGGER.error(ex.getMessage(), ex);
-				executor.shutdownNow();
-				Thread.currentThread().interrupt();
-			}
-		} catch (Exception e) {
-			LOGGER.error(e.getMessage(), e);
+			}));
 		}
 
-		return balance;
+		List<TransactionOutput> unspentOutputs = new ArrayList<>();
+
+		// Wait for all futures to complete
+		for (Future<List<TransactionOutput>> future : futures) {
+			
+				unspentOutputs.addAll(future.get(10, TimeUnit.SECONDS)); // No timeout needed
+		
+		}
+
+		// Sum up the available unspent outputs
+		for (TransactionOutput unspentOutput : unspentOutputs) {
+			if (unspentOutput.isAvailableForSpending()) {
+				balance += unspentOutput.getValue().value;
+			}
+		}
+	} catch (Exception e) {
+		LOGGER.error("Unexpected error in getWalletBalance: {}", e.getMessage(), e);
 	}
 
+	return balance;
+}
+
 	public Long getWalletBalanceFromBitcoinj(String key58) {
 		Context.propagate(bitcoinjContext);
 
@@ -643,104 +580,142 @@ public abstract class Bitcoiny implements ForeignBlockchain {
 		return balance;
 	}
 
-	public List<SimpleTransaction> getWalletTransactions(String key58) throws ForeignBlockchainException {
-		try {
-			// Serve from the cache if it's recent, and matches this xpub
-			if (Objects.equals(transactionsCacheXpub, key58)) {
-				if (transactionsCache != null && transactionsCacheTimestamp != null) {
-					Long now = NTP.getTime();
-					boolean isCacheStale = (now != null && now - transactionsCacheTimestamp >= TRANSACTIONS_CACHE_TIMEOUT);
-					if (!isCacheStale) {
-						return transactionsCache;
-					}
+public List<SimpleTransaction> getWalletTransactions(String key58) throws ForeignBlockchainException {
+	try {
+		// Serve from cache if valid
+		if (Objects.equals(transactionsCacheXpub, key58)) {
+			if (transactionsCache != null && transactionsCacheTimestamp != null) {
+				Long now = NTP.getTime();
+				boolean isCacheStale = (now != null && now - transactionsCacheTimestamp >= TRANSACTIONS_CACHE_TIMEOUT);
+				if (!isCacheStale) {
+					return transactionsCache;
 				}
 			}
-
-			Context.propagate(bitcoinjContext);
-
-			Wallet wallet = walletFromDeterministicKey58(key58);
-			DeterministicKeyChain keyChain = wallet.getActiveKeyChain();
-
-			keyChain.setLookaheadSize(Bitcoiny.WALLET_KEY_LOOKAHEAD_INCREMENT);
-			keyChain.maybeLookAhead();
-
-			List<DeterministicKey> keys = new ArrayList<>(keyChain.getLeafKeys());
-
-			// prepare an executor and start a list to collect transactions asynchronouly
-			ExecutorService executor = Executors.newFixedThreadPool(50);
-			List<Future<Optional<BitcoinyTransaction>>> futures = new ArrayList<>();
-
-			// determine the keys and collect the addresses
-			Set<String> keySet = processKeysWithTransactionFutures(executor, keys, keyChain, futures, 0);
-
-			// start a list to collect the transactions when they are ready from the asynchronous threads
-			Set<BitcoinyTransaction> walletTransactions = Collections.synchronizedSet(new HashSet<>());
-
-			// for each transaction fetched from an asynchronous thread,
-			// process the transaction for the wallet
-			for( Future<Optional<BitcoinyTransaction>> future : futures ) {
-
-				Optional<BitcoinyTransaction> transactionOptional = future.get();
-
-				if( transactionOptional.isPresent() ) {
-					BitcoinyTransaction transaction = transactionOptional.get();
-					walletTransactions.add(transaction);
-
-					// if the transaction is confirmed, then cache it for later use
-					if( transaction.timestamp != null ) {
-						this.blockchainCache.addTransactionByHash(transaction.txHash, transaction);
-					}
-				}
-			}
-
-			// Shutdown the executor and wait for all tasks to complete
-			executor.shutdown();
-			try {
-				if (!executor.awaitTermination(60, TimeUnit.SECONDS)) {
-					executor.shutdownNow();
-				}
-			} catch (InterruptedException ex) {
-				executor.shutdownNow();
-				Thread.currentThread().interrupt();
-			}
-
-			Comparator<SimpleTransaction> newestTimestampFirstComparator = Comparator.comparingLong(SimpleTransaction::getTimestamp).reversed();
-
-			// convert to simple transactions
-			List<SimpleTransaction> simpleTransactions
-				= walletTransactions.parallelStream()
-					.map(t -> convertToSimpleTransaction(t, keySet))
-					.collect(Collectors.toList());
-
-			// add null timestamps first, probably unconfirmed
-			transactionsCache
-				= simpleTransactions.stream()
-					.filter(t -> t.getTimestamp() == null)
-					.collect(Collectors.toList());
-
-			// Update cache and return
-			transactionsCache.addAll(
-				simpleTransactions.stream()
-					.filter( t -> t.getTimestamp() != null)
-					.sorted(newestTimestampFirstComparator)
-					.collect(Collectors.toList())
-			);
-
-			transactionsCacheTimestamp = NTP.getTime();
-			transactionsCacheXpub = key58;
-
-			return transactionsCache;
-		} catch ( ForeignBlockchainException e) {
-			LOGGER.error(e.getMessage(), e);
-			throw e;
-		} catch (ExecutionException | InterruptedException e) {
-			LOGGER.error(e.getMessage(), e);
-			throw new ForeignBlockchainException( "execution or interruption exception when calling foreign chain");
-		} catch( Exception e ) {
-			LOGGER.error(e.getMessage(), e);
-			return new ArrayList<>(0);
 		}
+
+		Context.propagate(bitcoinjContext);
+
+		Wallet wallet = walletFromDeterministicKey58(key58);
+		DeterministicKeyChain keyChain = wallet.getActiveKeyChain();
+
+		keyChain.setLookaheadSize(Bitcoiny.WALLET_KEY_LOOKAHEAD_INCREMENT);
+		keyChain.maybeLookAhead();
+
+		List<DeterministicKey> keys = new ArrayList<>(keyChain.getLeafKeys());
+
+		// Use thread-safe list for futures
+		List<Future<Optional<BitcoinyTransaction>>> futures = Collections.synchronizedList(new ArrayList<>());
+
+
+		// Fetch keys with transaction checks
+		Set<String> keySet = processKeysWithTransactionFuturesIterative(EXECUTOR, keys, keyChain, futures);
+
+		// Collect transactions from futures
+		Set<BitcoinyTransaction> walletTransactions = Collections.synchronizedSet(new HashSet<>());
+		for (Future<Optional<BitcoinyTransaction>> future : futures) {
+			Optional<BitcoinyTransaction> transactionOptional = future.get(10, TimeUnit.SECONDS);
+
+			if (transactionOptional.isPresent()) {
+				BitcoinyTransaction transaction = transactionOptional.get();
+				walletTransactions.add(transaction);
+
+				// Cache confirmed transactions
+				if (transaction.timestamp != null) {
+					this.blockchainCache.addTransactionByHash(transaction.txHash, transaction);
+				}
+			}
+		}
+
+		Comparator<SimpleTransaction> newestTimestampFirstComparator =
+			Comparator.comparingLong(SimpleTransaction::getTimestamp).reversed();
+
+		// Convert to simplified form
+		List<SimpleTransaction> simpleTransactions = walletTransactions.parallelStream()
+			.map(t -> convertToSimpleTransaction(t, keySet))
+			.collect(Collectors.toList());
+
+		// Unconfirmed transactions (null timestamp)
+		transactionsCache = simpleTransactions.stream()
+			.filter(t -> t.getTimestamp() == null)
+			.collect(Collectors.toList());
+
+		// Add confirmed transactions sorted by timestamp
+		transactionsCache.addAll(
+			simpleTransactions.stream()
+				.filter(t -> t.getTimestamp() != null)
+				.sorted(newestTimestampFirstComparator)
+				.collect(Collectors.toList())
+		);
+
+		// Update cache metadata
+		transactionsCacheTimestamp = NTP.getTime();
+		transactionsCacheXpub = key58;
+
+		return transactionsCache;
+	} catch (ForeignBlockchainException e) {
+		LOGGER.error(e.getMessage(), e);
+		throw e;
+	} catch (ExecutionException | InterruptedException e) {
+		LOGGER.error(e.getMessage(), e);
+		throw new ForeignBlockchainException("Execution or interruption exception when calling foreign chain");
+	} catch (Exception e) {
+		LOGGER.error(e.getMessage(), e);
+		return new ArrayList<>(0);
 	}
+}
+
+	private Set<String> processKeysWithTransactionFuturesIterative(
+	ExecutorService executor,
+	List<DeterministicKey> initialKeys,
+	DeterministicKeyChain keyChain,
+	List<Future<Optional<BitcoinyTransaction>>> futures
+) throws ForeignBlockchainException {
+
+	Set<String> keySet = new HashSet<>();
+	int unusedCounter = 0;
+
+	List<DeterministicKey> keysToProcess = new ArrayList<>(initialKeys);
+
+	while (!keysToProcess.isEmpty()) {
+		List<Future<Boolean>> transactionChecks = new ArrayList<>(keysToProcess.size());
+		boolean foundTransaction = false;
+
+		for (DeterministicKey dKey : keysToProcess) {
+			Address address = Address.fromKey(this.params, dKey, ScriptType.P2PKH);
+			keySet.add(address.toString());
+
+			// Schedule transaction check
+			transactionChecks.add(executor.submit(() -> getTransactions(address, futures, executor)));
+		}
+
+		// Wait for transaction check results
+		for (Future<Boolean> check : transactionChecks) {
+			try {
+				if (check.get()) {
+					foundTransaction = true;
+				}
+			} catch (Exception e) {
+				LOGGER.warn("Failed to check transaction for key", e);
+			}
+		}
+
+		if (foundTransaction) {
+			unusedCounter = 0;
+		} else {
+			unusedCounter += WALLET_KEY_LOOKAHEAD_INCREMENT;
+		}
+
+		if (unusedCounter >= Settings.getInstance().getGapLimit()) {
+			LOGGER.debug("Reached gap limit of " + unusedCounter + ", stopping key discovery.");
+			break;
+		}
+
+		// Generate next batch of keys
+		keysToProcess = generateMoreKeys(keyChain);
+	}
+
+	return keySet;
+}
 
 	/**
 	 * Process Keys With Transaction Futures
@@ -821,18 +796,15 @@ public abstract class Bitcoiny implements ForeignBlockchain {
 		// return list
 		List<AddressInfo> infos = new ArrayList<>();
 
-		// for the asynchronous thread tasks below
-		ExecutorService executor = Executors.newFixedThreadPool(50);
-
 		// generate keys asynchronously
-		Set<DeterministicKey> walletKeys = getWalletKeysWithExecutor(key58, executor);
+		Set<DeterministicKey> walletKeys = getWalletKeysWithExecutor(key58, EXECUTOR);
 
 		// collect all address info build tasks
 		List<Future<AddressInfo>> futures = new ArrayList<>(walletKeys.size());
 
 		// build info for each key, one address per key
 		for(DeterministicKey key : walletKeys) {
-			futures.add(executor.submit(() -> buildAddressInfo(key)));
+			futures.add(EXECUTOR.submit(() -> buildAddressInfo(key)));
 		}
 
 		try {
@@ -844,18 +816,6 @@ public abstract class Bitcoiny implements ForeignBlockchain {
 			LOGGER.error(e.getMessage(), e);
 		}
 
-		// Shutdown the executor and wait for all tasks to complete
-		executor.shutdown();
-		try {
-			if (!executor.awaitTermination(60, TimeUnit.SECONDS)) {
-				executor.shutdownNow();
-			}
-		} catch (InterruptedException e) {
-			LOGGER.error(e.getMessage(), e);
-			executor.shutdownNow();
-			Thread.currentThread().interrupt();
-		}
-
 		return infos.stream()
 				.sorted(new PathComparator(1))
 				.collect(Collectors.toList());
@@ -884,22 +844,8 @@ public abstract class Bitcoiny implements ForeignBlockchain {
 	public Set<String> getWalletAddresses(String key58) throws ForeignBlockchainException {
 		Context.propagate(bitcoinjContext);
 
-		// for asynchronous processing
-		ExecutorService executor = Executors.newFixedThreadPool(50);
-
 		// generate keys asynchronously and get the addresses, return value
-		Set<String> addresses = getWalletAddressesWithExecutor(key58, executor);
-
-		// Shutdown the executor and wait for all tasks to complete
-		executor.shutdown();
-		try {
-			if (!executor.awaitTermination(60, TimeUnit.SECONDS)) {
-				executor.shutdownNow();
-			}
-		} catch (InterruptedException ex) {
-			executor.shutdownNow();
-			Thread.currentThread().interrupt();
-		}
+		Set<String> addresses = getWalletAddressesWithExecutor(key58, EXECUTOR);
 
 		return addresses;
 	}
@@ -938,7 +884,8 @@ public abstract class Bitcoiny implements ForeignBlockchain {
 		keyChain.setLookaheadSize(Bitcoiny.WALLET_KEY_LOOKAHEAD_INCREMENT);
 		keyChain.maybeLookAhead();
 
-		Set<String> keySet = processKeys(executor, new ArrayList<>(keyChain.getLeafKeys()), keyChain, 0);
+		Set<String> keySet = processKeysIterative(executor, keyChain);
+
 
 		return keySet;
 	}
@@ -968,6 +915,91 @@ public abstract class Bitcoiny implements ForeignBlockchain {
 		return keySet;
 	}
 
+
+private Set<String> processKeysIterative(ExecutorService executor, DeterministicKeyChain keyChain) {
+    Set<String> allAddresses = new HashSet<>();
+    int unusedCounter = 0;
+    int batchCount = 0;
+    int gapLimit = Settings.getInstance().getGapLimit(); // e.g. 20
+    boolean continueProcessing = true;
+
+    while (continueProcessing) {
+        // Generate a batch of new keys
+        List<DeterministicKey> batch = keyChain.getLeafKeys().subList(
+            allAddresses.size(), 
+            Math.min(allAddresses.size() + WALLET_KEY_LOOKAHEAD_INCREMENT, keyChain.getLeafKeys().size())
+        );
+
+        if (batch.isEmpty()) {
+            // Ask keyChain to generate more if needed
+            keyChain.setLookaheadSize(allAddresses.size() + WALLET_KEY_LOOKAHEAD_INCREMENT);
+            keyChain.maybeLookAhead();
+
+            // Try to get new keys again
+            batch = keyChain.getLeafKeys().subList(
+                allAddresses.size(), 
+                Math.min(allAddresses.size() + WALLET_KEY_LOOKAHEAD_INCREMENT, keyChain.getLeafKeys().size())
+            );
+
+            if (batch.isEmpty()) {
+                LOGGER.warn("⚠️ No more keys to process.");
+                break;
+            }
+        }
+
+        batchCount++;
+        boolean foundTxInBatch = false;
+
+        List<Future<Boolean>> futures = new ArrayList<>();
+
+        for (DeterministicKey dKey : batch) {
+            Address address = Address.fromKey(this.params, dKey, ScriptType.P2PKH);
+            allAddresses.add(address.toString());
+
+            // First check cache
+            if (this.blockchainCache.keyHasHistory(dKey)) {
+                foundTxInBatch = true;
+                LOGGER.debug("Cached transaction found for {}", address);
+            } else {
+                // Submit async transaction check
+                futures.add(executor.submit(() -> {
+                    boolean hasTx = checkForTransactions(dKey, address);
+                    if (hasTx) LOGGER.debug("Live transaction found for {}", address);
+                    return hasTx;
+                }));
+            }
+        }
+
+        // Wait for async results
+        for (Future<Boolean> future : futures) {
+            try {
+                if (future.get(10, TimeUnit.SECONDS)) {
+                    foundTxInBatch = true;
+                }
+            } catch (Exception e) {
+                LOGGER.warn("Failed transaction check", e);
+            }
+        }
+
+        if (foundTxInBatch) {
+            unusedCounter = 0; // Reset on successful discovery
+        } else {
+            unusedCounter += WALLET_KEY_LOOKAHEAD_INCREMENT;
+        }
+
+        LOGGER.debug("Batch {}: Processed {} keys, unusedCounter = {}", batchCount, batch.size(), unusedCounter);
+
+        if (unusedCounter >= gapLimit) {
+            LOGGER.debug("Reached gap limit of {} unused keys, stopping.", gapLimit);
+            continueProcessing = false;
+        }
+    }
+
+    LOGGER.debug("Discovered {} total addresses in {} batches", allAddresses.size(), batchCount);
+    return allAddresses;
+}
+
+
 	/**
 	 * Process Keys
 	 *
@@ -1429,15 +1461,13 @@ public abstract class Bitcoiny implements ForeignBlockchain {
 
 		@Override
 		public List<UTXO> getOpenTransactionOutputs(List<ECKey> keys) throws UTXOProviderException {
-			ExecutorService executor = Executors.newFixedThreadPool(50);
-
-			Set<String> addresses = bitcoiny.processKeys(executor, this.keyChain.getLeafKeys(), this.keyChain, 0);
+			Set<String> addresses = bitcoiny.processKeys(EXECUTOR, this.keyChain.getLeafKeys(), this.keyChain, 0);
 
 			List<Future<UTXO>> futures = new ArrayList<>();
 
 			try {
 				for( String address : addresses ) {
-					futures.addAll( bitcoiny.getUTXOsAsync( address, true, executor) );
+					futures.addAll( bitcoiny.getUTXOsAsync( address, true, EXECUTOR) );
 				}
 
 				List<UTXO> utxos = new ArrayList<>(futures.size());

src/main/java/org/qortal/crosschain/ElectrumServer.java

@@ -38,6 +38,7 @@ public class ElectrumServer {
 
         this.socket = new Socket();
         this.socket.connect(endpoint, timeout);
+        this.socket.setSoTimeout(timeout);
         this.socket.setTcpNoDelay(true);
 
         if (this.server.getConnectionType() == ElectrumX.Server.ConnectionType.SSL) {

src/main/java/org/qortal/data/transaction/ArbitraryHostedDataInfo.java

@@ -0,0 +1,45 @@
+package org.qortal.data.transaction;
+
+import org.qortal.arbitrary.misc.Service;
+import org.qortal.controller.arbitrary.ArbitraryDataFolderInfo;
+
+import javax.xml.bind.annotation.XmlAccessType;
+import javax.xml.bind.annotation.XmlAccessorType;
+import java.util.List;
+
+// All properties to be converted to JSON via JAXB
+@XmlAccessorType(XmlAccessType.FIELD)
+public class ArbitraryHostedDataInfo {
+
+	private long count;
+
+	private long totalSpace;
+
+	private List<ArbitraryHostedDataItemInfo> items;
+
+	// Constructors
+
+	// For JAXB
+	protected ArbitraryHostedDataInfo() {
+		super();
+	}
+
+	public ArbitraryHostedDataInfo(long count, long totalSpace, List<ArbitraryHostedDataItemInfo> items) {
+
+		this.count = count;
+		this.totalSpace = totalSpace;
+		this.items = items;
+	}
+
+	public long getCount() {
+		return count;
+	}
+
+	public long getTotalSpace() {
+		return totalSpace;
+	}
+
+	public List<ArbitraryHostedDataItemInfo> getItems() {
+		return items;
+	}
+}

src/main/java/org/qortal/data/transaction/ArbitraryHostedDataItemInfo.java

@@ -0,0 +1,96 @@
+package org.qortal.data.transaction;
+
+import org.qortal.arbitrary.misc.Service;
+import org.qortal.controller.arbitrary.ArbitraryDataFolderInfo;
+
+import javax.xml.bind.annotation.XmlAccessType;
+import javax.xml.bind.annotation.XmlAccessorType;
+
+// All properties to be converted to JSON via JAXB
+@XmlAccessorType(XmlAccessType.FIELD)
+public class ArbitraryHostedDataItemInfo {
+	private int chunkCount;
+	private long totalSpace;
+	private ArbitraryTransactionData.DataType dataType;
+	private ArbitraryTransactionData.Compression compression;
+	private ArbitraryTransactionData.Method method;
+	private String identifier;
+	private long timestamp;
+	private byte[] signature;
+	private String creatorAddress;
+	private Service service;
+	private int size;
+	private String name;
+
+	// Constructors
+
+	// For JAXB
+	protected ArbitraryHostedDataItemInfo() {
+		super();
+	}
+
+	public ArbitraryHostedDataItemInfo(ArbitraryTransactionData data, ArbitraryDataFolderInfo info) {
+
+		this.timestamp = data.getTimestamp();
+		this.signature = data.getSignature();
+		this.creatorAddress = data.getCreatorAddress();
+		this.service = data.getService();
+		this.size = data.getSize();
+		this.name = data.getName();
+		this.identifier = data.getIdentifier();
+		this.method = data.getMethod();
+		this.compression = data.getCompression();
+		this.dataType = data.getDataType();
+
+		this.totalSpace = info.getTotalSpace();
+		this.chunkCount = info.getChunkCount();
+	}
+
+	public int getChunkCount() {
+		return chunkCount;
+	}
+
+	public long getTotalSpace() {
+		return totalSpace;
+	}
+
+	public ArbitraryTransactionData.DataType getDataType() {
+		return dataType;
+	}
+
+	public ArbitraryTransactionData.Compression getCompression() {
+		return compression;
+	}
+
+	public ArbitraryTransactionData.Method getMethod() {
+		return method;
+	}
+
+	public String getIdentifier() {
+		return identifier;
+	}
+
+	public long getTimestamp() {
+		return timestamp;
+	}
+
+	public byte[] getSignature() {
+		return signature;
+	}
+
+	public String getCreatorAddress() {
+		return creatorAddress;
+	}
+
+	public Service getService() {
+		return service;
+	}
+
+	public int getSize() {
+		return size;
+	}
+
+	public String getName() {
+		return name;
+	}
+}

src/main/java/org/qortal/settings/Settings.java

@@ -545,7 +545,22 @@ public class Settings {
 	 */
 	private int rebuildArbitraryResourceCacheTaskPeriod = 24;
 
-	// Domain mapping
+	/**
+	 * Electrum Thread Count
+	 *
+	 * The number of threads ready to access Electrum servers for the supported foreign coins.
+	 */
+    private int electrumThreadCount = 12;
+
+	/**
+	 * Host Monitor Enabled
+	 *
+	 * The Host Monitor is a thread that runs in the background. It crawls through the QDN data directory to monitor
+	 * what is in there. If set to false, then it will not run.
+	 */
+    private  boolean hostMonitorEnabled = false;
+
+    // Domain mapping
 	public static class ThreadLimit {
 		private String messageType;
 		private Integer limit;
@@ -1394,4 +1409,12 @@ public class Settings {
 	public int getRebuildArbitraryResourceCacheTaskPeriod() {
 		return rebuildArbitraryResourceCacheTaskPeriod;
 	}
+
+	public int getElectrumThreadCount() {
+		return electrumThreadCount;
+	}
+
+	public boolean isHostMonitorEnabled() {
+		return hostMonitorEnabled;
+	}
 }

src/main/java/org/qortal/utils/ArbitraryIndexUtils.java

@@ -58,8 +58,8 @@ public class ArbitraryIndexUtils {
             }
         };
 
-        // delay 1 second
-        timer.scheduleAtFixedRate(task, 1_000, frequency * 60_000);
+        // delay by the frequency
+        timer.scheduleAtFixedRate(task, frequency * 60_000, frequency * 60_000);
     }
 
     private static void fillCache(IndexCache instance) throws DataException, IOException {

src/main/java/org/qortal/utils/ArbitraryTransactionUtils.java

@@ -396,8 +396,7 @@ public class ArbitraryTransactionUtils {
         return filesRelocatedCount;
     }
 
-    public static List<ArbitraryTransactionData> limitOffsetTransactions(List<ArbitraryTransactionData> transactions,
-                                                                         Integer limit, Integer offset) {
+    public static <T> List<T> limitOffsetTransactions(List<T> transactions, Integer limit, Integer offset) {
         if (limit != null && limit == 0) {
             limit = null;
         }