mycelium/mycelium
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Bootstrap Stage 0.

Browse source 
Here we begin.

   * GPLv3.txt
   * README.txt
   * bootstrap-stage-0.html
   * bootstrap-stage-0.txt
   * rust/Cargo.toml
   * rust/mycelium.rs
This commit is contained in:
khleedril 2025-08-17 12:33:35 +01:00
commit 01c48ff0e8
Signed by: khleedril
GPG key ID: CA471FD501618A49
6 changed files with 1953 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

674
GPLv3.txt Normal file
View file

@ -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>.

1
README.txt Symbolic link
View file

@ -0,0 +1 @@
bootstrap-stage-0.txt

567
bootstrap-stage-0.html Normal file
View file

@ -0,0 +1,567 @@
<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en" xml:lang="en">
<head>
<meta http-equiv="Content-Type" content="text/html;charset=utf-8" />
<meta name="viewport" content="width=device-width, initial-scale=1" />
<title>Mycelium Totally Un-Discoverable Developer Network: Bootstrap Stage Zero</title>
<meta name="generator" content="Org Mode" />
<style>
#content { max-width: 60em; margin: auto; }
.title { text-align: center;
margin-bottom: .2em; }
.subtitle { text-align: center;
font-size: medium;
font-weight: bold;
margin-top:0; }
.todo { font-family: monospace; color: red; }
.done { font-family: monospace; color: green; }
.priority { font-family: monospace; color: orange; }
.tag { background-color: #eee; font-family: monospace;
padding: 2px; font-size: 80%; font-weight: normal; }
.timestamp { color: #bebebe; }
.timestamp-kwd { color: #5f9ea0; }
.org-right { margin-left: auto; margin-right: 0px; text-align: right; }
.org-left { margin-left: 0px; margin-right: auto; text-align: left; }
.org-center { margin-left: auto; margin-right: auto; text-align: center; }
.underline { text-decoration: underline; }
#postamble p, #preamble p { font-size: 90%; margin: .2em; }
p.verse { margin-left: 3%; }
pre {
border: 1px solid #e6e6e6;
border-radius: 3px;
background-color: #f2f2f2;
padding: 8pt;
font-family: monospace;
overflow: auto;
margin: 1.2em;
}
pre.src {
position: relative;
overflow: auto;
}
pre.src:before {
display: none;
position: absolute;
top: -8px;
right: 12px;
padding: 3px;
color: #555;
background-color: #f2f2f299;
}
pre.src:hover:before { display: inline; margin-top: 14px;}
/* Languages per Org manual */
pre.src-asymptote:before { content: 'Asymptote'; }
pre.src-awk:before { content: 'Awk'; }
pre.src-authinfo::before { content: 'Authinfo'; }
pre.src-C:before { content: 'C'; }
/* pre.src-C++ doesn't work in CSS */
pre.src-clojure:before { content: 'Clojure'; }
pre.src-css:before { content: 'CSS'; }
pre.src-D:before { content: 'D'; }
pre.src-ditaa:before { content: 'ditaa'; }
pre.src-dot:before { content: 'Graphviz'; }
pre.src-calc:before { content: 'Emacs Calc'; }
pre.src-emacs-lisp:before { content: 'Emacs Lisp'; }
pre.src-fortran:before { content: 'Fortran'; }
pre.src-gnuplot:before { content: 'gnuplot'; }
pre.src-haskell:before { content: 'Haskell'; }
pre.src-hledger:before { content: 'hledger'; }
pre.src-java:before { content: 'Java'; }
pre.src-js:before { content: 'Javascript'; }
pre.src-latex:before { content: 'LaTeX'; }
pre.src-ledger:before { content: 'Ledger'; }
pre.src-lisp:before { content: 'Lisp'; }
pre.src-lilypond:before { content: 'Lilypond'; }
pre.src-lua:before { content: 'Lua'; }
pre.src-matlab:before { content: 'MATLAB'; }
pre.src-mscgen:before { content: 'Mscgen'; }
pre.src-ocaml:before { content: 'Objective Caml'; }
pre.src-octave:before { content: 'Octave'; }
pre.src-org:before { content: 'Org mode'; }
pre.src-oz:before { content: 'OZ'; }
pre.src-plantuml:before { content: 'Plantuml'; }
pre.src-processing:before { content: 'Processing.js'; }
pre.src-python:before { content: 'Python'; }
pre.src-R:before { content: 'R'; }
pre.src-ruby:before { content: 'Ruby'; }
pre.src-sass:before { content: 'Sass'; }
pre.src-scheme:before { content: 'Scheme'; }
pre.src-screen:before { content: 'Gnu Screen'; }
pre.src-sed:before { content: 'Sed'; }
pre.src-sh:before { content: 'shell'; }
pre.src-sql:before { content: 'SQL'; }
pre.src-sqlite:before { content: 'SQLite'; }
/* additional languages in org.el's org-babel-load-languages alist */
pre.src-forth:before { content: 'Forth'; }
pre.src-io:before { content: 'IO'; }
pre.src-J:before { content: 'J'; }
pre.src-makefile:before { content: 'Makefile'; }
pre.src-maxima:before { content: 'Maxima'; }
pre.src-perl:before { content: 'Perl'; }
pre.src-picolisp:before { content: 'Pico Lisp'; }
pre.src-scala:before { content: 'Scala'; }
pre.src-shell:before { content: 'Shell Script'; }
pre.src-ebnf2ps:before { content: 'ebfn2ps'; }
/* additional language identifiers per "defun org-babel-execute"
in ob-*.el */
pre.src-cpp:before { content: 'C++'; }
pre.src-abc:before { content: 'ABC'; }
pre.src-coq:before { content: 'Coq'; }
pre.src-groovy:before { content: 'Groovy'; }
/* additional language identifiers from org-babel-shell-names in
ob-shell.el: ob-shell is the only babel language using a lambda to put
the execution function name together. */
pre.src-bash:before { content: 'bash'; }
pre.src-csh:before { content: 'csh'; }
pre.src-ash:before { content: 'ash'; }
pre.src-dash:before { content: 'dash'; }
pre.src-ksh:before { content: 'ksh'; }
pre.src-mksh:before { content: 'mksh'; }
pre.src-posh:before { content: 'posh'; }
/* Additional Emacs modes also supported by the LaTeX listings package */
pre.src-ada:before { content: 'Ada'; }
pre.src-asm:before { content: 'Assembler'; }
pre.src-caml:before { content: 'Caml'; }
pre.src-delphi:before { content: 'Delphi'; }
pre.src-html:before { content: 'HTML'; }
pre.src-idl:before { content: 'IDL'; }
pre.src-mercury:before { content: 'Mercury'; }
pre.src-metapost:before { content: 'MetaPost'; }
pre.src-modula-2:before { content: 'Modula-2'; }
pre.src-pascal:before { content: 'Pascal'; }
pre.src-ps:before { content: 'PostScript'; }
pre.src-prolog:before { content: 'Prolog'; }
pre.src-simula:before { content: 'Simula'; }
pre.src-tcl:before { content: 'tcl'; }
pre.src-tex:before { content: 'TeX'; }
pre.src-plain-tex:before { content: 'Plain TeX'; }
pre.src-verilog:before { content: 'Verilog'; }
pre.src-vhdl:before { content: 'VHDL'; }
pre.src-xml:before { content: 'XML'; }
pre.src-nxml:before { content: 'XML'; }
/* add a generic configuration mode; LaTeX export needs an additional
(add-to-list 'org-latex-listings-langs '(conf " ")) in .emacs */
pre.src-conf:before { content: 'Configuration File'; }
table { border-collapse:collapse; }
caption.t-above { caption-side: top; }
caption.t-bottom { caption-side: bottom; }
td, th { vertical-align:top; }
th.org-right { text-align: center; }
th.org-left { text-align: center; }
th.org-center { text-align: center; }
td.org-right { text-align: right; }
td.org-left { text-align: left; }
td.org-center { text-align: center; }
dt { font-weight: bold; }
.footpara { display: inline; }
.footdef { margin-bottom: 1em; }
.figure { padding: 1em; }
.figure p { text-align: center; }
.equation-container {
display: table;
text-align: center;
width: 100%;
}
.equation {
vertical-align: middle;
}
.equation-label {
display: table-cell;
text-align: right;
vertical-align: middle;
}
.inlinetask {
padding: 10px;
border: 2px solid gray;
margin: 10px;
background: #ffffcc;
}
#org-div-home-and-up
{ text-align: right; font-size: 70%; white-space: nowrap; }
textarea { overflow-x: auto; }
.linenr { font-size: smaller }
.code-highlighted { background-color: #ffff00; }
.org-info-js_info-navigation { border-style: none; }
#org-info-js_console-label
{ font-size: 10px; font-weight: bold; white-space: nowrap; }
.org-info-js_search-highlight
{ background-color: #ffff00; color: #000000; font-weight: bold; }
.org-svg { }
</style>
</head>
<body>
<div id="content" class="content">
<h1 class="title">Mycelium Totally Un-Discoverable Developer Network: Bootstrap Stage Zero
<br />
<span class="subtitle">Khleedril, August 2025</span>
</h1>
<div id="table-of-contents" role="doc-toc">
<h2>Table of Contents</h2>
<div id="text-table-of-contents" role="doc-toc">
<ul>
<li><a href="#orgaaf1368">1. Abstract</a>
<ul>
<li><a href="#org62f64e7">1.1. Audience</a></li>
<li><a href="#orga39b305">1.2. Distribution</a></li>
<li><a href="#orgfee18b8">1.3. Provenance</a></li>
</ul>
</li>
<li><a href="#org1fb1226">2. Introduction</a>
<ul>
<li><a href="#org826117c">2.1. The Catch-22s of Open Web Governance</a></li>
<li><a href="#org944f708">2.2. Safety</a></li>
</ul>
</li>
<li><a href="#org6a91e2b">3. Bootstrap Stage Zero Technical Specifications</a>
<ul>
<li><a href="#org849f0eb">3.1. Communication Protocol</a></li>
<li><a href="#orga3bafb7">3.2. Assessment Procedure/Protocol</a></li>
</ul>
</li>
<li><a href="#orge7af4c4">4. Deployment</a>
<ul>
<li><a href="#orgba9cf15">4.1. Use</a></li>
</ul>
</li>
</ul>
</div>
</div>
<style>
body { width: 40em; }
</style>
<div id="outline-container-orgaaf1368" class="outline-2">
<h2 id="orgaaf1368"><span class="section-number-2">1.</span> Abstract</h2>
<div class="outline-text-2" id="text-1">
<p>
With the ultimate aim to provide provenance to people to allow them to participate in online project governance structures, we describe a network of <i>Pretty Good Privacy</i> (PGP) public keys, but unlike the original intention for the keys to be discoverable, we create a network which is absolutely <span class="underline">not discoverable</span> and provides a more dynamic set of trust measures. The network is made up of people each with a few friends (people known to be actual people and trustworthy), and the only action one can perform on the network is to ask friends for an opinion of the trust of a <i>person</i> in a <i>context</i>, both being known in advance by out-of-band means. Thus honest participants should feel safe being a part of the network, only being reachable by trusted friends.
</p>
</div>
<div id="outline-container-org62f64e7" class="outline-3">
<h3 id="org62f64e7"><span class="section-number-3">1.1.</span> Audience</h3>
<div class="outline-text-3" id="text-1-1">
<p>
This document is aimed at software developers who manage an Internet web server, and are comfortable with HTTPS, JSON, and PGP.
</p>
</div>
</div>
<div id="outline-container-orga39b305" class="outline-3">
<h3 id="orga39b305"><span class="section-number-3">1.2.</span> Distribution</h3>
<div class="outline-text-3" id="text-1-2">
<p>
Wide dissemination of this document is strongly encouraged, but modifications are <b>not</b> permitted. The document should be referred to by the title and date shown above. Legally the work should be considered to be copyrighted by the author with terms according to the Creative Commons (CC) BY-ND<sup><a id="fnr.1" class="footref" href="#fn.1" role="doc-backlink">1</a></sup> license. The document is being discussed on <i>Mastodon</i> under the hash-tag <code>#myceliumboot0</code>.
</p>
</div>
</div>
<div id="outline-container-orgfee18b8" class="outline-3">
<h3 id="orgfee18b8"><span class="section-number-3">1.3.</span> Provenance</h3>
<div class="outline-text-3" id="text-1-3">
<p>
The source text for this document and the referenced source code exists as commits in a GIT repositiory — at this moment in time residing at <a href="https://khleedril.org/forge/mycelium/mycelium">https://khleedril.org/forge/mycelium/mycelium</a> — signed by <i>khleedril@a.b</i>, PGP fingerprint <code>E23C21ED864FF4F3A7114CDFCA471FD501618A49</code>, the same key that I’m using in the Mycelium network; it will hopefully develop reputation as the network evolves!
</p>
<p>
If you have access to the <i>Guix</i> command, you can run
</p>
<div class="org-src-container">
<pre class="src src-sh">guix git authenticate \
d92072679363b63576862ca206add26f8039114c \
E23C21ED864FF4F3A7114CDFCA471FD501618A49
</pre>
</div>
<p>
to assert the authenticity of the entire repository after you have cloned it to your own machine.<sup><a id="fnr.2" class="footref" href="#fn.2" role="doc-backlink">2</a></sup><sup>, </sup><sup><a id="fnr.3" class="footref" href="#fn.3" role="doc-backlink">3</a></sup>
</p>
</div>
</div>
</div>
<div id="outline-container-org1fb1226" class="outline-2">
<h2 id="org1fb1226"><span class="section-number-2">2.</span> Introduction</h2>
<div class="outline-text-2" id="text-2">
</div>
<div id="outline-container-org826117c" class="outline-3">
<h3 id="org826117c"><span class="section-number-3">2.1.</span> The Catch-22s of Open Web Governance</h3>
<div class="outline-text-3" id="text-2-1">
<p>
We look back over the work of Indymedia<sup><a id="fnr.4" class="footref" href="#fn.4" role="doc-backlink">4</a></sup>, Occupy Movement<sup><a id="fnr.5" class="footref" href="#fn.5" role="doc-backlink">5</a></sup>, and Hamish Campbell’s ideas on an open web governance body<sup><a id="fnr.6" class="footref" href="#fn.6" role="doc-backlink">6</a></sup><sup>, </sup><sup><a id="fnr.7" class="footref" href="#fn.7" role="doc-backlink">7</a></sup>, and realize that there are two imminent problems: the choice of first use case, and the ramp-up process to arrive at something which works. We believe the first application of governance is the managed development of the governance project itself. This gives us an immediate Catch-22: we want to develop code to enable fully federated governance; we want the code development to be governed by the fully federated governance: we need to bootstrap the process of assembling a governance of developers to develop the governance infrastructure. So we lay out here the smallest first step (which we christen <i>Stage Zero</i>) to get this process started, or bootstrapped.
</p>
<p>
The extant projects are trying to single-handedly get funding. This points to another Catch-22, wherein a movement of sorts needs to be established so that funding can be justified, yet real (i.e., full-time) progress may be stilted without some funding.
</p>
<p>
As to a final Catch-22: it is acknowledged that governance is a messy business unsuited to inflexible algorithms. But on-line governance needs to be managed by a network of computers, and computers run on algorithms. Thus here we endeavour to make the smallest possible working algorithm we can imagine, and leave it to further effort to put actual governance structures in place, using the Mycelium network as the unassuming root of trust in the system.
</p>
</div>
</div>
<div id="outline-container-org944f708" class="outline-3">
<h3 id="org944f708"><span class="section-number-3">2.2.</span> Safety</h3>
<div class="outline-text-3" id="text-2-2">
<p>
There is no central register of keys, and no way to traverse the Mycelium network to discover them. The best any member of the network can do is ask other members they know about to provide an assessment of trust in some known key — person — in some known context. The assessor end-points which people provide SHOULD be at some very obscure uniform resource indicator (URI) which will be hidden from prying eyes by transport layer security (TLS). The only people who will know your assessor URI are the friends you tell about it. If you don’t trust them not to denial-of-service (DOS) attack you, they are not your friends!
</p>
<p>
There is, in fact, no centre-point at all. The project does not have an Internet domain name, a web server of its own, or an official GIT repository. I might be special just at this moment in time in that I’m the first to have a Mycelium assessor end-point, and a GIT repository with the code (and this document) in, but that’s as far as it goes.
</p>
</div>
</div>
</div>
<div id="outline-container-org6a91e2b" class="outline-2">
<h2 id="org6a91e2b"><span class="section-number-2">3.</span> Bootstrap Stage Zero Technical Specifications</h2>
<div class="outline-text-2" id="text-3">
<p>
At a minimum, a governance system needs people and contexts in which they are deemed to have some privilege to take actions, such as proposing changes, voting on proposals, committing to official repositories, or changing the rules of an organization. People need to be uniquely and unambiguously identified, both on line and in person. The simplest way to achieve this is to use the fingerprint of a public PGP key as an identifier, and the user can assert their authenticity by exercising the private part of the key. These keys are <b>not</b> considered associated with any e-mail addresses, and are not expected to sit in any registries or public key-rings.
</p>
<p>
A secondary benefit of using PGP keys is that they might also have been used in signing GIT commits, and so the authenticity of a person could be reinforced that way.
</p>
<p>
As regards contexts, we simply need guaranteed unique identifiers for these, and choose to use Universally Unique Identifiers (UUIDs).
</p>
<p>
The Mycelium network itself need have no knowledge of the meaning of contexts, or of any proper nouns attributed to the people. Both are regarded as completely abstract objects (although it is mandated that people are actual living people).
</p>
<p>
So all developers on the network need a PGP key pair, and the ability to use them. For any context, identified by a UUID, users need to give <i>measures</i> to keys for that context. Measures could be trust, reliability, provenenance, historical commitment, &amp;c. Contexts can be created at will.
</p>
<p>
Thus developers need to provide a service to the Mycelium network wherein they provide their assessment of measure of a key in a context to someone they know and trust. This assessment should be based either on their own judgement, or on accessing their own sub-networks of trusted contacts. Therefore the basic unit of ‘entity’ on the network is a key-assessor pair, where the assessor is a HTTPS URI end-point providing a simple Javascript object notation (JSON)-based application programming interface (API).
</p>
</div>
<div id="outline-container-org849f0eb" class="outline-3">
<h3 id="org849f0eb"><span class="section-number-3">3.1.</span> Communication Protocol</h3>
<div class="outline-text-3" id="text-3-1">
<p>
The request should be the JSON object
</p>
<div class="org-src-container">
<pre class="src src-json">{ “request-id”: “&lt;UUID: string&gt;”,
“request-depth”: &lt;positive integer&gt;,
“key”: “&lt;GPG fingerprint: string&gt;”,
“context”: “&lt;UUID: string&gt;” }
</pre>
</div>
<p>
presented as UTF-8 text in the body of a HTTPS POST request, asking for an assessment of the trust of the given key in the given context. The <i>key</i> and the <i>context</i> are the important parts, obviously, and then the <i>request-id</i> should be a new UUID created by the original requestor and passed along to others in the chain; if a node sees a UUID twice in a short space of time it means there is a loop in the friend network (not uncommon), and so the response in this case should be a <i>no-basis</i> one, i.e. there is no basis on which to make a judgement of measure.
</p>
<p>
The <i>request-depth</i> is set to some value by the initial requestor and decremented by one whenever the request is passed from one friend to another; if zero is reached a no-basis response should also be assumed (as a safety measure, nodes should ensure that the depth is not unreasonably large so as to flood the network). This will guarantee termination of the process and not flood the entire Mycelium network. If the theory holds that everyone on Earth is related by up to seven degrees of freedom, then setting the parameter to seven would seem to make the system conclusive. However, this will flood the network and take a long time to return, so for practical purposes the parameter should probably be no more than three or four. In practice it would be expected that people will associate in rings (e.g. all members of a project), so a low fan-out should suffice. This may need tuning in light of experience with the protocol, and adjusting as the network matures.
</p>
<p>
The HTTP response body would be either
</p>
<pre class="example">
“no-basis”
</pre>
<p>
in the case that the service has no basis for making an assessment of a level of trust, or
</p>
<pre class="example">
{“trust”: &lt;integer 0-100&gt;}
</pre>
<p>
presented as UTF-8.
</p>
<p>
The trust levels — ‘trust’ being some measure of trust, belief, provenance, reliability, &amp;c., depending on context — between 0 and 100 are to be understood thus. A value of 50 means there is no opinion on a person’s trust, less than 50 means that the person is actively untrusted, and above 50 means that they are trusted to some extent; between 50 and 75 means that a person is trusted with some reservation, whereas a value above 75 means they are more trusted than not. In many cases actions by people should only be considered valid if their trust level in the context of the action is above 75.
</p>
<p>
Of course these are executive decisions being made unaccountably for the purpose of bootstrapping the project; it should be regarded as a minimal seed for the bootstrap process, and not impervious to changes in future made by a governance structure in the context of the Mycelium project, which has been given the ID <code>7a484ea4-82c6-4bf2-a4d9-c31001079f69</code>.
</p>
</div>
</div>
<div id="outline-container-orga3bafb7" class="outline-3">
<h3 id="orga3bafb7"><span class="section-number-3">3.2.</span> Assessment Procedure/Protocol</h3>
<div class="outline-text-3" id="text-3-2">
<p>
While the communication protocol above is absolutely rigid, and services which do not conform simply will not work, the assessment procedure used by an individual is much less enforced, or even enforceable. Remember that the only people you will deal with are people you innately trust.
</p>
<p>
If the <code>request-id</code> has been seen recently (in the last 60 seconds), or if the <code>request-depth</code> is zero, then an assessor should return <code>”no-basis”</code>.
</p>
<p>
The assessor might directly have an opinion of a key in a context, in which case it would be fair for them to simply return that.
</p>
<p>
If however they don’t have a measure of this key in this context, they ask all of their friends, or a random subset if they have many. First, check their <i>person</i> context and ignore them if the measure is less than 75 (why are they on your friends list if you don’t really believe they are people?) Then check that their assessor rating, taken to be a weight, is at least positive. Then send a request asking for their assessment, decrementing the depth number by one. If they return <code>“no-basis”</code>, ignore this. Anything else, we update our trust, starting from 50, with an updater which effectively takes the mean of all trust assessments we receive from our friends, weighted relatively by their <i>assessor</i> context measures (context ID <code>b5cd757f-54fa-4ec3-a1e3-bd5544533c1b</code>) whose value we MUST have locally.
</p>
<p>
Sample implementation code is enclosed with this document, written in Rust, with the code — not this document — to be understood as definitive; the protocol itself is considered language agnostic. It is kept as simple as possible. You might question the wisdom of hard-wiring friend data, including keys, into the code, and so you should. Remember that this is the zero-stage bootstrap and we are taking baby steps, so we are taking some slightly desperate measures to keep all things simple, and, importantly, introspectible; we don’t want anybody to feel compelled to do anything they are not comfortable with. It is very likely that in the near future this will change to a local database which is updated dynamically, so that some measures, such as reliability estimates, can be automatically updated over time, as well as through a web interface so that non-technical people can join in with more worldly projects than dry protocol development. But we need to get experience with the simple set-up first, and get the tuning right early on.
</p>
<p>
Note that the communication protocol imposes very little on the assessment methodology. Individual users might come up with their own scheme, which might include caching of historically seen values, turning a node into an aggregator. At this time, such behaviours are discouraged. It should be further noted that most assessments will be weighted averages of those obtained through all friends, and so outliers (disgruntled friends!) and generally bad behaviour in the network, including gaming of the system, should be suppressed, and such things as aggregation behaviour become unworthwhile.
</p>
</div>
</div>
</div>
<div id="outline-container-orge7af4c4" class="outline-2">
<h2 id="orge7af4c4"><span class="section-number-2">4.</span> Deployment</h2>
<div class="outline-text-2" id="text-4">
<p>
It is assumed you manage an Internet server, have a web front-end like <i>Nginx</i> or <i>Apache</i> which deals with TLS and its certificates (e.g., <i>LetsEncrypt</i>), and can reverse-proxy to a back-end server. We provide the minimal code needed to realize that back-end, which does not concern itself with the security of your machine. You must edit this code before deployment, as your network data are hard-wired in it. You should map a relatively random URI to this service so that it cannot be easily guessed. Remember, only your trusted friends are supposed to be using it!
</p>
<p>
The only other requirement of the deployment machine is that the edited Rust code can be compiled and then the resulting executable can be deployed.
</p>
</div>
<div id="outline-container-orgba9cf15" class="outline-3">
<h3 id="orgba9cf15"><span class="section-number-3">4.1.</span> Use</h3>
<div class="outline-text-3" id="text-4-1">
</div>
<div id="outline-container-org88bc3f2" class="outline-4">
<h4 id="org88bc3f2"><span class="section-number-4">4.1.1.</span> Get Started</h4>
<div class="outline-text-4" id="text-4-1-1">
<p>
Set up the service on a machine you own on the Internet, and connect with some friends (exchange public keys, verify control of private keys, and obtain assessor end-point URIs). Modify the service you are running to include your friends’ data by editing the source code.
</p>
</div>
</div>
<div id="outline-container-org2d10e70" class="outline-4">
<h4 id="org2d10e70"><span class="section-number-4">4.1.2.</span> Utilize the Network</h4>
<div class="outline-text-4" id="text-4-1-2">
<p>
If you want to use the network, a curl command would do the trick:
</p>
<pre class="example">
curl -d ‘{“request-depth”: 3, \
“request-id”: “&lt;new uuid&gt;”, \
“key”: “&lt;a person’s key fingerprint&gt;”, \
“context”: “&lt;a context UUID&gt;”}’ \
&lt;assessor-uri&gt;
</pre>
<p>
which, in the early stages of uptake of this scheme, is most likely going to return <code>”no-basis”</code>, but hopefully the situation will improve very quickly in time, especially in the context of on-going projects which you are a part of. Like the Mycelium project itself (<code>7a484ea4-82c6-4bf2-a4d9-c31001079f69</code>).
</p>
<p>
Note that you are using one of your friend’s assessor end-points here (you don’t know of any others); you don’t want to annoy them by making a torrent of requests of this kind, do you? You likely won’t stay friends for very long if you do, and then you’ll lose your footing in the Mycelium network.
</p>
</div>
</div>
<div id="outline-container-orgd32fed9" class="outline-4">
<h4 id="orgd32fed9"><span class="section-number-4">4.1.3.</span> Join the Mycelium Project as a Developer</h4>
<div class="outline-text-4" id="text-4-1-3">
<p>
Take the initiative. Write a proposal, or proposed modification to some source code, put it out on the Internet somehow. Generate a UUID; this is the context for the proposal. Maybe give some people you want to engage with some trust against this UUID, by modifying your server.
</p>
<p>
Also generate a ‘proposal-vote’ UUID; any other person can give you a rating against this context, effectively voting for or against the proposal. Final votes might be weighted according to the voter’s rating against the proposal context itself.
</p>
<p>
Advertise the proposal and its UUIDs. Gain a reputation on the Mycelium network (people will hopefully give you measure above 50 in the context of the vote UUID). Maybe use Mastodon with one or more of the hash-tags #mycelium, #myceliumboot0, #mycelium&lt;my-proposal&gt;. Maybe send me a private message somehow to let me know of the proposal. One way or another, you are now part of the project; whether your proposal or your reputation with the project gets any traction is another matter: it is up to you to promote your idea and for the network to respond. If I find out about your proposal and care to get the network’s measure of you against the proposal’s vote context and this comes in greater than 75, I’ll likely engage with you about it.
</p>
</div>
</div>
<div id="outline-container-org764cf83" class="outline-4">
<h4 id="org764cf83"><span class="section-number-4">4.1.4.</span> Vote within the Mycelium Project</h4>
<div class="outline-text-4" id="text-4-1-4">
<p>
As of this writing, the ‘project’ does not exist; there is no organization nor rules of governance. The only thing in place is the emerging zero-bootstrapped Mycelium network. Thus the first decisions are likely to be decided by vote: to express your preference add a ‘person’ to your service, and give them your weighting under the context of the vote.
</p>
<p>
You will want to make sure that you have some connection to the project, and that the project knows you want to have an input. The project will presumably (through social media; hint: watch the #mycelium hash-tag) announce a decision needs to be made (choice of proposals which have been put forward?) and a UUID will be announced as the context for that decision.
</p>
</div>
</div>
<div id="outline-container-org2f4e451" class="outline-4">
<h4 id="org2f4e451"><span class="section-number-4">4.1.5.</span> Connect to Me</h4>
<div class="outline-text-4" id="text-4-1-5">
<p>
I don’t encourage this, but if you want to connect with me&#x2026;
</p>
<p>
Somehow send me a secure private message, convincing me that I know you as a person (did we meet in a video call somewhere?) and that what you do matters to me. Probably your PGP key should be well used as the committer to the GIT repository of some worthwhile project. Then I’ll consider linking to you as a friend, and maybe let you know my assessor URI.
</p>
</div>
</div>
</div>
</div>
<div id="footnotes">
<h2 class="footnotes">Footnotes: </h2>
<div id="text-footnotes">
<div class="footdef"><sup><a id="fn.1" class="footnum" href="#fnr.1" role="doc-backlink">1</a></sup> <div class="footpara" role="doc-footnote"><p class="footpara">
Creative Commons license with author attribution and no derivatives. <a href="https://creativecommons.org/licenses/by-nd/4.0/">https://creativecommons.org/licenses/by-nd/4.0/</a>
</p></div></div>
<div class="footdef"><sup><a id="fn.2" class="footnum" href="#fnr.2" role="doc-backlink">2</a></sup> <div class="footpara" role="doc-footnote"><p class="footpara">
Introduction to Guix GIT authentication <a href="https://openworld.news/gnu-guix-authenticate-your-git-checkouts/">https://openworld.news/gnu-guix-authenticate-your-git-checkouts/</a>.
</p></div></div>
<div class="footdef"><sup><a id="fn.3" class="footnum" href="#fnr.3" role="doc-backlink">3</a></sup> <div class="footpara" role="doc-footnote"><p class="footpara">
The <i>guix git authenticate</i> command <a href="https://guix.gnu.org/manual/devel/en/html_node/Invoking-guix-git-authenticate.html">https://guix.gnu.org/manual/devel/en/html_node/Invoking-guix-git-authenticate.html</a>.
</p></div></div>
<div class="footdef"><sup><a id="fn.4" class="footnum" href="#fnr.4" role="doc-backlink">4</a></sup> <div class="footpara" role="doc-footnote"><p class="footpara">
Indymedia self-history, 2017-04-28, <a href="https://www.indymedia.org.uk/en/2017/04/525966.html">https://www.indymedia.org.uk/en/2017/04/525966.html</a>
</p></div></div>
<div class="footdef"><sup><a id="fn.5" class="footnum" href="#fnr.5" role="doc-backlink">5</a></sup> <div class="footpara" role="doc-footnote"><p class="footpara">
Occupy Movement: Personal Reflections, Standing Stone, 2012-03-25, <a href="https://www.headheritage.co.uk/uknow/features/the-occupy-movement-personal-reflections-origins-actions-future-intentions">https://www.headheritage.co.uk/uknow/features/the-occupy-movement-personal-reflections-origins-actions-future-intentions</a>
</p></div></div>
<div class="footdef"><sup><a id="fn.6" class="footnum" href="#fnr.6" role="doc-backlink">6</a></sup> <div class="footpara" role="doc-footnote"><p class="footpara">
Funding proposal, Open Web Governance Body, Hamish Campbell, 2025-01-11, <a href="https://unite.openworlds.info/Open-Media-Network/openwebgovernancebody">https://unite.openworlds.info/Open-Media-Network/openwebgovernancebody</a>
</p></div></div>
<div class="footdef"><sup><a id="fn.7" class="footnum" href="#fnr.7" role="doc-backlink">7</a></sup> <div class="footpara" role="doc-footnote"><p class="footpara">
The #OGB: A Native Path for Open Governance, Hamish Campbell, 2025-08-05, <a href="https://hamishcampbell.com/the-ogb-a-native-path-for-open-governance">https://hamishcampbell.com/the-ogb-a-native-path-for-open-governance</a>
</p></div></div>
</div>
</div></div>
<div id="postamble" class="status">
<p class="validation"><a href="https://validator.w3.org/check?uri=referer">Validate</a></p>
</div>
</body>
</html>

452
bootstrap-stage-0.txt Normal file
View file

@ -0,0 +1,452 @@
━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
MYCELIUM TOTALLY UN-DISCOVERABLE DEVELOPER
NETWORK: BOOTSTRAP STAGE ZERO
Khleedril, August 2025
━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
Table of Contents
─────────────────
1. Abstract
.. 1. Audience
.. 2. Distribution
.. 3. Provenance
2. Introduction
.. 1. The Catch-22s of Open Web Governance
.. 2. Safety
3. Bootstrap Stage Zero Technical Specifications
.. 1. Communication Protocol
.. 2. Assessment Procedure/Protocol
4. Deployment
.. 1. Use
1 Abstract
══════════
With the ultimate aim to provide provenance to people to allow them to
participate in online project governance structures, we describe a
network of /Pretty Good Privacy/ (PGP) public keys, but unlike the
original intention for the keys to be discoverable, we create a
network which is absolutely _not discoverable_ and provides a more
dynamic set of trust measures. The network is made up of people each
with a few friends (people known to be actual people and trustworthy),
and the only action one can perform on the network is to ask friends
for an opinion of the trust of a /person/ in a /context/, both being
known in advance by out-of-band means. Thus honest participants
should feel safe being a part of the network, only being reachable by
trusted friends.
1.1 Audience
────────────
This document is aimed at software developers who manage an Internet
web server, and are comfortable with HTTPS, JSON, and PGP.
1.2 Distribution
────────────────
Wide dissemination of this document is strongly encouraged, but
modifications are *not* permitted. The document should be referred to
by the title and date shown above. Legally the work should be
considered to be copyrighted by the author with terms according to the
Creative Commons (CC) BY-ND[1] license. The document is being
discussed on /Mastodon/ under the hash-tag `#myceliumboot0'.
1.3 Provenance
──────────────
The source text for this document and the referenced source code
exists as commits in a GIT repositiory — at this moment in time
residing at <https://khleedril.org/forge/mycelium/mycelium> — signed
by /khleedril@a.b/, PGP fingerprint
`E23C21ED864FF4F3A7114CDFCA471FD501618A49', the same key that I’m
using in the Mycelium network; it will hopefully develop reputation as
the network evolves!
If you have access to the /Guix/ command, you can run
┌────
│ guix git authenticate \
│ d92072679363b63576862ca206add26f8039114c \
│ E23C21ED864FF4F3A7114CDFCA471FD501618A49
└────
to assert the authenticity of the entire repository after you have
cloned it to your own machine.[2][3]
2 Introduction
══════════════
2.1 The Catch-22s of Open Web Governance
────────────────────────────────────────
We look back over the work of Indymedia[4], Occupy Movement[5], and
Hamish Campbell’s ideas on an open web governance body[6][7], and
realize that there are two imminent problems: the choice of first use
case, and the ramp-up process to arrive at something which works. We
believe the first application of governance is the managed development
of the governance project itself. This gives us an immediate
Catch-22: we want to develop code to enable fully federated
governance; we want the code development to be governed by the fully
federated governance: we need to bootstrap the process of assembling a
governance of developers to develop the governance infrastructure. So
we lay out here the smallest first step (which we christen /Stage
Zero/) to get this process started, or bootstrapped.
The extant projects are trying to single-handedly get funding. This
points to another Catch-22, wherein a movement of sorts needs to be
established so that funding can be justified, yet real (i.e.,
full-time) progress may be stilted without some funding.
As to a final Catch-22: it is acknowledged that governance is a messy
business unsuited to inflexible algorithms. But on-line governance
needs to be managed by a network of computers, and computers run on
algorithms. Thus here we endeavour to make the smallest possible
working algorithm we can imagine, and leave it to further effort to
put actual governance structures in place, using the Mycelium network
as the unassuming root of trust in the system.
2.2 Safety
──────────
There is no central register of keys, and no way to traverse the
Mycelium network to discover them. The best any member of the network
can do is ask other members they know about to provide an assessment
of trust in some known key — person — in some known context. The
assessor end-points which people provide SHOULD be at some very
obscure uniform resource indicator (URI) which will be hidden from
prying eyes by transport layer security (TLS). The only people who
will know your assessor URI are the friends you tell about it. If you
don’t trust them not to denial-of-service (DOS) attack you, they are
not your friends!
There is, in fact, no centre-point at all. The project does not have
an Internet domain name, a web server of its own, or an official GIT
repository. I might be special just at this moment in time in that
I’m the first to have a Mycelium assessor end-point, and a GIT
repository with the code (and this document) in, but that’s as far as
it goes.
3 Bootstrap Stage Zero Technical Specifications
═══════════════════════════════════════════════
At a minimum, a governance system needs people and contexts in which
they are deemed to have some privilege to take actions, such as
proposing changes, voting on proposals, committing to official
repositories, or changing the rules of an organization. People need
to be uniquely and unambiguously identified, both on line and in
person. The simplest way to achieve this is to use the fingerprint of
a public PGP key as an identifier, and the user can assert their
authenticity by exercising the private part of the key. These keys
are *not* considered associated with any e-mail addresses, and are not
expected to sit in any registries or public key-rings.
A secondary benefit of using PGP keys is that they might also have
been used in signing GIT commits, and so the authenticity of a person
could be reinforced that way.
As regards contexts, we simply need guaranteed unique identifiers for
these, and choose to use Universally Unique Identifiers (UUIDs).
The Mycelium network itself need have no knowledge of the meaning of
contexts, or of any proper nouns attributed to the people. Both are
regarded as completely abstract objects (although it is mandated that
people are actual living people).
So all developers on the network need a PGP key pair, and the ability
to use them. For any context, identified by a UUID, users need to
give /measures/ to keys for that context. Measures could be trust,
reliability, provenenance, historical commitment, &c. Contexts can be
created at will.
Thus developers need to provide a service to the Mycelium network
wherein they provide their assessment of measure of a key in a context
to someone they know and trust. This assessment should be based
either on their own judgement, or on accessing their own sub-networks
of trusted contacts. Therefore the basic unit of ‘entity’ on the
network is a key-assessor pair, where the assessor is a HTTPS URI
end-point providing a simple Javascript object notation (JSON)-based
application programming interface (API).
3.1 Communication Protocol
──────────────────────────
The request should be the JSON object
┌────
│ { “request-id”: “<UUID: string>”,
│ “request-depth”: <positive integer>,
│ “key”: “<GPG fingerprint: string>”,
│ “context”: “<UUID: string>” }
└────
presented as UTF-8 text in the body of a HTTPS POST request, asking
for an assessment of the trust of the given key in the given context.
The /key/ and the /context/ are the important parts, obviously, and
then the /request-id/ should be a new UUID created by the original
requestor and passed along to others in the chain; if a node sees a
UUID twice in a short space of time it means there is a loop in the
friend network (not uncommon), and so the response in this case should
be a /no-basis/ one, i.e. there is no basis on which to make a
judgement of measure.
The /request-depth/ is set to some value by the initial requestor and
decremented by one whenever the request is passed from one friend to
another; if zero is reached a no-basis response should also be assumed
(as a safety measure, nodes should ensure that the depth is not
unreasonably large so as to flood the network). This will guarantee
termination of the process and not flood the entire Mycelium network.
If the theory holds that everyone on Earth is related by up to seven
degrees of freedom, then setting the parameter to seven would seem to
make the system conclusive. However, this will flood the network and
take a long time to return, so for practical purposes the parameter
should probably be no more than three or four. In practice it would
be expected that people will associate in rings (e.g. all members of a
project), so a low fan-out should suffice. This may need tuning in
light of experience with the protocol, and adjusting as the network
matures.
The HTTP response body would be either
┌────
│ “no-basis”
└────
in the case that the service has no basis for making an assessment of
a level of trust, or
┌────
│ {“trust”: <integer 0-100>}
└────
presented as UTF-8.
The trust levels — ‘trust’ being some measure of trust, belief,
provenance, reliability, &c., depending on context — between 0 and 100
are to be understood thus. A value of 50 means there is no opinion on
a person’s trust, less than 50 means that the person is actively
untrusted, and above 50 means that they are trusted to some extent;
between 50 and 75 means that a person is trusted with some
reservation, whereas a value above 75 means they are more trusted than
not. In many cases actions by people should only be considered valid
if their trust level in the context of the action is above 75.
Of course these are executive decisions being made unaccountably for
the purpose of bootstrapping the project; it should be regarded as a
minimal seed for the bootstrap process, and not impervious to changes
in future made by a governance structure in the context of the
Mycelium project, which has been given the ID
`7a484ea4-82c6-4bf2-a4d9-c31001079f69'.
3.2 Assessment Procedure/Protocol
─────────────────────────────────
While the communication protocol above is absolutely rigid, and
services which do not conform simply will not work, the assessment
procedure used by an individual is much less enforced, or even
enforceable. Remember that the only people you will deal with are
people you innately trust.
If the `request-id' has been seen recently (in the last 60 seconds),
or if the `request-depth' is zero, then an assessor should return
`”no-basis”'.
The assessor might directly have an opinion of a key in a context, in
which case it would be fair for them to simply return that.
If however they don’t have a measure of this key in this context, they
ask all of their friends, or a random subset if they have many.
First, check their /person/ context and ignore them if the measure is
less than 75 (why are they on your friends list if you don’t really
believe they are people?) Then check that their assessor rating,
taken to be a weight, is at least positive. Then send a request
asking for their assessment, decrementing the depth number by one. If
they return `“no-basis”', ignore this. Anything else, we update our
trust, starting from 50, with an updater which effectively takes the
mean of all trust assessments we receive from our friends, weighted
relatively by their /assessor/ context measures (context ID
`b5cd757f-54fa-4ec3-a1e3-bd5544533c1b') whose value we MUST have
locally.
Sample implementation code is enclosed with this document, written in
Rust, with the code — not this document — to be understood as
definitive; the protocol itself is considered language agnostic. It
is kept as simple as possible. You might question the wisdom of
hard-wiring friend data, including keys, into the code, and so you
should. Remember that this is the zero-stage bootstrap and we are
taking baby steps, so we are taking some slightly desperate measures
to keep all things simple, and, importantly, introspectible; we don’t
want anybody to feel compelled to do anything they are not comfortable
with. It is very likely that in the near future this will change to a
local database which is updated dynamically, so that some measures,
such as reliability estimates, can be automatically updated over time,
as well as through a web interface so that non-technical people can
join in with more worldly projects than dry protocol development. But
we need to get experience with the simple set-up first, and get the
tuning right early on.
Note that the communication protocol imposes very little on the
assessment methodology. Individual users might come up with their own
scheme, which might include caching of historically seen values,
turning a node into an aggregator. At this time, such behaviours are
discouraged. It should be further noted that most assessments will be
weighted averages of those obtained through all friends, and so
outliers (disgruntled friends!) and generally bad behaviour in the
network, including gaming of the system, should be suppressed, and
such things as aggregation behaviour become unworthwhile.
4 Deployment
════════════
It is assumed you manage an Internet server, have a web front-end like
/Nginx/ or /Apache/ which deals with TLS and its certificates (e.g.,
/LetsEncrypt/), and can reverse-proxy to a back-end server. We
provide the minimal code needed to realize that back-end, which does
not concern itself with the security of your machine. You must edit
this code before deployment, as your network data are hard-wired in
it. You should map a relatively random URI to this service so that it
cannot be easily guessed. Remember, only your trusted friends are
supposed to be using it!
The only other requirement of the deployment machine is that the
edited Rust code can be compiled and then the resulting executable can
be deployed.
4.1 Use
───────
4.1.1 Get Started
╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌
Set up the service on a machine you own on the Internet, and connect
with some friends (exchange public keys, verify control of private
keys, and obtain assessor end-point URIs). Modify the service you are
running to include your friends’ data by editing the source code.
4.1.2 Utilize the Network
╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌
If you want to use the network, a curl command would do the trick:
┌────
│ curl -d ‘{“request-depth”: 3, \
│ “request-id”: “<new uuid>”, \
│ “key”: “<a person’s key fingerprint>”, \
│ “context”: “<a context UUID>”}’ \
│ <assessor-uri>
└────
which, in the early stages of uptake of this scheme, is most likely
going to return `”no-basis”', but hopefully the situation will improve
very quickly in time, especially in the context of on-going projects
which you are a part of. Like the Mycelium project itself
(`7a484ea4-82c6-4bf2-a4d9-c31001079f69').
Note that you are using one of your friend’s assessor end-points here
(you don’t know of any others); you don’t want to annoy them by making
a torrent of requests of this kind, do you? You likely won’t stay
friends for very long if you do, and then you’ll lose your footing in
the Mycelium network.
4.1.3 Join the Mycelium Project as a Developer
╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌
Take the initiative. Write a proposal, or proposed modification to
some source code, put it out on the Internet somehow. Generate a
UUID; this is the context for the proposal. Maybe give some people
you want to engage with some trust against this UUID, by modifying
your server.
Also generate a ‘proposal-vote’ UUID; any other person can give you a
rating against this context, effectively voting for or against the
proposal. Final votes might be weighted according to the voter’s
rating against the proposal context itself.
Advertise the proposal and its UUIDs. Gain a reputation on the
Mycelium network (people will hopefully give you measure above 50 in
the context of the vote UUID). Maybe use Mastodon with one or more of
the hash-tags #mycelium, #myceliumboot0, #mycelium<my-proposal>.
Maybe send me a private message somehow to let me know of the
proposal. One way or another, you are now part of the project;
whether your proposal or your reputation with the project gets any
traction is another matter: it is up to you to promote your idea and
for the network to respond. If I find out about your proposal and
care to get the network’s measure of you against the proposal’s vote
context and this comes in greater than 75, I’ll likely engage with you
about it.
4.1.4 Vote within the Mycelium Project
╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌
As of this writing, the ‘project’ does not exist; there is no
organization nor rules of governance. The only thing in place is the
emerging zero-bootstrapped Mycelium network. Thus the first decisions
are likely to be decided by vote: to express your preference add a
‘person’ to your service, and give them your weighting under the
context of the vote.
You will want to make sure that you have some connection to the
project, and that the project knows you want to have an input. The
project will presumably (through social media; hint: watch the
#mycelium hash-tag) announce a decision needs to be made (choice of
proposals which have been put forward?) and a UUID will be announced
as the context for that decision.
4.1.5 Connect to Me
╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌
I don’t encourage this, but if you want to connect with me…
Somehow send me a secure private message, convincing me that I know
you as a person (did we meet in a video call somewhere?) and that what
you do matters to me. Probably your PGP key should be well used as
the committer to the GIT repository of some worthwhile project. Then
I’ll consider linking to you as a friend, and maybe let you know my
assessor URI.
Footnotes
─────────
[1] Creative Commons license with author attribution and no
derivatives. <https://creativecommons.org/licenses/by-nd/4.0/>
[2] Introduction to Guix GIT authentication
<https://openworld.news/gnu-guix-authenticate-your-git-checkouts/>.
[3] The /guix git authenticate/ command
<https://guix.gnu.org/manual/devel/en/html_node/Invoking-guix-git-authenticate.html>.
[4] Indymedia self-history, 2017-04-28,
<https://www.indymedia.org.uk/en/2017/04/525966.html>
[5] Occupy Movement: Personal Reflections, Standing Stone, 2012-03-25,
<https://www.headheritage.co.uk/uknow/features/the-occupy-movement-personal-reflections-origins-actions-future-intentions>
[6] Funding proposal, Open Web Governance Body, Hamish Campbell,
2025-01-11,
<https://unite.openworlds.info/Open-Media-Network/openwebgovernancebody>
[7] The #OGB: A Native Path for Open Governance, Hamish Campbell,
2025-08-05,
<https://hamishcampbell.com/the-ogb-a-native-path-for-open-governance>

17
rust/Cargo.toml Normal file
View file

@ -0,0 +1,17 @@
[package]
name = "mycelium"
version = "1.0.0"
edition = "2024"
[dependencies]
axum = { version = "0.8.4" }
chrono = { version = "0.4.41" }
permutation_iterator = { version = "0.1.2" }
reqwest = { version = "0.12.23", features = ["json"] }
serde = { version = "1.0.219", features = ["derive"] }
serde_json = { version = "1.0.142" }
tokio = { version = "1.47.1", features = ["rt-multi-thread"] }
[[bin]]
name = "mycelium"
path = "mycelium.rs"

242
rust/mycelium.rs Normal file
View file

@ -0,0 +1,242 @@
// Copyright © 2025 Khleedril E23C21ED864FF4F3A7114CDFCA471FD501618A49
// 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/>.
#![allow(non_camel_case_types, non_snake_case)]
const WEB_PORT : u16 = 8989; // The port we listen on as a HTTP server.
const FRIENDS_QUERY_COUNT : usize = 5; // The maximum number of friends we query for
// trust assessments.
const REQUEST_MEMORY : chrono::Duration = chrono::Duration::seconds (60); // If we see the same request in this time, we DO
// NOT provide an assessment.
const DEPTH_BREAK : u8 = 4; // If we see a depth greater than this we
// truncate it to interrupt attempts to flood
// the network.
const PERSON_CONTEXT : &str = "7097bd0d-9bfa-4b5c-8594-615d1a9bfcbd"; // Well-known contexts.
const ASSESSOR_CONTEXT : &str = "b5cd757f-54fa-4ec3-a1e3-bd5544533c1b";
const MYCELIUM_CONTEXT : &str = "7a484ea4-82c6-4bf2-a4d9-c31001079f69";
/* Add any other contexts on which you make judgements here. */
static PEOPLE: LazyLock<Vec<Person>> = LazyLock::new (|| // List of people we are aware of.
vec![
/* Khleedril; you can leave, edit, or remove this as per your own judgement. */
Person { key_fingerprint : "E23C21ED864FF4F3A7114CDFCA471FD501618A49", // Key fingerprint/person ID.
assessor_uri : None, // Assessor URI; you don't have to have access to
// this to have an opinion about this key.
measures : vec! [(PERSON_CONTEXT, 100), // List of contexts and our estimation of this
// person in this context, in the range 50-100
// (unless you feel that you must make an
// actually negative opinion about this
// person).
(ASSESSOR_CONTEXT, 90),
(MYCELIUM_CONTEXT, 100)] },
/* Add as many friends as you can here (with assessor_uri, like `Some("https: //...")`). */
/* Add as many measures of other people as you can here (without assessor_uris). */
] );
/*-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
You shouldn't have to edit anything below here, but do check it over. */
use std::{sync::{LazyLock, Mutex}, collections::HashMap};
use axum::response::IntoResponse; // Trait.
#[derive(Clone, serde::Deserialize, serde::Serialize)]
#[serde(rename_all="kebab-case")]
struct Request { request_id : String,
request_depth : u8,
key : String,
context : String }
#[derive(Clone, serde::Deserialize, serde::Serialize)]
struct Response { trust: u8 }
#[derive(Clone)]
struct Person { key_fingerprint : &'static str,
assessor_uri : Option<&'static str>,
measures : Vec<(&'static str, u8)> } // Pairs of context and measure.
fn get_context_measure (person: &Person, context: &str) -> Option<u8>
{
person .measures .iter () .find (|c| c.0 == context) .map (|c| c.1)
}
fn get_our_trust (request: &Request) -> Option<u8> // If we have an immediate opinion on this key/context,
// return it.
{
PEOPLE.iter ()
.find (|f| f.key_fingerprint == request.key)
.map (|f| get_context_measure (f, &request.context))
.flatten ()
}
fn select_friends () -> Vec<(&'static Person, u8)> // Make a friends list with at most FRIENDS-QUERY-COUNT random
// items. The return is a list of people and their assessor
// weight.
{
permutation_iterator::Permutor::new (PEOPLE.len () as u64)
.map (|i| &PEOPLE [i as usize])
.filter (|f| f.assessor_uri.is_some ()) // Only consider people with assessors...
.filter (|f| get_context_measure (f, PERSON_CONTEXT)
.is_some_and (|m| m > 75 )) // ... a person rating over 75...
.filter_map (|f| // ... and assessor weight above 55 (corresponding to a p-value
// of +0.1).
match get_context_measure (f, ASSESSOR_CONTEXT)
{ Some(weight) if weight > 55 => Some ((f, weight)),
_ => None } )
.take (FRIENDS_QUERY_COUNT)
.collect ()
}
async fn get_their_trust (friend: &Person, request: Request) // /Friend/ MUST be a proper friend with an accessor.
-> Option<u8>
{
if request.key == friend.key_fingerprint { return None; } // Don't ask a friend for a self-assessment.
if let Ok (send_result)
= reqwest::Client::new ()
.post (friend.assessor_uri.unwrap ())
.json (&Request { request_depth:
DEPTH_BREAK.min (request.request_depth - 1),
.. request })
.header (reqwest::header::CONTENT_TYPE, "application/json")
.send ().await
{
if let Ok (send_result) = send_result .text() .await
{
return serde_json::from_str::<Response> (&send_result)
.map (|r| r.trust)
.ok ()
}
}
None
}
#[derive(Clone, Default)]
struct Agg_Trust { value: f64, weight: f64 }
fn agg_trust_from_measures (value: u8, weight: u8) -> Agg_Trust
{
Agg_Trust { value: (value as f64 - 50.0) / 50.0,
weight: (weight as f64 - 50.0) / 50.0 }
}
fn add (old: &Agg_Trust, new: Agg_Trust) -> Agg_Trust
{
Agg_Trust { value: old.value + new.value * new.weight,
weight: old.weight + new.weight }
}
fn get_measure (T: &Agg_Trust) -> Option<u8>
{ // Note that 0.05 is greater than zero and less than 0.1, hence will do as
// a differentiator between having some weight and having none at all.
if T.weight > 0.05 { Some ((50.0 + 50.0 * T.value / T.weight) as u8) }
else { None }
}
static REQUEST_ID_MEMORY: LazyLock<Mutex<HashMap<String, // List of request-id/time pairs, so we know if we
chrono::NaiveDateTime>>> // have seen this request recently (our friend
= LazyLock::new (|| Mutex::new (HashMap::new ())); // network has looped back to us).
fn clean_request_id_memory ()
{
let cut = chrono::offset::Utc::now () .naive_utc ()
- REQUEST_MEMORY;
REQUEST_ID_MEMORY .lock().unwrap () .retain (|_,t| *t >= cut);
}
async fn get_trust (request: &Request) -> Option<u8> // Try to return a trust value.
{
if REQUEST_ID_MEMORY .lock().unwrap()
.insert (request.request_id.to_owned (),
chrono::offset::Utc::now ().naive_utc ()) // Add the request-id to the recent memory.
.is_some ()
{ return None } // We have seen this request-id already.
if let Some (T) = get_our_trust (&request) { return Some (T) } // We have an immediate opinion on this
// user/context.
if request.request_depth <= 1 { return None; } // If the depth is one or less, we cannot ask our
// friends.
let mut T = Agg_Trust::default ();
for f in &select_friends () // Loop over a random subset of our friends. /f/
// is (friend, weight).
{
if let Some(t) = get_their_trust (f.0, request.clone ()) .await
{
T = add (&T, agg_trust_from_measures (t, f.1))
}
}
get_measure (&T) // Return the final weighted average.
}
async fn process_request (body: axum::body::Body)
-> axum::response::Response // We take in a generic axum::Body rather than an axum::Json so we don't have to
// worry about the Content_Type; makes everything a tiny bit less flakey when
// the service is called from a lax curl command line.
{
clean_request_id_memory (); // Take this opportunity to clear old entries out of the recent request-id
// memory.
if let Ok (body) = axum::body::to_bytes (body, 2048) .await {
if let Ok (body) = std::str::from_utf8 (&body) {
if let Ok (request) = serde_json::from_str::<Request> (body) {
if let Some (trust) = get_trust (&request).await
{
return axum::response::Json::from (Response { trust })
.into_response ()
}
} } }
axum::response::Json::from ("no-basis") .into_response ()
}
#[tokio::main]
async fn main () -> Result <(), Box<dyn std::error::Error>>
{
let server = axum::Router::new ()
.route ("/", axum::routing::post (process_request));
let listener = tokio::net::TcpListener::bind
(std::net::SocketAddr::from
((std::net::Ipv4Addr::LOCALHOST, WEB_PORT)))
.await ?;
Ok (axum::serve (listener, server) .await ?) // Run the HTTP server at localhost:8989; this does not return.
}