diff --git a/AGENTS.md b/AGENTS.md deleted file mode 100644 index 971c8964..00000000 --- a/AGENTS.md +++ /dev/null @@ -1,1386 +0,0 @@ -# Brandolini’s Reference - -> *A little learning is a dang’rous thing;* -> -> *Drink deep, or taste not the Pierian spring.* -> -> *There shallow draughts intoxicate the brain,* -> -> *And drinking largely sobers us again.* -> -> -> - Alexander Pope, 1711 -> - -This chapter serves as a helpful reference for developers, users and community members living in an Age of Bullshit Manufacture equivalent to the Cambrian Explosion. - -As we are surely only at the on-ramp of this trajectory, the chapter will continue to evolve, expand and be updated based on community feedback as events occur. - -## What The Reticulum License Is - -*To understand the legal reality relating to this section, see* [Void Grants](#void-grants). - -The [Reticulum License](./LICENSE) is the license under which RNS, the Reticulum reference implementation, has been published since **April 15, 2025**, in versioning effective from **0.9.4** and every release since. In practical terms, it covers all of “modern Reticulum”: The current wire format, the cryptographic machinery as it exists today (including the AES-256-based link encryption, ratchets, et cetera), and all protocol additions that distinguish the modern implementation from the earliest pre-1.0.0 beta formats. If an implementation speaks today’s Reticulum protocol, it is, in all relevant respects, built on Reticulum-licensed work. - -The license is a permissive license. It grants the full range of rights to use, copy, modify, merge, publish, distribute, sublicense, and sell the software, free of charge; subject to three conditions, which are reproduced here verbatim: - -> * The Software shall not be used in any kind of system which includes amongst its -> functions the ability to purposefully do harm to human beings. -> * The Software shall not be used, directly or indirectly, in the creation of an artificial -> intelligence, machine learning or language model training dataset, including but not -> limited to any use that contributes to the training or development of such a model or -> algorithm. -> * The above copyright notice and this permission notice shall be included in all copies or -> substantial portions of the Software. - -### Why This License Exists - -Reticulum was not moved to a custom license casually or quickly. It was licensed under the MIT license for the greater part of its existence, and that served well for a long time. The change came when it became clear that no existing license expressed what the project needed, and that the two most commonly proposed alternatives would either say the wrong thing or say nothing useful at all. Three factors had primary influence on the situation: - -**The harm problem** - -Reticulum is a tool that was built, deliberately and at great cost, to empower people; to make communication something you own rather than something you are temporarily granted. It has also been, at various times, exactly what certain kinds of organisations would like to use to control people. This is the duality of any powerful tool. A permissive license could not, and cannot, say anything about that; MIT is silent on the question of whether the software may be used to build systems designed to harm human beings. The Reticulum License is not silent. It does not pretend that a license can stop an individual madman; it does assert, however, plainly and in enforceable terms, that corporations and organisations integrated into the legal system cannot consume this software for harm and then claim they never knew. The line is drawn by the creators of the tool, not by an external authority, and it is drawn deliberately. This is covered in more depth in the discussion of the ethics of the tool in the *Zen of Reticulum*. - -**The appropriation problem** - -The second factor was the machine-learning appropriation of the open-source commons. By 2025 that was no longer hypothetical: The commons was already being systematically ingested by corporate training pipelines, and the code, words, and creativity of the people who built it were being converted into synthetic systems designed to replace them. The license responds to this with an explicit condition: The software shall not be used in the creation of an AI, machine-learning, or language-model training dataset, nor in any use that contributes to the training or development of such a model or algorithm. - -It is important to understand what this condition does and does not do, which matters for what follows in this chapter. **The AI-training condition is not the legal basis for protecting the code from machine copying**. That protection *already exists*, in the oldest and most well-tested form of copyright law, and it applies regardless of any license (see [Copyright & The Two Legal Layers](#brandolinis-copyright-and-layers)). - -The AI-training condition addresses something *additional*: the appropriation of the code *into the models themselves*; the ingestion of human-made work as raw material for a synthetic replacement, and the use of that ingestion to fabricate “prior work” minefields, patent-troll material, and a wall of slop meant to bury and devalue the actual ecosystem. That danger was foreseeable; the licensing decision was made with full awareness of it. The events of 2026 have since demonstrated, in public and in detail, that the concern was not theoretical. - -**The sustainability problem** - -Reticulum has been developed and maintained for over a decade by a single person, supported by a small group of contributors and network-building users, without corporate backing, without VC funding, through several serious attempts at commercialization and takeover from both the corporate and the ideological side. The license is part of what makes that sustainable, and possible at all. - -It ensures that the specific, painstaking labor of the reference implementation cannot be hijacked to undermine the intent of the project, while leaving the protocol itself, the mathematical rules of how Reticulum works, dedicated to the public domain, where it belongs to humanity and can never be owned. Anyone can implement the protocol, provided they themselves invest the *actual* work and effort. What the license protects is the work, and the intent embodied in it. - -### On Freedom - -The most persistent mischaracterisation of the Reticulum License is that it is “more restrictive” than the licenses it replaced or than the GPL family. This is backwards, and I’ll state the comparison plainly, because the confusion is the foundation of a great deal of deliberately manufactured controversy examined later in this chapter. - -The GPL and AGPL are constructed around a single, self-referential axiom: that “free” is *defined by the terms of the license itself*, and that any use falling outside those terms is not free. In practice, this means the GPL restricts the freedom of **everyone** - you may not write, distribute, link, or (in some cases) even communicate with GPL-covered software without the entire arrangement being pulled under the same terms, which the licensor then controls. The restriction applies to 100% of users, including the ones building purely constructive things. - -The Reticulum License restricts the freedom of almost nobody. Its restrictions apply only to: - -* Those who wish to use the software in systems that purposefully harm human beings, and -* Those who wish to ingest the software into AI training pipelines. - -That is a restriction on a vanishingly small fraction of would-be users - the 0.0000001% - and it is a restriction they can characterise however they like, forever. The bickering is itself a signal that the licensing decision hit exactly the right target. - -Everyone else retains the full breadth of use, modification, distribution, and sale, with none of the viral encumbrance of copyleft. - -Both licenses contain moral axioms. The difference is that the Reticulum License states its axioms out loud: - -* *Intentionally restricting the way that millions of people use and build upon a foundational - communications technology* - **The mechanism of copyleft** -* *Intentionally restricting a small number of organisations from using the technology to - violently harm human beings* - **The mechanism of the Reticulum License** - -Which of these is more free? The answer is not a matter of committee approval. It is a matter of what the word “free” means to the people *whose freedom is at stake*. The question of whether “open source” requires the blessing of a particular licensing orthodoxy is examined in [Open Source Means Open Source](#brandolinis-opensource). - -### The Prediction, And What Happened - -When the license change was made and publicly discussed in 2025, the following was said, in public, about the machine-learning threat: - -> A generative system could be trained on the Reticulum codebase, and for extremely low cost -> be set to work spewing out millions of source repositories for all kinds of ridiculous -> “Reticulum-based programs”. This is already happening. You can find several examples of this -> on GitHub already. … the point of this kind of trolling is to establish as wide a base for -> “prior work” as possible. By doing that, a patent troll or IP abuser can create an immense -> minefield for real developers. - -This was written when the phenomenon was just beginning. It was not a guess; it was a description of a mechanism already in motion, in the specific context of Reticulum, by people who had already begun to appear around the project. - -Less than a year and a half later, the prediction has now been demonstrated, in public, exhaustively and to the letter. There are now roughly a dozen machine-generated “Reticulum implementations” of the same shape: fluent, marketing-heavy, some without attribution, and - in several cases - actively harmful to the network. The [Prns case](#brandolinis-prns) is an example documented in this chapter. The pattern that produced it (and the people, mechanisms, and the recycling of falsehoods behind the *wider* phenomenon) is examined in [A Movement Of A Dozen](#brandolinis-movement-of-a-dozen). - -The license was written, in part, so that when this happened, the community would not be defenceless. - -### What This Means For Other Implementations - -Two simple things must be kept separate: - -1. **The protocol is public domain.** The mathematical rules of Reticulum - addresses, - signatures, routing, the wire format as an idea - belong to humanity. A *genuine* clean-room - implementation of the protocol, written by human beings who reasoned it out themselves, is - free and welcome, and owes nothing to the Reticulum License. Nothing in this chapter is an - argument against implementing the protocol. On the contrary: More good implementations, - honestly made, are good for the network. -2. **The implementation is licensed.** Copying the reference implementation - by machine or - by silk-screen press - and modifying and redistributing the result, is - exercising rights granted by the license, and is therefore subject to its conditions: The attribution - notice, the harm condition, the AI-training condition. A copy that does not follow those - conditions is **not** licensed, and it is not “open source in spirit”; it is an unauthorized - derivative work, and therefore a copyright violation. - -The distinction is the same one the license itself makes, and it must be held firmly: An implementation that *speaks* Reticulum is exercising the public domain protocol, **if** it was truly created independently. An implementation that was *generated from* RNS, reproduced by a copy process, is a derivative of licensed work. - -### Copyright & The Two Legal Layers - -The exact legal structure is frequently muddied in public discussion; and in several cases deliberately. - -**Layer A - Copyright (license-independent)** - -Copyright does not depend on any license. A primarily machine-generated copy of a copyrighted work - a copy not accompanied by demonstrable, substantial, new human creative input - is a derivative work over which the copier holds no copyright whatsoever, and the reproduction of which, without the original author’s permission, is an infringement of the original author’s copyright. This is standard, well-tested law, and it applies with equal force under the MIT license, the GPL, or any other license, because it is not about the license at all; it is about who created what. A process that copies the reference implementation into a machine, produces a transformed derivative, and then claims “Copyright, [name of the process operator]” - with no human able to account for the creative decisions in the result - **is not** asserting a valid copyright over the result. They are openly asserting the absence of one, and reproducing someone else’s work without authorisation. This is probably the cleanest cut copyright violation one could imagine. - -**Layer B - License Conditions (Reticulum License specific)** - -Where a copy *is* a licensed derivative, the conditions of the Reticulum License apply: The copyright notice and permission notice must be included in all copies and substantial portions; the harm condition must be honoured; the AI-training condition must be honoured. A derivative that follows none of these is unlicensed *a second way over*. - -The two layers are often intentionally confused in public discussion - the AI-training condition is waved around as if the entire question of machine copying rested on it, when in fact machine copying of copyrighted work is a copyright violation that would exist even under the most permissive license ever written. The purpose of keeping the layers separate is not rhetorical flourish; it is that Layer A is old, settled law, and does not rely on any novel legal theory, while Layer B is specific to this license. Both matter. Neither is a substitute for the other. - -Layer B is the required mechanism for closing the loophole where the work is *first* ingested during model training into the weights of a model itself, which would make any resulting violations almost impossible to detect and enforce. - -### The “Clean-Room” Delusion - -I regularly receive mail or LXMF messages from people who proudly and happily proclaim that they have created a “clean-room” implementation of one of the software systems I maintain; RNS, Sideband, LXMF or others. The declaration is delivered with the flat certainty of someone who believes they have found the legal lock-pick that settles everything at once: Their production is independent, uncontaminated, and therefore free of any obligation to the work they copied, its license, or its author. The proclamation usually concludes with a request for blessing, or at least acknowledgment. The proclamation is, usually, also generated by an LLM. - -This is a delusion, and I’ll cut through it surgically. The word they here invoke as magic is attempting to do a great deal of work it was never able to bear. - -**What a clean room actually was** - -The legal “clean room” is not folklore, incantation, witchcraft or a claim a person gets to make about their own output. It is a very specific, institutionalized procedure that grew out of the hardware and software litigations of the 1980s, and it existed for exactly one purpose: **Convincingly proving the absence of copying in a court of law**. - -The canonical case was Phoenix Technologies and its 1984 reimplementation of the IBM PC BIOS. IBM’s BIOS was copyrighted, which meant that the entire PC-compatible industry depended on being able to show that a compatible BIOS had been written independently, and not from IBM’s code. Phoenix’s answer was a physical and procedural firewall: - -* One team, the “dirty room”, read the original code and produced written *functional specifications*: descriptions of what the BIOS did, not how IBM’s code did it. -* A second team, the “clean room”, consisted of engineers who had *never seen the original code at all*, and they wrote the new BIOS from those specifications alone. - -This obsessively documented, legally attested separation was not a preference or a willy-nilly show for a kindergarten; it was the entire legal point, and it had to be *solid*. If even one clean-room engineer had *glanced* at IBM’s code, the clone would have been contaminated, and the defense would shatter. - -The other landmark case was *Computer Associates v. Altai* (1992), in which Altai had copied CA’s scheduler code into its own product, and (upon being caught) hired outside counsel to run a genuine clean-room procedure: A programmer with no exposure to the original was brought in to rewrite the infringing modules from functional specifications prepared by the team that had seen the code. The court credited the good-faith effort precisely because it was done, as the carefully documented record showed, to the letter of the procedure. - -Bear in mind what this procedure entailed in practice, because this is the part the modern claimants never seem to have even *heard* of: Physical separation of teams, legal counsel managing the process, signed and notarised declarations of non-exposure, controlled specification documents that described *behaviour* and never *code*, months of work, and testing against the specification - not against the original, which the implementers were forbidden to consult. - -The people on the clean-room side of the wall did not just *claim* they had not read the code. Their non-exposure was institutionally guaranteed, obsessively documented, and legally attestable through every fart and sneeze of the process, because the entire point was that a court - hostile, adversarial, and entitled to discovery - would believe it. - -*That* is the process. “Clean-room implementation” is the name of a *certified procedure for proving independent authorship*. It is not a mood, a marketing label, or a property a person gets to declare about their own work. - -**The moronic inversion** - -Now consider what is actually being described when someone says: *“I created a clean-room implementation of Reticulum by feeding the source code into a machine.”* - -That sentence is the opposite of a clean room. Feeding a copyrighted work into a machine so that it reproduces and transforms the work is **the definition of copying**, and a clean room is the one procedure whose entire purpose is the demonstrated *absence* of copying. This process cannot demonstrate the absence of copying, because the process is *composed of* copying. The cleanest possible room has been replaced by the dirtiest possible room, and the dirt has been installed as the base feature. What these claimants have actually performed is a photocopy with extra steps, and the extra steps, far from cleaning anything, are simply steps that forge a certificate they believe the output has earned. - -**Why the word is deployed** - -The word “clean-room” is deployed because it sounds like what the speaker wishes were true. It carries the accumulated legal prestige of the 1980s and 1990s - the BIOS clones, the Altai credit - and it sounds like a certificate already issued: *Independent, original, unencumbered*, the work of a person who owes nothing. The claimants want that halo without the procedure: No law firm, no physical separation, no written specifications, no signed declarations, no months of process - just a laptop, a loop, and the word “clean-room” typed into a README. The word must do the work of the process it replaces, and the delusional replacement is the entire point. - -**The irony runs deep** - -The Reticulum protocol is public domain. Any human being can implement it - from the mathematics, from the documentation, from their own reasoning - and owe nothing whatsoever to the license, to the reference implementation, or to me. - -An honestly written implementation needs no incantations, no legal theater, and no special vocabulary; it simply *is* what it claims. It’s plain for everyone to see. **It’s also plain for everyone to see when you’re faking it**. The people who reach for the word “clean-room” are, without exception, the people who need it to create a fantasy - and the people who need that are precisely the people who cannot have it. If what you wrote were genuinely independent work on the public-domain protocol, you would not need to call it anything. The word is not a seal of independence. In this context it is a confession of copying, filed by the copier, in the confident belief that it says the opposite. - -## Open Source Means Open Source - -An objection regarding the “open source status” of RNS appears occasionally in variations, but always reduces to the same syllogism: - -1. “Open source” means *licensed under one of the licenses approved by the Open Source - Initiative (or, in other variants, compatible with GPL orthodoxy)*. -2. The Reticulum License is not on that list. -3. Therefore Reticulum is not open source, and anything built on it is illegitimate. - -The entire argument rests on the first premise, and the first premise is false. - -Open source is not a certification conferred by a committee. It is a description of a fact: The source code is available, and the rights to use, copy, modify, merge, publish, distribute, sublicense, and sell it are granted to everyone, free of charge. - -The Reticulum License does all of those things. It is, in every substantive respect that concerns the person who wants to use, study, modify, or build upon the software, **an open license**. What it adds - and what disqualifies it in the eyes of the orthodoxy - is two conditions on *who may do what with the original work*, not on what the *user* is allowed to do with it. - -The definition being wielded against Reticulum is not even a young one. It is, in essence, the Debian Free Software Guidelines written in 1997, adopted by the OSI in 1998, and treated ever since by certain people as if it had descended from a mountain on tablets. It is an approach that is close to three decades old. Being old is not itself a flaw - but being old is also not a proof of correctness, and the suggestion that the meaning of a word like “open” was settled for all time by a committee in the 1990s, and may never be revisited, is not a position rooted in reason. It is rooted in institutional inertia dressed as principle, maintained by those whose ideologies it serves. - -### What The Argument Is Actually Doing - -I would like to go into some detail about the rhetorical mechanism, because it is roughly the same mechanism that powers the rest of the campaign described later in this chapter. - -The orthodoxy’s argument is self-referential: *“open source means what we say it means, because we are the ones who define it.”* When the Reticulum License is measured against that definition and found wanting, the conclusion is presented as a property of Reticulum - when in fact it is *a property of the definition*. The definition is treated as neutral and authoritative - as some base fact of raw cosmology - and the license is treated as deviant. But the definition is no more neutral than the license is. It encodes a moral position, and that moral position is exactly the one that this project declines to take. - -Consider what the orthodoxy’s definition requires, in the case at hand. The OSI-based definition contains, in its ancestry, the Debian Free Software Guideline of “No discrimination against fields of endeavor”: The software must not restrict who may use it or for what purpose. Taken to its logical end, this means that open source, properly “certified”, must be equally available to those who build hospitals and those who build weapons, those who connect people and those who control them, those who create and those who ingest and replace. - -The orthodoxy presents this as neutrality. It is not neutrality; it is a moral position - one that says, in effect, that *harming human beings is a field of endeavor like any other, and software must not discriminate against it*. - -The Reticulum License takes a different position, and it has the honesty to state it in the license text: this software is for life, not for death; it is for people, not for the systems that would replace them. That is not a restriction on openness, nor on freedom. It is a restriction on *who may consume the work*, and it is a restriction the orthodoxy’s definition cannot express - which is why the orthodoxy must always attack the license as “not open source” rather than engage with what it actually does. - -### Who Is Restricted By Which License? - -The arithmetic is simple, so let’s do it out loud, because the orthodoxy’s framing inverts it every time. - -The GPL family imposes its conditions on **everyone**: You may not distribute, link, or - in the AGPL case - even *communicate with* GPL-covered software without your own work being pulled under the same terms. “Free” in this system is defined (self-referentially) *by the license’s own terms*; everything outside those terms is, by definition, unfree. The restriction applies to 100% of users. It applies to the hospital, the mesh community, the school, and the hobbyist with the same force it applies to anyone else. That is not freedom for everyone; it is a *specific moral architecture applied to everyone*, presented *as if it were the absence of one*. - -The Reticulum License imposes its conditions on a fraction of would-be users so small as to be practically unmeasurable: - -* Those whose intended use is to build systems that purposefully harm human beings, and -* Those whose intended use is to ingest the work into AI training pipelines. - -That is the entire list. Everyone else - the overwhelming majority, the community, the developers, the users, the downstream projects - receives the full, unrestricted rights to use, copy, modify, merge, publish, distribute, sublicense, and sell the software, with none of the viral encumbrance of copyleft. - -So when the claim is made that the Reticulum License “is more restrictive” than the GPL, the claim is not merely wrong; it is the exact inverse of the truth. The GPL restricts the freedom of everyone, in the name of a specific ideology. - -The Reticulum License restricts the freedom of the harm-doer and the appropriator, and leaves everyone else free. The two approaches do not differ in whether they contain moral axioms - **all licenses do**. They differ in whether the axioms are stated openly, and in *whose* freedom they restrict. - -### The Consequences Of The “Not Open Source” Claim - -This would be a footnote debate if the mischaracterisation had no practical consequences. It has very large ones, and therefore this section exists. - -The claim that “Reticulum is not open source” is the foundation of the takeover narrative it so often accompanies. The sequence is always the same: - -* First, declare the reference implementation illegitimate (“not really open source”, “owned by one man”, “not a real community project”) -* Second, conclude that it is therefore acceptable - even necessary - to replace it. -* Third, present the replacement, which is (conveniently) often the speaker’s own machine-generated clone, as the legitimate heir. - -This is not speculation about motives; it is the documented structure of the campaign examined in [A Movement Of A Dozen](#brandolinis-movement-of-a-dozen). - -The “not open source” claim is the legal-ideological battering ram of that campaign. It is recycled, in article after article, in forum after forum, because it works on people who assume that a committee’s definition is the same thing as the truth. - -It is also worth stating the other obvious fact: None of these critics have ever shown that the Reticulum License restricts *them*. They do not build weapons. They are not training models on the codebase. They are free, in every practical sense, to use Reticulum exactly as they would under MIT or GPL. Their objection is not to a restriction on themselves; it is to the *mere existence* of a license that states a moral position they disagree with, or which they can use as leverage for a different goal entirely, and to the institutional fact that it does so outside *their* system of approval and control. The complaint is not that the license makes them unfree. The complaint is that the license is *free of them*. - -### The Distribution Argument - -A recurring companion claim is that RNS is not properly “distributed”, usually deployed as “it’s not packaged as a .deb” or “it’s not on package manager X”, with the implication that it is somehow unavailable or inaccessible, or hard to install on a given system. - -This is simply false, and it has been false for years. The reference implementation is available on practically every platform and architecture with a single command (`pip install rns`). It is packaged in the Arch User Repository, in NixOS, and in a range of other distribution channels, community-maintained and official. It can be installed, updated, and kept current *over Reticulum itself* - the network transports its own software updates. It is used on more than a hundred thousand devices worldwide, is embedded in over a hundred other packages and applications, and carries terabytes of traffic every day. - -The claim that Reticulum needs a `.deb` to be “really distributed” mistakes the mechanism for the goal. The goal is that people can obtain and update the software easily, everywhere, **on their own terms**, and distribute it themselves, both offline, online and over Reticulum with full cryptographic verification of the install packages, without any central infrastructure. - -That goal is met to an excellence that few software packages can speak of, and met in a way that does not pin the project’s release cadence to the review cycles of distribution maintainers, which is an achievement, not a bug. - -A project like RNS that updates continuously, sometimes daily, and has a track-record of shipping security updates mere hours after issues are discovered, would be crippled by packaging that makes every change wait months for approval. The distribution complaint is a strawman generated for the occasion. It has been answered, in public, many times; it is repeated anyway, because the people repeating it are not counting on facts - they are counting on the reader never having heard the answer. - -### On The Institutions, In Fairness - -None of the above is hostility toward the Open Source Initiative or the Free Software Foundation as institutions, nor toward the individuals who have dedicated decades of work to them. Their contribution to the world of software is **enormous**, and this document does not dispute it. What is disputed is a specific claim of authority: That “open source” is a term whose meaning is reserved to a committee’s approval, and that a license which does not submit itself to that approval is therefore not open. - -That claim of authority is not in Reticulum’s interest, and it is not in the interest of the people the movement claims to serve. The current legal and technological landscape - the machine-appropriation of the commons, the weaponisation of “prior work” generation, the erosion of human agency by synthetic systems - was not anticipated by the DFSG of 1997, and the institutions have not, as of this writing, produced *any* meaningful answer to it. The choice, as it was put at the time of the license change, is whether developers should sit back and wait for a solution from a committee that “may or may not ever materialize, before the entire foundation we stand on has been eaten away”. - -**Reticulum’s answer was to act**. If we had waited, it would have been too late. - -If an OSI-approved license existed that expressed the same constraints - and did not impose the far more severe restrictions of copyleft - the project would have used it. None such exists. That is not Reticulum’s failure. It is the measure of what the definition is missing. - -### What “Open” Means Positively - -For anyone who wants the positive statement rather than the rebuttal, Open Source, in this project’s understanding, means: - -* The source code is available, to everyone, without charge -* Everyone may use, copy, modify, merge, publish, distribute, sublicense, and sell the - software -* No one is discriminated against as a person - developer, user, community, or project -* The protocol itself is dedicated to the public domain, where no one can own it -* And the single, plainly stated condition of the license is that the work shall not be - consumed to harm human beings, or ingested to replace the humans who made it - -If that is not “open” by a definition written in the 1990s, then the definition is the thing -that has failed - not the software, and not the people who use it. - -**Open source means open source**. It was true before the committees existed to certify it, and it will remain true after they are gone. - -## Assistance Versus Machine-Substitution - -### False Dichotomy - -The public discussion around machine learning and software development has been derailed, by the loudest voices on both sides, into a farcical fight between “AI enthusiasts” and “AI haters”. - -> **Both positions are absolute caricatures.** - -> **The fight is beside the point in the ways that matters most.** - -It is not an accident, but a very conscious choice that the initial analysis of the Prns case examined herein, and this very chapter, were themself produced with the assistance of a machine-learning based generative system. - -Specifically, it was generated using `lc` managing a `Q8_K_XL` quant of `DeepSeek v4 Flash` running in the `llama.cpp` inference engine. The main context base used to stabilize, ground and inform the generative environment consisted of approximately 100,000 tokens of text material that I personally thought out and wrote (by hand), then archived and organized, over the last eight years. - -If you know my writing, and have a hard time discerning where this chapter is me directly, typing manually, and where it is the machine output, it is because of two things: Almost every line in this chapter was either directly edited by my hands on the keyboard or typed by me, and the text corpus that informed the process *is* genuinely me - my thoughts, written by me, over a period of years. - -The chapter was produced this way *deliberately and openly*, under a software framework I designed and wrote, with the human directing the inquiry points, flow of investigation, structure of the outputs, contents of every section, making the editorial decisions, reviewing the conclusions, painstakingly adjusting every line, and taking responsibility for the final claims presented, with the goal of reaching a higher level of synthesis and symbolic density than I could have achieved without that assistance. - -The tool was *used as tool*, both to structure and produce a complex chapter, and to inspect a repository so preposterous in size, commit velocity and nonsensical wording that it barred any purely human inquiry. - -As such, the position is hereby, by personal example and demonstration, stated clearly: - -* **Technological assistance is not the problem** - -* **It was never the problem** - -* **It is the opposite of the problem** - -The problems are *substitution* and *usurpation*: The perverse process in which the machine becomes the author of choices, and the human becomes the facade of software, while expecting “reciprocity” or recognition for deeds they never performed. - -### The Line - -The exact distinction can be reduced neither to how many lines of code a machine produced, nor who pressed the keys. The final distinction has to rest on **who, or what, the real agent of the work is**. - -* **Assistance** is when the human retains the full seat of agency: The human decides what to build, judges - what is correct, rejects what is wrong, understands what is shipped, and can answer for every single line of it. - The machine writes, suggests, drafts, accelerates *meaningfully* and within reason - but every choice that survives into the - final work is a choice the human made *consciously*, and understood - or grew to understand - the consequences of. - -* **Substitution** is when the machine *becomes* the agency: the machine decides what to build, - decides what is correct, iterates on its own errors, generates at a scale and speed no single - human can follow - and the human’s role is reduced to providing the name, the account, the - signature, and the marketing launch. - -> The Line can be stated as a single test, and this is the same test that has always separated authorship from couriership: **Can the person whose name is on the work answer for it fully?** Not “can they describe what it does” - can they account for why it is the way it is, line by line and decision by decision, and the history of how it came to be that way, under questioning, without machine assistance, including by people who know more than they do? - -If they cannot, they did not author the work. They wore it, or in more severe cases, they stole it. And a courier who claims authorship is not a writer; they are a fraud. - -### What assistance looks like - -Assisted work is recognisable, and recognisability is itself part of its value. It has the following observable properties: - -1. **The human can explain it.** Under examination, the author can say why this choice was - made, what was rejected, and what they verified. The ability to explain is not a luxury; - it is the very demonstration of authorship. On a large project with many contributors this is partial in - practice - no one can explain every line of a large codebase - but the *full capacity* must - exist between the authors and the *habit* must be visible. -2. **The human can, and does, reject machine output.** An author who has never rejected the machine’s output is not - an author, but an open drain. Rejection is not a stylistic flourish; it is the - mechanism by which any work attains Quality. A record of decisions, including reversals and rejections, - is a sign of agency. A record without rejection is a record of assent-by-default. -3. **The human’s judgment is directional.** The work contains the human’s actual choices; - things the machine would not have decided on its own, which the human can defend on their - merits. This directionality has many names in engineering: Design, architecture, taste, - judgment. Where it is absent, the work has the uniform, self-consistent texture of - something that was never doubted, and doubt is exactly what anything important requires. -4. **Provenance is not concealed.** Disclosure of how the work was made is not a legal - requirement in every jurisdiction; it is not even always a practical requirement. But it - is a *statement* that matters. A project that discloses its process - - including its use of machines - is telling the truth about the relationship between the - human and the work, and that is a property users *are* entitled to know. Concealment of - provenance is not a stylistic choice; it is deception, made by someone who knows what the - record would otherwise show. -5. **The human stands behind the failures.** When assisted work fails, the human can say: Yes, I - chose this, under these assumptions, here is why, here is what I got wrong, here is the fix. - That sentence is the entire contract between an author and the people who depend on their work. - A human who cannot say it - because the choices were never theirs - *has nothing to offer anyone*, and - is by definition entirely replaceable; anyone else could have pressed the same button. - -### What substitution looks like - -Substitution is equally recognisable, once the pattern is known: - -1. **Scope that no human could have authored.** Output that - structurally cannot have been the product of human authorship, review, and judgment, for - example when the volume exceeds any reasonable human capacity within the span of the project’s life. - When the review capacity and the output volume are incommensurable, the output was not - reviewed. It was generated, then forgotten, and the record was signed blindly. -2. **Uniform generation.** The work carries no trace of a human’s changing mind. No style - drift, no contested decisions, no “we tried X and it was wrong, so we did Y”. That is, *no - signs of actual development, growth and learning*. Instead, endless, self-referential - refactoring, renamed abstractions, and the same fluent register in every commit, - every document, every reply. A human’s history shows the wear of judgment. - Pure generation shows the superficial polish of its absence. -3. **Discovery by recursive regeneration.** When errors are found, they are found by the machine’s own - subsequent runs, not by human scrutiny - and the findings are recorded as planned - “reviews” and “alignments” rather than as the corrections they are. This is the tell: A - machine editing its own previous output, while the edit is recorded as if it were a - scheduled milestone. That’s not review. That’s a continuous generation loop revising itself, - with the attempt of an illusion-preserving voice-over. -4. **Laundered provenance.** Theatrical concealment machinery: Commit hooks that refuse - attribution of machine generation, contribution policies that declare machine output - “yours”, processes that scrub personal traces from the history, fake identities in the - contributor list. All of these have one function: To make the record say what the “author” - *wished* had happened, rather than what happened. A project that builds such machinery is - not making a record of its work; it is using automated software to manufacture one. -5. **Authorship by assignment.** The human’s name is on the work, but the human cannot - answer for it - because the human did not choose any of it, and knows it. The name is not a - signature of authorship; it is a *fraudulent claim of ownership* over something the claimant did not - make and cannot explain. In every field that has ever dealt with such claims - art, - literature, invention, journalism - *this has a name*. That **forgery** is now cheap in software - makes it no more forgivable. - -### Infrastructure Matters - -For a hobby project, the distinction between assistance and substitution is a personal matter. For infrastructure - code that other people’s communications, safety, and freedom run on - it is a matter of life and safety, and any statement about this must be entirely unapologetic. - -Infrastructure has one property that distinguishes it from almost all other software: While most of the people who depend on it cannot verify it themselves, **it must be verifiable, auditable and open to human inspection**, and be engineered in such a way that this is as frictionless and straight-forward as possible. - -The reference implementation of Reticulum was designed this way, and continues to make that goal a primary one. While it *is* a complex piece of software, with an intricate array of interlocking and moving parts, the core parts of RNS, the entire Reticulum protocol implementation, the transport logic, the cryptographic primitive interfaces, **is less than 15,000 lines of code**. That line count even includes the rather extensive comments, incredibly detailed logging facilities and other choices that makes the code easy to read and understand for humans, and easy to operate, verify and debug. It took real dedication, and *a lot* of hard work to achieve that. - -Exactly because not *everyone* can do this, it is a fundamental necessity for infrastructure software that it is designed and authored so that *as many as possible can*, and that the *chain of accountability* - who made it, who reviewed it, who answers for it - is held intact at every link. That chain is not decoration. It is the entire mechanism by which normal users decide to trust a system they cannot fully verify. The transparent foundations and the chain combined *is* the verification for most users. - -Substitution breaks the chain both at the foundations, and at its load-bearing link: The human at the top can no longer answer, because they were never the maker. Unfortunately, the chain does not always fail visibly; often it fails silently, at the exact moment a question goes deep, or when routing fails subtly at a critical moment. - -For the user, the result is not a project with a normal and humanly flawed author - it is a project *with no author at all*; a signature with no substance behind it, a name that cannot be held to account, and a body of work that nobody on earth can (or wants to) explain, defend, or fix in a crisis. - -### The Fluency Trap - -It is worth understanding, briefly, why substitution is so attractive and so dangerous at once. Machine-generated output is fluent. It is confident, well-structured, and terminologically *self-consistent*. At the surface, and from the perspective of someone outside a given craft, it is indistinguishable from the output of a knowledgeable human. Fluency of this kind can be a useful property: It makes assisted work fast. But fluency is *not* understanding. It is the *minimal conformal surface* of understanding. - -The danger is that the surface is exclusively where the substituter invests; for the simple reason that the surface is where most of the desired audience looks, and what yields attention to the project. - -A human who can tell the difference uses the tool well. A human who cannot is being deceived through means they cannot detect from inside, namely through their own inability to account for the limits imposed by what they do not know. - -This is why the most important quality for anyone working with systems like Reticulum is not speed, and not vocabulary, but the oldest engineering virtue there is: The honest, uncomfortable, terrorizing knowledge of **what you do not know**. The substitute *never* has it. The substitute’s operator, *if* they ever had it, loses it precisely the moment they accept the fantasy of the substitution process. - -The tool is not the hazard, plain old human nature is. The tool is a mirror, and mirrors - as has been observed for rather longer than software has existed - show the truth only to those willing and yearning to see their own shortcomings. - -### Disclosed Assistance Or Laundered Generation - -The contrast at the centre of this entire discussion can be made clearer with two examples, both of which are publicly accessible, both produced in the same year, by people using the same class of tools. - -The first is this chapter. It was produced with machine assistance, openly: the structure was directed by the human, the material was assembled with the tool’s help, every conclusion, every line, every slight nuance of meaning and semantics was examined, edited, and accepted or rejected by the human, and the process described publicly - including the precise characteristics of the technological assistance framework used. The human can answer for every claim in these documents, because the human made the decisions the claims rest on. - -The second is the project examined in [the Prns case](#brandolinis-prns). It was produced by a machine, at a volume no human could review, and the authorship record was engineered to erase the machine’s role: A commit hook that refuses attribution of machine generation, a contribution policy declaring machine output the human’s own, a fictitious contributor identity, 637,000 lines of unreviewed code. The human cannot answer for the code, because the choices were never made by a human - only the conformal surface of the presentation was. - -The same tool class. The same technology. Two diametrically opposed relationships to truth and responsibility. **The difference is not the tool**. The difference is the presence or absence of the human as the agent of the work - and the honesty or concealment with which that relationship is recorded. - -Assistance leaves the human as the agent and the commons as the source from which the human works and can grow. Substitution removes the human from the loop and converts the commons into fuel for the thing that seeks to replace them, or usurp their work for the profit of the few, human atrophying in the process. - -### The License In This Context - -The Reticulum License, examined in [What The Reticulum License Is](#brandolinis-what-the-license-is), draws the same line, at the level of the law. Its AI condition does not forbid the use of machine-learning technology to *assist* development - no reading of the license could support that, and no one associated with this project has ever claimed so. What the condition forbids is the *appropriation of the work into the machine itself*: The ingestion of the commons as raw material for synthetic replacement, and the concealed fabrication of “prior work” that would bury the real thing. - -As also noted in [Copyright & The Two Legal Layers](#brandolinis-copyright-and-layers), plain old copyright law already protects against the case where a process copies the reference implementation into a machine, produces a transformed derivative, and then claims “Copyright, [name of the process operator]”, with no human able to account for the creative decisions in the result. That is simple, petty theft, as it always has been. - -### The General Principle - -In these regards, the position of this project can be codensed to something relatively concise: - -* Machine assistance in human learning, development, and creation is accepted and useful. - It is not a shameful secret; but it *is* a tool that needs knowledge, training, understanding, - and great care to use. It should not make anything easier or more fun, it should make the - results better, more carefully considered, and arrive at *higher levels of synthesis*, not - produce endless streams of code churn. -* The line is crossed when the human stops being the agent of the work. When *any* output is - accepted that the human cannot explain, produced at a scale the human cannot review, or filed under a record - where the human has arranged to conceal the fact. -* The line is crossed, when a human claims authorship of work they cannot - answer for or has usurped. Credit follows the ability to answer. It has always worked that way, and - machines do not change the rule - they only make it cheaper and more tempting to break. -* The people who depend on infrastructure have the right to know which side of the line - the code they run was made on. That knowledge is the only verification most of - them will ever be able to perform. - -Use assistance, by all means, *and learn*, but don’t substitute. And never sign what you cannot answer for. - -Somewhere, within the general shape of the conceptual framework outlined in this section, or realistically, a more refined variant of it, I do believe there is the *potential* of the *beginning* of a constructive outcome to the immense challenge we are faced with as a species in regards to these problems. - -At the same time, I reserve my right to revert that position to Butlerian Jihad without prior notice. We are on a knife’s edge, and you know it just as well as I do. - -## Void Grants: Legal Foundations of Machine-Generated Code - -A grant of rights is only as real as the rights behind it. A license conveys what its issuer holds, and nothing more. A derivative may be distributed only under whatever license covers what it took. And over a work that a machine originated, no human holds anything at all. - -Each of these statements is a matter of settled statute and case law, and this section sets out the authorities. The conclusions they support are: - -1. A software implementation generated from a licensed work by a machine, published under its operator’s claimed copyright and license, **conveys rights the operator never possessed**. -2. **Its grant is void**. The projects, products, and promises built upon such grants stand on nothing. A field of void grants is a minefield for everyone who crosses it. - -This section is a general examination of copyright law as it applies to machine-generated code. It is not legal advice. - -### I. The Foundational Statute: Translation Is Copying - -The starting point is the statutory definition of the class of works at issue. Title 17, United States Code, section 101 provides the definition of a derivative work: - -> A “derivative work” is a work based upon one or more preexisting works, such as a *translation*, musical arrangement, dramatization, fictionalization, motion picture version, sound recording, art reproduction, abridgment, condensation, or *any other form in which a work may be recast, transformed, or adapted*. - -Section 101 further provides that *“the terms ‘including’ and ‘such as’ are illustrative and not limitative”*. As such, the list is a list of *examples*, and the very first example is translation. The definition also reaches, in its own words, *“any other form in which a work may be recast, transformed, or adapted”*. - -The exclusive right at issue is defined in section 106: - -> Subject to sections 107 through 122, the owner of copyright under this title has the exclusive rights to do and to authorize any of the following: -> (1) to reproduce the copyrighted work in copies or phonorecords; -> (2) to prepare derivative works based upon the copyrighted work; -> (3) to distribute copies or phonorecords of the copyrighted work to the public by sale or other transfer of ownership, or by rental, lease, or lending; - -Violation of any of these rights is infringement. 17 U.S.C. § 501(a). - -Taken together, the provisions yield a construction that is difficult to improve upon and impossible to escape: - -1. **A port is a translation.** A work that takes a program written in one language and from it produces a program written in another language, implementing the same behavior, is a translation of the original - whatever mechanism performed it, and however the surface presentation differs. -2. **A translation is a derivative work.** Section 101 says so, explicitly. -3. **Preparing a derivative work is the copyright owner’s exclusive right.** Section 106(2) says so explicitly. A derivative work prepared without authorization, or outside the scope of any authorization, infringes that right. - -The common objection - “the code is in a different language, so it is completely different” - is not a legal argument; it is the definition of what the statute already classifies. - -Translation *is the paradigm* of derivative authorship, not an exception to it. If translating a work without permission was a defense, the derivative-work right would be meaningless; every infringing adaptation would simply need to be “different enough” to count as a translation of its source. - -Nor does the identity of the translator change the analysis. The statute asks whether the work is “based upon” a preexisting work. It does not ask who or what performed the translation. A machine that ingests a licensed work and reproduces a translated transformation of it has performed mechanical translation; the output is a derivative of the ingested work, and the law governing derivative works applies to it exactly as it applies to a translation made by hand. - -### II. Ideas Are Free, Expressions Protected - -The second foundation is the distinction between what a work *is* - its ideas, its processes, its systems - and the *expression* in which those ideas are embodied. The distinction is codified in section 102(b): - -> In no case does copyright protection for an original work of authorship extend to any idea, procedure, process, system, method of operation, concept, principle, or discovery, regardless of the form in which it is described, explained, illustrated, or embodied in such work. - -The principle is older than the statute, and its application to software is settled. An author may own the particular code in which a method is expressed; the method itself, the process, the algorithm, belongs to no one - because *“the sine qua non of copyright is originality”* (*Feist Publications, Inc. v. Rural Telephone Service Co.*, 499 U.S. 340, 345. 1991). And ideas are not original to anyone in particular, *Baker v. Selden*, 101 U.S. 99 (1879), established the line: Copyright in a book describing a system does not prevent others from practicing the system. - -Applied to a communications protocol, the structure is clean: - ---- - -**An implementation of a public-domain protocol, honestly reasoned and written by humans, is welcome and unencumbered, and owes nothing to any license. An implementation generated from a licensed implementation is a derivative of licensed work, subject to its conditions and to the ordinary copyright of its source.** - ---- - -The public-domain status of the protocol’s ideas changes nothing about the copyright in an implementation’s expression. A person who copies an implementation - by machine or by hand - cannot defend the copying by pointing to the protocol, because the protocol covers the ideas, not the symbols in which someone expressed them. - -A further misconception can be dismissed here; the recently popularized “clean-room” claim about the absence of copying. A [clean-room](#brandolinis-cleanroom-delusion) is a not a magic label achievable by LLM, but a specific, institutionalized procedure for proving to a court that copying did not occur: Physically separated teams, written functional specifications, attestable non-exposure, and no access to the original by the implementers (*Altai*, 982 F.2d at 709–11). - - *“I created a clean-room implementation by feeding the original source code into a machine”* attempts to *claim* the certified, legally established procedure for proving the absence of copying by describing, in the same breath, a process **composed entirely of copying**. The word is deployed because the procedure it names is what the claimant would *need to have happened*. - -### III. Machine Output Has No Author - -The third foundation is the human authorship requirement. It is settled at both levels of the federal courts and in the Copyright Office’s administering practice. - -In *Thaler v. Perlmutter*, the district court held that *“copyright law protects only works of human creation,”* and that *“human authorship is a bedrock requirement of copyright”* (687 F. Supp. 3d 140, 146, D.D.C. 2023). On appeal, the United States Court of Appeals for the District of Columbia Circuit affirmed, holding that the Copyright Act *“requires all eligible works to be authored in the first instance by a human being”* (No. 23-5233, D.C. Cir. Mar. 18, 2025). - -The requirement traces to the ordinary meaning of the statutory term. In *Burrow-Giles Lithographic Co. v. Sarony*, the Supreme Court defined an “author” as *“he to whom anything owes its origin; originator; maker; one who completes a work of science or literature”* (111 U.S. 53, 57–58, 1884), and more recently described the author as *“the person who translates an idea into a fixed, tangible expression entitled to copyright protection”* (*Community for Creative Non-Violence v. Reid*, 490 U.S. 730, 737, 1989). - ---- - -**A machine does not owe expression its origin; it reproduces it. No court has recognized copyright in material created by non-humans, and the courts that have addressed the question have rejected it. If you create by machine generation, you do not own the output.** - ---- - -The Copyright Office’s registration guidance applies the requirement to generative systems in terms that are directly on point. The Office asks: - -> whether the “work” is basically one of human authorship, with the computer [or other device] merely being an assisting instrument, or whether the traditional elements of authorship in the work (literary, artistic, or musical expression or elements of selection, arrangement, etc.) were actually conceived and executed not by man but by a machine. -* *Copyright Registration Guidance: Works Containing Material Generated by Artificial Intelligence*, 88 Fed. Reg. 16190, 16192 (Mar. 16, 2023) - -And it states the consequence: *“If a work’s traditional elements of authorship were produced by a machine, the work lacks human authorship and the Office will not register it”* (*Id.*). - -On the role of prompts, the Office is equally explicit: when a system receives a prompt and produces a work in response, *“these prompts function more like instructions to a commissioned artist - they identify what the prompter wishes to have depicted, but the machine determines how those instructions are implemented in its output”* (*Id.*). - -The agency applied this standard and excluded machine-originated material from registration in the leading administrative case. In *Zarya of the Dawn* (Cancellation Decision, Feb. 21, 2023, Registration No. VAu001480196), the Office cancelled registration of images generated by the Midjourney service, holding that *“it was Midjourney-not [the author]-that originated the ‘traditional elements of authorship’ in the images”*, while preserving protection for the human-authored text and the human selection and arrangement of the work. - -The Copyright Office’s 2025 report on AI copyrightability reaches the same conclusion: - -> Based on the functioning of current generally available technology, prompts do not alone provide sufficient control. -* U.S. Copyright Office, *Copyright and Artificial Intelligence, Part 2: Copyrightability*, at iii (Jan. 29, 2025) - -The report’s analysis is explicit: *“The Office concludes that, given current generally available technology, prompts alone do not provide sufficient human control to make users of an AI system the authors of the output. Prompts essentially function as instructions that convey unprotectible ideas”* (*Id.* at 18). - -Its guiding distinction is stated plainly: *“The use of AI tools to assist rather than stand in for human creativity does not affect the availability of copyright protection for the output”* while *“Copyright does not extend to purely AI-generated material, or material where there is insufficient human control over the expressive elements”* (*Id.* at iii). - -The boundary is therefore not “AI or no AI”. It is *assistance or substitution*: Whether a human exercised sufficient creative control over the expressive elements and can answer for them, or whether the machine originated them and the human merely supplied instructions and a signature. That is a question of fact in each case, determined from the record of how the work was made. - -Two facts follow, and stated together, they form the base legal reality: - -1. **A work whose expressive elements were originated by a machine contains no valid new copyright: It has no human author. To the extent that the same work reproduces a preexisting copyrighted work without explicit license, it is at the same time an unauthorized derivative. It is unowned for anything new it contains, and unlicensed for everything taken.** -2. **Its operator therefore holds no copyright in it and no grant over it - and a person who holds neither copyright nor grant can convey neither.** - -The first fact makes the work **unownable** by its operator. The second makes it infringing against its source. Neither replaces the other: - -* The absence of copyright in machine output does not make the output free for anyone to take; it makes it unowned. -* This is a different thing entirely, especially when what it contains is someone else’s expression. - -### IV. License Conditions Bound the Grant - -The fourth foundation governs what a license *is*. A copyright owner may grant permission to use the work on conditions. The conditions define the scope of the permission. Use outside the scope is use that was never authorized. - -In *Jacobsen v. Katzer*, 535 F.3d 1373 (Fed. Cir. 2008), the Federal Circuit held that the conditions of an open-source license are *conditions of the copyright license itself*, not mere contractual promises, and that a licensee operating outside them is an infringer: - -> Copyright holders who engage in open source licensing have the right to control the modification and distribution of copyrighted material. - -> The choice to exact consideration in the form of compliance with the open source requirements of disclosure and explanation of changes, rather than as a dollar-denominated fee, is entitled to no less legal recognition. - -> It is outside the scope of the [license] to modify and distribute the copyrighted materials without copyright notices and a tracking of modifications from the original computer files. -* *Id.* at 1381–82 - -The doctrinal mechanism is settled: *“A copyright owner who grants a nonexclusive license to use his copyrighted material waives his right to sue the licensee for copyright infringement”* within the scope of the license. If, however *“the licensee acts outside the scope, the licensor can bring an action for copyright infringement”*: An act outside the granted scope **is infringement** (*Sun Microsystems, Inc. v. Microsoft Corp.*, 188 F.3d 1115, 1121, 9th Cir. 1999; *Graham v. James*, 144 F.3d 229, 236, 2d Cir. 1998; *S.O.S., Inc. v. Payday, Inc.*, 886 F.2d 1081, 1087, 9th Cir. 1989). - -Whether a given license term is a condition of the grant or a mere covenant is determined from the license’s own language; conditions that limit what may be copied, modified, and distributed - the attribution terms, the notice terms, the modification-tracking terms, the field-of-use terms - are the boundaries of the copyright grant (*MDY Industries, LLC v. Blizzard Entertainment, Inc.*, 629 F.3d 928, 940, 9th Cir. 2010). - -Three consequences follow for the analysis at hand. They are not hypothetical. - -**First, the conditions are measured at the moment of copying** - -A work is licensed under whatever conditions applied when the reproduction, adaptation, and distribution occurred. There is **no** period in which copying a licensed work is “free” because the copy was made by a machine; the machine is the *licensee’s tool*, and the licensee is bound by the conditions regardless. A derivative generated without satisfying the conditions - without the attribution, without authorization for the manner of use - was never within the scope of the license, from the first instant of its existence. - -**Second, breach does not restore rights that never attached** - -The district court in *Artifex Software, Inc. v. Hancom, Inc.*, No. 16-cv-06982-JSC (N.D. Cal. Sept. 12, 2017), analyzing the GPL’s termination provisions, observed that *“the language of the GPL suggests that [the licensee’s] obligations persisted beyond termination of its rights to propagate software using Ghostscript,”* because the source-code obligation recurs each time a covered work is conveyed. The same structure operates a fortiori where a derivative was produced *outside* the license entirely: No grant ever attached, and no subsequent event creates one. - -**Third, the settled conditions are the enforceable core** - -The attribution and notice conditions rest on the settled doctrine above. Novel conditions (restrictions on field of use, restrictions on how the work may be consumed) are enforceable as conditions of the grant when clearly drafted, but their enforcement history is thinner. The argument that a derivative is unlicensed does *not* depend on the novel conditions being vindicated; it needs **only** the settled ones, and the ordinary law of derivative works, to stand. - -### V. The Void Grant - -The preceding sections assemble into a single structure. Let us apply it to an example situation: - -* A project presented as an independent implementation of a protocol; “ground-up”, “from scratch” or “clean-room” work. -* The actual history shows continuous, machine-mediated ingestion of a licensed reference implementation. -* The output is generated at a scale no human could produce or review, with the provenance of the process obscured. - -**Step One: The derivative** - -The project’s output is a translation of the licensed implementation: A derivative work, produced by a copy process. 17 U.S.C. §§ 101, 106(2). Preparing it without authorization infringed from the first moment of its existence. *Id.* § 501(a). - -**Step Two: The license** - -The derivative was produced outside the conditions of the license; without the notices, without the attribution. The license never attached (*Jacobsen*, 535 F.3d at 1381–82). - -**Step Three: Authorship** - -The expression was originated by a machine. No human can account for its creative decisions, and no human authored it. It contains no valid new copyright (*Thaler*, 687 F. Supp. 3d at 146; No. 23-5233, D.C. Cir. 2025; 88 Fed. Reg. at 16192). - -**Consequence: Void Grant** - -The statute supplies the consequence. Section 103(a) provides: - -> The subject matter of copyright as specified by section 102 includes compilations and derivative works, but protection for a work employing preexisting material in which copyright subsists does not extend to any part of the work in which such material has been used unlawfully. - -And section 103(b) provides that copyright in a derivative work *“extends only to the material contributed by the author of such work.”* The legislative history states the point without ambiguity: *“An unauthorized translation of a novel could not be copyrighted at all”* (H.R. Rep. No. 94-1476, at 57, 1976). - -In our example, the operator of the derivative’s copy process decides to assert copyright over the output, and licenses it to the world under terms of the operator’s choosing, for example the Apache License. - -But the operator holds no copyright in machine-originated content (section III) and no license over the source from which it was derived (sections I and IV). - -For the derived material, the operator’s copyright claim **is an assertion of a right that never existed**. The material was used unlawfully, and section 103(a) withholds protection from *every* part of the work in which it appears. For the machine-originated remainder, the operator holds no copyright either, for lack of any human author. - -The operator’s license to the world is a promise the operator had no power to make. Every person who receives the work believing they received a valid grant has received **a void grant**, and stands, as a matter of settled law, in the position of a downstream user of an unauthorized derivative, whatever they were told at the time. - -This is a cascading consequence, and it is why the pattern is a hazard. No combination of self-granted licenses - “MIT,” “Apache,” “public domain,” anything at all - can transfer rights the operator never held. Every downstream project, product, or deployment built on the derivative is built on unlicensed reproduction of a third party’s work, whether or not it knew, whether or not it was told, and whether or not the marketing was plausible. - -The longer the derivative circulates unexamined, the more it becomes embedded, forked, vendored, depended upon, and the more expensive its correction becomes for everyone who trusted it. A field of superficially real projects, repositories, and licenses that **in reality confer nothing on anyone who relies on them is a minefield**, in the most precise sense the law allows: The rights they purport to grant *were never possessed*. - -The law defines what may be asserted, not what will be. The copyright owner may choose whether and how to assert these rights, and at what point in time. The exposure exists regardless, and for *every* downstream that trusted the void grant. This is the scope of the hazard that the conduct exemplified here produces. - -### VI. Fair Use Does Not Rescue This Pattern - -Every defendant raises fair use. It is an essential and important limitation in the service of free speech, accountability, criticism, education and other important domains. Therefore, it must be considered, and in the case exemplified here, it fails. - -Fair use is a limitation on the exclusive rights, evaluated case by case under four factors: The purpose and character of the use; the nature of the copyrighted work; the amount and substantiality of the portion used; and the effect of the use on the potential market for or value of the work (17 U.S.C. § 107). - -On the first factor, the governing standard is *Andy Warhol Foundation for the Visual Arts, Inc. v. Goldsmith*, 598 U.S. 508 (2023), in which the Supreme Court held that: - -> In sum, the first fair use factor considers whether the use of a copyrighted work has a further purpose or different character, which is a matter of degree, and the degree of difference must be balanced against the commercial nature of the use - -The question is whether the use serves a further purpose, not whether the surface changed. A derivative that exists to serve as the same thing as the original, marketed to the people who would otherwise use the original, has not acquired a further purpose by being translated; the surface changed, the function did not, and the use is commercial. - -The remaining factors resolve the same way. Source code is expressive creative work, not bare fact. The pattern under examination copies the whole; a complete implementation, ingested and translated in its entirety. And the market effect is the decisive factor, because it is engineered: A derivative marketed as a drop-in replacement for the work it was copied from is not a complement to the original’s market, it is a substitute for it. The Supreme Court has long held that use of a work to satisfy the market demand for the original is the paradigm of an *unfair* use (*Harper & Row, Publishers, Inc. v. Nation Enterprises*, 471 U.S. 539, 566–67, 1985). - -The one case that is always raised in response, *Google LLC v. Oracle America, Inc.*, 593 U.S. 1 (2021), holds less than it is believed to. The Court there assumed *“for argument’s sake, that the material was copyrightable”* and held *“that the copying here at issue nonetheless constituted a fair use”* (*Id.* at 11). - -The material in question was a thin slice of *declaring code*, which the Court found sits, *“if copyrightable at all, further than are most computer programs (such as the implementing code) from the core of copyright”* (*id.*), in a use that built a new platform for a new environment, with the copier **having written the vast majority of its own code**. By comparison: A wholesale translation of an entire implementation, marketed as a substitute for it, is **not** that case; it is the other end of every factor. - -The valuable zones of fair use remain, and they are important. **Commentary and criticism**, quoting from a work to review, discuss or criticize it. **Teaching and scholarship**, explaining concepts and quoting excerpts, is its traditional beneficiary. - -### Conclusion - -The law is neither obscure nor new. The conclusion it yields can now be stated: - -* A machine translation of a protected implementation **is a derivative work**, and an unauthorized derivative **is an infringement**, whatever language it speaks and whatever machinery produced it. -* A work whose expression a machine originated has no human author, no valid new copyright, and without valid copyright **no license can be granted on it**. -* § 103 withholds protection from every part of a derivative in which protected material was used unlawfully. A license is a grant with conditions, and a derivative made outside the conditions **never received a grant**. -* A person who holds no copyright and no grant **can convey neither**, and *every* downstream consumer who received from them received a **void grant**. - -This is a *catastrophic* failure state for all who want to create things good and useful: The projects that inherit only void grants and liability believing they have inherited foundations, the users who depend on code that no one on earth can answer for, the honest builders whose work is buried under a field of plausible-looking impostors. - -### Sources and Authorities - -Statutory references are to Title 17, United States Code. Case citations are to the official or generally cited reporters. Online links are for reference only. Section numbers refer to the sections in which each authority is principally relied upon. - -**Statutes** - -* [17 U.S.C. § 101 (definitions: “derivative work,” “including,” “publication”) - I, II](https://www.law.cornell.edu/uscode/text/17/101) -* [17 U.S.C. § 102(b) (idea/expression) - II](https://www.law.cornell.edu/uscode/text/17/102) -* [17 U.S.C. § 103(a)–(b) (derivative works employing unlawfully used preexisting material) - V](https://www.law.cornell.edu/uscode/text/17/103) -* [17 U.S.C. § 106(1)–(3) (exclusive rights: reproduction, derivative works, distribution) - I](https://www.law.cornell.edu/uscode/text/17/106) -* [17 U.S.C. § 107 (fair use) - VI](https://www.law.cornell.edu/uscode/text/17/107) -* [17 U.S.C. § 501(a) (infringement) - I, V](https://www.law.cornell.edu/uscode/text/17/501) - -**Judicial decisions** - -* [\*Jacobsen v. Katzer\*, 535 F.3d 1373 (Fed. Cir. 2008) - IV, V](https://www.casemine.com/judgement/us/5914b290add7b04934760a54) -* [\*Sun Microsystems, Inc. v. Microsoft Corp.\*, 188 F.3d 1115 (9th Cir. 1999) - IV](https://law.justia.com/cases/federal/appellate-courts/F3/188/1115/629501/) -* [\*Graham v. James\*, 144 F.3d 229 (2d Cir. 1998) - IV](https://caselaw.findlaw.com/court/us-2nd-circuit/1011522.html) -* [\*S.O.S., Inc. v. Payday, Inc.\*, 886 F.2d 1081 (9th Cir. 1989) - IV](https://law.justia.com/cases/federal/appellate-courts/F2/886/1081/19091/) -* [\*MDY Industries, LLC v. Blizzard Entertainment, Inc.\*, 629 F.3d 928 (9th Cir. 2010) - IV](https://law.justia.com/cases/federal/appellate-courts/ca9/09-15932/09-15932-2011-02-25.html) -* [\*Artifex Software, Inc. v. Hancom, Inc.\*, No. 16-cv-06982-JSC (N.D. Cal. Sept. 12, 2017) (settled; dismissed with prejudice Jan. 2018) - IV](https://storage.courtlistener.com/recap/gov.uscourts.cand.305835/gov.uscourts.cand.305835.54.0_1.pdf) -* [\*Thaler v. Perlmutter\*, 687 F. Supp. 3d 140 (D.D.C. 2023), aff’d, No. 23-5233 (D.C. Cir. Mar. 18, 2025) - III, V](https://www.bitlaw.com/source/cases/copyright/Thaler-Perlmutter-Dct.html) -* [\*Burrow-Giles Lithographic Co. v. Sarony\*, 111 U.S. 53 (1884) - III](https://supreme.justia.com/cases/federal/us/111/53/) -* [\*Community for Creative Non-Violence v. Reid\*, 490 U.S. 730 (1989) - III](https://supreme.justia.com/cases/federal/us/490/730/) -* [\*Feist Publications, Inc. v. Rural Telephone Service Co.\*, 499 U.S. 340 (1991) - II](https://supreme.justia.com/cases/federal/us/499/340/) -* [\*Baker v. Selden\*, 101 U.S. 99 (1879) - II](https://supreme.justia.com/cases/federal/us/101/99/) -* [\*Computer Associates International, Inc. v. Altai, Inc.\*, 982 F.2d 693 (2d Cir. 1992) - II](https://law.justia.com/cases/federal/appellate-courts/F2/982/693/137252/) -* [\*Andy Warhol Foundation for the Visual Arts, Inc. v. Goldsmith\*, 598 U.S. 508 (2023) - VI](https://www.supremecourt.gov/opinions/22pdf/21-869_87ad.pdf) -* [\*Google LLC v. Oracle America, Inc.\*, 593 U.S. 1 (2021) - VI](https://supreme.justia.com/cases/federal/us/593/18-956/) -* [\*Harper & Row, Publishers, Inc. v. Nation Enterprises\*, 471 U.S. 539 (1985) - VI](https://supreme.justia.com/cases/federal/us/471/539/) - -**Administrative and policy authorities** - -* [\*Copyright Registration Guidance: Works Containing Material Generated by Artificial Intelligence\*, 88 Fed. Reg. 16190 (Mar. 16, 2023) - III](https://www.federalregister.gov/documents/2023/03/16/2023-05321/copyright-registration-guidance-works-containing-material-generated-by-artificial-intelligence) -* [\*Zarya of the Dawn\*, U.S. Copyright Office (Cancellation Decision, Feb. 21, 2023), Registration No. VAu001480196 - III](https://www.copyright.gov/docs/zarya-of-the-dawn.pdf) -* [U.S. Copyright Office, \*Copyright and Artificial Intelligence, Part 2: Copyrightability\* (Jan. 29, 2025) - III](https://www.copyright.gov/ai/Copyright-and-Artificial-Intelligence-Part-2-Copyrightability-Report.pdf) -* [H.R. Rep. No. 94-1476 (1976) - V](https://law.resource.org/pub/us/works/aba/ibr/H.Rep.94-1476.pdf) - -## Evaluating a Reticulum Implementation - -### The Intention Of This Guide - -Very few user of network infrastructure can verify the software they run. This is true of the reference implementation as well, and it is precisely why it was engineered the way it was: the entire Reticulum protocol implementation - the transport logic, the cryptographic interfaces, the routing - is less than 15,000 lines of code, including its extensive comments and detailed logging. The reference is *designed* to be readable by a human in a reasonable sitting. That is a deliberate decision, and it is the standard against which every other implementation should be measured: An implementation that asks for trust while being structurally unreadable is asking for the absurd. - -Because most users cannot verify the code directly, the evaluation of the *project* is the evaluation of the software. The framework below exists so that this evaluation can be performed in minutes, by anyone, without expertise - and so that each new “implementation” does not require the kind of full investigation that would otherwise be if not impossible, prohibitevly expensive. - -### Two Questions That Resolve Most Cases - -Other considerations in this guide is further corroboration. These two questions allow you to decide the case quickly in most instances, and they should be asked first. - -**Question 1: Does this speak the protocol, or was it just generated from the reference?** - -The copyright and license realities, described in [What The Reticulum License Is](#brandolinis-what-the-license-is), is the legal foundation of this distinction. The protocol is public domain: A *genuine* [clean-room](#brandolinis-cleanroom-delusion) implementation, reasoned out and written by humans, is free and welcome, and owes nothing to any license. But an implementation that was *directly generated from* the reference - reproduced by a copy process, whether manually or through a machine or software - is a derivative of the licensed work, and is subject to both the license’s conditions, and to the ordinary copyright law examined in [Copyright & The Two Legal Layers](#brandolinis-copyright-and-layers). A primarily machine-generated copy without substantial human creative input is not merely unlicensed; it is a copyright violation that would exist under any license at all. - -**Ask**: Does the project say where its protocol knowledge came from? Does it credit the reference implementation, or claim “ground-up” status while its own history shows continuous ingestion of the reference’s source? Does its license carry the original copyright notice? The answers tell you, within minutes, which of two very different kinds of project you are dealing with. - -**Question 2: Who, or what, is the agent of the work?** - -This distinction, established in [Assistance Versus Machine Substitution](#brandolinis-assistance-versus-substitution), is the trust foundation of everything else. Is there a human who decided what to build, judged what was correct, rejected what was wrong, understands what was shipped - and can answer for it, line by line and decision by decision, *without machine assistance*? Or is the machine the agent, with the human’s role reduced to the name, the account, and the signature? - -> This test has a sharper form: **would the project be meaningfully different if someone else had pressed the button?** If the answer is no - if any person could have been the signature and nothing would change - then the “author” is not the agent of the work. They are its facade, and the project is, in the most literal sense, worthless and unowned. - -A project with no owner is a project no one can answer for, and infrastructure with no one to answer for it has no place carrying other people’s traffic. - -### Other Signals To Look For - -Once the first two questions are answered, the following signals determine the verdict. None is alone decisive; together they form a pattern that is difficult to fake in the directions that matter. - -#### Provenance and attribution - -* **Credit to the reference.** Does the project name Reticulum’s reference implementation - in its README, its website, its licenses, and the code? Does it present itself as a port - or as a “ground-up” origin story? Absence of credit, in a field where every implementation - owes its existence to the reference, is not an oversight; it is a decision. - -* **License compliance.** For a derivative, the license conditions apply: the copyright - notice and permission notice in all copies and substantial portions, the harm condition, - the AI-training condition. A project whose license file claims a fresh copyright in the - operator’s name, over work that was generated from the reference, has failed the minimum - bar of honesty before any code is read. - -* **Disclosed provenance.** Is the use of machine assistance stated openly, or does the - project maintain machinery to conceal it - commit hooks that refuse attribution of - generation, contribution policies that declare machine output the human’s own, scrubbers - for personal traces, fictitious contributor identities? The first is the mark of a human - using a tool. The second is the mark of a record being manufactured. - -* **The author’s history.** Is there a prior record - projects, contributions, a body of - work that a person can look at and reasonably assess? A sudden, fully-formed “decade of experience” - appearing from nowhere, attached to a project of unprecedented scope, is a story that - contradicts itself. - -#### Agency and answerability - -* **Who answers the questions?** When technical questions are asked, does a human answer - with substance - going deeper, explaining trade-offs, admitting uncertainty - or do - answers deflect to process (“the CI verifies it”, “the proofs prove it”, “the audit - covered it”)? Are the answers themself machine generated? Deflection to process is - the substitute’s answer pattern: It names the machinery instead of the reasoning. - -* **Velocity commensurate with authorship.** Is the output volume compatible with human - authorship, review, and judgment? An implementation ten (or 42!) times the size of the reference, - produced in a fraction of the time by a single person, is not evidence of brilliance; it - is evidence of unchecked generation. Churn is part of the same signal: A project that - deletes half of everything it adds is not building; it is looping. - -* **Signs of development, growth and learning.** Do reversals exist? Contested decisions? - “We tried X and it was wrong, so we did Y”? Humans change their minds, admit mistakes, and - leave the wear of judgment in their history. Pure generation shows “the polish of its - absence”: uniform register, endless renaming, and errors discovered by the generator’s own - later runs, recorded as if they were planned milestones. - -* **Standing behind failures.** When something is wrong, does the human say “I chose this, - here is what I got wrong, here is the fix”? Or do corrections arrive as process language, - with nobody accepting that a decision was even made? A project whose history contains no - first-person acceptance of error contains no author. - -#### Engineering reality - -* **Honest benchmarks, or none.** If performance is claimed, is the baseline real - stock, - current, interpreted RNS, on the modern interface, at equal policy, with methodology - published in advance and reproducible by anyone? - -* **Interop with reality.** Is compatibility verified against the *current* reference - implementation - on real hardware, including the radio and serial interfaces this - protocol family lives on - in both directions, over long transfers, uptimes and edge cases? - -* **The readability standard.** Can a competent human read the core of this implementation - in a reasonable sitting, the way the 15,000-line reference can be read? Was human - readability a stated design goal, or an afterthought? A project that cannot be inspected - is a project asking for trust it has not earned and will never attend to. - -* **Nonstandard inventions.** Does the project “improve” on the protocol with its own - modes - new channel behaviour on shared spectrum, new rendezvous mechanisms, new crypto, - “post-quantum” replacements, “turbo” variants? Inventions that change behaviour on a - shared network are not features; they are forks of the airwaves, imposed on every other - node that shares the medium. A project that invents on top of a protocol it has not yet - correctly implemented is not advanced; it is dangerous to its neighbours. - -* **The public record.** The commit history is public. Read it. - -#### Network citizenship - -* **Honest presence.** Does the project identify itself honestly on the network, or does - it masquerade as something it is not? - -* **Coexistence.** Does it respect the shared medium and network conventions? A node that - is a bad neighbour on the spectrum is a hazard regardless of how well its code works in isolation. - -* **Community participation.** Does the author participate in the community as a member - - answering questions, contributing, learning - or only appear to advertise? The second is - not participation; it is exploiting the community as a broadcasting target. - -#### Monetary and influence signals - -* **Money under the claim.** Donations, funding, or commercial offers premised on claims - like “89× faster” or “formally proven” convert false marketing into a different category - of problem. When money changes hands on the strength of fabricated measurements, the - stakes are no longer theoretical. - -* **Tokens and “investment” vehicles.** Any implementation that surrounds itself with a - crypto token, a “coin”, or an investment pitch should be treated as what it is: A project - whose primary purpose is to earn the controller a profit, not open networking. - -* **Marketing-first ordering.** A polished website on day three, a twelve-language marketing - presence, a “benchmarks” page and a “get started” funnel existing before the protocol works - is a massive red flag. Real builders ship, then talk. The inverse order is the signature of - a project whose goal is attention. - -### The Conformal Surface - -One warning before the synthesis. When you evaluate any project, assume - as a working hypothesis - that its surface is an investment. The marketing, the design, the badge collection, the “proof records”, the fluent and confident prose: This is exactly where substitution invests, for the simple reason that it is where the audience looks first. Fluency is the *minimal conformal surface* of understanding, and the surface is not evidence of anything except that the author *wanted to look convincing*. If you find yourself impressed by the surface before you have asked Question 1 and Question 2, you are doing the evaluation in the order the substitute operator hoped you would. - -### Possible Verdicts - -The framework proposed here can yield three different verdicts: - -1. **Meets the standard.** A named human who can answer for the work and demonstrably does; - provenance disclosed; attribution given; honest benchmarks; interop - demonstrated against current, real RNS on real media; readable code; a maintenance - history that shows growth and learning. This standard is not high. It is what the - reference implementation has met, in public, for over a decade, and it is what any - project that wants other people’s traffic should be willing to meet in turn. -2. **Experimental, but honest.** A project that clearly labels itself as in-progress and - experimental (“do not use this yet”, in plain words, as the first thing a user sees) - discloses its provenance, credits the reference, and is being developed in the open by - humans who answer questions. Such projects should be encouraged. They are how the - ecosystem grows, new ideas are tested, and the framework above is designed to make an - honest experimental project *easy* to recognize, not hard. -3. **Does not meet the standard.** Unanswerable authorship, concealed provenance, fabricated - measurements, invented protocol behaviour, absent interop, marketing ahead of substance. - Such projects should be treated as unproven regardless of their surface, and as hazards - if they invite users onto shared networks. The community owes them exactly the - skepticism they have earned, and not a moment of engagement beyond that; the network’s - time is better spent elsewhere. - -### These Standards Are Reasonable - -I’ll close this guide by stating what these standards are *not*: They are neither a demand for perfection, nor a ban on machine assistance. Assistance is useful, when it is used to arrive at *higher levels of synthesis* than unaided work. It is not a requirement that an implementation be a clone of the reference; neither is it a requirement that it invents everything from scratch or aspires to be a [“clean-room”](#brandolinis-cleanroom-delusion) implementation. Good implementations of the protocol are very welcome, *however they come*, but working on one requires *serious* work, considerable skill, and **deep competence**. - -The reference implementation has met this standard for years, and its users know what that looks like. - -## The Movement Of A Dozen - -### Presentation, Elongated - -Whenever Reticulum defends itself, its license, or its community - or simply continues to exist - a familiar chorus appears. The register is always similar: *concern*. Concern about the direction of the project. Concern about its license. Concern about its governance. Concern about its “bullying” of “good-faith contributors”. Concern about the future of the ecosystem at the hands of a single maintainer. The chorus speaks in the plural, presents itself as a body of independent voices, and insists, with some frequency, that it is… *not alone*. - -The implicit claim under examination in this section is that there exists a *movement* of concerned individuals, spread across the ecosystem, all worried about Reticulum, and therefore (for some reason) deserving of a place at the table of decisions. - -A resolution of this claim requires one step: Count them. - -### Headcount - -This “movement” does have a headcount. It is not in the hundreds, and it is not in the dozens. It is a small number of people who appear, in various combinations and under various names, in the following roles: - -* Creators of the machine-generated “Reticulum implementations” examined in this chapter. -* Creators of articles praising those implementations and lamenting the state of the - reference, its moral shortcomings, its unavailability or lack of something it already has. -* Commenters “defending” the implementations when they are evaluated reasonably and critically, - most often by attempting simply to derail the discussion. -* Critics of the Reticulum License on “open source” grounds. -* “Concerned community members” objecting to the maintainer’s conduct. -* Campaigners on online platforms; and -* In some cases, a single individual performing *several* of these roles at once, under - different names, in the same week. - -The overlap is well documented at this point, across time and different platforms. The same phrasing, the same arguments, the same links, the same reactive reflexes, the same handful of accounts appearing in the same threads at the same moments. When the sockpuppets are unmasked (and they frequently unmask themselves) the cast does not grow, but rapidly shrinks. - -This is the most interesting single fact about the “movement”: **It isn’t one. It is a synthetic cast**, held together mostly by LLM-glue, reddit handles and hysteria. A cast is not a constituency. It performs; it does not represent. The difference matters quite a bit, because a great deal of this “movement’s” imagined power comes from the assumption that the *plural form* is actual evidence of plurality. If that sentence seemed opaque, notice how many times a statement or article uses “we” instead of “I”, and it will be less so. - -### Recycled Wine, Fermenting - -The cast is not only small, it is also, by any evidentiary standard, *forgetful*. Every major claim this “movement” advances has been advanced before, answered in public, with evidence, and often years ago - and is then advanced again, unchanged and completely ignoring any rationale or evidence presented previously (to the same people), as if the answer had never been written. - -* **The license argument.** Reticulum is “not really open source” because its license is not - approved by a particular orthodoxy. This is answered (now in a new and updated version, for the - fifth time) in full in [Open Source Means Open Source](#brandolinis-opensource). It was also - answered in public, at length, at the time of the license change - including the - arithmetic of who is actually restricted by which license. It is repeated *ad infinitum* anyway. - Quite a conversation starter, apparently. - -* **The distribution argument.** Reticulum is “not properly distributed” because it is not - packaged as a `.deb` or on some favoured catalogue. Reality: It is available on practically every - platform with a single command, packaged by the community in a wide range of channels, and - capable of updating itself over its own network. The argument has been answered; it is repeated. - -* **The “stepped back” narrative.** When the primary mirror of the project moved away from - a public internet platform, it was spun as the founder leaving for good, or now taking on dictatorial - powers, or abandoning his creation, or any variation or nonsensical combination thereof. - Those spins always center around justifying that *a vaccuum now needs to be filled*. - There was no such vaccuum. The narrative is repeated in various forms whenever convenient. - -* **The enclosure narrative.** The license is reframed as a “power grab” or an “enclosure” - of the commons - as if a license whose protocol is public domain and whose conditions - restrict only harm and appropriation were a form of enclosure. The [most recent](https://gaggl.com/blogs/2026-09-05-enclosure-by-good-intentions/) (and mostly incoherent) - expression of this narrative is, once again, fluent, polite, and factually hollow. The - bizarre arguments supporting the “article” include: Defunct and abandoned forks presented - as living, community forks bearing the very Reticulum License mislabeled as AGPL license vehicles - (created by “concerned users”), companion app forks correctly retaining the Creative Commons - licensing used as further evidence of the same and completely abandoned projects propped up - as being “the ecosystem”. Another case of LLM generated nonsense that the “author” didn’t bother checking. - The intent is clear here, simply produce more *mass* of the bullshit, so it can be further - referenced, regurgitated and linked to. - -* **The “bullying” narrative.** Whenever the community declines to treat manufactured - controversies as legitimate, or calmly documents the falsity of claims, or (Lord forbid) - moves a forum post for violating clearly stated forum rules, - the response is the same: The documentation is “bullying”, the community is “excluding” people, the - maintainer is “unprofessional”. In the most recent example, those accusations were made by someone who, in the - same week, publically called for the Reticulum maintainer’s “removal from the equation”, forged a moderator’s - username, attempted to drag unrelated individuals into the campaign, and presented a new - round of outright falsehoods. Contrary to popular belief, the accusation of incivility - is not the last resort of the wronged; it is the standard reflex of the exposed. - -None of the “arguments” engages the answers given repeatedly, and extensively. That is the point, and the strategy. The arguments are not produced for the purpose of being engaged; they are produced for the purpose of *being repeated* - the same wine, poured into new bottles, on a cycle. Each cycle is short, cheap to produce, and (thanks to freely available fluent text generation) now nearly effortless. The intended audience is not the community, which has heard it all before. The intended audience is the newcomer, who has not. - -### The Method of Madness - -The method behind the pattern is consistent and simple enough to be described precisely: - -**Bullshit asymmetry** - -Producing a fluent, plausibly-sourced smear is now the work of minutes. Refuting it to the standard this manual demands is the work of days, and the refuted smear is replaced by the next one within the week. This asymmetry isn’t just a fine point of the campaign; **it is the campaign**. The goal is exhaustion - the slow conversion of the community’s time and attention from building to defending. - -**Weaponized concern** - -The register of the campaign is almost always the register of solicitude: “we are worried about the ecosystem”, “we just want what is best for the community”, “this is about the future of the project”. The concern is directed, without exception, at the things the campaign wants changed, and the change it wants is always the same: **The replacement of the reference’s authority with its own**. Concern is the *costume*; capture is the choreography. It is the oldest form of cheap power grab in the book. - -**Event seizure** - -Any event - a license change, a platform move, a forum moderation decision, a subreddit closure, a security notice, even the most banal messages from maintainers or known contributors - are seized, stripped of their actual context, and re-narrated as evidence of the same pre-written story. The subreddit that was closed after its moderator vanished and ceased moderating (according to *prior agreement with said moderator*) becomes “the maintainer shutting down dissent”. Moving away from a highly centralized online platform becomes “the founder retreating”. The license becomes “the enclosure”. The pattern is so reliable that the story could be pre-written by a lightly mechanized quill; only the date changes. The actual real-world context of these events is documented, in public, in each case; the re-narration proceeds regardless. - -**The legitimacy circuit** - -The campaign invests heavily in the places where legitimacy is minted: Conference talks, blog platforms, social threads, and forums - presented as if these appearances constituted some sort of ecosystem-wide groundswell rather than the same dozen people moving through the same circuit. The LLM-generated articles cite the LLM-generated ports; the ports are praised in the articles; the managers of the ports spread the articles, and echo them on the forums and internet platforms; the conference presentations cite the forums. Random bypassers with the need for a cause watch the conference presentations and take on the holy duty of Internet Soldier. The circuit is closed, self-referential, and (to a reader encountering it fresh) convincing. It is also, entirely, **a loop of bullshit**. - -**The prior-work minefield** - -The machine-generated implementations have a consequence beyond attention: They flood the space with fake “prior work”. The effect, as the license discussion predicted in the beginning of 2025, is the creation of a minefield of sloppy repositories that can later be matched against any genuine project, and attempt to claim prior art, or even worse: Dissuade actual, honest developers or builders from taking up a real project they might have succeeded with, because they now believe it has already been done. Just as importantly, it also buries real efforts under machine-generated noise. The machine-ports are not failed attempts to contribute. They are (disregarding intentions, but effectively) the campaign’s long game, deployed as inventory. - -### A Persistent, But Fragile Triad - -This chapter as a whole has documented three fronts: The legal-ideological attack on the license ([Open Source Means Open Source](#brandolinis-opensource)), the substitution and usurpation pattern in machine-generated implementations ([Assistance Versus Machine Substitution](#brandolinis-assistance-versus-substitution)), and the takeover narratives examined in this section. They are three fronts of the same operation, run by the same cast. - -* The license attack and other urgency-engineered narratives are the *cover*: They supply - the ideological justification for treating the reference as illegitimate, and needing replacement. -* The ports are the *inventory*: they supply the “replacements” that the narrative claims - the ecosystem needs. -* The takeover narrative is the *objective function*: the repeated, persistent, escalating claim that - the reference should be replaced, and that the speakers themself are the natural heirs. - -Each front depends on the others, and all three depend on a single, fragile assumption: That their audience cannot count. Restore the count, and the charade collapses into what it is: - -**A small group of people, obsessively orbiting a technology they did not build, synthetically producing the -appearance of a constituency they do not have, in service of a takeover they cannot justify.** - -### What The Pattern Is Not - -It is important, to also say what this pattern is *not*, exactly because the campaign depends on being mistaken for such things. - -**It is not criticism** - -The Reticulum community has always had lively, rigorous criticism - of decisions, of priorities, of direction - and it has always engaged that criticism on the merits, and changed course and development priorities many times. The license discussions at the time of the change were extensive, public, and answered in full, including with the critics themselves. Core protocol decisions were always discussed and evaluated in the community. The complex coordination and execution of several protocol upgrades between a loosely organised group of developers, node operators and users have succeeded surprisingly fluidly. All of these are success stories that the “critics” **always** ignore. Real criticism engages the content and accepts evidence. The campaign engages nothing. - -**It is not a community** - -Communities *build things*, maintain them, and have skin in the game; long-term users, operators of nodes, authors of real applications, people whose traffic flows through the network every day. A community has a stake. The “movement” only has an agenda. - -**It is not a debate** - -A debate has parties who evaluate arguments and evidence, and as a function of that, the debate moves forward, perpetually. The campaign’s arguments, as shown above, are not designed to survive contact with answers, but to be repeated past them. You cannot debate a loop. You can decline to perform for it, though. - -### Intent & Consequence - -While it would provide for interesting speculation, we do not need to know what the individuals in the cast *intend*, and this document will not speculate about their inner lives. People may believe their own narratives entirely, or partly, or not at all; **the pattern is the same in any case**, and the pattern is what matters here, since it is the exact thing that has been so insidiously destructive and resource wasting for the actual Reticulum project and community, ever since Reticulum was more widely discovered, popularized, and became a prime target for all sorts of grift known to man. - -The consequences are very real: - -* **Time**. The community’s scarcest resource is the attention of skilled people who actually build - and maintain the network. The campaign converts that attention into reactive defence, on a cycle - with no end. - -* **Harm**. Hastily machine-generated implementations, marketed as drop-in replacements and carrying - traffic onto shared networks, mislead users and can damage the network and its neighbours. - We, the actual reticulum community, all rely on these networks every day, and it is my belief - that we need to defend them. The fabricated measurements and laundered authorship examined in this chapter are not - editorial embellishments; they are the mechanism by which real users are induced to run - unverified, and often destructive software. - -* **Erosion of the currency of trust**. Every manufactured scandal, every fluently polite smear, every - fabricated “movement” debases the currency of trust and degrades it for **everyone**; - including, most of all, the honest projects that come after. This is deep harm, and - it is the primary reason this chapter exists. - -Whatever the intent - profit, control, attention, or a simple, obsessive inability to stop - the mechanism is the same, and the response should be *calibrated to the mechanism as a whole*, not to the individual person acting as the current avatar for it. - -### Recognition & Response - -For anyone who encounters the pattern fresh, here is a proposal on how to recognise it, and what to do about it. - -**Recognition:** The pattern is recognisable in minutes, once the signs are known: - -* Claims that have been answered before, repeated as if never answered. -* The register of solemn concern applied, without exception, in one direction. -* A severe allergic reaction to answering any questions posed. -* A cast that is small, overlapping, and frequently anonymous, with the *plural form* doing the - work of plurality. -* Sockpuppet theater: The same person or footsoldiers thereof appearing as several “supporters” - (and occasionally slipping up mid-performance). -* Articles, ports, and forum threads that cite and reference each other in a closed loop. -* The immediate, reflexive turn to “bullying”, “exclusion” and “toxicity” whenever a claim is refuted. -* A complete absence of engagement with the substance of the answers given, and a complete - absence of stake in the network itself. - -**Response:** A constructive response is one that is proportionate, and does not cost the -community its resources, sanity and dignity: - -* Engage the content once, on its merits (if any), with evidence, in public, and then refer to the - existing records. The answers already exist; they do not need to be re-derived for every new - bottle of piss-sour burgundy served from a man behind the curtains. I will do my best to keep this - chapter up to date with such answers and records, for easy reference, but other great resources - exist. -* Do not become part of the theater performance. The “movement” feeds on engagement in *any* form; - attention is its fuel, and outrage is as good as endorsement for them, if not better. -* Do the headcount. When the audience is reminded that a “movement” is a dozen people - recycling answered falsehoods, its projected power dissipates. The power was never real; - only the audience’s own assumption of scale can make the illusion effective. A polished-looking - “ground up” implementation might look like the work of many people, but is most likely - just the result of an LLM looping on a laptop for a couple of months (this is weird, but it is - the reality we now live in). Four different users suddenly singing in unison may look like the - representatives of a broader sentiment, but is most likely the same person hiding behind the same keyboard. -* Then, spend the saved time on the networks: On building real infrastructure, putting up nodes - and antennas, on real development, real maintenance, real coexistence, and on the people - *who actually use Reticulum*. The things that we can only do *together*, as humans. That is - what the fake “movement” cannot do, no matter how fluent and smooth its productions become. - -## Network Health & Coexistence - -### Substance Of The Networks - -Before examining health, we should consider what is being protected. The networks are not a repository. They are not a website, a social presence, or a set of marketing pages. They are a habitat: A living commons of communication, carried by, from a catious estimate, an intermesh now consisting of over a hundred thousand physical devices, embedded in a plethora of applications and packages, transporting terabytes of traffic every single day - real messages, real coordination, real people - across radios, serial lines, phones, laptops, and backbone servers, in cities, places and ways that no other network reaches. - -The protocol belongs to humanity; no one owns it. The network belongs to everyone on it, and its membership is defined by nothing other than participation: A node on a mast, a phone in a pocket, a server routing for its neighbourhood, a developer building on the commons. The network has no gatekeepers because it needs none; it is held together by the same physics and mathematics everywhere, and by a shared expectation of how members behave. That expectation - unwritten, unenforced by any central authority, and just as important as any code - is the subject of this section. The *Zen of Reticulum* calls the software a habitat. A habitat is healthy or unhealthy as a whole, and the health of this one is decided, every day, by the people who live in it. - -### Health Is A Property Of The Whole - -A network is not made healthy by the excellence of any single part. It is made healthy by the behaviour of every part on the shared medium, and how they interact. And the shared medium is the point. When your node transmits, it transmits into the same spectrum, the same line, the same time, the same mathematical address space, the same bandwidth that its neighbours depend on. - -The network cannot be certified by any single project’s claims. A node that is a bad neighbour, that invents its own channel behaviour on shared spectrum, that announces without discipline, that spawns tens of thousands of links to scrape the network, that floods and retries without mercy, is a hazard to every node that shares its medium, regardless of how well its “creator” imagines its own code to work in isolation. - -On a shared medium, “my software works” is not a complete sentence. The complete sentence is “my software works *and coexists*”. A network’s health deteriorates with its worst-behaved member, and every member has a responsibility to not be *that* member. There is no final, technical solution for this; the solutions are human. - -### A History Of What Works - -Let’s recall, because it is the ground truth this entire thing rests on, that the coexistence model has *worked* - is working, right now, **at scale**. Reticulum’s protocol decisions have been discussed and evaluated in the community, openly, for years. Protocol upgrades have been designed, coordinated, and executed between a loosely organised group of independent developers, node operators, and users - and have succeeded, repeatedly, without any corporate board, without any central command, and without the collapse that the skeptics predict every second week (while screaming for *GOVERNANCE*). The reference implementation has been developed in the open for over a decade, by a maintainer who answers for it, fixes bugs or issues within hours of their discovery, and is set down in code deliberately kept small enough (the entire protocol implementation under 15,000 lines, including its comments) for a human to read, verify, *and challenge*. - -This is the empirical baseline that every narrative examined in [A Movement Of A Dozen](#brandolinis-movement-of-a-dozen) conveniently ignores, in order to justify: - -* The claim that the project is a one-man dictatorship -* The claim that the community is excluded -* The claim that the networks need saving from their own founders - -The **reality**, documented and reproducible, is that a loose community of humans coordinates complex technical evolution *without* the apparatus the narratives insist is missing. The health of the networks is not a promise for the future; it is a demonstrated property of the past and present, under the leadership and community model that brought it into existence and navigated it through difficult decisions and situations over a decade. **My job is to keep it that way**, and you can be damned certain that I take it seriously. - -### The Role Of The Individual - -The networks are built by physical acts and human coordination. You cannot prompt an antenna into existence. No model can string up a dipole, or stand in the rain aligning a radio, or coordinate with a neighbour three valleys away about who covers which repeater frequency, or sit down with a newcomer and explain why their first node didn’t announce. These are the acts that make a network *organic* - present in the physical world, resilient because it is *real*, valuable because it is *human*. The machines and technology we use are tools aimed at a well-defined, openly described goal. But the networks themself are composed of intentional human actions, and every node operator is infrastructure for other humans. - -This has a corollary for the individual: You do not need permission, and you do not need to be an expert, to participate. Run a node. Help a neighbour. Ask questions in the community, and answer the questions you can. Build something small at first. The network grows by these acts, and they are the most meaningful ones - the things that can only be done together, as humans, in the physical world. The parasitic “movement” that haunts the peripheries of this ecosystem cannot do any of this. It cannot build a node because it does not exist, in any real connected and human sense; only people can, and people are precisely what a self-recurrent loop lacks. - -### The Place Of New Implementations - -The future of the network includes more implementations - and they are welcome. This chapter is not an argument against implementing Reticulum. The protocol is public domain, by design, and the network is made stronger by genuine diversity: More *good* implementations, honestly made, mean more resilience, more experimentation, more people who understand the protocol deeply *because they have built it themselves*. That is the goal: **For people to understand and own the technology they rely on**. Not to spew out 600,000 line rust ports that fills no meaningful gap or purpose. - -What the ecosystem needs, from every implementation, is the ordinary floor that [Evaluating A Reticulum Implementation](#brandolinis-evaluating) establishes, and that the reference has met for over a decade: A human who made it and answers for it; provenance disclosed; attribution given; benchmarks honest or absent; interop demonstrated against the real network; code a human can read. And it needs the one thing that costs nothing and changes everything: **Honest labeling**. - -An experimental implementation that says, plainly, as the first thing a user sees: “This is in-progress, experimental, do not depend on it yet, but help if you can”, that is a gift to the ecosystem. It contributes, it invites participation, and it protects users. - -The opposite, the polished “drop-in replacement”, does damage far beyond its own users: It dissuades the honest developers who might have built *the real thing*, because the polished slop persuades them the work is already done. That dissuasion is one of the quietest and most expensive harms in this entire affair, and the antidote is honesty at every project’s door. - -### Expanding The Commons - -Coexistence, reduced to its essentials, is a short formula; the duties of membership in a network no one owns: - -* **Be honest.** Say what you are, what you built, how you built it, and what you used to - build it. Label experimental work as experimental. Credit the work you build on, including - the reference implementation, in the licenses and in the prose. Concealment is not a - defence; it is a very clear diagnosis marker. - -* **Be owned.** Have a human who made the work and can answer for it. Use assistance, don’t - substitute. Never sign what you cannot answer for. The chain of accountability is the - community’s only verification at scale, and every link in it is a *person*, not a facade. - -* **Be a good neighbour.** Respect the shared mediums. Do not invent new behaviour in our - shared space and call it progress. The network belongs to its other members as much as - to you. - -* **Verify against the network.** Compatibility is a property demonstrated with actual nodes, - on actual media, against the actual current protocol, over a period of *years*, not 48 hours. - And not a claim pinned to an old snapshot over loopback. - -* **Participate as a member.** Ask, answer, help, build. *Advertising at* the community is not - the same as being part of it, and it is **not** the first thing you should do. - -None of this is a high bar. It is the bar the reference implementation has met, in public, for over a decade, and the bar the ecosystem has adopted organically itself, successfully, through every protocol upgrade it has ever coordinated, and everything running on Reticulum today, that people actually use. It is not a new requirement; it is the existing, working culture of the networks, now written down so that newcomers can find it and so that those who would exploit us cannot claim they never saw it. - -### Defence Of The Commons - -The networks need defending - not because they are under severe physical attacks (yet), but because attention, talent and resources is being stolen from them, trust is being mined against them, and its newcomers are being harvested by the machinery documented in this chapter. Defence, for a commons, has specific shapes, and it is not what the theater would like it to be. - -* Defence is **documentation**: Records kept public, of what was claimed, what was - answered, and what turned out true. -* Defence is **a headcount**: Calm, unexcited reminders that a “movement” might just be a dozen - people having a tantrum. -* Defence is **honesty in action**: The visible, ordinary practice of the good behaviour - by the people who actually run the networks. -* And defence is **building**: Every node raised, every page of *real* documentation, every - honest implementation, every new user helped into the community with the knowledge to know - what they are doing is more durable than any rebuttal, because it adds to the thing being - defended. - ---- - -**The theatre cannot keep up with a network.** - -**It can only orbit it, while it recycles its own sour piss.** - ---- - -A lot of us rely on these networks every day. They carry our messages, our coordination, our friendships, and in some places, our safety. That is exactly why they are a target: - -They are valuable, free, and very hard to shut down. The response is not to become aggressive. It is to be *more* of what the network already is: Real, open, owned, and shared. - -*Mark* - -## Addendum A: The Prns Case - -### Purpose & Scope - -This section provides a concrete example, which future evaluations can use as a template. Its purpose is not to be the last word on this particular subject, but to be an example of how the ideas in this chapter can be applied, and to make the next such examination easier. - -The subject of this case study is **Prns**, a project published at the repository `github.com/KenAKAFrosty/Prns`, presented as a “ground-up implementation of Reticulum, written in Rust”, marketed as faster, safer, and more strictly tested than the reference, widely promoted with the claim of “up to 89× the throughput” of the reference implementation, and an “author” actively engaged in the tactics described in [A Movement Of A Dozen](#brandolinis-recycled-wine) on online platforms. The record described below is the project’s own, and sourced from its GitHub repository, analyzed locally. - -### The Project In Brief - -* **Time span.** 3,374 commits between 2026-05-26 and 2026-09-12: approximately 110 days, - at a mean rate of ~31 commits per day. Monthly: 132 / 1,137 / 1,097 / 805 / 203. - -* **Authorship.** 3,252 of 3,374 commits (96.4%) are authored by a single account. A - second identity, “Prns Tests [tests@example.test](mailto:tests@example.test)” - a fictitious identity on a reserved - domain - contributed 35 commits, every one of them website and marketing content. - -* **Size.** 3,519 tracked files; 1,983 Rust files; 636,226 lines of Rust; approximately - 22.7 MB of Rust source; 69.5 MB of total repository content. - -* **Scope claimed.** A daemon (“drop-in replacement” for the reference daemon), embedded - firmware for three microcontroller families (including six ESP32-S3 board variants and - nRF52840), SDKs and bindings for nine languages, a browser-based node and web flasher, a - twelve-language website, a benchmark apparatus with its own publication and “proof” - pipeline, and a validation hub with oracles, fuzzing, mutation testing, and formal-proof - claims. - -* **Marketing claims.** “Ground-up implementation of Reticulum”; “up to 89× the - throughput”; “48× smaller peak-memory footprint”; “33× the energy efficiency”; - “Measured, not just claimed”; “Enforced, then audited”; “byte-for-byte wire parity with - the reference implementation”; “works with Sideband, NomadNet, MeshChat, etc.”; - “no_std (no alloc required either)”. - -* **Status at the time of writing.** Version 0.3.7; published version history begins at - 0.3.0. The repository continues to receive commits. - -### Question 1: Is this a clean implementation, or was it directly generated from the reference? - -The first of the two deciding questions from [Evaluating A Reticulum Implementation](#brandolinis-evaluating) is settled by the project’s own record. An actual [clean-room](#brandolinis-cleanroom-delusion) implementation, reasoned out and written by humans, would owe nothing to any license. The data available shows clearly that Prns is not that. - -* **The founding state.** The first commit, “Scaffold Personal Reticulum suite”, contains - the scaffolding of not one but two ports - `personal-rns` and `personal-lxmf`, the latter - being the reference’s companion messaging protocol - together with a daemon scaffold and - a 233-line founding document, `docs/build-ethos.md`. That document declares the project’s - goal as a “performance-focused drop-in-replacement for rnsd” and its governing principle - as: “Port the contract, not the implementation.” It further states directly to the - machine-loop, that **“You owe the reference fidelity at exactly two boundaries: - The wire… The behavior. … Between those two boundaries, the model is yours”**. - At this point, the very first commit, effectively the whole of the implementation design - and any relevant decisions are handed over to the LLM. - -* **Continuous ingestion from the reference.** 506 commits reference RNS or Reticulum - source behaviour; the word “parity” appears in 49 commit messages. Commits cite the reference - implementation’s own source locations (for example `Transport.py:1367`) when correcting - their own divergences and mistakes. - -* **Byte-level fidelity as an explicit goal.** Within 48 hours of the first commit, the - record shows a “crypto adapter - vetted primitives, byte-exact vs RNS 1.3.1”, and a wire - implementation matching the reference’s packet header layout. The project’s own - validation apparatus decodes wire vectors using the reference implementation’s own - packet parser, and the interop suite consists of real, stock-RNS peer nodes - that is, - the reference source itself, used as the ground truth against which this LLM output is - checked, and committed as accepted and verified after 48 hours of the project’s recorded start. - -* **The marketing mismatch.** The same record that documents all of the above describes the - project, publicly, as “a ground-up implementation of Reticulum” - while declining, on its - website, to link to the reference implementation at all: the entire tree mentions the - reference’s author in six files, and the website in none. - -Conclusion: the project’s own history and commit record establishes that it was generated directly from the reference implementation’s source code, not reasoned out from the public-domain protocol. It is a derivative of licensed work within the meaning of [the Reticulum License](#brandolinis-what-the-license-is) and [general copyright law](#brandolinis-copyright-and-layers). The “ground-up” claim, which carries its entire legal and marketing posture, is disproven by the project’s own history. - -### Question 2: Who, or what, is the agent of the work? - -The second deciding question is answered by the application of [Assistance Versus Machine Substitution](#brandolinis-assistance-versus-substitution) criteria to the project. - -**Scope that no human could have authored** - -636,226 lines of Rust in 110 days is approximately 5,800 lines per day, every day, including weekends - with 149 commits recorded between midnight and 06:00, and Saturday the single busiest weekday. No human review or decision capacity is commensurable with this volume; the review capacity and the output volume are structurally incommensurable, which is the definition of unauthored scope. - -**Uniform generation** - -The record shows no sign of human development, growth, or learning: No contested decisions, no style drift. Instead: endless renaming (in the first 48 hours: `State → EngineState → TickInput → TickOutput`), uniform fluent register in every commit, and the exact same, synthetic voice in code, documentation, and website copy. - -**Discovery by regeneration** - -Corrections arrived by the machine’s own subsequent runs, recorded as planned milestones. In early July 2026, a series of “core review” commits documented, in the project’s own words: - -* announce-ID history “was unbounded per-slot growth” (`54cc8d601`); -* interface announce limiting could “leak a sustained flood” (`9d27af75c`); -* a “phantom-airtime leak” where frames “used to vanish silently” (`4ed75ffdd`); -* Group-packet deduplication “which RNS does not do” - a behaviour the reference never had, - implemented and later removed (`edd8e72be`); -* “both `unwrap_or(&[])` arms were unreachable dead defaults” (`74bea355e`); -* a benchmark crate “hasn’t compiled since” a prior rename, undetected for weeks because it - was outside the CI’s workspace (`86240b027`). - -Earlier still: the record shows a “>1 MiB RNS-to-Prns interop stall” closed three weeks in -(`cc4d524a3`), and a known send-path hang shipped with the note “typed fast-fail a -candidate for later” (`a010e6613`). - -**Laundered provenance** - -The repository contains a committed commit-message hook (`.githooks/commit-msg`) that *blocks* any commit containing attribution for machine generation (“generated with claude/codex/copilot/cursor/gemini”, “co-authored-by”), with the explanation “The committer owns the commit”. The contributing guide is explicit: “AI tools … are welcome … what you submit is *yours*”, and describes the contributing population as “both human and automated contributors”. The fictitious “Prns Tests” identity completes the picture: A manufactured, unknowable contributor, used for marketing content. - -**Authorship by assignment** - -The human whose name is on the work cannot answer for it, because the choices were never made by a human, and only the general shape and constraints of the outward presentation was. Nothing in the project’s history shows an individual explaining a design decision, accepting a mistake in the first person, or going deeper under technical questioning; the record shows process language and marketing instead. Per the earlier mentioned test: any other person could have pressed the same button, and nothing would be different. The project is effectively unowned, and void of value. - -By the criteria of [Assistance Versus Machine Substitution](#brandolinis-assistance-versus-substitution), this is substitution. The machine was the agent of the work; the “author” was a facade. - -### The performance claims - -The project’s central marketing claim - “up to 89× the throughput” of the reference - is also its most completely documented failure, because the project published the evidence of its own measurement. The apparatus, the results, and the problems are all on the record. - -**The claim** - -The README states “up to 89× the throughput”; the on-network marketing page repeats “up to 89× the throughput, 48× smaller peak-memory footprint, and 33× the energy efficiency of stock RNS 1.4.2”; the website’s front page carries the tagline “Measured, not just claimed”. - -**The apparatus** - -The reference is loaded through `benchmarks/reference/compiled_reference.py`, which installs `pyximport` and then asserts two things: that `RNS.compiled == True`, and that at least *one* RNS module was loaded from a native extension. The project’s own published “proof” records show exactly what those checks captured, on every platform: - -```default -aarch64-apple-darwin: .../RNS.cpython-313-darwin.so, Cython 3.2.8, Python 3.13.13 -x86_64-unknown-linux-gnu: .../RNS.cpython-313-x86_64-linux-gnu.so, gcc 11.4.0 -x86_64-pc-windows-msvc: ~/.prns-oc/lib.win-amd64-cpython-313/RNS.cp313-win_amd64.pyd -``` - -In every case the recorded native module is the **top-level package only** - `RNS.so`, nothing below it. Nothing named `RNS.Transport`, `RNS.Destination`, `RNS.Packet`, `RNS.Link`, or `RNS.Resource` ever appears, because *nothing below the top level was ever compiled*. Nobody bothered to check or verify *anything* here. - -The machine output was simply taken for truth, and a full marketing strategy was spun and produced on it. “RNS 1.4.2 (compiled)” - the label used in every table, chart, and marketing page - *is not a mode of RNS that exists*, but the hallucinations of a machine, which the humans created a marketing strategy on. In reality, it is the old `CRNS` development shim, whose top-level-only, debug-oriented “compilation” is slower than plain interpreted RNS, and which was *defunct for over a year* before these benchmarks were published. - -**Interface choices** - -The harness writes the reference’s configuration itself (`benchmarks/reference/participant_node.py`): `TCPClientInterface` for the initiator, `TCPServerInterface` for the responder and both relay sides, with `UDPInterface` as the abstract wire. The reference was never given its modern `BackboneInterface` on any platform, forcing the slowest possible interrfaces. The interface selection is never mentioned in any methodology text. - -**The policy** - -The published default-policy tables record the asymmetry directly: Prns at 500 Mbps / 128 KiB TCP policy against the reference at 10 Mbps / 8 KiB - slyly footnoted as “preserves each implementation’s normal TCP policy” (in the case of RNS, a conservative default policy that was selected to prioritize coexistence on slower, shared links, requiring the user to dial it up to full speed if they knew what they were doing). Raw transport “throughput” ratios of 20.65× (Linux) and 38.84× (Windows) are therefore mostly policy, not engine. - -**The cross-host evidence** - -The published results show the same scenario producing wildly different ratios by host, and the variance is entirely in the reference artifact: - -| Host | Prns, single-packet | “Reference”, single-packet | Ratio | -|-------------------------|-----------------------|------------------------------|---------| -| macOS (Apple M4) | 37.4k/s | 420/s | 89.09× | -| Linux (i7-1260P) | 25.3k/s | 3.5k/s | 7.19× | -| Windows (Ryzen 5 5600X) | 30.8k/s | 3.9k/s | 8.00× | - -Prns is consistent (25–37k/s). The reference artifact collapses to different depths on different hosts, and the single worst collapse - 420 packets per second on macOS - is the cell selected as the global headline. The “89×” is not a measure of Prns; it is a measure of how badly the broken baseline happened to fail on one host. - -For reality calibration: Stock, interpreted RNS 1.5.4 on an ordinary mid-range laptop, single core, sustains roughly 30,000 single-packet deliveries per second (including ephemeral-key decryption), ~175,000–280,000 packets per second in transit relay, and on the order of 10 Gbps at 16 KiB payloads. The project’s “compiled” artifact measured 420–3,900 packets per second for its single-packet scenario: An order of magnitude or more *below* stock interpreted RNS. The comparison being marketed was not “Rust vs Python”; **it was “an implementation running under optimal conditions versus a mislabeled, broken shim on a slow legacy interface at a severe policy disadvantage”**. - -**The equalized rows** - -The project’s own “1 Gbps policy” rows, in which both sides are explicitly configured identically, publish ratios of roughly 2.4–8.4× across all hosts and scenarios - still against the broken baseline, but nowhere near 89×, and consistent with the ordinary, uncontroversial observation that a native implementation tends to outperform an interpreted one in raw throughput. That point needed no fudging to make, and is banal. - -Interestingly, though, it seems that Prns is really only *marginally* faster than a Python implementation, running in interpreted mode, on a single CPU core. - -**Assessment** - -The front page says “Measured, not just claimed.” The record shows the opposite ordering: claimed, and arranged to look measured. No methodology section anywhere states what “compiled” means, that it is a deprecated development shim, that it builds debug targets, or which interface the reference was given; the one statement of the policy asymmetry appears in a footnote of the results tables themselves. If they did not need to fudge it, they would have published the method clearly. - -### Overall Evaluation - -Evaluated against the conditions of [Evaluating A Reticulum Implementation](#brandolinis-evaluating): - -* **Provenance and attribution.** Fails: The fake “ground-up” origin story; zero reference links - on the website; a single well-hidden link in the README; a license file reading - `Copyright (c) 2026 The Prns Authors` over work directly generated from the licensed reference; - no original copyright or permission notice anywhere. - -* **Agency and answerability.** Fails on every criterion of [Assistance Versus Machine Substitution](#brandolinis-assistance-versus-substitution): - Unauthored scope, uniform generation, discovery by regeneration, laundered provenance, - authorship by assignment. - -* **Engineering.** Fails: The benchmark apparatus above; interop demonstrated only - against a pinned, outdated reference version over loopback while the marketing claims current - parity, interop failures with stock RNS; vendored prebuilt binaries and a republished fork - of an upstream crate (`nrf-softdevice 0.1.0-prns.1`) with no verifiable provenance; - committed WASM bundles. - -* **Network behaviour.** Fails: Invented spectrum behaviour and compatibility claims - about third-party applications of the reference ecosystem (Sideband, NomadNet, MeshChat) - that are not established by any evidence. - -* **Monetary and influence signals.** The marketing apparatus - website before protocol, - day-three twelve-language marketing, false benchmark headlines, “audited” and “formal proof” - claims - the conformal surface described in [Evaluating A Reticulum Implementation](#brandolinis-evaluating): - is where this project invested. - -### Licensing Analysis - -Applying the two legal layers established in [Copyright & The Two Legal Layers](#brandolinis-copyright-and-layers): - -**Layer A - copyright infringement (license-independent)** - -The record shows a direct copy roundtrip: the licensed reference implementation fed into a machine, transformed, at a scale and cadence no human could review, with a license file asserting a fresh copyright in the operator’s name and no acknowledgment of the work the project was generated from. No substantial, new human creative input is demonstrated anywhere in the record - the founding document explicitly frames the design as an instructed port of the reference’s contract. A primarily machine-generated copy of a copyrighted work, not accompanied by demonstrable substantial human creative input, is a derivative work over which the copier holds no copyright, and a reproduction of which without the original author’s permission infringes the original author’s copyright. This holds under any license, MIT included. The operator’s copyright claim over the result is, on this evidence, not merely unsubstantiated; it is the absence of one, directly asserted in the project’s own writing. - -**Layer B - license conditions (Reticulum License specific)** - -Modern Reticulum - the current wire format, the AES-256-based link encryption, ratchets, the cryptographic machinery as it exists today - has been published under the Reticulum License since April 15, 2025, effective from release 0.9.4 and every release since. As a derivative of that work, the license’s conditions attach: The copyright and permission notice must be included in all copies and substantial portions; the AI-training condition must be honoured; the harm condition must be honoured. The record shows none of the notice requirements met, and a production process that consists of the licensed work being ingested into a machine and regurgitated, at industrial scale and cadence. - -**The cascading consequence** - -Prns is distributed claiming dual MIT/Apache-2.0 licensing. It is, however, a direct derivative of Reticulum-licensed work, and the claimed grant is therefore void. Every downstream project that builds on Prns believing it is MIT/Apache-licensed is building on a grant that does not exist. The users of Prns, and all software developers using it, have in effect, been placed under conditions they were never told about. The “ground-up” claim is not merely false; it is the sole load-bearing element of an entire licensing posture, and it fails spectacularly. - -### Consequences - -The consequences of this pattern are examined in the following sections: The harm to users and to the network in [A Movement Of A Dozen](#brandolinis-movement-of-a-dozen), and the human dimension in [Network Health & Coexistence](#brandolinis-health-and-coexistence). The contribution of this addendum is narrower and intended as an instructive example: This is what a substitution project looks like, in full, on its own record. It is a reference example for [Evaluating A Reticulum Implementation](#brandolinis-evaluating), and it demonstrates, in one case, most of the elements this chapter describes. - -### Verdict - -Applying the three verdicts of [Evaluating A Reticulum Implementation](#brandolinis-evaluating), this project does not meet the standard. It is not “experimental but honest” - it is not labeled as experimental anywhere; the first thing users saw was a polished marketing presence promising a finished, tested, drop-in replacement. It is a project whose central claims are fabricated (the performance apparatus), whose provenance is laundered (the authorship machinery), whose foundation is misrepresented (the “ground-up” story), whose core semantics were learned late and by regeneration, and whose operator cannot possibly answer for any of it. It is also a blatant copyright violation of the reference implementation. - -The proposed conclusion, for users and for the network: Treat the Prns project as hostile regardless of its polished surface, and as a hazard insofar as it invites users onto shared networks. Nothing in this section is a judgment about the people involved; it is a reading of the results produced, their history and how they came to be, which in the regrettable lack of any human authorship is the only thing that can be expected to be held to account. - -### Dating - -This examination reflects the publicly available material as of September 2026; the repository in question continued to receive commits at the time of writing, so readers should treat citations to commits and files as point-in-time evidence. A [forensics snapshot](https://github.com/markqvist/forensics_prns) is publicly available on GitHub. \ No newline at end of file diff --git a/Changelog.md b/Changelog.md index 591f04fa..9ee5d91b 100644 --- a/Changelog.md +++ b/Changelog.md @@ -1,222 +1,3 @@ -### RNS 1.6.1 - -This release brings yet another round of major efficiency, performance and filtering improvements to RNS, and continues the transition towards full network stamp functionality. - -All network stamp types will now be generated and emitted by default. Expect some CPU load once your applications start up for the first time on `1.6.1`, as destination stamps are generated. - -**Changes** -- Enabled network stamp generation by default -- Added ability to filter destination types by hash -- Added hop limiter options both globally and per-interface -- Added super fast announce ingress pre-filtering -- Added filtered traffic stats to `rnstatus` -- Added link traffic stats to `rnstatus` -- Added display of remote transport IDs per client interface in `rnstatus`. -- Ability to inspect filtered traffic, announces, et cetera in `rnstatus` per interface -- Ability to inspect tunnel properties, stamp costs, remote implementation info and more in `rnstatus` -- Added ability to set `client_limit` on `BackboneInterface`, defaults to 500 -- Added ability to configure the maximum amount of stamp workers and worker niceness -- Added ability to place a `blocked_ips` file in your config directory to permanently block IPs -- Added ability to directly blackhole remote transport nodes -- Added ability to configure stamp values and costs for `rngit` -- Added asynchronous, interleaved held announce queue cleaning across all interfaces based on potential announce usability -- Added bidirectional tunnel synthesis on non shared-medium interfaces, with stamp cost and version signalling -- Added announce rate table persistence between instance restarts -- Added default caps for configured auto-connect interface counts -- Added path state info to API path table getters -- Significantly optimized and improved inbound announce filtering and deduplication -- Significantly optimized and reworked the filtering subsystem for scalability across hundreds of interfaces -- Improved `rnpath` display and filtering options -- Improved traffic counting -- Improved path responsiveness tracking -- Improved protocol violation tracking and logging -- Improved path pool and tunnel table culling -- Tuned announce validation caches and other parameters -- Fixed a regression introduced in `1.6.0`, that could cause path table culling to temporarily remove an instance's own local destination paths -- Fixed dataplane egress control state not resetting on `BackboneInterface` client connection recovery -- Fixed a potential logging deadlock -- Fixed a potential exit handler deadlock if a signal arrives mid RPC call -- Fixed missing wanted destination type for interface discovery when local announce filtering was enabled -- Fixed split-instance initial known-destinations load not being available on Android -- Added mitigation for a CPython process fork deadlock dug in stdin handling - -**Verified Retrieval** -You can retrieve and verify this release over Reticulum using the built-in `rngit release` utility. To retrieve only the installation `.whl` package, and the release manifest for future updates, you can use: - -```sh -rngit release rns://7649a50d84610232d1416b41d2896aff/reticulum/reticulum fetch "latest:rns-*.whl" --signer bc7291552be7a58f361522990465165c -``` - -To download all artifacts, including the documentation and source archive, you can use the following command: - -```sh -rngit release rns://7649a50d84610232d1416b41d2896aff/reticulum/reticulum fetch latest:all --signer bc7291552be7a58f361522990465165c -``` - -**Release Signatures** -Release artifacts include a signed `rsm` release manifest and `rsg` signature files that can be validated against the RNS release signing identity `` using `rngit` or `rnid`. To perform an offline verification of all release artifacts using a manifest: - -```sh -rngit release rns_*.rsm verify --signer bc7291552be7a58f361522990465165c -``` - -To verify release artifacts using individual `rsg` files, while also verifying the manifest itself, download the `rsm` and `rsg` signatures, make sure they are in the same folder as the release artifact, and run `rnid` signature verification with the release identity as the required signer: - -```sh -rnid -i bc7291552be7a58f361522990465165c -V rns_*.rsm *.rsg -``` - -The `rnid` utility will then verify the signatures, and display whether they are valid. If the signature cannot be verified, the release has been tampered with and should be discarded. - -### RNS 1.6.0 - -This major release of Reticulum brings significant improvements to resource consumption, performance, stability and resilience, especially for constrained devices and nodes. - -**Memory & Performance Improvements** - -A new, SQLite based storage backend has been implemented, and is now the default. All legacy file-based storage will be auto-migrated to the database-backed store on the first start. If you are using an esoteric system that does not support the `sqlite3` module, Reticulum will automatically fall back to using the file-based storage system. - -The memory management system has been completely reworked, and significantly improved. For long-running transport nodes, this cuts memory consumption by approximately 50%, and for non-transport instances, standalone applications and appliance devices by up to 80%. - -**Path Table Sharding** - -This release implements the initial transport awareness and mechanisms for emergent path table sharding. Transport instances will no longer attempt to hold full inter-network path tables in memory, but keep only paths relevant to the nodes they are transporting traffic for. Unused paths are now kept for much shorter periods of time, and used as a rolling pool that potential new traffic corridors can form into. The system is entirely passive, and adds no inter-node coordination or additional protocol mechanics. The current release brings the foundation, and the upcoming 1.6.x releases will tune, improve it and add the remaining pieces of the functionality. - -**Network Stamps** - -The stamp system, first introduced in LXMF, where it was tested and refined over the last two years, has now been brought into the core of Reticulum to help protect against spam and network abuse. All the relevant core primtives now support stamp generation and verification: - -- Identities can be created with an embedded stamp value. This adds no additional bytes or identity format changes. Generation and verification is completely transparent, and carried within the Reticulum Identity keyset. -- Destinations can now be stamped, and will embed stamps and required link request cost in their announces. The change is backwards-compatible, so even older versions of Reticulum carry stamped announces transparently. Destination stamps are one-time generations, stored and persisted on success, so these have relatively high default target values. Expect some CPU usage when an unstamped destination has its stamp generated for the first time on 1.6.0+. -- Path requests can now be stamped, and are also backwards-compatible. A stamped path request will be carried transparently by non stamp-aware transport nodes. -- Link requests are stamped according to the announced link request cost of the destination. As with all the other primitives, these are also completely transparent and backwards-compatible. The stamp is carried embedded in the ephemeral link request keyset. - -The stamp functionality and requirements will be deployed in a phased transition, so both network operators and application developers have time to update their systems, and any potential bugs and issues can be worked out before the full deployment: - -- Version `1.6.0` implements all the core functionality and primitives, and starts excercising the verification mechanics. By default, no destination and path request stamps are generated yet in this release, and while stamps are checked and verified, they are not *enforced*. However, both stamp emission and enforcement can be enabled in the configuration for testing or early opt-in. Link request stamps *will* be generated, if the destination has announced a cost. -- Version `1.6.1` will enable stamp emission for all network primitives by default. Old, unstamped destinations will have their stamps generated automatically on their first announce, and will start announcing link request costs as configured. Enforcement in this phase will still be disabled by default, but can be enabled by configuration. -- Version `1.6.2` will complete the transition to network stamps. All functionality will now be enabled by default, including enforcement. Destination announces, path requests and link requests that do not meet stamp requirements will be dropped. Any old transport nodes that have not updated to `1.6.x` will not be able to communicate with stamp-enforcing nodes, but will still *carry traffic for* stamp-capable systems. - -The `1.6.0` and `1.6.1` releases will be an important time for observing the on-network behaviour, functionality and stability of the system, and to make any potential adjustments or fix problems before the final transition to `1.6.2`. If you're operating a transport node, please help out by reporting any problems or issues you discover. - -**For application developers**, there is no immediate refactoring or changes required application-side. Simply updating RNS to `1.6.0` is sufficient to transparently enable all the new functionality and improvements. It is very much recommended, however, to familiarize yourself with the new API methods for specifying link request costs and destination values, as these are configurable on a per-destination basis, and might warrant specific configuration for your intended use-case. - -**Changes** -- Added `Identity` stamps -- Added destination and announce stamps -- Added path request stamps -- Added link request stamps -- Added link request cost signalling to announces -- Added fractional stamp value support -- Added path usage tracking -- Added automatic path table culling based on traffic and usage -- Added path retainment prioritization for slow interfaces -- Added unused path pool monitoring and handling -- Added managed storage backend using SQLite -- Added fallback to legacy file-based storage if SQLite is unavailable -- Added managed storage for known destinations and ratchets -- Added managed storage for cached announces -- Added memory-density optimized announce rate table implementation -- Added memory-density optimized packet hashlist implementation -- Added heap-tracking memory management -- Added more comprehensive metrics to status output structure -- Added improved filtering backend capabilities -- Added new `[filter]` configuration section -- Added `hop_limiter` configuration option -- Added allow and ignore lists for destination types -- Added ability for applications to receive required announces only -- Added cost-aware interface discovery and auto-connects -- Added cost and value display to `rnstatus` and `rnpath` utilities -- Added `app_flag` signalling to resource advertisements -- Added link MTU aware resource advertisements -- Significantly improved inbound announce handling performance -- Significantly improved stamper performance on Android -- Significantly improved announce handler callback performance -- Optimized and improved stamper implementation -- Optimized announce rate table handling -- Optimized packet filter hashlist handling -- Improved early filtering and malformed packet detection -- Improved path request protocol violation handling -- Fixed `RNodeInterface` phy stats regression on Android -- Fixed missing interface parameter inheritances -- Fixed `rngit` default config path typo for `~/.config/rngit` case -- Fixed invalid RPC error handling in some cases -- Fixed various minor bugs and inconsistencies -- Updated documentation - -### 2026-10-05: RNS 1.5.7 - -This maintenance release fixes a bug in the dataplane egress control handling. - -**Changes** -- Fixed egress control TX stall state deadlock on BackboneInterface initiator instances - -### 2026-10-02: RNS 1.5.6 - -This maintenance release improves interface discovery handling. - -**Changes** -- Fixed ephemeral transport identity being possible when discoverable interfaces are present on non-transport instances -- Ensure only transport-enabled interfaces are autoconnected at discovery time - -### 2026-09-29: RNS 1.5.5 - -This release adds live interface attach, detach and reload, as well as significant improvements to interface discovery. Auto-connecting interfaces is now also supported on Windows and macOS. - -It also brings improvements to `rngit` and fixes discovered `I2PInterface` configuration snippets, along with a number of other bugs. - -**Changes** -- Added ability to `--attach`, `--detach` and `--reload` interfaces to the `rnstatus` utility -- Added interface discovery auto-connect support on Windows and macOS -- Added ability to download micron-converted versions of markdown files to the `rngit` page node -- Added workdoc counts to filter scope links to the `rngit` page node -- Added version info to `rnstatus` discovered interfaces output -- Added `--show-stale` and `--show-unknown` options to `rnstatus` -- Added sequential naming of auto-connected interfaces on announced name collisions -- Added auto-connect implementation and version criteria filtering -- Added configuration option for allowing auto-connects to discovered interfaces with missing version info -- Improved sanitization of nonsensical interface discovery IFAC announce data -- Fixed `I2PInterface` discovery config snippets not including `.b32.i2p` -- Fixed timeout and response rejects not being processed for single-packet requests, by **JRG** -- Fixed missing configurable property propagations on spawned interfaces, by **JRG** -- Fixed ingress control producer comprehension at mid-watermark using incorrect variable name for interface type check, by **JRG** -- Fixed instances of `announce_cap` property ensurance logic not storing announce cap value as a fraction, by **JRG** -- Fixed a potential race condition in `LocalInterface` initialization. -- Updated documentation and manual - -### 2026-09-11: RNS 1.5.4 - -This release improves RNode BLE connectivity reliability on desktop operating systems. - -**Changes** -- Fixed RNode BLE device address acquisition on windows, by **Nickie Deuxyeux** -- Fixed RNode BLE re-connection deadlock on desktop -- Improved RNode BLE reconnect reliability - -### 2026-09-10: RNS 1.5.3 - -This maintenance release adds functionality to, and fixes bugs in `rngit`, and includes a few other optimizations and improvements. - -**Changes** -- Added media request handler to `rngit`, for serving images to `nomadnet` clients -- Added media conversion handler to `rngit`, auto-converting images to webp -- Added importable helper method for using the `rngit` media converter in other programs -- Added a `no_ident` template to the `rngit` page node -- Added immediate activation of changed permissions with `rngit perms` -- Added optimized HDLC framer -- Fixed `rngit` repo admins not being able activate/complete workdocs from other users, by **Bergie** -- Fixed a typo, I'm positively certain this is the last one - -### 2026-08-28: RNS 1.5.2 - -This maintenance release fixes a regression in resource transfers that was introduced in 1.5.1, an `I2PInterface` bug, and sets dataplane control parameters to default values that are actually sensible. If you installed `1.5.1`, it's update time again, baby. - -**Changes** -- Tuned dataplane control parameters -- Added example for blocking unidentified page node peers to `rngit` default config -- Fixed regression in resource transfers causing some `rngit` file downloads to fail -- Fixed keepalive frames being passed to transport core on `I2PInterface` - ### 2026-08-28: RNS 1.5.1 This release focuses on dataplane control, memory bounding and transport throughput, with adaptive ingress and egress control for interfaces, a new (and very efficient) zero-copy coalescing transmit buffer, an optimized HDLC deframer, and a range of other improvements to the inbound packet processing paths. It also introduces support for live profiling, and various new diagnostics output in `rnstatus`, along with a number of bug fixes and general improvements. @@ -263,6 +44,34 @@ This release focuses on dataplane control, memory bounding and transport through - Fixed a latent bug in the AES module, where an exception would not resolve it's exception description correctly, and instead raise another exception. - Removed dead Python 2 code from `umsgpack` +**Verified Retrieval** +You can retrieve and verify this release over Reticulum using the built-in `rngit release` utility. To retrieve only the installation `.whl` package, and the release manifest for future updates, you can use: + +```sh +rngit release rns://7649a50d84610232d1416b41d2896aff/reticulum/reticulum fetch "latest:rns-*.whl" --signer bc7291552be7a58f361522990465165c +``` + +To download all artifacts, including the documentation and source archive, you can use the following command: + +```sh +rngit release rns://7649a50d84610232d1416b41d2896aff/reticulum/reticulum fetch latest:all --signer bc7291552be7a58f361522990465165c +``` + +**Release Signatures** +Release artifacts include a signed `rsm` release manifest and `rsg` signature files that can be validated against the RNS release signing identity `` using `rngit` or `rnid`. To perform an offline verification of all release artifacts using a manifest: + +```sh +rngit release rns_*.rsm verify --signer bc7291552be7a58f361522990465165c +``` + +To verify release artifacts using individual `rsg` files, while also verifying the manifest itself, download the `rsm` and `rsg` signatures, make sure they are in the same folder as the release artifact, and run `rnid` signature verification with the release identity as the required signer: + +```sh +rnid -i bc7291552be7a58f361522990465165c -V rns_*.rsm *.rsg +``` + +The `rnid` utility will then verify the signatures, and display whether they are valid. If the signature cannot be verified, the release has been tampered with and should be discarded. + ### 2026-08-22: RNS 1.5.0 This release significantly improves the core Transport handling of RNS, with a priority-based ingress queue backend, substantially improved efficiency of both data and management traffic handling, more efficient ingress/egress limiting, and a long list of other improvements and bugfixes. diff --git a/Contributing.md b/Contributing.md index 38372f79..3965f844 100644 --- a/Contributing.md +++ b/Contributing.md @@ -2,66 +2,57 @@ Welcome, and thank you for your interest in contributing to Reticulum! -Before interacting with this community, read these short and simple guidelines. - -If you didn't shit your pants after reading this document, you may well find that we are all really quite cuddly and nice to be around. Mostly. +Apart from writing code, there are many ways in which you can contribute. Before interacting with this community, read these short and simple guidelines. ## Expected Conduct -First and foremost, there is one simple requirement for taking part in the development of this technology: While we primarily interact virtually, your actions matter and have real consequences. Therefore: **Act like a responsible, civilized person** - especially in the face of disputes and heated disagreements. Speak your mind here; discussions are welcome. Just do so in the spirit of being face-to-face with everyone else. Thank you. +First and foremost, there is one simple requirement for taking part in this community: While we primarily interact virtually, your actions matter and have real consequences. Therefore: **Act like a responsible, civilized person** - especially in the face of disputes and heated disagreements. Speak your mind here; discussions are welcome. Just do so in the spirit of being face-to-face with everyone else. Thank you. -In order to keep the discourse navigable and useful, the following types of posts and inquiries will be deleted and ignored: +In order to keep the discussion forums and issue trackers navigable and useful, the following types of posts will be deleted without notice: - Spam. -- Questions that have already been adequately answered elsewhere. Utilize search functions. -- Low-effort posts or comments that contain no actual information or useful substance. [This is not a tea-house](./This%20Is%20Not%20a%20Teahouse.md). +- Questions that have already been adequately answered elsewhere. Use the search function. +- Low-effort posts or comments that contain no actual information or useful content. This is not a tea-house. - Post or comments solely containing personal opinions or beliefs without adding anything to the discussion. Facebook and X exists. - Content that simply waste the developer's / maintainer's time with completely obvious "ideas", "insights" or "recommendations". Yes, we have *at least* 8 neurons ourselves. - Posts that fail to understand that developing a highly complex software project with a very small amount of resources and people takes time. Imagining perfection on our behalf is useless. -If you're new to the community and start out your engagement with any of the above transgressions, you will simply be banned permanently without notice or explanation, and any further communication from you will be ignored. - -Except for the case of real, well-grounded, clearly documented, human-written security advisories, technical investigations or bug reports, if your inquiry or communication is not attached to a Reticulum Identity, expect it to be ignored. +If you're new to the community and start out your engagement with any of the above transgressions, you will simply be banned without notice or explanation, and your post will be deleted. If you find this "harsh", "unfair" or "unwelcoming", go somewhere else. This is not social club, but a work environment for the people contributing to the project. -## Reporting Bugs +## Asking Questions -If you have found a bug or issue in this project, please report it to the maintainer over LXMF, or if strictly not possible, over email. Detailed and serious bug reports can also be posted in the various on-network forums and RRC channels that the developers frequent. Due to the realities described in [This Is Not a Teahouse](./This%20Is%20Not%20a%20Teahouse.md), there is no way to report issues or request features over the internet. +If you want to ask a question, **do not open an issue**. The issue tracker is used by people *working on Reticulum* to track bugs, issues and improvements. Instead, ask away on the [discussions](https://github.com/markqvist/Reticulum/discussions). + +Do not post feature requests or general ideas on the issue tracker, or in direct messages to the primary developers. You are much more likely to get a response and start a constructive discussion by posting your ideas in the public channels created for these purposes. + +## Reporting Issues + +If you have found a bug or issue in this project, please report it using the [issue tracker](https://github.com/markqvist/Reticulum/issues). Be sure to include details on how to reproduce the bug. + +Anything submitted to the issue tracker that does not follow these guidelines will be closed and removed without comments or explanation. ## Writing Code -Patches and code contributions are *generally* only welcomed from developers already known to the community, with a proven track-record of competence, skill, careful and considerate design and responsible conduct. If we do not know you yet, but you have created something that you believe lives up to such standards, we are eager to hear from you. +If you are interested in contributing code, fixing open issues or adding features, please coordinate the effort with the maintainer or one of the main developers **before** submitting a pull request. Before deciding to contribute, it is also a good idea to ensure your efforts are in alignment with the [Roadmap](./Roadmap.md) and current development focus. -Current development priorities and work documents are not publicly available on the internet, but shared and coordinated directly between the developers over Reticulum itself, following the principles outlined in [Distributed Development](https://reticulum.network/manual/distributed.html). +Pull requests have a high chance of being accepted if they are: -## Commit Signing +- In alignment with the [Roadmap](./Roadmap.md) or solve an open issue or feature request +- Sufficiently tested to work with all API functions, and pass the standard test suite +- Functionally and conceptually complete and well-designed +- Not simply formatting or code style changes +- Well-documented -All commits in Reticulum and related projects **must** be signed with a Reticulum identity. If you want your author credentials to be included directly in the commit log, ensure that you have [configured commit signing](https://reticulum.network/manual/git.html#commit-signing). Bare patches submitted manually or fetched remote commits without signatures are still very welcome, but we will review, squash merge and sign with the key of the maintainer that approved the changes. Attribution will be provided in the commit message instead (unless you wish to remain anonymous). +Even new ideas and proposals that have not been approved by a maintainer, or fall outside the established roadmap, are *occasionally* accepted - if they possess the remaining of the above qualities. If not, they will be closed and removed without comments or explanation. -## Machine Assistance & LLMs +## Generative AI Policy -For a highly complex, critical piece of cryptographically based networking infrastructure, we should not need to state the following, but alas, experience has proven otherwise. Therefore: +Contributions written using large language models (LLMs) or other generative 'AI' programs are prohibited. LLMs produce errors so frequently and in a way that is so unlike human error that such issues are incredibly time-consuming to spot and fix. This is not a worthwhile tradeoff for Reticulum. -**Including material generated using LLMs or other "AI" programs in Reticulum is, almost without exception, prohibited.** - -Before even *thinking* about using a generative software system to "create" something for Reticulum, read [Brandolini's Reference](https://reticulum.network/manual/brandolinis.html), in full. If you do not have the capacity for that, you have failed the first requirement for contributing: Basic literacy. - -*If* you are not already a known contributor with a proven record of being able to responsibly handle these tools, a **full** audit trail of all ML-utilizing workflows, including prompts, LLM reasoning traces, tool calls and outputs (that is, the *entire*, unaltered session log) will need to be provided with any proposed contribution. Without that, we will not even *consider* looking at it. - -This applies to all Reticulum-related projects and documentation, as well as all submitted issues, reports and discussion, **except** of course in cases where language translation, speech recogntion, or other assistive technologies are required. - -In **all** circumstances, clear disclosure is **mandatory**. Any piece of material, file, code snippet, method, function or similar that was generated with machine assistance must be prepended with a disclosure header or comment that states the framework, exact model used and reviewer, such as: - -```python -# Generated with lc/deepseek_v4_flash_q8_k_xl -# Reviewed and corrected by Mark Qvist -``` - -Additionally, any explanatory comments or doc-strings generated by software must be manually re-written in clear, concise language by the reviewer stated in the disclosure header. +This applies to all Reticulum-related projects and documentation, as well as all submitted issues and discussion in official channels, except in cases where language translation and/or speech recogntion technologies are required for communication. ## Contributor License Agreement By contributing code to this project, you agree that copyright for the code is transferred to the Reticulum maintainers and that the code is irrevocably placed under the [Reticulum License](./LICENSE). - -For a more in-depth elaboration on the current CLA position, see [this post](https://rns.recipes/forum/general/brandolinis-reference-or-alternatively-agentsmd?page=1#post-3002). diff --git a/Examples/Link.py b/Examples/Link.py index f0a37ca5..b2463075 100644 --- a/Examples/Link.py +++ b/Examples/Link.py @@ -42,9 +42,6 @@ def server(configpath): "linkexample" ) - # We can optionally configure a link request stamp cost - server_destination.set_link_cost(14.2) - # We configure a function that will get called every time # a new client creates a link to this destination. server_destination.set_link_established_callback(client_connected) diff --git a/Examples/Resource.py b/Examples/Resource.py index 2cd55107..896c936a 100644 --- a/Examples/Resource.py +++ b/Examples/Resource.py @@ -92,7 +92,6 @@ def resource_concluded(resource): if resource.status == RNS.Resource.COMPLETE: RNS.log(f"Resource {resource} received") RNS.log(f"Metadata: {resource.metadata}") - RNS.log(f"Application flag is {'set' if resource.app_flag else 'not set'}") RNS.log(f"Data length: {os.stat(resource.data.name).st_size}") RNS.log(f"Data can be read directly from: {resource.data}") RNS.log(f"Data can be moved or copied from: {resource.data.name}") @@ -193,22 +192,16 @@ def client_loop(): RNS.log(f"First 32 bytes of data: {RNS.hexrep(data[:32])}") # Generate some metadata - metadata = {"text": random_text_generator(), - "numbers": [1,2,3,4], "blob": os.urandom(16)} - - # An optional application-specific flag can be set - flag_set = True + metadata = {"text": random_text_generator(), "numbers": [1,2,3,4], "blob": os.urandom(16)} # Send the resource - resource = RNS.Resource(data, server_link, metadata=metadata, app_flag=flag_set, - callback=resource_concluded_sending, auto_compress=False) + resource = RNS.Resource(data, server_link, metadata=metadata, callback=resource_concluded_sending, auto_compress=False) # Alternatively, you can stream data # directly from an open file descriptor # with open("/path/to/file", "rb") as data_file: - # resource = RNS.Resource(data_file, server_link, metadata=metadata, - # callback=resource_concluded_sending, auto_compress=False) + # resource = RNS.Resource(data_file, server_link, metadata=metadata, callback=resource_concluded_sending, auto_compress=False) except Exception as e: RNS.log("Error while sending resource over the link: "+str(e)) diff --git a/README.md b/README.md index f04c6b0e..2e2f8b2e 100755 --- a/README.md +++ b/README.md @@ -1,32 +1,40 @@ Reticulum Network Stack ========== -> [!WARNING] -> A significant number of hastily launched, incorrect, dubious, directly harmful and, in most cases, entirely LLM-generated fakes of Reticulum implementations, "documentation", "guides" and user-facing applications are currently being marketed under polished, but ultimately misleading or outright deceptive claims. -> -> For more detailed information, see the relevant sections of the [Brandolini's Reference](https://reticulum.network/manual/brandolinis.html) chapter of the manual. Known good community implementations are listed in the [Community Implementations](#community-implementations) section of this readme. For software and projects recognized by the Reticulum community, see the [Programs Using Reticulum](https://reticulum.network/manual/software.html) chapter of the manual. -> -> Machine-generated content derived from the RNS source code or documentation (such as "implementations", "guides" for sale, et cetera), are in several, well-documented cases violating the open source licenses that granted rights of copying and distribution. -> -> Any claimed assertion of copyright or grant of license (Apache, GPL, et cetera) that such projects are making are [void grants](https://reticulum.network/manual/brandolinis.html#void-grants-legal-foundations-of-machine-generated-code). Both the violators themselves, and all downstream projects using the infringing derivatives, are **directly** and personally liable for the legal consequences. -> -> Do **not** use these "projects", they are a hazard to the entire ecosystem we have been carefully building over the last ten years. -

*This repository is [a public mirror](./MIRROR.md). All development is happening elsewhere.* To understand the foundational philosophy and goals of this system, read the [Zen of Reticulum](Zen%20of%20Reticulum.md). -Reticulum is the cryptography-based networking stack for building local and wide-area networks with readily available hardware. It can operate even with very high latency and extremely low bandwidth. Reticulum allows you to build wide-area networks with off-the-shelf tools, and offers end-to-end encryption and connectivity, initiator anonymity, autoconfiguring cryptographically backed multi-hop transport, efficient addressing, unforgeable delivery acknowledgements and more. +Reticulum is the cryptography-based networking stack for building local and wide-area +networks with readily available hardware. It can operate even with very high latency +and extremely low bandwidth. Reticulum allows you to build wide-area networks +with off-the-shelf tools, and offers end-to-end encryption and connectivity, +initiator anonymity, autoconfiguring cryptographically backed multi-hop +transport, efficient addressing, unforgeable delivery acknowledgements and +more. -The vision of Reticulum is to allow anyone to be their own network operator, and to make it cheap and easy to cover vast areas with a myriad of independent, inter-connectable and autonomous networks. Reticulum **is not** *one* network. It is **a tool** for building *thousands of networks*. Networks without kill-switches, surveillance, censorship and control. Networks that can freely interoperate, associate and disassociate with each other, and require no central oversight. Networks for human beings. *Networks for the people*. +The vision of Reticulum is to allow anyone to be their own network operator, +and to make it cheap and easy to cover vast areas with a myriad of independent, +inter-connectable and autonomous networks. Reticulum **is not** *one* network. +It is **a tool** for building *thousands of networks*. Networks without +kill-switches, surveillance, censorship and control. Networks that can freely +interoperate, associate and disassociate with each other, and require no +central oversight. Networks for human beings. *Networks for the people*. -Reticulum is a complete networking stack, and does not rely on IP or higher layers, but it is possible to use IP as the underlying carrier for Reticulum. It is therefore trivial to tunnel Reticulum over the Internet or private IP networks. +Reticulum is a complete networking stack, and does not rely on IP or higher +layers, but it is possible to use IP as the underlying carrier for Reticulum. +It is therefore trivial to tunnel Reticulum over the Internet or private IP +networks. -Having no dependencies on traditional networking stacks frees up overhead that has been used to implement a networking stack built directly on cryptographic principles, allowing resilience and stable functionality, even in open and trustless networks. +Having no dependencies on traditional networking stacks frees up overhead that +has been used to implement a networking stack built directly on cryptographic +principles, allowing resilience and stable functionality, even in open and +trustless networks. -No kernel modules or drivers are required. Reticulum runs completely in userland, and can run on practically any system that runs Python 3. +No kernel modules or drivers are required. Reticulum runs completely in +userland, and can run on practically any system that runs Python 3. ## Read The Manual The full documentation for Reticulum is available at [markqvist.github.io/Reticulum/manual/](https://markqvist.github.io/Reticulum/manual/). @@ -70,20 +78,12 @@ For more info, see [reticulum.network](https://reticulum.network/) and [the FAQ - Low cost of keeping links open at only 0.44 bits per second - Reliable sequential delivery with Channel and Buffer mechanisms -## Community Resources - -The references listed here are not run, managed or moderated by the Reticulum project or its maintainer. They are provided by dedicated, independent volunteers in the community, for the benefit of anyone interested in learning more about Reticulum. - -- [Reticulum Community Wiki](https://reticulum.miraheze.org/wiki) -- [RNS Recipes](https://rns.recipes/) -- [RNS Moscow](https://rns.moscow/) -- [RMAP.world](https://rmap.world/) - -If you find anything that is no longer accurate, incorrect or simply not quite up to date, do not demand or complain towards the maintainers of these resources. Instead, take the task upon yourself to help out and improve things by working on, and offering the contributions you would like to see, like the creators of the above did themselves. - ## Reference Implementation -The Python code in this repository is the Reference Implementation of Reticulum. The Reticulum Protocol is defined entirely and authoritatively by this reference implementation, and its associated manual. It is maintained by Mark Qvist, identified by the Reticulum Identity ``. +The Python code in this repository is the Reference Implementation of Reticulum. +The Reticulum Protocol is defined entirely and authoritatively by this reference +implementation, and its associated manual. It is maintained by Mark Qvist, +identified by the Reticulum Identity ``. No second-order protocol specification derivatives currently do, or will ever exist. You can't get a better specification than one that is executable, functional, testable, deployed and operating 24/7 across the planet. @@ -91,39 +91,18 @@ There is not, and never will be a separate, derived "formal spec", "RFC" or anyt **The reference implementation *is* the final, authoritative specification.** -Compatibility with the Reticulum Protocol is defined as having full interoperability, and sufficient functional parity with this reference implementation. Any specific protocol implementation that achieves this is Reticulum. Any that does not is not Reticulum. +Compatibility with the Reticulum Protocol is defined as having full interoperability, +and sufficient functional parity with this reference implementation. Any specific protocol +implementation that achieves this is Reticulum. Any that does not is not Reticulum. The reference implementation is licensed under the Reticulum License. The Reticulum Protocol was dedicated to the Public Domain in 2016. -## Community Implementations - -The implementations listed here have demonstrated wire-compatibility, sufficient feature parity, sensible security and development practices, long-term commitment and care for implementation quality. Additionally, they have a track record of at least 18 months of active development. - -Most importantly, their developers and maintainers are recognized by the community to actually know what they are doing, and as having a commitment to improving the overall Reticulum ecosystem. - -- [Chad Atterman's](https://github.com/attermann) [microReticulum](https://github.com/attermann/microReticulum/) is a C++ implementation targeting 32-bit micro-controllers. -- [Quad4's](https://quad4.io/) [Reticulum-Go](https://reticulum-go.quad4.io/) is a Go implementation targeting both desktop, mobile and embedded systems. - -*If you are the maintainer of an implementation not listed above, and believe that it deserves inclusion by following the same standards of rigor and commitment, your proposal will be welcomed.* - ---- - -**Warning!** A significant number of hastily launched, incorrect, dubious, directly harmful and, in most cases, entirely LLM-generated fakes of Reticulum implementations (and user facing applications) are currently being marketed and pushed under polished, but ultimately misleading or outright deceptive claims. Most of these are either quick attention or money grabs, completely unreviewed, incompatible, without maintenance or human oversight, actively trying to fragment the community, or a combination thereof. - ---- - -For more extensive information on this topic, read the [Brandolini's Reference](https://reticulum.network/manual/brandolinis.html) chapter of the manual (for the legal foundations, see [Void Grants](https://reticulum.network/manual/brandolinis.html#void-grants-legal-foundations-of-machine-generated-code) specifically). The chapter is very long, very detailed, and is the polite, measured analysis, intended as an evolving, sectioned reference on these issues. - -If you would rather just have the short, unfiltered and quite angry version, which consists of an enacted response to one particular manifestation of the phenomenon as a whole, used as an example, you can read [Yes, I am Angry](docs/history/2026_09_18_Yes_I_am_Angry.md). It gets the same point across, in a very different language, if you can handle that sort of communication. - -The core Reticulum maintainers and developers **strongly advise against using any such "implementation"**. The [deceitful and self-serving behavior](https://reticulum.network/manual/brandolinis.html#a-persistent-but-fragile-triad) of a small number of either malintented, attention-seeking or incompetent individuals has caused significant [damage and waste of time and resources](https://reticulum.network/manual/brandolinis.html#intent-consequence) for both developers, node operators, users and the community and Reticulum project at large. - -We kindly, but urgently ask all users to excercise caution, common sense and healthy skepticism when [evaluating](https://reticulum.network/manual/brandolinis.html#evaluating-a-reticulum-implementation) the potential use of any implementation not listed above; and to accept that **choosing to do so regardless translates the responsibility for potential damage from an irresponsible or malicious individual onto yourself**. - ## Examples of Reticulum Applications -If you want to quickly get an idea of what Reticulum can do, take a look at the [Programs Using Reticulum](https://reticulum.network/manual/software.html) section of the manual, or the following resources: +If you want to quickly get an idea of what Reticulum can do, take a look at the +[Programs Using Reticulum](https://reticulum.network/manual/software.html) +section of the manual, or the following resources: - [LXMF](https://github.com/markqvist/lxmf) is a distributed, delay and disruption tolerant message transfer protocol built on Reticulum - The [LXST](https://github.com/markqvist/lxst) protocol and framework provides real-time audio and signals transport over Reticulum. It includes primitives and utilities for building voice-based applications and hardware devices, such as the `rnphone` program, that can be used to build hardware telephones. @@ -131,27 +110,50 @@ If you want to quickly get an idea of what Reticulum can do, take a look at the - The Android, Linux, macOS and Windows app [Sideband](https://github.com/markqvist/Sideband) has a graphical interface and many advanced features, such as file transfers, image and voice messages, real-time voice calls, a distributed telemetry system, mapping capabilities and full plugin extensibility. - [MeshChatX](https://git.quad4.io/RNS-Things/MeshChatX) is a full-featured LXMF client with many built-in tools and functionalities, that also supports image and voice messages, file transfers and voice calls. It also includes a built-in page browser for browsing Nomad Network nodes. - You can use the included [rnsh](https://reticulum.network/manual/using.html#the-rnsh-utility) program to establish remote shell sessions over Reticulum. -- The included [rngit](https://reticulum.network/manual/git.html) system provides a full solution for managing, hosting, collaborating on and interacting with Git repositories over Reticulum. ## Where can Reticulum be used? -Over practically any medium that can support at least a half-duplex channel with greater throughput than 5 bits per second, and an MTU of 500 bytes. Data radios, modems, LoRa radios, serial lines, AX.25 TNCs, amateur radio digital modes, WiFi and Ethernet devices, free-space optical links, and similar systems are all examples of the types of physical devices Reticulum can use. +Over practically any medium that can support at least a half-duplex channel +with greater throughput than 5 bits per second, and an MTU of 500 bytes. Data radios, +modems, LoRa radios, serial lines, AX.25 TNCs, amateur radio digital modes, +WiFi and Ethernet devices, free-space optical links, and similar systems are +all examples of the types of physical devices Reticulum can use. -An open-source LoRa-based interface called [RNode](https://markqvist.github.io/Reticulum/manual/hardware.html#rnode) has been designed specifically for use with Reticulum. It is possible to build yourself, or it can be purchased as a complete transceiver that just needs a USB, WiFi or Bluetooth connection to the host. +An open-source LoRa-based interface called +[RNode](https://markqvist.github.io/Reticulum/manual/hardware.html#rnode) has +been designed specifically for use with Reticulum. It is possible to build +yourself, or it can be purchased as a complete transceiver that just needs a +USB connection to the host. -Reticulum can also be encapsulated over existing IP networks, so there's nothing stopping you from using it over wired Ethernet, your local WiFi network or the Internet, where it'll work just as well. In fact, one of the strengths of Reticulum is how easily it allows you to connect different mediums into a self-configuring, resilient and encrypted mesh, using any available mixture of available infrastructure. +Reticulum can also be encapsulated over existing IP networks, so there's +nothing stopping you from using it over wired Ethernet, your local WiFi network +or the Internet, where it'll work just as well. In fact, one of the strengths +of Reticulum is how easily it allows you to connect different mediums into a +self-configuring, resilient and encrypted mesh, using any available mixture of +available infrastructure. -As an example, it's possible to set up a Raspberry Pi connected to both a LoRa radio, a packet radio TNC and a WiFi network. Once the interfaces are configured, Reticulum will take care of the rest, and any device on the WiFi network can communicate with nodes on the LoRa and packet radio sides of the network, and vice versa. +As an example, it's possible to set up a Raspberry Pi connected to both a LoRa +radio, a packet radio TNC and a WiFi network. Once the interfaces are +configured, Reticulum will take care of the rest, and any device on the WiFi +network can communicate with nodes on the LoRa and packet radio sides of the +network, and vice versa. ## How do I get started? -The best way to get started with the Reticulum Network Stack depends on what you want to do. For full details and examples, have a look at the [Getting Started Fast](https://markqvist.github.io/Reticulum/manual/gettingstartedfast.html) section of the [Reticulum Manual](https://markqvist.github.io/Reticulum/manual/). +The best way to get started with the Reticulum Network Stack depends on what +you want to do. For full details and examples, have a look at the +[Getting Started Fast](https://markqvist.github.io/Reticulum/manual/gettingstartedfast.html) +section of the [Reticulum Manual](https://markqvist.github.io/Reticulum/manual/). -To simply install Reticulum and related utilities on your system, the easiest way is via `pip`. You can then start any program that uses Reticulum, or start Reticulum as a system service with [the rnsd utility](https://markqvist.github.io/Reticulum/manual/using.html#the-rnsd-utility). +To simply install Reticulum and related utilities on your system, the easiest way is via `pip`. +You can then start any program that uses Reticulum, or start Reticulum as a system service with +[the rnsd utility](https://markqvist.github.io/Reticulum/manual/using.html#the-rnsd-utility). ```bash pip install rns ``` -If you are using an operating system that blocks normal user package installation via `pip`, you can return `pip` to normal behaviour by editing the `~/.config/pip/pip.conf` file, and adding the following directive in the `[global]` section: +If you are using an operating system that blocks normal user package installation via `pip`, +you can return `pip` to normal behaviour by editing the `~/.config/pip/pip.conf` file, +and adding the following directive in the `[global]` section: ```text [global] @@ -164,14 +166,23 @@ Alternatively, you can use the `pipx` tool to install Reticulum in an isolated e pipx install rns ``` -When first started, Reticulum will create a default configuration file, providing basic connectivity to other Reticulum peers that might be locally reachable. The default config file contains a few examples, and references for creating a more complex configuration. +When first started, Reticulum will create a default configuration file, +providing basic connectivity to other Reticulum peers that might be locally +reachable. The default config file contains a few examples, and references for +creating a more complex configuration. If you have an old version of `pip` on your system, you may need to upgrade it first with `pip install pip --upgrade`. If you no not already have `pip` installed, you can install it using the package manager of your system with `sudo apt install python3-pip` or similar. -For more detailed examples on how to expand communication over many mediums such as packet radio or LoRa, serial ports, or over fast IP links and the Internet using the UDP and TCP interfaces, take a look at the [Supported Interfaces](https://markqvist.github.io/Reticulum/manual/interfaces.html) section of the [Reticulum Manual](https://markqvist.github.io/Reticulum/manual/). +For more detailed examples on how to expand communication over many mediums such +as packet radio or LoRa, serial ports, or over fast IP links and the Internet using +the UDP and TCP interfaces, take a look at the [Supported Interfaces](https://markqvist.github.io/Reticulum/manual/interfaces.html) +section of the [Reticulum Manual](https://markqvist.github.io/Reticulum/manual/). ## Included Utilities -Reticulum includes a range of useful utilities for managing your networks, viewing status and information, and other tasks. You can read more about these programs in the [Included Utility Programs](https://markqvist.github.io/Reticulum/manual/using.html#included-utility-programs) section of the [Reticulum Manual](https://markqvist.github.io/Reticulum/manual/). +Reticulum includes a range of useful utilities for managing your networks, +viewing status and information, and other tasks. You can read more about these +programs in the [Included Utility Programs](https://markqvist.github.io/Reticulum/manual/using.html#included-utility-programs) +section of the [Reticulum Manual](https://markqvist.github.io/Reticulum/manual/). - The system daemon `rnsd` for running Reticulum as an always-available service - An interface status utility called `rnstatus`, that displays information about interfaces @@ -184,13 +195,19 @@ Reticulum includes a range of useful utilities for managing your networks, viewi - The `rngit` program provides a full multi-repository Git node for serving repositories over Reticulum - The included `git-remote-rns` helper allows you to interact with Git repositories over Reticulum -All tools, including `rnx` and `rncp`, work reliably and well even over very low-bandwidth links like LoRa or Packet Radio. For full-featured remote shells over Reticulum, also have a look at the [rnsh](https://github.com/acehoss/rnsh) program. +All tools, including `rnx` and `rncp`, work reliably and well even over very +low-bandwidth links like LoRa or Packet Radio. For full-featured remote shells +over Reticulum, also have a look at the [rnsh](https://github.com/acehoss/rnsh) +program. ## Supported interface types and devices -Reticulum implements a range of generalised interface types that covers most of the communications hardware that Reticulum can run over. If your hardware is not supported, it's [simple to implement a custom interface module](https://markqvist.github.io/Reticulum/manual/interfaces.html#custom-interfaces). +Reticulum implements a range of generalised interface types that covers most of +the communications hardware that Reticulum can run over. If your hardware is +not supported, it's [simple to implement a custom interface module](https://markqvist.github.io/Reticulum/manual/interfaces.html#custom-interfaces). -Contributions of custom interfaces are gratefully accepted, provided they are generally useful and well-tested in real-world usage. +Pull requests for custom interfaces are gratefully accepted, provided they are +generally useful and well-tested in real-world usage. Currently, the following built-in interfaces are supported: @@ -205,42 +222,62 @@ Currently, the following built-in interfaces are supported: - Custom hardware via stdio or pipes ## Performance -*All performance numbers here assume `rnsd` running in fully interpreted Python mode, limited to a single CPU core.* +Reticulum targets a *very* wide usable performance envelope, but prioritises +functionality and performance on low-bandwidth mediums. The goal is to +provide a dynamic performance envelope from 250 bits per second, to 1 gigabit +per second on normal hardware. -Reticulum targets a *very* wide usable performance envelope, but prioritises functionality and performance on low-bandwidth mediums. The goal is to provide a dynamic performance envelope from 100 bits per second, to 10 gigabits per second on normal hardware. - -Currently, the on-network, usable performance envelope is approximately 150 bits per second to 1 gigabit per second on modest hardware. Real-world performance will vary widely with the speed of your system, availability of cryptographic hardware acceleration, and other factors. - -Raw routing throughput for a transport node hosted on a Raspberry Pi 5 is approximately 5 gigabits per second. Systems with modern crypto hardware acceleration can achieve transport throughput of 15 gigabits per second and higher. - -While the reference implementation is perfectly capable of reaching 100+ Gbps, by utilizing multiple CPU cores and vectorized transport, performance beyond the current level is not higly prioritised, since RNS is already able to saturate available physical medium bandwidth in almost all real-world situations. - -The primary objectives for RNS are *reliability*, *correctness*, *security*, *proper traffic management* and *actually practical performance*, not hollow on-paper "benchmarks" with little to no bearing on real-world usability. - -All alternative-implementation maintainers are *highly* encouraged to adopt a similar approach, and especially to focus on getting their implementations working properly and reliably before publishing empirically dubious or factually wrong performance claims. +Currently, the usable performance envelope is approximately 150 bits per second +to 500 megabits per second, with physical mediums faster than that not being +saturated. Performance beyond the current level is intended for future +upgrades, but not highly prioritised at this point in time. ## Current Status -All core protocol features are implemented and functioning, but additions will probably occur as real-world use is explored and understood. The API and wire-format can be considered stable. +All core protocol features are implemented and functioning, but additions will +probably occur as real-world use is explored and understood. The API and wire-format +can be considered stable. ## Dependencies -The installation of the default `rns` package requires only two external dependencies, listed below. Almost all systems and distributions have readily available packages for these dependencies, and when the `rns` package is installed with `pip`, they will be downloaded and installed as well. +The installation of the default `rns` package requires only two external dependencies, listed +below. Almost all systems and distributions have readily available packages for +these dependencies, and when the `rns` package is installed with `pip`, they +will be downloaded and installed as well. - [PyCA/cryptography](https://github.com/pyca/cryptography) - [pyserial](https://github.com/pyserial/pyserial) -On more unusual systems, and in some rare cases, it might not be possible to install or even compile one or more of the above modules. In such situations, you can use the `rnspure` package instead, which require no external dependencies for installation. Please note that the contents of the `rns` and `rnspure` packages are *identical*. The only difference is that the `rnspure` package lists no dependencies required for installation. +On more unusual systems, and in some rare cases, it might not be possible to +install or even compile one or more of the above modules. In such situations, +you can use the `rnspure` package instead, which require no external +dependencies for installation. Please note that the contents of the `rns` and +`rnspure` packages are *identical*. The only difference is that the `rnspure` +package lists no dependencies required for installation. -No matter how Reticulum is installed and started, it will load external dependencies only if they are *needed* and *available*. If for example you want to use Reticulum on a system that cannot support [pyserial](https://github.com/pyserial/pyserial), it is perfectly possible to do so using the `rnspure` package, but Reticulum will not be able to use serial-based interfaces. All other available modules will still be loaded when needed. +No matter how Reticulum is installed and started, it will load external +dependencies only if they are *needed* and *available*. If for example you want +to use Reticulum on a system that cannot support +[pyserial](https://github.com/pyserial/pyserial), it is perfectly possible to +do so using the `rnspure` package, but Reticulum will not be able to use +serial-based interfaces. All other available modules will still be loaded when +needed. -**Please Note!** If you use the `rnspure` package to run Reticulum on systems that do not support [PyCA/cryptography](https://github.com/pyca/cryptography), it is important that you read and understand the [Cryptographic Primitives](#cryptographic-primitives) section of this document. +**Please Note!** If you use the `rnspure` package to run Reticulum on systems +that do not support [PyCA/cryptography](https://github.com/pyca/cryptography), +it is important that you read and understand the [Cryptographic +Primitives](#cryptographic-primitives) section of this document. ## Bootstrapping Connectivity -Reticulum is not a service you subscribe to, nor is it a single global network you "join". Reticulum provides functionality for discovering available public interfaces over the network itself, and the broader community has provided various directories of publicly available entrypoints to bootstrap connectivity. +Reticulum is not a service you subscribe to, nor is it a single global network you "join". +Reticulum provides functionality for discovering available public interfaces +over the network itself, and the broader community has provided various directories +of publicly available entrypoints to bootstrap connectivity. To learn how to establish initial connectivity over Reticulum, read the [Bootstrapping Connectivity](https://reticulum.network/manual/gettingstartedfast.html#bootstrapping-connectivity) section of the manual. -If you already have a general idea of how this works, you can use community-run sites such as [directory.rns.recipes](https://directory.rns.recipes/) and [rmap.world](https://rmap.world) to find interface definitions for initial connectivity to the global distributed Reticulum backbone. +If you already have a general idea of how this works, you can use community-run +sites such as [directory.rns.recipes](https://directory.rns.recipes/) and [rmap.world](https://rmap.world) +to find interface definitions for initial connectivity to the global distributed Reticulum backbone. ## Public Testnet ***Important!** Historically, a developer-targeted testnet was made available by the Reticulum project itself. As the amount of global Reticulum nodes and entrypoints have grown to a substantial quantity, this public testnet, including the Amsterdam Testnet entrypoint, has now been decommissioned. If your still have instances that relied on this entrypoint for connectivity, transition to using the distributed backbone instead. Reticulum now includes a full on-network interface discovery and connectivity bootstrapping system. Read the [Bootstrapping Connectivity](https://reticulum.network/manual/gettingstartedfast.html#bootstrapping-connectivity) section of the manual for pointers.* @@ -265,11 +302,17 @@ For this to be possible, I need your help. Please support the continued developm - Ko-Fi: https://ko-fi.com/markqvist ## Cryptographic Primitives -Reticulum uses a simple suite of efficient, strong and well-tested cryptographic primitives, with widely available implementations that can be used both on general-purpose CPUs and on microcontrollers. +Reticulum uses a simple suite of efficient, strong and well-tested cryptographic +primitives, with widely available implementations that can be used both on +general-purpose CPUs and on microcontrollers. -One of the primary considerations for choosing this particular set of primitives is that they can be implemented *safely* with relatively few pitfalls, on practically all current computing platforms. +One of the primary considerations for choosing this particular set of primitives is +that they can be implemented *safely* with relatively few pitfalls, on practically +all current computing platforms. -The primitives listed here **are authoritative**. Anything claiming to be Reticulum, but not using these exact primitives **is not** Reticulum, and possibly an intentionally compromised or weakened clone. The utilised primitives are: +The primitives listed here **are authoritative**. Anything claiming to be Reticulum, +but not using these exact primitives **is not** Reticulum, and possibly an +intentionally compromised or weakened clone. The utilised primitives are: - Reticulum Identity Keys are 512-bit Curve25519 keysets - A 256-bit Ed25519 key for signatures @@ -284,7 +327,13 @@ The primitives listed here **are authoritative**. Anything claiming to be Reticu - SHA-256 - SHA-512 -In the default installation configuration, the `X25519`, `Ed25519`, and `AES-256-CBC` primitives are provided by [OpenSSL](https://www.openssl.org/) (via the [PyCA/cryptography](https://github.com/pyca/cryptography) package). The hashing functions `SHA-256` and `SHA-512` are provided by the standard Python [hashlib](https://docs.python.org/3/library/hashlib.html). The `HKDF`, `HMAC`, `Token` primitives, and the `PKCS7` padding function are always provided by the following internal implementations: +In the default installation configuration, the `X25519`, `Ed25519`, +and `AES-256-CBC` primitives are provided by [OpenSSL](https://www.openssl.org/) +(via the [PyCA/cryptography](https://github.com/pyca/cryptography) package). +The hashing functions `SHA-256` and `SHA-512` are provided by the standard +Python [hashlib](https://docs.python.org/3/library/hashlib.html). The `HKDF`, +`HMAC`, `Token` primitives, and the `PKCS7` padding function are always +provided by the following internal implementations: - [HKDF.py](RNS/Cryptography/HKDF.py) - [HMAC.py](RNS/Cryptography/HMAC.py) @@ -292,18 +341,39 @@ In the default installation configuration, the `X25519`, `Ed25519`, and `AES-256 - [PKCS7.py](RNS/Cryptography/PKCS7.py) -Reticulum also includes a complete implementation of all necessary primitives in pure Python. If OpenSSL and PyCA are not available on the system when Reticulum is started, Reticulum will instead use the internal pure-python primitives. A trivial consequence of this is performance, with the OpenSSL backend being *much* faster. The most important consequence however, is the potential loss of security by using primitives that has not seen the same amount of scrutiny, testing and review as those from OpenSSL. +Reticulum also includes a complete implementation of all necessary primitives +in pure Python. If OpenSSL and PyCA are not available on the system when +Reticulum is started, Reticulum will instead use the internal pure-python +primitives. A trivial consequence of this is performance, with the OpenSSL +backend being *much* faster. The most important consequence however, is the +potential loss of security by using primitives that has not seen the same +amount of scrutiny, testing and review as those from OpenSSL. -Please note that by default, installing Reticulum will **require** OpenSSL and PyCA to also be automatically installed if not already available. It is only possible to use the pure-python primitives if this requirement is specifically overridden by the user, for example by installing the `rnspure` package instead of the normal `rns` package, or by running directly from local source-code. +Please note that by default, installing Reticulum will **require** OpenSSL and +PyCA to also be automatically installed if not already available. It is only +possible to use the pure-python primitives if this requirement is specifically +overridden by the user, for example by installing the `rnspure` package instead +of the normal `rns` package, or by running directly from local source-code. -If you want to use the internal pure-python primitives, it is **highly advisable** that you have a good understanding of the risks that this pose, and make an informed decision on whether those risks are acceptable to you. +If you want to use the internal pure-python primitives, it is **highly +advisable** that you have a good understanding of the risks that this pose, and +make an informed decision on whether those risks are acceptable to you. -Having been in development for ten, and wider deployment for around five years, Reticulum is relatively young software, and should be considered as such. While it has been carefully built with cryptography best-practices very foremost in mind, there could very well still be privacy or security breaking bugs. +Reticulum is relatively young software, and should be considered as such. While +it has been built with cryptography best-practices very foremost in mind, it +_has not_ been externally security audited, and there could very well be +privacy or security breaking bugs. If you want to help out, or help sponsor an +audit, please do get in touch. ## Acknowledgements & Credits -Reticulum can only exist because of the mountain of Open Source work it was built on top of, the contributions of everyone involved, and everyone that has supported the project through the years. To everyone who has helped, thank you so much. +Reticulum can only exist because of the mountain of Open Source work it was +built on top of, the contributions of everyone involved, and everyone that has +supported the project through the years. To everyone who has helped, thank you +so much. -A number of other modules and projects are either part of, or used by Reticulum. Sincere thanks to the authors and contributors of the following projects: +A number of other modules and projects are either part of, or used by +Reticulum. Sincere thanks to the authors and contributors of the following +projects: - [PyCA/cryptography](https://github.com/pyca/cryptography), *BSD License* - [Pure-25519](https://github.com/warner/python-pure25519) by [Brian Warner](https://github.com/warner), *MIT License* diff --git a/README.mu b/README.mu index c64a7a50..2d361909 100644 --- a/README.mu +++ b/README.mu @@ -4,8 +4,6 @@ To understand the foundational philosophy and goals of this system, read the `_` Reticulum is the cryptography-based networking stack for building local and wide-area networks with readily available hardware. It can operate even with very high latency and extremely low bandwidth. Reticulum allows you to build wide-area networks with off-the-shelf tools, and offers end-to-end encryption and connectivity, initiator anonymity, autoconfiguring cryptographically backed multi-hop transport, efficient addressing, unforgeable delivery acknowledgements and more. -`(RNS Logo`w=18`a=c`:/media/reticulum/reticulum/HEAD/docs/source/graphics/rns_logo_256.webp) - The vision of Reticulum is to allow anyone to be their own network operator, and to make it cheap and easy to cover vast areas with a myriad of independent, inter-connectable and autonomous networks. Reticulum `!is not`! `*one`* network. It is `!a tool`! for building `*thousands of networks`*. Networks without kill-switches, surveillance, censorship and control. Networks that can freely interoperate, associate and disassociate with each other, and require no central oversight. Networks for human beings. `*Networks for the people`*. Reticulum is a complete networking stack, and does not rely on IP or higher layers, but it is possible to use IP as the underlying carrier for Reticulum. It is therefore trivial to tunnel Reticulum over the Internet or private IP networks. @@ -172,19 +170,9 @@ Currently, the following built-in interfaces are supported: >> Performance -`*All performance numbers here assume `B333rnsd`b running in fully interpreted Python mode, limited to a single CPU core.`* +Reticulum targets a `*very`* wide usable performance envelope, but prioritises functionality and performance on low-bandwidth mediums. The goal is to provide a dynamic performance envelope from 250 bits per second, to 1 gigabit per second on normal hardware. -Reticulum targets a `*very`* wide usable performance envelope, but prioritises functionality and performance on low-bandwidth mediums. The goal is to provide a dynamic performance envelope from 100 bits per second, to 10 gigabits per second on normal hardware. - -Currently, the on-network, usable performance envelope is approximately 150 bits per second to 1 gigabit per second on modest hardware. Real-world performance will vary widely with the speed of your system, availability of cryptographic hardware acceleration, and other factors. - -Raw routing throughput for a transport node hosted on a Raspberry Pi 5 is approximately 4 gigabits per second. Systems with modern crypto hardware acceleration can achieve transport throughput of 15 gigabits per second and higher. - -While the reference implementation is perfectly capable of reaching 100+ Gbps, by utilizing multiple CPU cores and vectorized transport, performance beyond the current level is not higly prioritised, since RNS is already able to saturate available physical medium bandwidth in almost all real-world situations. - -The primary objectives for RNS are `*reliability`*, `*correctness`*, `*security`*, `*proper traffic management`* and `*actually practical performance`*, not hollow on-paper "benchmarks" with little to no bearing on real-world usability. - -All alternative-implementation maintainers are `*highly`* encouraged to adopt a similar approach, and especially to focus on getting their implementations working properly before publishing empirically dubious or factually wrong performance claims. +Currently, the usable performance envelope is approximately 150 bits per second to 500 megabits per second, with physical mediums faster than that not being saturated. Performance beyond the current level is intended for future upgrades, but not highly prioritised at this point in time. >> Current Status @@ -268,7 +256,7 @@ Please note that by default, installing Reticulum will `!require`! OpenSSL and P If you want to use the internal pure-python primitives, it is `!highly advisable`! that you have a good understanding of the risks that this pose, and make an informed decision on whether those risks are acceptable to you. -Having been in development for ten, and wider deployment for around five years, Reticulum is relatively young software, and should be considered as such. While it has been carefully built with cryptography best-practices very foremost in mind, there could very well still be privacy or security breaking bugs. +Reticulum is relatively young software, and should be considered as such. While it has been built with cryptography best-practices very foremost in mind, it _has not_ been externally security audited, and there could very well be privacy or security breaking bugs. If you want to help out, or help sponsor an audit, please do get in touch. >> Acknowledgements & Credits diff --git a/RNS/Buffer.py b/RNS/Buffer.py index 8117fefe..807b081a 100644 --- a/RNS/Buffer.py +++ b/RNS/Buffer.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal diff --git a/RNS/Channel.py b/RNS/Channel.py index 29c44019..799f002e 100644 --- a/RNS/Channel.py +++ b/RNS/Channel.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal diff --git a/RNS/Destination.py b/RNS/Destination.py index f618aa60..c5a65a2d 100755 --- a/RNS/Destination.py +++ b/RNS/Destination.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -35,8 +35,6 @@ import threading import RNS from RNS.Cryptography import Token -from RNS.Stamps import generate_stamp, store_destination_stamp, load_destination_stamp -from RNS.Stamps import cost_to_bytes, quantize_cost from .vendor import umsgpack as umsgpack class Callbacks: @@ -148,14 +146,6 @@ class Destination: return Destination.hash(identity, app_name, *aspects) - @staticmethod - def name_hash(full_name): - components = Destination.app_and_aspects_from_name(full_name) - app_name = str(components[0]) - aspects = f".{'.'.join(components[1])}" if components[1] else "" - name = f"{app_name}{aspects}".encode("utf-8") - return RNS.Identity.full_hash(name)[:(RNS.Identity.NAME_HASH_LENGTH//8)] - def __init__(self, identity, direction, type, app_name, *aspects): # Check input values and build name string if "." in app_name: raise ValueError("Dots can't be used in app names") @@ -169,11 +159,6 @@ class Destination: self.type = type self.direction = direction self.proof_strategy = Destination.PROVE_NONE - self.stamp = None - self.stamp_value = None - self.stamp_generation_lock = threading.Lock() - self._target_value = RNS.Transport.DESTINATION_VALUE - self._link_cost = None self.ratchets = None self.ratchets_path = None self.ratchet_interval = Destination.RATCHET_INTERVAL @@ -205,13 +190,6 @@ class Destination: self.name_hash = RNS.Identity.full_hash(self.expand_name(None, app_name, *aspects).encode("utf-8"))[:(RNS.Identity.NAME_HASH_LENGTH//8)] self.hexhash = self.hash.hex() - # Load existing stamp if available - if self.direction == Destination.IN and self.identity != None and self.identity.prv != None and RNS.Transport.STAMP_DESTINATIONS: - stamp_entry = load_destination_stamp(self.hash, self.stamp_material(), RNS.Transport.DESTINATION_COST) - if stamp_entry != None: - self.stamp, self.stamp_value = stamp_entry - RNS.log(f"Loaded stamp with value {RNS.prettycost(self.stamp_value)} for {self}", RNS.LOG_DEBUG) - self.default_app_data = None self.callback = None self.proofcallback = None @@ -263,26 +241,6 @@ class Destination: return False - def _await_stamp(self): - with self.stamp_generation_lock: - if self.stamp == None or self.stamp_value == None or self.stamp_value < quantize_cost(self.target_value): - stamp_entry = load_destination_stamp(self.hash, self.stamp_material(), self.target_value) - if stamp_entry != None: self.stamp, self.stamp_value = stamp_entry - else: - stamp, stamp_value = generate_stamp(self.stamp_material(), stamp_cost=self.target_value, - expand_rounds=0, size=RNS.Identity.STAMPLENGTH) - if stamp == None: - RNS.log(f"Destination stamp generation for {RNS.prettyhexrep(self.hash)} failed or was aborted", RNS.LOG_DEBUG) - return False - - self.stamp = stamp - self.stamp_value = stamp_value - store_destination_stamp(self.hash, stamp, stamp_value) - RNS.log(f"Generated and persisted stamp with value {self.stamp_value} for {self}", RNS.LOG_DEBUG) - - if self.stamp == None: return False - else: return True - def announce(self, app_data=None, path_response=False, attached_interface=None, tag=None, send=True): """ Creates an announce packet for this destination and broadcasts it on all @@ -291,20 +249,12 @@ class Destination: :param app_data: *bytes* containing the app_data. :param path_response: Internal flag used by :ref:`RNS.Transport`. Ignore. """ - if self.type != Destination.SINGLE: raise TypeError("Only SINGLE destination types can be announced") - if self.direction != Destination.IN: raise TypeError("Only IN destination types can be announced") + if self.type != Destination.SINGLE: + raise TypeError("Only SINGLE destination types can be announced") - if send and RNS.Transport.STAMP_DESTINATIONS and self.stamp == None: - # If no stamp is available, queue for background generation - # and announce emission once ready. - RNS.Transport.enqueue_stamped_announce(self, app_data=app_data, path_response=path_response, - attached_interface=attached_interface, tag=tag) - else: - # Otherwise, dispatch immediately. - return self._announce(app_data=app_data, path_response=path_response, - attached_interface=attached_interface, tag=tag, send=send) - - def _announce(self, app_data=None, path_response=False, attached_interface=None, tag=None, send=True): + if self.direction != Destination.IN: + raise TypeError("Only IN destination types can be announced") + ratchet = b"" now = time.time() stale_responses = [] @@ -344,17 +294,6 @@ class Destination: returned_app_data = self.default_app_data() if isinstance(returned_app_data, bytes): app_data = returned_app_data - - if RNS.Transport.STAMP_DESTINATIONS: - if not self._await_stamp(): - RNS.log(f"Could not generate destination stamp for {RNS.prettyhexrep(self.hash)}, announce emission cancelled", RNS.LOG_WARNING) - return None - - cost_bytes = cost_to_bytes(self.get_link_cost()) - ext_payload = bytes([RNS.Identity.EXTPAYLOADMARKER, self.get_ext_flags()])+self.stamp+bytes([cost_bytes[1], cost_bytes[0]]) - - if app_data == None: app_data = ext_payload - else: app_data = app_data+ext_payload signed_data = self.hash+self.identity.get_public_key()+self.name_hash+random_hash+ratchet if app_data != None: signed_data += app_data @@ -378,44 +317,6 @@ class Destination: if send: announce_packet.send() else: return announce_packet - def stamp_material(self): - return self.hash+self.identity.get_public_key()+self.name_hash - - def get_ext_flags(self): - return 0x00 - - @property - def target_value(self): - return min(RNS.Transport.STAMP_COST_CAP, max(float(self._target_value), RNS.Transport.DESTINATION_VALUE)) - - def set_value(self, value): - """ - Sets the target stamp value for this destination. - - :param value: The target value as a *float*. - """ - self._target_value = min(RNS.Transport.STAMP_COST_CAP, max(float(value), RNS.Transport.DESTINATION_VALUE)) - - def set_link_cost(self, cost): - """ - Sets the required link establishment stamp cost for this destination. Set to 0 to disable. - - :param cost: The required cost as a *float*. - """ - self._link_cost = max(0, min(float(cost), RNS.Transport.LINK_COST_CAP)) - - def get_link_cost(self): - """ - Returns the link request stamp cost to be announced for this - destination, as a float. If no destination-specific cost has - been set, the default link request cost is returned. - - :returns: The announced link request cost as a *float*. - """ - cost = self._link_cost - if cost == None: cost = RNS.Transport.LR_COST - return max(0.0, min(float(cost), RNS.Transport.STAMP_COST_CAP)) - def accepts_links(self, accepts = None): """ Set or query whether the destination accepts incoming link requests. @@ -530,7 +431,8 @@ class Destination: def incoming_link_request(self, data, packet): if self.accept_link_requests: link = RNS.Link.validate_request(self, data, packet) - if link != None: self.links.append(link) + if link != None: + self.links.append(link) def _reload_ratchets(self, ratchets_path): if os.path.isfile(ratchets_path): diff --git a/RNS/Discovery.py b/RNS/Discovery.py index dd92f42f..57e3d875 100644 --- a/RNS/Discovery.py +++ b/RNS/Discovery.py @@ -1,33 +1,3 @@ -# Reticulum License -# -# Copyright (c) 2016-2026 Mark Qvist -# -# Permission is hereby granted, free of charge, to any person obtaining a copy -# of this software and associated documentation files (the "Software"), to deal -# in the Software without restriction, including without limitation the rights -# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -# copies of the Software, and to permit persons to whom the Software is -# furnished to do so, subject to the following conditions: -# -# - The Software shall not be used in any kind of system which includes amongst -# its functions the ability to purposefully do harm to human beings. -# -# - The Software shall not be used, directly or indirectly, in the creation of -# an artificial intelligence, machine learning or language model training -# dataset, including but not limited to any use that contributes to the -# training or development of such a model or algorithm. -# -# - The above copyright notice and this permission notice shall be included in -# all copies or substantial portions of the Software. -# -# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE -# SOFTWARE. - import os import re import RNS @@ -45,14 +15,11 @@ from collections import deque # version tag in announced discovery information. IMPLEMENTATION_NAME = "RNS" from RNS._version import __version__ as RNS_VERSION -import RNS.Stamps NAME = 0xFF TRANSPORT_ID = 0xFE TRANSPORT_IMPL = 0xFD TRANSPORT_VERS = 0xFC -DST_COST = 0xFB -PR_COST = 0xFA INTERFACE_TYPE = 0x00 TRANSPORT = 0x01 REACHABLE_ON = 0x02 @@ -81,10 +48,17 @@ class InterfaceAnnouncer(): "RNodeInterface", "WeaveInterface", "I2PInterface", "KISSInterface"] def __init__(self, owner): + import importlib.util + if importlib.util.find_spec('LXMF') != None: from LXMF import LXStamper + else: + RNS.log("Using on-network interface discovery requires the LXMF module to be installed.", RNS.LOG_CRITICAL) + RNS.log("You can install it with the command: pip install lxmf", RNS.LOG_CRITICAL) + RNS.panic() + self.owner = owner self.should_run = False self.job_interval = self.JOB_INTERVAL - self.stamper = RNS.Stamps + self.stamper = LXStamper self.stamp_cache = {} if self.owner.has_network_identity(): identity = self.owner.network_identity @@ -168,8 +142,6 @@ class InterfaceAnnouncer(): TRANSPORT_ID: RNS.Transport.identity.hash, TRANSPORT_IMPL: IMPLEMENTATION_NAME, TRANSPORT_VERS: RNS_VERSION, - DST_COST: RNS.Stamps.quantize_cost(interface.destination_cost), - PR_COST: RNS.Stamps.quantize_cost(interface.pr_cost), NAME: self.sanitize(interface.discovery_name), LATITUDE: interface.discovery_latitude, LONGITUDE: interface.discovery_longitude, @@ -232,8 +204,8 @@ class InterfaceAnnouncer(): info[MODULATION] = self.sanitize(interface.discovery_modulation) if interface.discovery_publish_ifac == True: - if interface.ifac_netname: info[IFAC_NETNAME] = self.sanitize(interface.ifac_netname) - if interface.ifac_netkey: info[IFAC_NETKEY] = self.sanitize(interface.ifac_netkey) + info[IFAC_NETNAME] = self.sanitize(interface.ifac_netname) + info[IFAC_NETKEY] = self.sanitize(interface.ifac_netkey) packed = msgpack.packb(info) infohash = RNS.Identity.full_hash(packed) @@ -260,10 +232,17 @@ class InterfaceAnnounceHandler: FLAG_ENCRYPTED = 0b00000010 def __init__(self, required_value=InterfaceAnnouncer.DEFAULT_STAMP_VALUE, callback=None): + import importlib.util + if importlib.util.find_spec('LXMF') != None: from LXMF import LXStamper + else: + RNS.log("Using on-network interface discovery requires the LXMF module to be installed.", RNS.LOG_CRITICAL) + RNS.log("You can install it with the command: pip install lxmf", RNS.LOG_CRITICAL) + RNS.panic() + self.aspect_filter = APP_NAME+".discovery.interface" self.required_value = required_value self.callback = callback - self.stamper = RNS.Stamps + self.stamper = LXStamper self.valid_cache = {} self.valid_cache_max = 2048 self.invalid_cache = deque(maxlen=2048) @@ -291,11 +270,6 @@ class InterfaceAnnounceHandler: signed = flags & self.FLAG_SIGNED encrypted = flags & self.FLAG_ENCRYPTED fullhash = RNS.Identity.full_hash(app_data) - hops = RNS.Transport.hops_to(destination_hash) - - if hops > RNS.Transport.PATHFINDER_M-1: - RNS.log(f"Ignored discovered interface with invalid hop count", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None - return if fullhash in self.invalid_cache: RNS.log(f"Ignored previously discovered interface with insufficient stamp value", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None @@ -323,37 +297,24 @@ class InterfaceAnnounceHandler: stamp = app_data[-self.stamper.STAMP_SIZE:] packed = app_data[:-self.stamper.STAMP_SIZE] infohash = RNS.Identity.full_hash(packed) - - # Transitory mechanism, check non-expanded workblock validity first. - workblock_ne = self.stamper.stamp_workblock(infohash, expand_rounds=0) - valid_ne = self.stamper.stamp_valid(stamp, self.required_value, workblock_ne) - if valid_ne: - value = self.stamper.stamp_value(workblock_ne, stamp) - valid = valid_ne - - else: - workblock = self.stamper.stamp_workblock(infohash, expand_rounds=InterfaceAnnouncer.WORKBLOCK_EXPAND_ROUNDS) - value = self.stamper.stamp_value(workblock, stamp) - valid = self.stamper.stamp_valid(stamp, self.required_value, workblock) - + workblock = self.stamper.stamp_workblock(infohash, expand_rounds=InterfaceAnnouncer.WORKBLOCK_EXPAND_ROUNDS) + value = self.stamper.stamp_value(workblock, stamp) + valid = self.stamper.stamp_valid(stamp, self.required_value, workblock) self.valid_cache[fullhash] = {"valid": valid, "value": value, "packed": packed, "stamp": stamp} while len(self.valid_cache) > self.valid_cache_max: self.valid_cache.pop(next(iter(self.valid_cache))) if not valid: - RNS.log(f"Ignored discovered interface with insufficient stamp value {RNS.prettycost(value)}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None + RNS.log(f"Ignored discovered interface with insufficient stamp value {value}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None self.invalid_cache.append(fullhash) return + if value < self.required_value: RNS.log(f"Ignored discovered interface with stamp value {value}", RNS.LOG_DEBUG) else: info = None unpacked = msgpack.unpackb(packed) if INTERFACE_TYPE in unpacked: interface_type = unpacked[INTERFACE_TYPE] name = self.sanitize_name(unpacked[NAME]) - impl_name = unpacked[TRANSPORT_IMPL] if TRANSPORT_IMPL in unpacked else None - impl_version = unpacked[TRANSPORT_VERS] if TRANSPORT_VERS in unpacked else None - dst_cost = RNS.Stamps.quantize_cost(unpacked[DST_COST]) if DST_COST in unpacked else None - pr_cost = RNS.Stamps.quantize_cost(unpacked[PR_COST]) if PR_COST in unpacked else None if type(unpacked[TRANSPORT]) != bool: raise ValueError("Invalid data in transport field of announce") if type(unpacked[LATITUDE]) not in [type(None), float]: raise ValueError("Invalid data in latitude field of announce") @@ -368,8 +329,6 @@ class InterfaceAnnounceHandler: raise ValueError("Invalid data in reachable_on field of announce") info = {"type": interface_type, - "impl_name": impl_name, - "version": impl_version, "transport": unpacked[TRANSPORT], "name": name or f"Discovered {interface_type}", "received": time.time(), @@ -377,15 +336,13 @@ class InterfaceAnnounceHandler: "value": value, "transport_id": RNS.hexrep(unpacked[TRANSPORT_ID], delimit=False), "network_id": RNS.hexrep(announced_identity.hash, delimit=False), - "dst_cost": dst_cost, - "pr_cost": pr_cost, - "hops": hops, + "hops": RNS.Transport.hops_to(destination_hash), "latitude": unpacked[LATITUDE], "longitude": unpacked[LONGITUDE], "height": unpacked[HEIGHT]} - if IFAC_NETNAME in unpacked and unpacked[IFAC_NETNAME] and type(unpacked[IFAC_NETNAME]) == str: info["ifac_netname"] = str(unpacked[IFAC_NETNAME]) - if IFAC_NETKEY in unpacked and unpacked[IFAC_NETKEY] and type(unpacked[IFAC_NETKEY]) == str: info["ifac_netkey"] = str(unpacked[IFAC_NETKEY]) + if IFAC_NETNAME in unpacked: info["ifac_netname"] = str(unpacked[IFAC_NETNAME]) + if IFAC_NETKEY in unpacked: info["ifac_netkey"] = str(unpacked[IFAC_NETKEY]) if interface_type in ["BackboneInterface", "TCPServerInterface"]: backbone_support = not RNS.vendor.platformutils.is_windows() and not RNS.vendor.platformutils.is_darwin() @@ -414,7 +371,7 @@ class InterfaceAnnounceHandler: cfg_netname_str = f"\n network_name = {cfg_netname}" if cfg_netname else "" cfg_netkey_str = f"\n passphrase = {cfg_netkey}" if cfg_netkey else "" cfg_identity_str = f"\n transport_identity = {cfg_identity}" - info["config_entry"] = f"[[{cfg_name}]]\n type = I2PInterface\n enabled = yes\n peers = {cfg_remote}.b32.i2p{cfg_identity_str}{cfg_netname_str}{cfg_netkey_str}" + info["config_entry"] = f"[[{cfg_name}]]\n type = I2PInterface\n enabled = yes\n peers = {cfg_remote}{cfg_identity_str}{cfg_netname_str}{cfg_netkey_str}" if interface_type == "RNodeInterface": info["frequency"] = unpacked[FREQUENCY] @@ -475,7 +432,7 @@ class InterfaceAnnounceHandler: if self.callback and callable(self.callback): self.callback(info) except Exception as e: - RNS.log(f"Could not decode discovered interface. The contained exception was: {e}", RNS.LOG_DEBUG) + RNS.log(f"An error occurred while trying to decode discovered interface. The contained exception was: {e}", RNS.LOG_DEBUG) class InterfaceDiscovery(): THRESHOLD_UNKNOWN = 24*60*60 @@ -489,17 +446,13 @@ class InterfaceDiscovery(): STATUS_UNKNOWN = 100 STATUS_AVAILABLE = 1000 STATUS_CODE_MAP = {"available": STATUS_AVAILABLE, "unknown": STATUS_UNKNOWN, "stale": STATUS_STALE} - AUTOCONNECT_TYPES = ["BackboneInterface"] + AUTOCONNECT_TYPES = ["BackboneInterface", "TCPServerInterface"] DISCOVERABLE_TYPES = ["BackboneInterface", "TCPServerInterface", "I2PInterface", "RNodeInterface", "WeaveInterface", "KISSInterface"] - AUTOCONNECT_IMPLS = ["RNS"] - AUTOCONNECT_MIN_V = "1.5.7" - AC_TRANSPORT_MODE = RNS.Interfaces.Interface.Interface.MODE_GATEWAY AC_GRAVITY = 0 discovery_lock = Lock() - autoconnect_lock = Lock() def __init__(self, required_value=InterfaceAnnouncer.DEFAULT_STAMP_VALUE, callback=None, discover_interfaces=True): if not required_value: required_value = InterfaceAnnouncer.DEFAULT_STAMP_VALUE @@ -520,7 +473,6 @@ class InterfaceDiscovery(): if not os.path.isdir(self.storagepath): os.makedirs(self.storagepath) if discover_interfaces: - RNS.Reticulum.get_instance().wants_destination_type("rnstransport.discovery.interface") self.handler = InterfaceAnnounceHandler(callback=self.interface_discovered, required_value=self.required_value) RNS.Transport.register_announce_handler(self.handler) threading.Thread(target=self.connect_discovered, daemon=True).start() @@ -546,16 +498,7 @@ class InterfaceDiscovery(): should_remove = False heard_delta = now-info["last_heard"] info["name"] = InterfaceAnnounceHandler.sanitize_name(info["name"]) - - # TODO: Temporary measure to sanitize invalidly persisted "None" values - # for incorrect IFAC parameters published due to unguarded nonsensical - # node-side configuration. Potentially remove once nodes upgrade to RNS - # versions that guard against the configuration mismatch. - try: - if "ifac_netname" in info and info["ifac_netname"] == "None": info.pop("ifac_netname") - if "ifac_netkey" in info and info["ifac_netkey"] == "None": info.pop("ifac_netkey") - except Exception as e: RNS.log(f"Error while sanitizing discovery info: {e}", RNS.LOG_ERROR) - + if heard_delta > self.THRESHOLD_REMOVE: should_remove = True elif not "transport_id" in info or not info["transport_id"]: should_remove = True elif not "network_id" in info or not info["network_id"]: should_remove = True @@ -601,13 +544,11 @@ class InterfaceDiscovery(): interface_type = info["type"] discovery_hash = info["discovery_hash"] discovered_type = info["type"] - has_impl_info = "impl_name" in info and "version" in info and info["impl_name"] and info["version"] - version_str = f" ({info['impl_name']} {info['version']})" if has_impl_info else " (unknown implementation)" if not discovered_type in self.DISCOVERABLE_TYPES: return hops = info["hops"]; ms = "" if hops == 1 else "s" filename = RNS.hexrep(discovery_hash, delimit=False) filepath = os.path.join(self.storagepath, filename) - RNS.log(f"Discovered {interface_type}{version_str} {hops} hop{ms} away with stamp value {RNS.prettycost(value)}: {name}", RNS.LOG_DEBUG) + RNS.log(f"Discovered {interface_type} {hops} hop{ms} away with stamp value {value}: {name}", RNS.LOG_DEBUG) with self.discovery_lock: if not os.path.isfile(filepath): try: @@ -675,27 +616,22 @@ class InterfaceDiscovery(): autoconnected_interfaces = self.autoconnect_count() for interface in self.monitored_interfaces: try: - if not interface in RNS.Transport.interfaces: - RNS.log(f"A monitored auto-connected interface was manually detached, removing from monitoring", RNS.LOG_DEBUG) - detached_interfaces.append(interface) + if interface.online: + online_interfaces += 1 + if hasattr(interface, "autoconnect_down") and interface.autoconnect_down != None: + RNS.log(f"Auto-discovered interface {interface} reconnected") + interface.autoconnect_down = None else: - if interface.online: - online_interfaces += 1 - if hasattr(interface, "autoconnect_down") and interface.autoconnect_down != None: - RNS.log(f"Auto-discovered interface {interface} reconnected") - interface.autoconnect_down = None + if not hasattr(interface, "autoconnect_down") or interface.autoconnect_down == None: + RNS.log(f"Auto-discovered interface {interface} disconnected", RNS.LOG_DEBUG) + interface.autoconnect_down = time.time() else: - if not hasattr(interface, "autoconnect_down") or interface.autoconnect_down == None: - RNS.log(f"Auto-discovered interface {interface} disconnected", RNS.LOG_DEBUG) - interface.autoconnect_down = time.time() - - else: - down_for = time.time()-interface.autoconnect_down - if down_for >= self.detach_threshold: - RNS.log(f"Auto-discovered interface {interface} has been down for {RNS.prettytime(down_for)}, detaching", RNS.LOG_DEBUG) - detached_interfaces.append(interface) + down_for = time.time()-interface.autoconnect_down + if down_for >= self.detach_threshold: + RNS.log(f"Auto-discovered interface {interface} has been down for {RNS.prettytime(down_for)}, detaching", RNS.LOG_DEBUG) + detached_interfaces.append(interface) except Exception as e: RNS.log(f"Error while checking auto-connected interface state for {interface}: {e}", RNS.LOG_ERROR) @@ -729,10 +665,8 @@ class InterfaceDiscovery(): RNS.log(f"Error while de-registering auto-connected interface from transport: {e}", RNS.LOG_ERROR) def teardown_interface(self, interface): - if interface in RNS.Transport.interfaces: - was_detached = RNS.Reticulum.get_instance()._detach_interface(interface.name, internal_forced=True) - if not was_detached: RNS.log(f"Detach of auto-connected interface {interface} did not succeed", RNS.LOG_ERROR) - + interface.detach() + RNS.Transport.remove_interface(interface) if interface in self.monitored_interfaces: self.monitored_interfaces.remove(interface) def autoconnect_count(self): @@ -779,56 +713,24 @@ class InterfaceDiscovery(): return exists - def autoconnect_interface_name(self, name): - names = {interface.name for interface in RNS.Transport.interfaces} - if not name in names: return name - else: - n = 2; seq_name = f"{name} ({n})" - while seq_name in names: - n += 1; seq_name = f"{name} ({n})" - - return seq_name - - def autoconnect_qualified(self, info): - if not "transport" in info or info["transport"] != True: return False - if RNS.Reticulum.should_autoconnect_unverified_implementations(): return True - if not "impl_name" in info: return False - if not info["impl_name"] in self.AUTOCONNECT_IMPLS: return False - if not "version" in info or not info["version"]: return False - - version = version_tuple(info["version"]) - if version == None: return False - return version >= version_tuple(self.AUTOCONNECT_MIN_V) - def autoconnect(self, info): try: if RNS.Reticulum.should_autoconnect_discovered_interfaces(): autoconnected_count = self.autoconnect_count() if autoconnected_count < RNS.Reticulum.max_autoconnected_interfaces(): interface_type = info["type"] - has_cost_info = "dst_cost" in info and "pr_cost" in info if interface_type in self.AUTOCONNECT_TYPES: - impl = f"{info['impl_name']} {info['version']}" if ("impl_name" in info and "version" in info and info["impl_name"] and info["version"]) else "unknown implementation" - if not self.autoconnect_qualified(info): - RNS.log(f"Not auto-connecting discovered {interface_type} {info['name']} ({impl}), auto-connect criteria not satisfied", RNS.LOG_DEBUG) - return - - if has_cost_info: - dst_value = RNS.Stamps.quantize_cost(RNS.Transport.DESTINATION_VALUE) - pr_value = RNS.Stamps.quantize_cost(RNS.Transport.PR_VALUE) - dst_cost = RNS.Stamps.quantize_cost(info["dst_cost"] or 0) - pr_cost = RNS.Stamps.quantize_cost(info["pr_cost"] or 0) - dst_cost_ok = dst_cost <= dst_value - pr_cost_ok = pr_cost <= pr_value - if not dst_cost_ok: RNS.log(f"Destination cost {dst_cost} higher than configured value {dst_value} for {interface_type} {info['name']} ({impl}), not auto-connecting", RNS.LOG_DEBUG) - if not pr_cost_ok: RNS.log(f"Path request cost {pr_cost} higher than configured value {pr_value} for {interface_type} {info['name']} ({impl}), not auto-connecting", RNS.LOG_DEBUG) - if not dst_cost_ok or not pr_cost_ok: return - endpoint_hash = self.endpoint_hash(info) exists = self.interface_exists(info) if exists: RNS.log(f"Discovered {interface_type} already exists, not auto-connecting", RNS.LOG_DEBUG) else: + if interface_type == "TCPClientInterface": + RNS.log(f"Your operating system does not support the Backbone interface type, and must degrade to using TCPClientInterface instead", RNS.LOG_WARNING) + RNS.log(f"Auto-connecting discovered TCPClient interfaces is not yet implemented, aborting auto-connect", RNS.LOG_WARNING) + RNS.log(f"You can obtain the configuration entry and add this interface manually instead using rnstatus -D", RNS.LOG_WARNING) + return + if interface_type == "I2PInterface": RNS.log(f"Auto-connecting discovered I2P interfaces is not yet implemented, aborting auto-connect", RNS.LOG_DEBUG) RNS.log(f"You can obtain the configuration entry and add this interface manually instead using rnstatus -D", RNS.LOG_DEBUG) @@ -846,57 +748,35 @@ class InterfaceDiscovery(): RNS.log(f"Not auto-connecting discovered interface with invalid IP address: {info['reachable_on']}", RNS.LOG_DEBUG) return - with self.autoconnect_lock: - if self.interface_exists(info): return - backbone_support = (not RNS.vendor.platformutils.is_windows() and not RNS.vendor.platformutils.is_darwin()) + interface_name = info["name"] + config_entry = info["config_entry"] + interface_config = {} + interface_config["name"] = f"{interface_name}" + ifac_netname = info["ifac_netname"] if "ifac_netname" in info else None + ifac_netkey = info["ifac_netkey"] if "ifac_netkey" in info else None + interface = None - interface_name = self.autoconnect_interface_name(info["name"]) - if interface_name != info["name"]: - RNS.log(f"Auto-connect name collision for \"{info['name']}\", connecting as \"{interface_name}\"", RNS.LOG_NOTICE) + if interface_type == "BackboneInterface": + from RNS.Interfaces import BackboneInterface + interface_config["target_host"] = info["reachable_on"] + interface_config["target_port"] = info["port"] + interface = BackboneInterface.BackboneClientInterface(RNS.Transport, interface_config) - config_entry = info["config_entry"] - interface_config = {} - interface_config["name"] = f"{interface_name}" - - # TODO: Temporary measure to sanitize invalidly persisted "None" values - # for incorrect IFAC parameters published due to unguarded nonsensical - # node-side configuration. Potentially remove once nodes upgrade to RNS - # versions that guard against the configuration mismatch. - if "ifac_netname" in info and info["ifac_netname"] == "None": info["ifac_netname"] = None - if "ifac_netkey" in info and info["ifac_netkey"] == "None": info["ifac_netkey"] = None - - ifac_netname = info["ifac_netname"] if "ifac_netname" in info and info["ifac_netname"] else None - ifac_netkey = info["ifac_netkey"] if "ifac_netkey" in info and info["ifac_netkey"] else None - interface = None - - if interface_type == "BackboneInterface": - if backbone_support: - from RNS.Interfaces import BackboneInterface - interface_class = BackboneInterface.BackboneClientInterface - else: - from RNS.Interfaces import TCPInterface - interface_class = TCPInterface.TCPClientInterface - RNS.log(f"BackboneInterface is not yet supported on this operating system, auto-connecting discovered {interface_type} {interface_name} using TCPClientInterface", RNS.LOG_NOTICE) - - interface_config["target_host"] = info["reachable_on"] - interface_config["target_port"] = info["port"] - interface = interface_class(RNS.Transport, interface_config) - - if interface: - RNS.log(f"Auto-connecting discovered {interface_type} {interface_name}") - interface.autoconnect_hash = endpoint_hash - interface.autoconnect_source = info["network_id"] - if RNS.Reticulum.autoconnect_interface_mode(): mode = RNS.Reticulum.autoconnect_interface_mode() - else: mode = self.AC_TRANSPORT_MODE if RNS.Reticulum.transport_enabled() else None - internal_a = True if RNS.Reticulum.autoconnect_announces_to_internal() else None - gravity = RNS.Reticulum.autoconnect_interface_gravity() or self.AC_GRAVITY - ar_target = RNS.Reticulum.get_instance()._default_ar_target() if RNS.Reticulum.transport_enabled() else None - ar_penalty = RNS.Reticulum.get_instance()._default_ar_penalty() if RNS.Reticulum.transport_enabled() else None - ar_grace = RNS.Reticulum.get_instance()._default_ar_grace() if RNS.Reticulum.transport_enabled() else None - RNS.Reticulum.get_instance()._add_interface(interface, mode=mode, ifac_netname=ifac_netname, ifac_netkey=ifac_netkey, configured_bitrate=5E6, - announce_rate_target=ar_target, announce_rate_grace=ar_grace, announce_rate_penalty=ar_penalty, - announces_to_internal=internal_a, gravity=gravity) - self.monitor_interface(interface) + if interface: + RNS.log(f"Auto-connecting discovered {interface_type} {interface_name}") + interface.autoconnect_hash = endpoint_hash + interface.autoconnect_source = info["network_id"] + if RNS.Reticulum.autoconnect_interface_mode(): mode = RNS.Reticulum.autoconnect_interface_mode() + else: mode = self.AC_TRANSPORT_MODE if RNS.Reticulum.transport_enabled() else None + internal_a = True if RNS.Reticulum.autoconnect_announces_to_internal() else None + gravity = RNS.Reticulum.autoconnect_interface_gravity() or self.AC_GRAVITY + ar_target = RNS.Reticulum.get_instance()._default_ar_target() if RNS.Reticulum.transport_enabled() else None + ar_penalty = RNS.Reticulum.get_instance()._default_ar_penalty() if RNS.Reticulum.transport_enabled() else None + ar_grace = RNS.Reticulum.get_instance()._default_ar_grace() if RNS.Reticulum.transport_enabled() else None + RNS.Reticulum.get_instance()._add_interface(interface, mode=mode, ifac_netname=ifac_netname, ifac_netkey=ifac_netkey, configured_bitrate=5E6, + announce_rate_target=ar_target, announce_rate_grace=ar_grace, announce_rate_penalty=ar_penalty, + announces_to_internal=internal_a, gravity=gravity) + self.monitor_interface(interface) except Exception as e: RNS.log(f"Error while auto-connecting discovered interface: {e}", RNS.LOG_ERROR) @@ -916,7 +796,6 @@ class BlackholeUpdater(): def start(self): if not self.should_run: - RNS.Reticulum.get_instance().wants_destination_type("rnstransport.info.blackhole") source_count = len(RNS.Reticulum.blackhole_sources()) ms = "" if source_count == 1 else "s" RNS.log(f"Starting blackhole updater with {source_count} source{ms}", RNS.LOG_DEBUG) @@ -955,9 +834,8 @@ class BlackholeUpdater(): if os.path.isfile(sourcelistpath): os.unlink(sourcelistpath) os.rename(tmppath, sourcelistpath) - except Exception as e: RNS.log(f"Error while persisting blackhole list from {RNS.prettyhexrep(remote_identity.hash)}: {e}", RNS.LOG_ERROR) - - RNS.Identity._reset_validation_caches() + except Exception as e: + RNS.log(f"Error while persisting blackhole list from {RNS.prettyhexrep(remote_identity.hash)}: {e}", RNS.LOG_ERROR) RNS.log(f"Blackhole list update from {RNS.prettyhexrep(remote_identity.hash)} completed", RNS.LOG_DEBUG) @@ -1017,18 +895,6 @@ def is_hostname(hostname): allowed = re.compile(r"(?!-)[a-z0-9-]{1,63}(? 0: - try: - imported = store.import_legacy_ratchets(ratchetdir, time.time()-Identity.RATCHET_EXPIRY, Identity.known_destinations) - RNS.log(f"Imported {imported} ratchets from legacy file storage", RNS.LOG_VERBOSE) - - except Exception as e: - RNS.log(f"Could not import legacy ratchet files into the known destinations database. The contained exception was: {e}", RNS.LOG_ERROR) - RNS.trace_exception(e) - - else: Identity.load_known_destinations_legacy() - - @staticmethod - def load_known_destinations_legacy(): if os.path.isfile(RNS.Reticulum.storagepath+"/known_destinations"): st = time.time() try: @@ -341,11 +225,7 @@ class Identity: if len(known_destination) == RNS.Reticulum.TRUNCATED_HASHLENGTH//8: if len(loaded_known_destinations[known_destination]) < 5: e = loaded_known_destinations[known_destination] - loaded_known_destinations[known_destination] = [e[0], e[1], e[2], e[3], 0, None, 0, None] - elif len(loaded_known_destinations[known_destination]) < 8: - e = loaded_known_destinations[known_destination] - while len(e) < 8: e.append(None if len(e) in (5, 7) else 0) - loaded_known_destinations[known_destination] = e + loaded_known_destinations[known_destination] = [e[0], e[1], e[2], e[3], 0] with Identity.known_destinations_lock: Identity.known_destinations[known_destination] = loaded_known_destinations[known_destination] @@ -364,7 +244,6 @@ class Identity: if destination_hash in Identity.known_destinations: if not Identity.known_destinations[destination_hash][4] < 0: Identity.known_destinations[destination_hash][4] = time.time() - Identity._kd_mark_dirty(destination_hash) return True return False @@ -374,7 +253,6 @@ class Identity: with Identity.known_destinations_lock: if destination_hash in Identity.known_destinations: Identity.known_destinations[destination_hash][4] = -1 - Identity._kd_mark_dirty(destination_hash) return True return False @@ -384,7 +262,6 @@ class Identity: with Identity.known_destinations_lock: if destination_hash in Identity.known_destinations: Identity.known_destinations[destination_hash][4] = time.time() - Identity._kd_mark_dirty(destination_hash) return True return False @@ -450,7 +327,7 @@ class Identity: if not is_retained and not has_path: if not was_used and now - last_announce > RNS.Transport.UNUSED_DESTINATION_LINGER: stale.append(destination_hash) - elif unused_for > RNS.Transport.PATH_TIMEOUT*1.25: stale.append(destination_hash) + elif unused_for > RNS.Transport.DESTINATION_TIMEOUT*1.25: stale.append(destination_hash) except Exception as e: RNS.log(f"Faulty entry for {RNS.prettyhexrep(destination_hash)} while cleaning known destinations: {e}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None @@ -459,23 +336,13 @@ class Identity: with Identity.known_destinations_lock: if destination_hash in Identity.known_destinations: Identity.known_destinations.pop(destination_hash) - Identity._kd_mark_deleted(destination_hash) - if destination_hash in Identity.known_ratchets: Identity.known_ratchets.pop(destination_hash) removed += 1 - if not Identity.known_destinations_store: - try: - hexhash = RNS.hexrep(destination_hash, delimit=False) - ratchet_path = f"{ratchetdir}/{hexhash}" - if os.path.isfile(ratchet_path): os.unlink(ratchet_path) - except Exception as e: RNS.log(f"Could not clean stale ratchets for {RNS.prettyhexrep(destination_hash)}: {e}", RNS.LOG_WARNING) - - if Identity.known_destinations_store != None: - expired_ratchets = Identity.known_destinations_store.expire_ratchets(time.time()-Identity.RATCHET_EXPIRY) - if len(expired_ratchets) > 0: - for destination_hash in expired_ratchets: - with Identity.known_destinations_lock: - if destination_hash in Identity.known_ratchets: Identity.known_ratchets.pop(destination_hash) + try: + hexhash = RNS.hexrep(destination_hash, delimit=False) + ratchet_path = f"{ratchetdir}/{hexhash}" + if os.path.isfile(ratchet_path): os.unlink(ratchet_path) + except Exception as e: RNS.log(f"Could not clean stale ratchets for {RNS.prettyhexrep(destination_hash)}: {e}", RNS.LOG_WARNING) RNS.log(f"Cleaned known destinations in {RNS.prettyshorttime(time.time()-st)}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None RNS.log(f"Total: {total}, stale: {len(stale)}, removed: {removed}, no path: {no_path}, never used: {never_used}, with path: {total-no_path}, used: {total-never_used}, retained: {retained}", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None @@ -542,40 +409,33 @@ class Identity: @staticmethod def _remember_ratchet(destination_hash, ratchet): try: - # Don't re-insert existing ratchet - if Identity.known_ratchets.get(destination_hash) == ratchet: return - - store = Identity.known_destinations_store - if store != None: - # Persist to store, only update in-memory cache if this - # destination already exists there. - store.remember_ratchet(destination_hash, ratchet, time.time()) - if destination_hash in Identity.known_ratchets: - Identity.known_ratchets[destination_hash] = ratchet - - # Legacy store: Use file system - # Shared instance client: Just keep in memory cache + if destination_hash in Identity.known_ratchets and Identity.known_ratchets[destination_hash] == ratchet: + ratchet_exists = True else: - ratchet_exists = destination_hash in Identity.known_ratchets and Identity.known_ratchets[destination_hash] == ratchet - if not ratchet_exists: - RNS.log(f"Remembering ratchet {RNS.prettyhexrep(Identity._get_ratchet_id(ratchet))} for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None - Identity.known_ratchets[destination_hash] = ratchet - if not RNS.Transport.owner.is_connected_to_shared_instance: - def persist_job(): - with Identity.ratchet_persist_lock: - hexhash = RNS.hexrep(destination_hash, delimit=False) - ratchet_data = {"ratchet": ratchet, "received": time.time()} + ratchet_exists = False - ratchetdir = RNS.Reticulum.storagepath+"/ratchets" + if not ratchet_exists: + RNS.log(f"Remembering ratchet {RNS.prettyhexrep(Identity._get_ratchet_id(ratchet))} for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None + Identity.known_ratchets[destination_hash] = ratchet + if not RNS.Transport.owner.is_connected_to_shared_instance: + def persist_job(): + with Identity.ratchet_persist_lock: + hexhash = RNS.hexrep(destination_hash, delimit=False) + ratchet_data = {"ratchet": ratchet, "received": time.time()} - if not os.path.isdir(ratchetdir): os.makedirs(ratchetdir) + ratchetdir = RNS.Reticulum.storagepath+"/ratchets" + + if not os.path.isdir(ratchetdir): + os.makedirs(ratchetdir) - outpath = f"{ratchetdir}/{hexhash}.out" - finalpath = f"{ratchetdir}/{hexhash}" - with open(outpath, "wb") as ratchet_file: ratchet_file.write(umsgpack.packb(ratchet_data)) - os.replace(outpath, finalpath) + outpath = f"{ratchetdir}/{hexhash}.out" + finalpath = f"{ratchetdir}/{hexhash}" + with open(outpath, "wb") as ratchet_file: + ratchet_file.write(umsgpack.packb(ratchet_data)) + os.replace(outpath, finalpath) - threading.Thread(target=persist_job, daemon=True).start() + + threading.Thread(target=persist_job, daemon=True).start() except Exception as e: RNS.log(f"Could not persist ratchet for {RNS.prettyhexrep(destination_hash)} to storage.", RNS.LOG_ERROR) @@ -584,7 +444,6 @@ class Identity: @staticmethod def _clean_ratchets(): - if Identity.known_destinations_store != None: return RNS.log("Cleaning ratchets...", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None try: count = 0 @@ -624,43 +483,7 @@ class Identity: @staticmethod def get_ratchet(destination_hash): - if destination_hash in Identity.known_ratchets: return Identity.known_ratchets[destination_hash] - - store = Identity.known_destinations_store - if store != None: - ratchet_data = store.fetch_ratchet(destination_hash) - if ratchet_data != None: - ratchet, received = ratchet_data - if time.time() < received+Identity.RATCHET_EXPIRY: - Identity.known_ratchets[destination_hash] = ratchet - return ratchet - - else: return None - - else: - RNS.log(f"Could not load ratchet for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - return None - - elif RNS.Reticulum.get_instance().is_connected_to_shared_instance: - try: - # TODO: Ideally, refactor this to an RPC method instead - store = KnownDestinationsStore(RNS.Reticulum.storagepath+"/known_destinations.db", hash_width=RNS.Reticulum.TRUNCATED_HASHLENGTH//8, read_only=True) - ratchet_data = store.fetch_ratchet(destination_hash) - store.close() - - if ratchet_data != None: - ratchet, received = ratchet_data - if time.time() < received+Identity.RATCHET_EXPIRY: - Identity.known_ratchets[destination_hash] = ratchet - return ratchet - - except Exception as e: RNS.log(f"Could not fetch ratchet for {RNS.prettyhexrep(destination_hash)} from shared instance database. The contained exception was: {e}", RNS.LOG_ERROR) - - return None - - else: - if not os.path.isfile(RNS.Reticulum.storagepath+"/ratchets/"+RNS.hexrep(destination_hash, delimit=False)): return None - + if not destination_hash in Identity.known_ratchets: ratchetdir = RNS.Reticulum.storagepath+"/ratchets" hexhash = RNS.hexrep(destination_hash, delimit=False) ratchet_path = f"{ratchetdir}/{hexhash}" @@ -670,138 +493,22 @@ class Identity: ratchet_data = umsgpack.unpackb(ratchet_file.read()) if time.time() < ratchet_data["received"]+Identity.RATCHET_EXPIRY and len(ratchet_data["ratchet"]) == Identity.RATCHETSIZE//8: Identity.known_ratchets[destination_hash] = ratchet_data["ratchet"] - else: return None - + else: + return None + except Exception as e: RNS.log(f"An error occurred while loading ratchet data for {RNS.prettyhexrep(destination_hash)} from storage.", RNS.LOG_ERROR) RNS.log(f"The contained exception was: {e}", RNS.LOG_ERROR) return None - if destination_hash in Identity.known_ratchets: return Identity.known_ratchets[destination_hash] + if destination_hash in Identity.known_ratchets: + return Identity.known_ratchets[destination_hash] else: RNS.log(f"Could not load ratchet for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None return None @staticmethod - def _reset_validation_caches(): - Identity.announce_valid_cache = {} - Identity.announce_invalid_cache = {} - - __valid_cache_count = 0 - __valid_cache_max = 384 - @staticmethod - def __cache_valid_announce(result): - Identity.__valid_cache_count += 1 - result["id"] = Identity.__valid_cache_count - packet_hash = result["packet_hash"] - if packet_hash and not packet_hash in Identity.announce_valid_cache: - Identity.announce_valid_cache[packet_hash] = result - - Identity.announce_invalid_cache.pop(packet_hash, None) - - try: - while len(Identity.announce_valid_cache) > Identity.__valid_cache_max: - Identity.announce_valid_cache.pop(next(iter(Identity.announce_valid_cache))) - except Exception as e: RNS.log(f"Error while culling announce validation cache: {e}", RNS.LOG_DEBUG) - - return True - - __invalid_cache_count = 0 - __invalid_cache_max = 384 - @staticmethod - def __cache_invalid_announce(packet, signal=None, stamp_value=None): - Identity.__invalid_cache_count += 1 - result = (signal or False, stamp_value) - if packet.packet_hash: Identity.announce_invalid_cache[packet.packet_hash] = result - - try: - while len(Identity.announce_invalid_cache) > Identity.__invalid_cache_max: - Identity.announce_invalid_cache.pop(next(iter(Identity.announce_invalid_cache))) - except Exception as e: RNS.log(f"Error while culling announce invalidation cache: {e}", RNS.LOG_DEBUG) - - return result[0] - - @staticmethod - def __finalize_av(r, cache_hit=False): - # We are also re-persisting here on cache hit in the edge (but very possible) case - # that a path was culled (for example because of interface teardown), and its - # associated destination data was removed. Known destinations must always cover - # what is in the path table, anything else is state inconsintency. - if not cache_hit or not r["destination_hash"] in Identity.known_destinations: - RNS.Identity.remember(r["packet_hash"], r["destination_hash"], r["public_key"], app_data=r["app_data"], - stamp=r["stamp"], stamp_value=r["stamp_value"], lr_cost=r["lr_cost"]) - - if r["ratchet"]: Identity._remember_ratchet(r["destination_hash"], r["ratchet"]) - - valid_announce_loglevel = RNS.LOG_EXTREME - if RNS.sl(valid_announce_loglevel): - if r["rssi"] != None or r["snr"] != None: - signal_str = " [" - if r["rssi"] != None: - signal_str += "RSSI "+str(r["rssi"])+"dBm" - if r["snr"] != None: signal_str += ", " - if r["snr"] != None: signal_str += "SNR "+str(r["snr"])+"dB" - signal_str += "]" - else: signal_str = "" - - via_str = f" via {RNS.prettyhexrep(r['transport_id'])}" if r["transport_id"] else "" - val_str = f" (v:{RNS.prettycost(r['stamp_value'])})" - RNS.log(f"Valid announce for {RNS.prettyhexrep(r['destination_hash'])}{val_str} {r['hops']} hops away, received{via_str} on {r['receiving_interface']}{signal_str}", valid_announce_loglevel) - - return True - - announce_valid_cache = {} - announce_invalid_cache = {} - - @staticmethod - def validate_announce(packet, only_validate_signature=False, signal_blackholed=False, signal_stamp=False, required_value=None): - # Check cached announce invalidations - cached_invalidation = Identity.announce_invalid_cache.get(packet.packet_hash, None) - if cached_invalidation: - try: - if cached_invalidation[0] != "invalid_stamp": - if cached_invalidation[0] == "no_stamp": return cached_invalidation[0] if signal_stamp else False - elif cached_invalidation[0] == "blackholed": return cached_invalidation[0] if signal_blackholed else False - else: return False - elif cached_invalidation[1] != None: - rcvd_value = quantize_cost(cached_invalidation[1]) - if packet.receiving_interface: cost_target = packet.receiving_interface.destination_cost - else: cost_target = RNS.Transport.DESTINATION_COST - if quantize_cost(cost_target) > quantize_cost(rcvd_value): return "invalid_stamp" if signal_stamp else False - else: pass # Stamp value above target for this interface, allow re-validation - else: - RNS.log(f"Incoherent state in cached announce invalidation, rejecting announce", RNS.LOG_WARNING) - return False - - except Exception as e: - RNS.log(f"Error while processing cached invalid announce: {e}", RNS.LOG_DEBUG) - return False - - # Check cached announce validations - cached_validation = Identity.announce_valid_cache.get(packet.packet_hash, None) - if cached_validation: - try: - if RNS.Transport.STAMPS_ENABLED and RNS.Transport.STAMPS_ENFORCED: - if required_value == None: - if packet.receiving_interface: cost_target = packet.receiving_interface.destination_cost - else: cost_target = RNS.Transport.DESTINATION_COST - else: cost_target = required_value - - cached_stamp_value = cached_validation.get("stamp_value", None) - if cached_stamp_value == None: return "no_stamp" if signal_stamp else False - elif quantize_cost(cost_target) > quantize_cost(cached_stamp_value): - return "invalid_stamp" if signal_stamp else False - - except Exception as e: - RNS.log(f"Error while processing cached valid announce: {e}", RNS.LOG_DEBUG) - return False - - return Identity.__finalize_av(cached_validation, cache_hit=True) - - if required_value == None: - if packet.receiving_interface: required_value = packet.receiving_interface.destination_cost - else: required_value = RNS.Transport.DESTINATION_COST - + def validate_announce(packet, only_validate_signature=False, signal_blackholed=False): try: if packet.packet_type == RNS.Packet.ANNOUNCE: keysize = Identity.KEYSIZE//8 @@ -813,14 +520,11 @@ class Identity: # Get public key bytes from announce public_key = packet.data[:keysize] - # Shared format structure - ratchet = b"" - name_hash = packet.data[keysize:keysize+name_hash_len] - random_hash = packet.data[keysize+name_hash_len:keysize+name_hash_len+10] - # If the packet context flag is set, # this announce contains a new ratchet if packet.context_flag == RNS.Packet.FLAG_SET: + name_hash = packet.data[keysize:keysize+name_hash_len ] + random_hash = packet.data[keysize+name_hash_len:keysize+name_hash_len+10] ratchet = packet.data[keysize+name_hash_len+10:keysize+name_hash_len+10+ratchetsize] signature = packet.data[keysize+name_hash_len+10+ratchetsize:keysize+name_hash_len+10+ratchetsize+sig_len] app_data = b"" @@ -830,6 +534,9 @@ class Identity: # If the packet context flag is not set, # this announce does not contain a ratchet else: + ratchet = b"" + name_hash = packet.data[keysize:keysize+name_hash_len] + random_hash = packet.data[keysize+name_hash_len:keysize+name_hash_len+10] signature = packet.data[keysize+name_hash_len+10:keysize+name_hash_len+10+sig_len] app_data = b"" if len(packet.data) > keysize+name_hash_len+10+sig_len: @@ -840,70 +547,14 @@ class Identity: if not len(packet.data) > Identity.KEYSIZE//8+Identity.NAME_HASH_LENGTH//8+10+Identity.SIGLENGTH//8: app_data = None - stamp = None - dst_stamped = None - dst_value = None - stamp_validated = None - dst_lr_cost = None - if RNS.Transport.STAMPS_ENABLED and app_data and len(app_data) >= Identity.EXTPAYLOADLENGTH: - ext_payload = app_data[-Identity.EXTPAYLOADLENGTH:] - ext_header = ext_payload[:Identity.EXTHEADERLENGTH] - ext_flags = ext_header[1] # Reserved for future extensions - ext_anchor = ext_payload[-1] - - # The ext_anchor carries the lr_cost integer part, and a - # reserved flag in the MSB. The fractional part of the - # lr_cost is stored in the immediately preceding byte. - ext_extended = (ext_anchor & 0x80) != 0 - ext_lr_cost_i = ext_anchor & 0x7F - ext_lr_cost_m = ext_payload[-2] - cost_bytes = bytes([ext_lr_cost_i, ext_lr_cost_m]) - ext_lr_cost = cost_from_bytes(cost_bytes) - known_format = (not ext_extended) and (ext_lr_cost <= RNS.Transport.STAMP_COST_CAP) - - if (not ext_header[0] == Identity.EXTPAYLOADMARKER) or (not known_format): dst_stamped = False - else: - # RNS.log(f"Checking potential stamp in announce with app_data len {len(app_data)} for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_DEBUG) # TODO: Remove after 1.6.1 - dst_stamped = True - try: - stamp = ext_payload[Identity.EXTHEADERLENGTH:Identity.EXTHEADERLENGTH+Identity.STAMPLENGTH] - material = destination_hash+public_key+name_hash - wb = stamp_workblock(material, expand_rounds=0) - valid = stamp_valid(stamp, required_value, wb) - dst_value = stamp_value(wb, stamp) - - if valid: - app_data = app_data[:-Identity.EXTPAYLOADLENGTH] - if not len(app_data): app_data = None - stamp_validated = True - dst_lr_cost = ext_lr_cost - - except Exception as e: RNS.log(f"Announce stamp parsing failed: {e}", RNS.LOG_ERROR) - - # TODO: Initial debug only, remove ###### - # if RNS.sl(RNS.LOG_DEBUG): - # if not dst_stamped: RNS.log(f"No stamp on announce from {RNS.prettyhexrep(destination_hash)}", RNS.LOG_DEBUG) - # else: - # if not stamp_validated: RNS.log(f"Invalid or insufficient-value stamp for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_DEBUG) - # else: RNS.log(f"Valid stamp with value {dst_value} for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_DEBUG) - ######################################### - - if RNS.Transport.STAMPS_ENABLED and RNS.Transport.STAMPS_ENFORCED: - if not dst_stamped: - if signal_stamp: return Identity.__cache_invalid_announce(packet, "no_stamp") - else: return Identity.__cache_invalid_announce(packet) - elif not stamp_validated: - if signal_stamp: return Identity.__cache_invalid_announce(packet, "invalid_stamp", dst_value) - else: return Identity.__cache_invalid_announce(packet) - announced_identity = Identity(create_keys=False) announced_identity.load_public_key(public_key) if len(RNS.Transport.blackholed_identities) > 0: if announced_identity.hash in RNS.Transport.blackholed_identities: RNS.log(f"Invalidated and dropped announce from blackholed identity {RNS.prettyhexrep(announced_identity.hash)}", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None - if signal_blackholed: return Identity.__cache_invalid_announce(packet, "blackholed") - else: return Identity.__cache_invalid_announce(packet) + if signal_blackholed: return "blackholed" + else: return False if announced_identity.pub != None and (packet.announce_signature_validated or announced_identity.validate(signature, signed_data)): packet.announce_signature_validated = True @@ -913,7 +564,6 @@ class Identity: hash_material = name_hash+announced_identity.hash expected_hash = RNS.Identity.full_hash(hash_material)[:RNS.Reticulum.TRUNCATED_HASHLENGTH//8] - del announced_identity if destination_hash == expected_hash: # Check if we already have a public key for this destination @@ -924,63 +574,52 @@ class Identity: # that someone manages a hash collision, we reject the announce. RNS.log("Received announce with valid signature and destination hash, but announced public key does not match already known public key.", RNS.LOG_CRITICAL) RNS.log("This may indicate an attempt to modify network paths, or a random hash collision. The announce was rejected.", RNS.LOG_CRITICAL) - return Identity.__cache_invalid_announce(packet) + return False - validation_result = { "packet_hash": packet.packet_hash, "destination_hash": destination_hash, - "public_key": public_key, "ratchet": ratchet, "app_data": app_data, "stamp": stamp, - "stamp_value": dst_value, "lr_cost": dst_lr_cost, "transport_id": packet.transport_id, - "hops": packet.hops, "receiving_interface": str(packet.receiving_interface), - "rssi": packet.rssi, "snr": packet.snr, "q": packet.q } + RNS.Identity.remember(packet.get_hash(), destination_hash, public_key, app_data) + del announced_identity - Identity.__finalize_av(validation_result) - return Identity.__cache_valid_announce(validation_result) + if packet.rssi != None or packet.snr != None: + signal_str = " [" + if packet.rssi != None: + signal_str += "RSSI "+str(packet.rssi)+"dBm" + if packet.snr != None: signal_str += ", " + if packet.snr != None: signal_str += "SNR "+str(packet.snr)+"dB" + signal_str += "]" + + else: signal_str = "" + + if hasattr(packet, "transport_id") and packet.transport_id != None: + RNS.log("Valid announce for "+RNS.prettyhexrep(destination_hash)+" "+str(packet.hops)+" hops away, received via "+RNS.prettyhexrep(packet.transport_id)+" on "+str(packet.receiving_interface)+signal_str, RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None + else: + RNS.log("Valid announce for "+RNS.prettyhexrep(destination_hash)+" "+str(packet.hops)+" hops away, received on "+str(packet.receiving_interface)+signal_str, RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None + + if ratchet: Identity._remember_ratchet(destination_hash, ratchet) + + return True else: RNS.log("Received invalid announce for "+RNS.prettyhexrep(destination_hash)+": Destination mismatch.", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - return Identity.__cache_invalid_announce(packet) + return False else: RNS.log("Received invalid announce for "+RNS.prettyhexrep(destination_hash)+": Invalid signature.", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None del announced_identity - return Identity.__cache_invalid_announce(packet) + return False except Exception as e: RNS.log("Error occurred while validating announce. The contained exception was: "+str(e), RNS.LOG_ERROR) - RNS.trace_exception(e) # TODO: Remove debug return False @staticmethod def persist_data(background=False): - if hasattr(RNS.Transport, "owner") and not RNS.Transport.owner.is_connected_to_shared_instance: - if Identity.known_destinations_store != None: Identity.flush_known_destinations() - else: Identity.save_known_destinations_legacy(background=background) + if not RNS.Transport.owner.is_connected_to_shared_instance: + Identity.save_known_destinations(background=background) @staticmethod - def flush_known_destinations(): - store = Identity.known_destinations_store - if store == None: return False + def exit_handler(): + Identity.persist_data() - with Identity.known_destinations_lock: upserts, deletes, ratchet_upserts, ratchet_deletes = store.take_pending() - - try: return store.apply(upserts, deletes, ratchet_upserts, ratchet_deletes, Identity.known_destinations) - except Exception as e: - RNS.log(f"Could not flush known destinations to storage. The contained exception was: {e}", RNS.LOG_ERROR) - return False - - @staticmethod - def _kd_mark_dirty(destination_hash): - store = Identity.known_destinations_store - if store != None: store.mark_dirty(destination_hash) - - @staticmethod - def _kd_mark_deleted(destination_hash): - store = Identity.known_destinations_store - if store != None: - store.mark_deleted(destination_hash) - store.mark_ratchet_deleted(destination_hash) - - @staticmethod - def exit_handler(): Identity.persist_data() @staticmethod def from_bytes(prv_bytes): @@ -1047,7 +686,7 @@ class Identity: RNS.log("Error while saving identity to "+str(path), RNS.LOG_ERROR) RNS.log("The contained exception was: "+str(e)) - def __init__(self, create_keys=True, value=None): + def __init__(self,create_keys=True): # Initialize keys to none self.prv = None self.prv_bytes = None @@ -1063,43 +702,25 @@ class Identity: self.hexhash = None if create_keys: - self.create_keys(value=value) + self.create_keys() + + def create_keys(self): + self.prv = X25519PrivateKey.generate() + self.prv_bytes = self.prv.private_bytes() - def create_keys(self, value=None): self.sig_prv = Ed25519PrivateKey.generate() - self.sig_pub = self.sig_prv.public_key() self.sig_prv_bytes = self.sig_prv.private_bytes() - self.sig_pub_bytes = self.sig_pub.public_bytes() - - if not value: - self.prv = X25519PrivateKey.generate() - self.prv_bytes = self.prv.private_bytes() - - else: - stamped_key, v = generate_stamped_key(material=self.sig_pub_bytes, stamp_cost=value) - if not stamped_key: raise RuntimeError("Stamped identity key generation failed or was cancelled") - - stamped_prv = stamped_key[0] - self.prv = X25519PrivateKey.from_private_bytes(stamped_prv) - self.prv_bytes = self.prv.private_bytes() - - assert self.prv_bytes == stamped_prv - assert self.prv.public_key().public_bytes() == stamped_key[1] self.pub = self.prv.public_key() self.pub_bytes = self.pub.public_bytes() + self.sig_pub = self.sig_prv.public_key() + self.sig_pub_bytes = self.sig_pub.public_bytes() + self.update_hashes() RNS.log("Identity keys created for "+RNS.prettyhexrep(self.hash), RNS.LOG_VERBOSE) - def get_value(self): - """ - :returns: The stamp value of this identity as a *float* - """ - if not self.get_public_key(): return None - else: return stamp_value(self.sig_pub_bytes, self.pub_bytes) - def get_private_key(self): """ :returns: The private key as *bytes* diff --git a/RNS/Interfaces/AX25KISSInterface.py b/RNS/Interfaces/AX25KISSInterface.py index ae7f0e36..032b42ae 100644 --- a/RNS/Interfaces/AX25KISSInterface.py +++ b/RNS/Interfaces/AX25KISSInterface.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -130,7 +130,6 @@ class AX25KISSInterface(Interface): self.flow_control = flow_control self.shared_medium = True self.interface_ready = False - self.reconnecting = False self.flow_control_timeout = 5 self.flow_control_locked = time.time() @@ -153,18 +152,14 @@ class AX25KISSInterface(Interface): try: self.open_port() - if self.serial.is_open: self.configure_device() - else: raise IOError("Could not open serial port") - except Exception as e: - RNS.log(f"Could not open serial port for {self}", RNS.LOG_ERROR) - RNS.log(f"The contained exception was: {e}", RNS.LOG_ERROR) - RNS.log(f"Reticulum will attempt to bring up this interface periodically", RNS.LOG_ERROR) - if not self.detached and not self.reconnecting: - thread = threading.Thread(target=self.reconnect_port) - thread.daemon = True - thread.start() + RNS.log("Could not open serial port for interface "+str(self), RNS.LOG_ERROR) + raise e + if self.serial.is_open: + self.configure_device() + else: + raise IOError("Could not open serial port") def open_port(self): RNS.log("Opening serial port "+self.port+"...", RNS.LOG_VERBOSE) @@ -182,12 +177,6 @@ class AX25KISSInterface(Interface): dsrdtr = False, ) - def detach(self): - self.detached = True - self.online = False - try: self.serial.close() - except Exception as e: RNS.log(f"Could not close port for {self} at detach: {e}", RNS.LOG_ERROR) - def configure_device(self): # Allow time for interface to initialise before config sleep(2.0) @@ -266,7 +255,9 @@ class AX25KISSInterface(Interface): def process_incoming(self, data): - if (len(data) > AX25.HEADER_SIZE): self.owner.inbound(data[AX25.HEADER_SIZE:], self) + if (len(data) > AX25.HEADER_SIZE): + self.rxb += len(data) + self.owner.inbound(data[AX25.HEADER_SIZE:], self) def process_outgoing(self,data): @@ -382,28 +373,30 @@ class AX25KISSInterface(Interface): RNS.log("A serial port error occurred, the contained exception was: "+str(e), RNS.LOG_ERROR) RNS.log("The interface "+str(self)+" experienced an unrecoverable error and is now offline.", RNS.LOG_ERROR) - if RNS.Reticulum.panic_on_interface_error: RNS.panic() + if RNS.Reticulum.panic_on_interface_error: + RNS.panic() RNS.log("Reticulum will attempt to reconnect the interface periodically.", RNS.LOG_ERROR) self.online = False - try: self.serial.close() - except Exception as e: RNS.log(f"Could not close port for {self}", RNS.LOG_ERROR) - if not self.detached and not self.reconnecting: self.reconnect_port() + self.serial.close() + self.reconnect_port() def reconnect_port(self): - self.reconnecting = True - while not self.online and not self.detached: + while not self.online: try: time.sleep(5) RNS.log("Attempting to reconnect serial port "+str(self.port)+" for "+str(self)+"...", RNS.LOG_VERBOSE) self.open_port() - if self.serial.is_open: self.configure_device() - except Exception as e: RNS.log("Error while reconnecting port, the contained exception was: "+str(e), RNS.LOG_ERROR) + if self.serial.is_open: + self.configure_device() + except Exception as e: + RNS.log("Error while reconnecting port, the contained exception was: "+str(e), RNS.LOG_ERROR) - self.reconnecting = False - if self.online: RNS.log("Reconnected serial port for "+str(self)) + RNS.log("Reconnected serial port for "+str(self)) - def should_ingress_limit(self): return False + def should_ingress_limit(self): + return False - def __str__(self): return "AX25KISSInterface["+self.name+"]" \ No newline at end of file + def __str__(self): + return "AX25KISSInterface["+self.name+"]" \ No newline at end of file diff --git a/RNS/Interfaces/Android/KISSInterface.py b/RNS/Interfaces/Android/KISSInterface.py index 0bdbf00f..6ba32099 100644 --- a/RNS/Interfaces/Android/KISSInterface.py +++ b/RNS/Interfaces/Android/KISSInterface.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -128,7 +128,6 @@ class KISSInterface(Interface): self.beacon_d = beacon_data.encode("utf-8") self.first_tx = None self.bitrate = KISSInterface.BITRATE_GUESS - self.reconnecting = False self.packet_queue = [] self.flow_control = flow_control @@ -150,23 +149,15 @@ class KISSInterface(Interface): try: self.open_port() - if self.serial.is_open: self.configure_device() - else: raise IOError("Could not open serial port") - except Exception as e: - RNS.log(f"Could not open serial port for {self}", RNS.LOG_ERROR) - RNS.log(f"The contained exception was: {e}", RNS.LOG_ERROR) - RNS.log(f"Reticulum will attempt to bring up this interface periodically", RNS.LOG_ERROR) - if not self.detached and not self.reconnecting: - thread = threading.Thread(target=self.reconnect_port) - thread.daemon = True - thread.start() + RNS.log("Could not open serial port "+self.port, RNS.LOG_ERROR) + raise e + + if self.serial.is_open: + self.configure_device() + else: + raise IOError("Could not open serial port") - def detach(self): - self.detached = True - self.online = False - try: self.serial.close() - except Exception as e: RNS.log(f"Could not close port for {self} at detach: {e}", RNS.LOG_ERROR) def open_port(self): RNS.log("Opening serial port "+self.port+"...") @@ -426,23 +417,24 @@ class KISSInterface(Interface): RNS.log("Reticulum will attempt to reconnect the interface periodically.", RNS.LOG_ERROR) self.online = False - try: self.serial.close() - except Exception as e: RNS.log(f"Could not close port for {self}", RNS.LOG_ERROR) - if not self.detached and not self.reconnecting: self.reconnect_port() + self.serial.close() + self.reconnect_port() def reconnect_port(self): - self.reconnecting = True while not self.online: try: time.sleep(5) RNS.log("Attempting to reconnect serial port "+str(self.port)+" for "+str(self)+"...", RNS.LOG_VERBOSE) self.open_port() - if self.serial.is_open: self.configure_device() - except Exception as e: RNS.log("Error while reconnecting port, the contained exception was: "+str(e), RNS.LOG_ERROR) + if self.serial.is_open: + self.configure_device() + except Exception as e: + RNS.log("Error while reconnecting port, the contained exception was: "+str(e), RNS.LOG_ERROR) - self.reconnecting = False - if self.online: RNS.log("Reconnected serial port for "+str(self)) + RNS.log("Reconnected serial port for "+str(self)) - def should_ingress_limit(self): return False + def should_ingress_limit(self): + return False - def __str__(self): return "KISSInterface["+self.name+"]" \ No newline at end of file + def __str__(self): + return "KISSInterface["+self.name+"]" \ No newline at end of file diff --git a/RNS/Interfaces/Android/RNodeInterface.py b/RNS/Interfaces/Android/RNodeInterface.py index 3b25f75d..5d8b19f0 100644 --- a/RNS/Interfaces/Android/RNodeInterface.py +++ b/RNS/Interfaces/Android/RNodeInterface.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -500,7 +500,6 @@ class RNodeInterface(Interface): self.r_interference = None self.r_interference_l = None self.r_temperature = None - self.reports_phy_stats = True self.r_battery_state = RNodeInterface.BATTERY_STATE_UNKNOWN self.r_battery_percent = 0 @@ -1505,13 +1504,13 @@ class RNodeInterface(Interface): except Exception as e: self.online = False - if not self.detached: - RNS.log("A serial port error occurred, the contained exception was: "+str(e), RNS.LOG_ERROR) - RNS.log("The interface "+str(self)+" experienced an unrecoverable error and is now offline.", RNS.LOG_ERROR) + RNS.log("A serial port error occurred, the contained exception was: "+str(e), RNS.LOG_ERROR) + RNS.log("The interface "+str(self)+" experienced an unrecoverable error and is now offline.", RNS.LOG_ERROR) - if RNS.Reticulum.panic_on_interface_error: RNS.panic() + if RNS.Reticulum.panic_on_interface_error: + RNS.panic() - RNS.log("Reticulum will attempt to reconnect the interface periodically.", RNS.LOG_ERROR) + RNS.log("Reticulum will attempt to reconnect the interface periodically.", RNS.LOG_ERROR) self.online = False @@ -1571,14 +1570,10 @@ class RNodeInterface(Interface): except Exception as e: RNS.log(f"An error occurred while detaching {self}: {e}", RNS.LOG_ERROR) - if self.use_ble: - self.ble.close() - self.ble.cleanup() - elif self.use_tcp: + if self.use_ble: self.ble.close() + if self.use_tcp: time.sleep(0.5) self.tcp.close() - else: - self.serial.close() def should_ingress_limit(self): return False @@ -1657,9 +1652,6 @@ class BLEConnection(BluetoothDispatcher): self.owner.ble_rx_queue = b"" return data - def cleanup(self): - self.should_run = False - def close(self): try: if self.connected: diff --git a/RNS/Interfaces/Android/SerialInterface.py b/RNS/Interfaces/Android/SerialInterface.py index 22c28765..088b41fc 100644 --- a/RNS/Interfaces/Android/SerialInterface.py +++ b/RNS/Interfaces/Android/SerialInterface.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -109,7 +109,6 @@ class SerialInterface(Interface): self.timeout = 100 self.online = False self.bitrate = self.speed - self.reconnecting = False if parity.lower() == "e" or parity.lower() == "even": self.parity = "E" @@ -119,23 +118,15 @@ class SerialInterface(Interface): try: self.open_port() - if self.serial.is_open: self.configure_device() - else: raise IOError("Could not open serial port") - except Exception as e: - RNS.log(f"Could not open serial port for {self}", RNS.LOG_ERROR) - RNS.log(f"The contained exception was: {e}", RNS.LOG_ERROR) - RNS.log(f"Reticulum will attempt to bring up this interface periodically", RNS.LOG_ERROR) - if not self.detached and not self.reconnecting: - thread = threading.Thread(target=self.reconnect_port) - thread.daemon = True - thread.start() + RNS.log("Could not open serial port for interface "+str(self), RNS.LOG_ERROR) + raise e + + if self.serial.is_open: + self.configure_device() + else: + raise IOError("Could not open serial port") - def detach(self): - self.detached = True - self.online = False - try: self.serial.close() - except Exception as e: RNS.log(f"Could not close port for {self} at detach: {e}", RNS.LOG_ERROR) def open_port(self): RNS.log("Opening serial port "+self.port+"...") @@ -267,23 +258,24 @@ class SerialInterface(Interface): RNS.log("Reticulum will attempt to reconnect the interface periodically.", RNS.LOG_ERROR) self.online = False - try: self.serial.close() - except Exception as e: RNS.log(f"Could not close port for {self}", RNS.LOG_ERROR) - if not self.detached and not self.reconnecting: self.reconnect_port() + self.serial.close() + self.reconnect_port() def reconnect_port(self): - self.reconnecting = True - while not self.online and not self.detached: + while not self.online: try: time.sleep(5) RNS.log("Attempting to reconnect serial port "+str(self.port)+" for "+str(self)+"...", RNS.LOG_VERBOSE) self.open_port() - if self.serial.is_open: self.configure_device() - except Exception as e: RNS.log("Error while reconnecting port, the contained exception was: "+str(e), RNS.LOG_ERROR) + if self.serial.is_open: + self.configure_device() + except Exception as e: + RNS.log("Error while reconnecting port, the contained exception was: "+str(e), RNS.LOG_ERROR) - self.reconnecting = False - if self.online: RNS.log("Reconnected serial port for "+str(self)) + RNS.log("Reconnected serial port for "+str(self)) - def should_ingress_limit(self): return False + def should_ingress_limit(self): + return False - def __str__(self): return "SerialInterface["+self.name+"]" + def __str__(self): + return "SerialInterface["+self.name+"]" diff --git a/RNS/Interfaces/AutoInterface.py b/RNS/Interfaces/AutoInterface.py index 5514449d..c136efdf 100644 --- a/RNS/Interfaces/AutoInterface.py +++ b/RNS/Interfaces/AutoInterface.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -127,7 +127,6 @@ class AutoInterface(Interface): self.link_local_addresses = [] self.adopted_interfaces = {} self.interface_servers = {} - self.discovery_sockets = [] self.multicast_echoes = {} self.initial_echoes = {} self.timed_out_interfaces = {} @@ -269,8 +268,6 @@ class AutoInterface(Interface): addr_info = socket.getaddrinfo(link_local_addr+"%"+ifname, self.unicast_discovery_port, socket.AF_INET6, socket.SOCK_DGRAM) unicast_discovery_socket.bind(addr_info[0][4]) - self.discovery_sockets.append(unicast_discovery_socket) - mcast_addr = self.mcast_discovery_address RNS.log(str(self)+" Creating multicast discovery listener on "+str(ifname)+" with address "+str(mcast_addr), RNS.LOG_EXTREME) @@ -299,8 +296,6 @@ class AutoInterface(Interface): discovery_socket.bind(addr_info[0][4]) - self.discovery_sockets.append(discovery_socket) - # Set up thread for multicast discovery packets def discovery_loop(): self.discovery_handler(discovery_socket, ifname) thread = threading.Thread(target=discovery_loop, daemon=True).start() @@ -363,9 +358,9 @@ class AutoInterface(Interface): thread.daemon = True thread.start() - while not self.detached: + while True: data, ipv6_src = socket.recvfrom(1024) - if self.final_init_done and data and ipv6_src: + if self.final_init_done: peering_hash = data[:RNS.Identity.HASHLENGTH//8] expected_hash = RNS.Identity.full_hash(self.group_id+ipv6_src[0].encode("utf-8")) if peering_hash == expected_hash: @@ -374,7 +369,7 @@ class AutoInterface(Interface): RNS.log(str(self)+" received peering packet on "+str(ifname)+" from "+str(ipv6_src[0])+", but authentication hash was incorrect.", RNS.LOG_DEBUG) def peer_jobs(self): - while not self.detached: + while True: time.sleep(self.peer_job_interval) now = time.time() timed_out_peers = [] @@ -483,7 +478,7 @@ class AutoInterface(Interface): def announce_handler(self, ifname): - while not self.detached: + while True: self.peer_announce(ifname) time.sleep(self.announce_interval) @@ -557,9 +552,6 @@ class AutoInterface(Interface): spawned_interface.ec_pr_freq = self.ec_pr_freq spawned_interface.ic_pr_burst_freq_new = self.ic_pr_burst_freq_new spawned_interface.ic_pr_burst_freq = self.ic_pr_burst_freq - - spawned_interface._destination_cost = self._destination_cost - spawned_interface._pr_cost = self._pr_cost spawned_interface.parent_interface = self spawned_interface.bitrate = self.bitrate @@ -589,10 +581,6 @@ class AutoInterface(Interface): spawned_interface.announce_rate_penalty = self.announce_rate_penalty spawned_interface.mode = self.mode spawned_interface.gravity = self.gravity - spawned_interface.recursive_prs = self.recursive_prs - spawned_interface.announces_from_internal = self.announces_from_internal - spawned_interface.announces_to_internal = self.announces_to_internal - spawned_interface.announce_cap = self.announce_cap spawned_interface.HW_MTU = self.HW_MTU spawned_interface.online = True RNS.Transport.add_interface(spawned_interface) @@ -616,20 +604,7 @@ class AutoInterface(Interface): def process_outgoing(self, data): pass - def detach(self): - self.online = False - self.detached = True - - RNS.log(f"Shutting down all UDP listeners for {self}", RNS.LOG_NOTICE) - for ifname in self.interface_servers: - try: - self.interface_servers[ifname].server_close() - self.interface_servers[ifname].shutdown() - except Exception as e: RNS.log(f"Could not shut down UDP listener {ifname} for {self}: {e}", RNS.LOG_ERROR) - - for s in self.discovery_sockets: - try: s.close() - except Exception as e: RNS.log(f"Error while shutting down discovery socket {s} for {self}: {e}", RNS.LOG_ERROR) + def detach(self): self.online = False def __str__(self): return f"AutoInterface[{self.name}]" @@ -663,6 +638,8 @@ class AutoInterfacePeer(Interface): self.owner.refresh_peer(self.addr) self.owner.mif_deque.append(data_hash) self.owner.mif_deque_times.append([data_hash, time.time()]) + self.rxb += len(data) + self.owner.rxb += len(data) self.owner.owner.inbound(data, self) def process_outgoing(self, data): diff --git a/RNS/Interfaces/BackboneInterface.py b/RNS/Interfaces/BackboneInterface.py index 16dbdc75..03fcd744 100644 --- a/RNS/Interfaces/BackboneInterface.py +++ b/RNS/Interfaces/BackboneInterface.py @@ -52,11 +52,9 @@ class BackboneInterface(Interface): fast_flapping_lock = threading.Lock() fast_flapping = {} - CLIENT_LIMIT = 500 - - DP_IC_HIGH_WM_PCT = 90 - DP_IC_MID_WM_PCT = 68 - DP_IC_LOW_WM_PCT = 10 + DP_IC_HIGH_WM_PCT = 85 + DP_IC_MID_WM_PCT = 10 + DP_IC_LOW_WM_PCT = 1 DP_IC_INTERVAL = 0.250 DP_IC_TRIGGER = 1.5 DP_IC_RCVBUF = 32768 @@ -137,7 +135,6 @@ class BackboneInterface(Interface): port = int(c["port"]) if "port" in c else None bindip = c["listen_ip"] if "listen_ip" in c else None bindport = int(c["listen_port"]) if "listen_port" in c else None - client_limit = int(c["client_limit"]) if "client_limit" in c else None prefer_ipv6 = c.as_bool("prefer_ipv6") if "prefer_ipv6" in c else False flap_block = c.as_bool("block_fast_flapping") if "block_fast_flapping" in c else BackboneInterface.BLOCK_FAST_FLAPPING flap_threshold = c.as_float("fast_flapping_threshold") if "fast_flapping_threshold" in c else BackboneInterface.FAST_FLAP_THRESHOLD @@ -155,9 +152,6 @@ class BackboneInterface(Interface): self.mode = RNS.Interfaces.Interface.Interface.MODE_FULL self.spawned_interfaces = [] self.supports_discovery = True - self.tunnels_allowed = True - self.lossless_medium = True - self.client_limit = client_limit or self.CLIENT_LIMIT self.block_fast_flapping = flap_block self.fast_flap_threshold = flap_threshold self.fast_flap_grace = flap_grace @@ -290,7 +284,7 @@ class BackboneInterface(Interface): server_socket.bind(bind_address) else: raise TypeError(f"Invalid socket type {socket_type} for {interface}") - server_socket.listen(16) + server_socket.listen(1) server_socket.setblocking(0) BackboneInterface.listener_filenos[server_socket.fileno()] = (interface, server_socket) BackboneInterface.epoll.register(server_socket.fileno(), select.EPOLLIN) @@ -414,14 +408,6 @@ class BackboneInterface(Interface): RNS.log(f"Available ingress budget {RNS.prettyspeed(avail*8)}, hard-allocated {round(alloc*100.0, 2)}% ({RNS.prettyspeed(avail*alloc*8)}), handled in {RNS.prettyshorttime(taken, compact=True, tight=True)}", RNS.LOG_DEBUG) RNS.log(f"Holding for {RNS.prettyshorttime(hold, compact=True, tight=True)}, throttling handled in {RNS.prettyshorttime(taken, compact=True, tight=True)} at depth {q_depth}", RNS.LOG_DEBUG) - @staticmethod - def _dp_ec_reset(interface): - interface._dp_ec_prev_sent = 0 - interface._dp_ec_zero_ticks = 0 - interface._dp_ec_last_drain = time.time() - interface.transmit_buffer = TransmitBuffer() - interface.tx_stalled = False - @staticmethod def _dp_ec_evaluate(interface, now): tb = interface.transmit_buffer @@ -438,7 +424,7 @@ class BackboneInterface(Interface): return False if now - interface._dp_ec_last_drain >= BackboneInterface.DP_EC_DEAD_TIME: - RNS.log(f"No egress control drain progress for {RNS.prettyshorttime(BackboneInterface.DP_EC_DEAD_TIME, compact=True)} on {interface}, tearing down", RNS.LOG_NOTICE) + RNS.log(f"No egress control drain progress for {RNS.prettyshorttime(BackboneInterface.DP_EC_DEAD_TIME, compact=True)} on {interface}, tearing down", RNS.LOG_WARNING) try: if hasattr(interface, "socket") and interface.socket: fileno = interface.socket.fileno() @@ -448,7 +434,6 @@ class BackboneInterface(Interface): except Exception as e: RNS.log(f"Egress control could not close socket for {interface}: {e}", RNS.LOG_ERROR) except Exception as e: RNS.log(f"Egress control cleanup error for {interface}: {e}", RNS.LOG_ERROR) - BackboneInterface._dp_ec_reset(interface) interface.receive(b"") return True @@ -497,7 +482,6 @@ class BackboneInterface(Interface): for interface in interfaces: if interface.detached: continue - if isinstance(interface, RNS.Interfaces.LocalInterface.LocalClientInterface): continue BackboneInterface._dp_ec_evaluate(interface, now) except Exception as e: @@ -524,7 +508,7 @@ class BackboneInterface(Interface): interfaces = list(BackboneInterface.spawned_interface_filenos.values()) if q_depth > BackboneInterface.DP_IC_MID_WM: - producers = [iface for iface in interfaces if iface.dp_ingress_packets > 0 and not isinstance(iface, RNS.Interfaces.LocalInterface.LocalClientInterface)] + producers = [iface for iface in interfaces if iface.dp_ingress_packets > 0] if producers: producers.sort(key=lambda p: p.dp_ingress_packets, reverse=True) selected = producers[0] @@ -693,8 +677,6 @@ class BackboneInterface(Interface): def incoming_connection(self, socket): try: - if len(self.spawned_interfaces) >= self.client_limit: return False - remote_ip = socket.getpeername()[0] remote_port = str(socket.getpeername()[1]) if self.blocked_ip_count > 0: @@ -729,9 +711,6 @@ class BackboneInterface(Interface): spawned_interface.ic_pr_burst_freq_new = self.ic_pr_burst_freq_new spawned_interface.ic_pr_burst_freq = self.ic_pr_burst_freq - spawned_interface._destination_cost = self._destination_cost - spawned_interface._pr_cost = self._pr_cost - spawned_interface.socket = socket spawned_interface.target_ip = remote_ip spawned_interface.target_port = remote_port @@ -758,11 +737,6 @@ class BackboneInterface(Interface): spawned_interface.announce_rate_penalty = self.announce_rate_penalty spawned_interface.mode = self.mode spawned_interface.gravity = self.gravity - spawned_interface.hop_limiter = self.hop_limiter - spawned_interface.recursive_prs = self.recursive_prs - spawned_interface.announces_from_internal = self.announces_from_internal - spawned_interface.announces_to_internal = self.announces_to_internal - spawned_interface.announce_cap = self.announce_cap spawned_interface.HW_MTU = self.HW_MTU RNS.log("Spawned new BackboneClient Interface: "+str(spawned_interface), RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None RNS.Transport.add_interface(spawned_interface) @@ -886,7 +860,6 @@ class BackboneClientInterface(Interface): self.OUT = False self.socket = None self.parent_interface = None - self.tunnels_allowed = True self.name = name self.initiator = False self.reconnecting = False @@ -894,7 +867,6 @@ class BackboneClientInterface(Interface): self.owner = owner self.online = False self.detached = False - self.lossless_medium = True self.prefer_ipv6 = prefer_ipv6 self.i2p_tunneled = i2p_tunneled self.mode = RNS.Interfaces.Interface.Interface.MODE_FULL @@ -924,21 +896,25 @@ class BackboneClientInterface(Interface): self.target_port = target_port self.initiator = True - if connect_timeout != None: self.connect_timeout = connect_timeout - else: self.connect_timeout = BackboneClientInterface.INITIAL_CONNECT_TIMEOUT - - def final_init(self): - if BackboneClientInterface.SYNCHRONOUS_START: self.initial_connect() - else: - thread = threading.Thread(target=self.initial_connect) - thread.daemon = True - thread.start() - + if connect_timeout != None: + self.connect_timeout = connect_timeout + else: + self.connect_timeout = BackboneClientInterface.INITIAL_CONNECT_TIMEOUT + + if BackboneClientInterface.SYNCHRONOUS_START: + self.initial_connect() + else: + thread = threading.Thread(target=self.initial_connect) + thread.daemon = True + thread.start() + def initial_connect(self): if not self.connect(initial=True): thread = threading.Thread(target=self.reconnect) thread.daemon = True thread.start() + else: + self.wants_tunnel = True def set_timeouts_linux(self): self.socket.setsockopt(socket.IPPROTO_TCP, socket.TCP_USER_TIMEOUT, int(BackboneClientInterface.TCP_USER_TIMEOUT * 1000)) @@ -949,10 +925,11 @@ class BackboneClientInterface(Interface): def detach(self): self.online = False - self.detached = True if self.socket != None: if hasattr(self.socket, "close"): if callable(self.socket.close): + self.detached = True + try: if self.socket != None: self.socket.shutdown(socket.SHUT_RDWR) except Exception as e: @@ -966,17 +943,6 @@ class BackboneClientInterface(Interface): self.socket = None - def early_synthesis(self, packet): - if not self.detached: - if not packet.packed: packet.pack() - if self.ifac_identity: raw = RNS.Transport.handle_outgoing_ifac(self, packet.raw); - else: raw = packet.raw - frame = HDLC.frame(raw) - if not self.transmit_buffer.append(frame, self.tx_hwm): - raise IOError("Transmit buffer overflow at early tunnel synthesis") - - BackboneInterface.tx_ready(self) - def connect(self, initial=False): try: if initial: @@ -1000,11 +966,7 @@ class BackboneClientInterface(Interface): # TODO: Check missing setblocking(0) self.socket.settimeout(None) - self.wants_tunnel = True - self.remote_transport = None - self.synthesis_received = False BackboneInterface.add_client_socket(self.socket, self) - RNS.Transport.synthesize_tunnel(self) self.online = True if initial: @@ -1029,7 +991,6 @@ class BackboneClientInterface(Interface): def reconnect(self): if self.initiator: if not self.reconnecting: - BackboneInterface._dp_ec_reset(self) self.reconnecting = True attempts = 0 while not self.online and not self.detached: @@ -1051,6 +1012,7 @@ class BackboneClientInterface(Interface): RNS.log("Reconnected socket for "+str(self)+".", RNS.LOG_INFO) self.reconnecting = False + RNS.Transport.synthesize_tunnel(self) else: RNS.log("Attempt to reconnect on a non-initiator TCP interface. This should not happen.", RNS.LOG_ERROR) @@ -1058,13 +1020,17 @@ class BackboneClientInterface(Interface): def process_incoming(self, data): if self.online and not self.detached: + self.rxb += len(data) + if hasattr(self, "parent_interface") and self.parent_interface != None: + self.parent_interface.rxb += len(data) + self.dp_ingress_packets += 1 self.owner.inbound(data, self) def process_outgoing(self, data): if self.online and not self.detached: try: - frame = HDLC.frame(data) + frame = bytes([HDLC.FLAG])+HDLC.escape(data)+bytes([HDLC.FLAG]) if self.tx_stalled or not self.transmit_buffer.append(frame, self.tx_hwm): self.tx_drops += 1 self.tx_dropped_bytes += len(frame) diff --git a/RNS/Interfaces/I2PInterface.py b/RNS/Interfaces/I2PInterface.py index 3fabd0e8..f8a562c6 100644 --- a/RNS/Interfaces/I2PInterface.py +++ b/RNS/Interfaces/I2PInterface.py @@ -353,11 +353,9 @@ class I2PInterfacePeer(Interface): self.online = False self.detached = False self.kiss_framing = False - self.tunnels_allowed = True self.i2p_tunneled = True self.i2p_dest = None self.i2p_tunnel_ready = False - self.lossless_medium = True self.mode = RNS.Interfaces.Interface.Interface.MODE_FULL self.bitrate = I2PInterface.BITRATE_GUESS self.last_read = 0 @@ -427,6 +425,8 @@ class I2PInterfacePeer(Interface): while self.awaiting_i2p_tunnel: time.sleep(0.25) time.sleep(2) + if not self.kiss_framing: self.wants_tunnel = True + if not self.connect(initial=True): thread = threading.Thread(target=self.reconnect) thread.daemon = True @@ -479,31 +479,10 @@ class I2PInterfacePeer(Interface): self.socket = None - def early_synthesis(self, packet): - if not self.detached: - if not packet.packed: packet.pack() - if self.ifac_identity: raw = RNS.Transport.handle_outgoing_ifac(self, packet.raw); - else: raw = packet.raw - - if self.kiss_framing: frame = bytes([KISS.FEND])+bytes([KISS.CMD_DATA])+KISS.escape(raw)+bytes([KISS.FEND]) - else: frame = bytes([HDLC.FLAG])+HDLC.escape(raw)+bytes([HDLC.FLAG]) - - self.socket.sendall(frame) - self.txb += len(frame) - self.last_write = time.time() - if hasattr(self, "parent_interface") and self.parent_interface != None and self.parent_count: self.parent_interface.txb += len(frame) - def connect(self, initial=False): try: self.socket = socket.socket(socket.AF_INET, socket.SOCK_STREAM) self.socket.connect((self.target_ip, self.target_port)) - - if not self.kiss_framing: - self.wants_tunnel = True - self.remote_transport = None - self.synthesis_received = False - RNS.Transport.synthesize_tunnel(self) - self.online = True except Exception as e: @@ -521,6 +500,8 @@ class I2PInterfacePeer(Interface): self.writing = False self.never_connected = False + if not self.kiss_framing and self.wants_tunnel: RNS.Transport.synthesize_tunnel(self) + return True def reconnect(self): @@ -549,13 +530,16 @@ class I2PInterfacePeer(Interface): thread = threading.Thread(target=self.read_loop) thread.daemon = True thread.start() + if not self.kiss_framing: RNS.Transport.synthesize_tunnel(self) else: RNS.log("Attempt to reconnect on a non-initiator I2P interface. This should not happen.", RNS.LOG_ERROR) raise IOError("Attempt to reconnect on a non-initiator I2P interface") def process_incoming(self, data): - if not data: return + self.rxb += len(data) + if hasattr(self, "parent_interface") and self.parent_interface != None and self.parent_count: + self.parent_interface.rxb += len(data) self.owner.inbound(data, self) def process_outgoing(self, data): @@ -756,8 +740,6 @@ class I2PInterface(Interface): self.owner = owner self.connectable = connectable self.i2p_tunneled = True - self.tunnels_allowed = True - self.peers = peers self.mode = RNS.Interfaces.Interface.Interface.MODE_FULL self.b32 = None @@ -767,6 +749,7 @@ class I2PInterface(Interface): self.OUT = False self.name = name + self.receives = True self.bind_ip = "127.0.0.1" self.bind_port = self.i2p.get_free_port() @@ -776,7 +759,6 @@ class I2PInterface(Interface): self.ifac_netname = ifac_netname self.ifac_netkey = ifac_netkey self.supports_discovery = True - self.lossless_medium = True self.online = False @@ -807,7 +789,6 @@ class I2PInterface(Interface): thread.daemon = True thread.start() - def final_init(self): if self.connectable: def tunnel_job(): while True: @@ -827,61 +808,22 @@ class I2PInterface(Interface): thread.daemon = True thread.start() - threading.Thread(target=self._spawn_peers, daemon=True).start() - - def _spawn_peers(self): - time.sleep(1.5) - if self.peers != None: - for peer_addr in self.peers: - try: - interface_name = self.name+" to "+peer_addr - peer_interface = I2PInterfacePeer(self, self.owner, interface_name, peer_addr) - peer_interface.OUT = self.OUT - peer_interface.IN = self.IN - peer_interface.parent_interface = self - peer_interface.parent_count = False - - peer_interface.mode = self.mode - peer_interface.bitrate = self.bitrate - peer_interface.recursive_prs = self.recursive_prs - peer_interface.gravity = self.gravity - peer_interface.HW_MTU = self.HW_MTU - - peer_interface.announces_to_internal = self.announces_to_internal - peer_interface.announces_from_internal = self.announces_from_internal - peer_interface.announce_cap = self.announce_cap - - peer_interface.ingress_control = self.ingress_control - peer_interface.ic_max_held_announces = self.ic_max_held_announces - peer_interface.ic_burst_hold = self.ic_burst_hold - peer_interface.ic_burst_freq = self.ic_burst_freq - peer_interface.ic_burst_freq_new = self.ic_burst_freq_new - peer_interface.ic_new_time = self.ic_new_time - peer_interface.ic_burst_penalty = self.ic_burst_penalty - peer_interface.ic_held_release_interval = self.ic_held_release_interval - - peer_interface.egress_control = self.egress_control - peer_interface.ec_pr_freq = self.ec_pr_freq - peer_interface.ic_pr_burst_freq_new = self.ic_pr_burst_freq_new - peer_interface.ic_pr_burst_freq = self.ic_pr_burst_freq - - peer_interface.announce_rate_target = self.announce_rate_target - peer_interface.announce_rate_grace = self.announce_rate_grace - peer_interface.announce_rate_penalty = self.announce_rate_penalty - - peer_interface._destination_cost = self._destination_cost - peer_interface._pr_cost = self._pr_cost - - RNS.Transport.add_interface(peer_interface) - - except Exception as e: RNS.log(f"Could not create interface for {self} to {peer_addr}: {e}", RNS.LOG_ERROR) + if peers != None: + for peer_addr in peers: + interface_name = self.name+" to "+peer_addr + peer_interface = I2PInterfacePeer(self, self.owner, interface_name, peer_addr) + peer_interface.OUT = True + peer_interface.IN = True + peer_interface.parent_interface = self + peer_interface.parent_count = False + RNS.Transport.add_interface(peer_interface) def incoming_connection(self, handler): RNS.log("Accepting incoming I2P connection", RNS.LOG_VERBOSE) interface_name = "Connected peer on "+self.name spawned_interface = I2PInterfacePeer(self, self.owner, interface_name, connected_socket=handler.request) - spawned_interface.OUT = self.OUT - spawned_interface.IN = self.IN + spawned_interface.OUT = True + spawned_interface.IN = True spawned_interface.ingress_control = self.ingress_control spawned_interface.ic_max_held_announces = self.ic_max_held_announces @@ -892,17 +834,10 @@ class I2PInterface(Interface): spawned_interface.ic_burst_penalty = self.ic_burst_penalty spawned_interface.ic_held_release_interval = self.ic_held_release_interval - spawned_interface.announces_to_internal = self.announces_to_internal - spawned_interface.announces_from_internal = self.announces_from_internal - spawned_interface.announce_cap = self.announce_cap - spawned_interface.egress_control = self.egress_control spawned_interface.ec_pr_freq = self.ec_pr_freq spawned_interface.ic_pr_burst_freq_new = self.ic_pr_burst_freq_new spawned_interface.ic_pr_burst_freq = self.ic_pr_burst_freq - - spawned_interface._destination_cost = self._destination_cost - spawned_interface._pr_cost = self._pr_cost spawned_interface.parent_interface = self spawned_interface.online = True @@ -925,9 +860,7 @@ class I2PInterface(Interface): spawned_interface.announce_rate_grace = self.announce_rate_grace spawned_interface.announce_rate_penalty = self.announce_rate_penalty spawned_interface.mode = self.mode - spawned_interface.recursive_prs = self.recursive_prs spawned_interface.gravity = self.gravity - spawned_interface.hop_limiter = self.hop_limiter spawned_interface.HW_MTU = self.HW_MTU RNS.log("Spawned new I2PInterface Peer: "+str(spawned_interface), RNS.LOG_VERBOSE) RNS.Transport.add_interface(spawned_interface) diff --git a/RNS/Interfaces/Interface.py b/RNS/Interfaces/Interface.py index 8ee49c42..2c529d41 100755 --- a/RNS/Interfaces/Interface.py +++ b/RNS/Interfaces/Interface.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -39,6 +39,7 @@ class Interface: OUT = False FWD = False RPT = False + name = None # Interface mode definitions MODE_FULL = 0x01 @@ -68,7 +69,7 @@ class Interface: # Maximum amount of ingress limited announces # to hold at any given time. - MAX_HELD_ANNOUNCES = 64 + MAX_HELD_ANNOUNCES = 256 # Control parameters DEFAULT_GRAVITY = 0 @@ -95,16 +96,12 @@ class Interface: DEFAULT_IFAC_SIZE = 16 def __init__(self): - self.name = None self.rxb = 0 self.txb = 0 - self.frxb = 0 - self.ftxb = 0 self.arxb = 0 self.atxb = 0 self.arxc = 0 self.atxc = 0 - self.afrxc = 0 self.prxb = 0 self.ptxb = 0 self.prxc = 0 @@ -117,8 +114,6 @@ class Interface: self.HW_MTU = None self.__hash = None - self.announce_cap = RNS.Reticulum.ANNOUNCE_CAP/100.0 - self.announce_allowed_at = 0 self.supports_discovery = False self.discoverable = False self.last_discovery_announce = 0 @@ -126,27 +121,12 @@ class Interface: self.recursive_prs = False self.announces_from_internal = True self.announces_to_internal = None - self.is_local_shared_instance = False self.parent_interface = None self.spawned_interfaces = None self.tunnel_id = None - self.local_tunnel_id = None - self.tunnels_allowed = False - self.synthesis_received = False - self.synthesis_emitted = False - self.wants_tunnel = False - self.remote_transport = None self.ingress_control = True - self.hop_limiter = None self.phy_keepalive = False self.shared_medium = False - self.lossless_medium = False - - self.remote_impl = None - self.remote_vers = None - self.remote_dst_cost = None - self.remote_pr_cost = None - self.remote_is_tn = None self.ic_burst_active = False self.ic_burst_activated = 0 @@ -167,9 +147,7 @@ class Interface: self.ic_held_release_interval = RNS.Reticulum.get_instance()._default_ic_held_release_interval() self.ec_pr_freq = RNS.Reticulum.get_instance()._default_ec_pr_freq() self.egress_control = RNS.Reticulum.get_instance()._default_egress_control() - self.announce_queue = [] self.held_announces = {} - self.ifac_identity = None self.transmit_buffer = None self.ia_freq_deque = deque(maxlen=Interface.IA_FREQ_SAMPLES) @@ -180,7 +158,6 @@ class Interface: self.protocol_violations = 0 self.ifac_violations = 0 self.packet_filter_hits = 0 - self.hop_limiter_hits = 0 self.dp_ingress_tcount = 0 self.dp_ingress_bytes = 0 self.dp_ingress_packets = 0 @@ -195,16 +172,11 @@ class Interface: self._dp_ec_zero_ticks = 0 self._dp_ec_last_drain = time.time() - self._destination_cost = None - self._pr_cost = None - self.reports_phy_stats = False self.r_stat_rssi = None self.r_stat_snr = None self.r_stat_q = None - self.is_connected_to_shared_instance = False - def get_hash(self): if not self.__hash: self.__hash = RNS.Identity.full_hash(str(self).encode("utf-8")) return self.__hash @@ -296,14 +268,11 @@ class Interface: def hold_announce(self, announce_packet): if announce_packet.hops >= RNS.Transport.PATHFINDER_M-1: - return self.filtered_announce() + return elif announce_packet.destination_hash in self.held_announces: self.held_announces[announce_packet.destination_hash] = announce_packet - return self.filtered_announce() elif not len(self.held_announces) >= self.ic_max_held_announces: self.held_announces[announce_packet.destination_hash] = announce_packet - return True - else: return self.filtered_announce() def process_held_announces(self): try: @@ -313,32 +282,18 @@ class Interface: if ia_freq < freq_threshold: selected_announce_packet = None min_hops = RNS.Transport.PATHFINDER_M - cull_entries = [] - for destination_hash in self.held_announces.copy(): - announce_packet = self.held_announces.get(destination_hash) - if not announce_packet: continue - - # If we can determine that a held announce has become - # useless for any potential path table updates, we'll - # remove it immediately instead of waiting for it to - # eventually get released, freeing up other held queue - # slots for potentially useful new announces. - path_entry = RNS.Transport.path_table.get(destination_hash) - if path_entry and not RNS.Transport.announce_prefilter(announce_packet, path_entry): - cull_entries.append(destination_hash) - continue - + for destination_hash in self.held_announces: + announce_packet = self.held_announces[destination_hash] if announce_packet.hops < min_hops: min_hops = announce_packet.hops selected_announce_packet = announce_packet - for destination_hash in cull_entries: self.held_announces.pop(destination_hash, None) - if selected_announce_packet != None: RNS.log("Releasing held announce packet "+str(selected_announce_packet)+" from "+str(self), RNS.LOG_EXTREME) self.ic_held_release = time.time() + self.ic_held_release_interval - self.held_announces.pop(selected_announce_packet.destination_hash, None) - RNS.Transport.inbound(selected_announce_packet.raw, selected_announce_packet.receiving_interface, tc=RNS.Transport.TC_INGRESS_LIMITED, ifac_handled=True) + self.held_announces.pop(selected_announce_packet.destination_hash) + def release(): RNS.Transport.inbound(selected_announce_packet.raw, selected_announce_packet.receiving_interface, tc=RNS.Transport.TC_INGRESS_LIMITED, ifac_handled=True) + threading.Thread(target=release, daemon=True).start() except Exception as e: RNS.log("An error occurred while processing held announces for "+str(self), RNS.LOG_ERROR) @@ -347,37 +302,30 @@ class Interface: def received_announce(self, size=0, from_spawned=False): self.arxc += 1; self.arxb += size self.ia_freq_deque.append(time.time()) - if self.parent_interface != None: + if hasattr(self, "parent_interface") and self.parent_interface != None: self.parent_interface.received_announce(size=size, from_spawned=True) def sent_announce(self, size=0, from_spawned=False): self.atxc += 1; self.atxb += size self.oa_freq_deque.append(time.time()) - if self.parent_interface != None: + if hasattr(self, "parent_interface") and self.parent_interface != None: self.parent_interface.sent_announce(size=size, from_spawned=True) - def filtered_announce(self, size=0, from_spawned=False): - self.afrxc += 1 - RNS.Transport.filtered_arxc += 1 - if self.parent_interface != None: self.parent_interface.afrxc += 1 - return None - def received_path_request(self, size=0, from_spawned=False): self.prxc += 1; self.prxb += size self.ip_freq_deque.append(time.time()) - if self.parent_interface != None: + if hasattr(self, "parent_interface") and self.parent_interface != None: self.parent_interface.received_path_request(size=size, from_spawned=True) def sent_path_request(self, size=0, from_spawned=False): self.ptxc += 1; self.ptxb += size self.op_freq_deque.append(time.time()) - if self.parent_interface != None: + if hasattr(self, "parent_interface") and self.parent_interface != None: self.parent_interface.sent_path_request(size=size, from_spawned=True) - def protocol_violation(self, description=None, level=None): - if level == None: level = RNS.LOG_DEBUG + def protocol_violation(self, description=None): self.protocol_violations += 1 - RNS.log(f"Protocol violation on {self}: {description}", level) if RNS.sl(level) else None + RNS.log(f"Protocol violation on {self}: {description}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None return None def ifac_violation(self, description=None): @@ -389,20 +337,6 @@ class Interface: self.packet_filter_hits += 1 return None - def hop_limiter_hit(self): - self.hop_limiter_hits += 1 - return None - - @property - def destination_cost(self): - if not self._destination_cost == None: return self._destination_cost - else: return RNS.Transport.DESTINATION_COST - - @property - def pr_cost(self): - if not self._pr_cost == None: return self._pr_cost - else: return RNS.Transport.PR_COST - @property def ic_burst_count(self): return None @@ -454,12 +388,10 @@ class Interface: return hz def process_announce_queue(self): - if not self.announce_queue: return - if not hasattr(self, "announce_cap"): - self.announce_cap = RNS.Reticulum.ANNOUNCE_CAP/100.0 + self.announce_cap = RNS.Reticulum.ANNOUNCE_CAP - if self.announce_queue: + if hasattr(self, "announce_queue"): try: now = time.time() stale = [] @@ -504,9 +436,6 @@ class Interface: def detach(self): pass - def teardown(self): - pass - @staticmethod def get_config_obj(config_in): if type(config_in) == ConfigObj: return config_in diff --git a/RNS/Interfaces/KISSInterface.py b/RNS/Interfaces/KISSInterface.py index 419ab2e2..036904e4 100644 --- a/RNS/Interfaces/KISSInterface.py +++ b/RNS/Interfaces/KISSInterface.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -124,7 +124,6 @@ class KISSInterface(Interface): self.flow_control = flow_control self.shared_medium = True self.interface_ready = False - self.reconnecting = False self.flow_control_timeout = 5 self.flow_control_locked = time.time() @@ -141,17 +140,15 @@ class KISSInterface(Interface): try: self.open_port() - if self.serial.is_open: self.configure_device() - else: raise IOError("Could not open serial port") - except Exception as e: - RNS.log(f"Could not open serial port for {self}", RNS.LOG_ERROR) - RNS.log(f"The contained exception was: {e}", RNS.LOG_ERROR) - RNS.log(f"Reticulum will attempt to bring up this interface periodically", RNS.LOG_ERROR) - if not self.detached and not self.reconnecting: - thread = threading.Thread(target=self.reconnect_port) - thread.daemon = True - thread.start() + RNS.log("Could not open serial port "+self.port, RNS.LOG_ERROR) + raise e + + if self.serial.is_open: + self.configure_device() + else: + raise IOError("Could not open serial port") + def open_port(self): RNS.log("Opening serial port "+self.port+"...", RNS.LOG_VERBOSE) @@ -169,11 +166,6 @@ class KISSInterface(Interface): dsrdtr = False, ) - def detach(self): - self.detached = True - self.online = False - try: self.serial.close() - except Exception as e: RNS.log(f"Could not close port for {self} at detach: {e}", RNS.LOG_ERROR) def configure_device(self): # Allow time for interface to initialise before config @@ -254,7 +246,7 @@ class KISSInterface(Interface): def process_incoming(self, data): - if not data: return + self.rxb += len(data) self.owner.inbound(data, self) @@ -368,28 +360,30 @@ class KISSInterface(Interface): RNS.log("A serial port error occurred, the contained exception was: "+str(e), RNS.LOG_ERROR) RNS.log("The interface "+str(self)+" experienced an unrecoverable error and is now offline.", RNS.LOG_ERROR) - if RNS.Reticulum.panic_on_interface_error: RNS.panic() + if RNS.Reticulum.panic_on_interface_error: + RNS.panic() RNS.log("Reticulum will attempt to reconnect the interface periodically.", RNS.LOG_ERROR) self.online = False - try: self.serial.close() - except Exception as e: RNS.log(f"Could not close port for {self}", RNS.LOG_ERROR) - if not self.detached and not self.reconnecting: self.reconnect_port() + self.serial.close() + self.reconnect_port() def reconnect_port(self): - self.reconnecting = True - while not self.online and not self.detached: + while not self.online: try: time.sleep(5) RNS.log("Attempting to reconnect serial port "+str(self.port)+" for "+str(self)+"...", RNS.LOG_VERBOSE) self.open_port() - if self.serial.is_open: self.configure_device() - except Exception as e: RNS.log("Error while reconnecting port, the contained exception was: "+str(e), RNS.LOG_ERROR) + if self.serial.is_open: + self.configure_device() + except Exception as e: + RNS.log("Error while reconnecting port, the contained exception was: "+str(e), RNS.LOG_ERROR) - self.reconnecting = False - if self.online: RNS.log("Reconnected serial port for "+str(self)) + RNS.log("Reconnected serial port for "+str(self)) - def should_ingress_limit(self): return False + def should_ingress_limit(self): + return False - def __str__(self): return "KISSInterface["+self.name+"]" \ No newline at end of file + def __str__(self): + return "KISSInterface["+self.name+"]" \ No newline at end of file diff --git a/RNS/Interfaces/LocalInterface.py b/RNS/Interfaces/LocalInterface.py index 391a99c5..18957d7d 100644 --- a/RNS/Interfaces/LocalInterface.py +++ b/RNS/Interfaces/LocalInterface.py @@ -58,12 +58,10 @@ class LocalClientInterface(Interface): def __init__(self, owner, name, target_port = None, connected_socket=None, socket_path=None): super().__init__() - self.owner = owner - self.bitrate = 1_000_000_000 - self.epoll_backend = False - self.HW_MTU = 262144 - self.online = False - self.ifac_size = self.DEFAULT_IFAC_SIZE + self.epoll_backend = False + self.HW_MTU = 262144 + self.online = False + self.ifac_size = self.DEFAULT_IFAC_SIZE if socket_path != None and RNS.Reticulum.get_instance().use_af_unix: self.socket_path = f"\0rns/{socket_path}" else: self.socket_path = None @@ -112,6 +110,8 @@ class LocalClientInterface(Interface): self.target_port = target_port self.connect() + self.owner = owner + self.bitrate = 1_000_000_000 self.online = True self.writing = False @@ -202,6 +202,9 @@ class LocalClientInterface(Interface): except Exception as e: RNS.log(f"Exception occurred while sending keepalive on {self}: {e}", RNS.LOG_ERROR) def process_incoming(self, data): + self.rxb += len(data) + if self.parent_interface != None: self.parent_interface.rxb += len(data) + try: self.owner.inbound(data, self) except Exception as e: RNS.log(f"An error occurred in the processing of an incoming frame for {self}: {e}", RNS.LOG_ERROR) @@ -215,7 +218,7 @@ class LocalClientInterface(Interface): if self.online: try: if self.epoll_backend: - frame = HDLC.frame(data) + frame = bytes([HDLC.FLAG])+HDLC.escape(data)+bytes([HDLC.FLAG]) if self.tx_stalled or not self.transmit_buffer.append(frame, self.tx_hwm): self.tx_drops += 1 self.tx_dropped_bytes += len(frame) @@ -232,7 +235,7 @@ class LocalClientInterface(Interface): s = len(data) / self.bitrate * 8 time.sleep(s) - data = HDLC.frame(data) + data = bytes([HDLC.FLAG])+HDLC.escape(data)+bytes([HDLC.FLAG]) self.socket.sendall(data) self.writing = False self.txb += len(data) diff --git a/RNS/Interfaces/PipeInterface.py b/RNS/Interfaces/PipeInterface.py index e708c966..6b420aa5 100644 --- a/RNS/Interfaces/PipeInterface.py +++ b/RNS/Interfaces/PipeInterface.py @@ -120,7 +120,7 @@ class PipeInterface(Interface): def process_incoming(self, data): - if not data: return + self.rxb += len(data) self.owner.inbound(data, self) diff --git a/RNS/Interfaces/RNodeInterface.py b/RNS/Interfaces/RNodeInterface.py index 87cc1a6d..42524bff 100644 --- a/RNS/Interfaces/RNodeInterface.py +++ b/RNS/Interfaces/RNodeInterface.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -262,7 +262,6 @@ class RNodeInterface(Interface): self.r_st_alock = None self.r_lt_alock = None self.r_random = None - self.r_modulation = "LoRa" self.r_airtime_short = 0.0 self.r_airtime_long = 0.0 self.r_channel_load_short = 0.0 @@ -387,7 +386,6 @@ class RNodeInterface(Interface): RNS.log(f"Opening BLE connection for {self}...") self.timeout = 1250 if self.ble != None and self.ble.running == False: - RNS.log(f"Cleaning up previous BLE connection for {self}...") self.ble.close() self.ble.cleanup() self.ble = None @@ -444,11 +442,7 @@ class RNodeInterface(Interface): ble_detect_timeout = 5.0 detect_time = time.time() while not self.detected and time.time() < detect_time + ble_detect_timeout: time.sleep(0.1) - if not self.detected: - RNS.log(f"RNode detect timed out over BLE", RNS.LOG_ERROR) - if self.ble: - self.ble.should_run = False - self.ble.must_disconnect = True + if not self.detected: RNS.log(f"RNode detect timed out over BLE", RNS.LOG_ERROR) else: sleep(0.2) @@ -486,7 +480,8 @@ class RNodeInterface(Interface): self.setLTALock() self.setRadioState(KISS.RADIO_STATE_ON) - if self.use_ble: time.sleep(2) + if self.use_ble: + time.sleep(2) def detect(self): kiss_command = bytes([KISS.FEND, KISS.CMD_DETECT, KISS.DETECT_REQ, KISS.FEND, KISS.CMD_FW_VERSION, 0x00, KISS.FEND, KISS.CMD_PLATFORM, 0x00, KISS.FEND, KISS.CMD_MCU, 0x00, KISS.FEND]) @@ -692,8 +687,10 @@ class RNodeInterface(Interface): RNS.log("Radio state mismatch", RNS.LOG_ERROR) self.validcfg = False - if (self.validcfg): return True - else: return False + if (self.validcfg): + return True + else: + return False def updateBitrate(self): @@ -705,7 +702,7 @@ class RNodeInterface(Interface): self.bitrate = 0 def process_incoming(self, data): - if not data: return + self.rxb += len(data) self.owner.inbound(data, self) def process_outgoing(self,data): @@ -1157,17 +1154,19 @@ class RNodeInterface(Interface): except Exception as e: self.online = False - if not self.detached: - RNS.log("A serial port error occurred, the contained exception was: "+str(e), RNS.LOG_ERROR) - RNS.log("The interface "+str(self)+" experienced an unrecoverable error and is now offline.", RNS.LOG_ERROR) + RNS.log("A serial port error occurred, the contained exception was: "+str(e), RNS.LOG_ERROR) + RNS.log("The interface "+str(self)+" experienced an unrecoverable error and is now offline.", RNS.LOG_ERROR) - if RNS.Reticulum.panic_on_interface_error: RNS.panic() + if RNS.Reticulum.panic_on_interface_error: + RNS.panic() - RNS.log("Reticulum will attempt to reconnect the interface periodically.", RNS.LOG_ERROR) + RNS.log("Reticulum will attempt to reconnect the interface periodically.", RNS.LOG_ERROR) self.online = False - try: self.serial.close() - except Exception as e: pass + try: + self.serial.close() + except Exception as e: + pass if not self.detached and not self.reconnecting: self.reconnect_port() @@ -1193,20 +1192,14 @@ class RNodeInterface(Interface): self.disable_external_framebuffer() self.setRadioState(KISS.RADIO_STATE_OFF) self.leave() - self.serial.close() except Exception as e: RNS.log(f"An error occurred while detaching {self}: {e}", RNS.LOG_ERROR) - if self.use_ble: - self.ble.close() - self.ble.cleanup() - self.ble = None - elif self.use_tcp: + if self.use_ble: self.ble.close() + if self.use_tcp: time.sleep(0.5) self.tcp.close() - else: - self.serial.close() def should_ingress_limit(self): return False @@ -1304,7 +1297,6 @@ class BLEConnection(): self.must_disconnect = False self.connect_job_running = False self.device_disappeared = False - self._windows_paired_addrs = None import importlib.util if BLEConnection.bleak == None: @@ -1315,8 +1307,8 @@ class BLEConnection(): import asyncio BLEConnection.asyncio = asyncio else: - RNS.log("Using the RNode interface over BLE requires the \"bleak\" module to be installed.", RNS.LOG_CRITICAL) - RNS.log("You can install it with the command: python3 -m pip install bleak", RNS.LOG_CRITICAL) + RNS.log("Using the RNode interface over BLE requires a the \"bleak\" module to be installed.", RNS.LOG_CRITICAL) + RNS.log("You can install one with the command: python3 -m pip install bleak", RNS.LOG_CRITICAL) RNS.panic() self.should_run = True @@ -1332,7 +1324,6 @@ class BLEConnection(): self.should_run = False def connection_job(self): - self.running = True while self.should_run: if self.ble_device == None: self.ble_device = self.find_target_device() @@ -1359,7 +1350,6 @@ class BLEConnection(): self.owner.ble_receive(data) self.connected = True - self.device_disappeared = False self.ble_device = ble_client self.last_client = ble_client self.owner.port = str(f"ble://{ble_client.address}") @@ -1394,8 +1384,6 @@ class BLEConnection(): def find_target_device(self): RNS.log(f"Searching for attachable BLE device for {self.owner}...", RNS.LOG_EXTREME) - if RNS.vendor.platformutils.is_windows(): - self._windows_paired_addrs = self._get_windows_paired_ble_addresses() def device_filter(device: self.bleak.backends.device.BLEDevice, adv: self.bleak.backends.scanner.AdvertisementData): if BLEConnection.UART_SERVICE_UUID.lower() in adv.service_uuids: if self.device_bonded(device): @@ -1427,9 +1415,6 @@ class BLEConnection(): def device_bonded(self, device): try: - if self._windows_paired_addrs is not None: - return device.address is not None and device.address.lower() in self._windows_paired_addrs - if hasattr(device, "details"): if "props" in device.details and "Bonded" in device.details["props"]: if device.details["props"]["Bonded"] == True: @@ -1440,15 +1425,6 @@ class BLEConnection(): return False - def _get_windows_paired_ble_addresses(self): - from winrt.windows.devices.bluetooth import BluetoothLEDevice - from winrt.windows.devices.enumeration import DeviceInformation - async def _query(): - selector = BluetoothLEDevice.get_device_selector_from_pairing_state(True) - infos = await DeviceInformation.find_all_async_aqs_filter(selector) - return set(info.id.split("-")[-1].lower() for info in infos) - return self.asyncio.run(_query()) - class TCPConnection(): TARGET_PORT = 7633 CONNECT_TIMEOUT = 5.0 diff --git a/RNS/Interfaces/RNodeMultiInterface.py b/RNS/Interfaces/RNodeMultiInterface.py index 45eb0fd1..97b74abd 100644 --- a/RNS/Interfaces/RNodeMultiInterface.py +++ b/RNS/Interfaces/RNodeMultiInterface.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -278,7 +278,7 @@ class RNodeMultiInterface(Interface): self.interface_ready = False self.announce_rate_target = None self.reports_phy_stats = True - self.r_modulation = "LoRa" + self.validcfg = True if id_interval != None and id_callsign != None: @@ -916,7 +916,6 @@ class RNodeMultiInterface(Interface): if interface != 0: self.setRadioState(KISS.RADIO_STATE_OFF, interface) self.leave() - self.serial.close() def teardown_subinterfaces(self): for interface in self.subinterfaces: @@ -1129,7 +1128,7 @@ class RNodeSubInterface(Interface): self.bitrate = 0 def process_incoming(self, data): - if not data: return + self.rxb += len(data) self.owner.inbound(data, self) def process_outgoing(self,data): diff --git a/RNS/Interfaces/SerialInterface.py b/RNS/Interfaces/SerialInterface.py index 671994a6..0bce146f 100755 --- a/RNS/Interfaces/SerialInterface.py +++ b/RNS/Interfaces/SerialInterface.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -97,7 +97,6 @@ class SerialInterface(Interface): self.timeout = 100 self.online = False self.bitrate = self.speed - self.reconnecting = False if parity.lower() == "e" or parity.lower() == "even": self.parity = serial.PARITY_EVEN @@ -107,17 +106,15 @@ class SerialInterface(Interface): try: self.open_port() - if self.serial.is_open: self.configure_device() - else: raise IOError("Could not open serial port") - except Exception as e: - RNS.log(f"Could not open serial port for {self}", RNS.LOG_ERROR) - RNS.log(f"The contained exception was: {e}", RNS.LOG_ERROR) - RNS.log(f"Reticulum will attempt to bring up this interface periodically", RNS.LOG_ERROR) - if not self.detached and not self.reconnecting: - thread = threading.Thread(target=self.reconnect_port) - thread.daemon = True - thread.start() + RNS.log("Could not open serial port for interface "+str(self), RNS.LOG_ERROR) + raise e + + if self.serial.is_open: + self.configure_device() + else: + raise IOError("Could not open serial port") + def open_port(self): RNS.log("Opening serial port "+self.port+"...", RNS.LOG_VERBOSE) @@ -135,11 +132,6 @@ class SerialInterface(Interface): dsrdtr = False, ) - def detach(self): - self.detached = True - self.online = False - try: self.serial.close() - except Exception as e: RNS.log(f"Could not close port for {self} at detach: {e}", RNS.LOG_ERROR) def configure_device(self): sleep(0.5) @@ -149,10 +141,12 @@ class SerialInterface(Interface): self.online = True RNS.log("Serial port "+self.port+" is now open", RNS.LOG_VERBOSE) + def process_incoming(self, data): - if not data: return + self.rxb += len(data) self.owner.inbound(data, self) + def process_outgoing(self,data): if self.online: data = bytes([HDLC.FLAG])+HDLC.escape(data)+bytes([HDLC.FLAG]) @@ -161,6 +155,7 @@ class SerialInterface(Interface): if written != len(data): raise IOError("Serial interface only wrote "+str(written)+" bytes of "+str(len(data))) + def readLoop(self): try: in_frame = False @@ -204,28 +199,30 @@ class SerialInterface(Interface): RNS.log("A serial port error occurred, the contained exception was: "+str(e), RNS.LOG_ERROR) RNS.log("The interface "+str(self)+" experienced an unrecoverable error and is now offline.", RNS.LOG_ERROR) - if RNS.Reticulum.panic_on_interface_error: RNS.panic() + if RNS.Reticulum.panic_on_interface_error: + RNS.panic() RNS.log("Reticulum will attempt to reconnect the interface periodically.", RNS.LOG_ERROR) self.online = False - try: self.serial.close() - except Exception as e: RNS.log(f"Could not close port for {self}", RNS.LOG_ERROR) - if not self.detached and not self.reconnecting: self.reconnect_port() + self.serial.close() + self.reconnect_port() def reconnect_port(self): - self.reconnecting = True - while not self.online and not self.detached: + while not self.online: try: time.sleep(5) RNS.log("Attempting to reconnect serial port "+str(self.port)+" for "+str(self)+"...", RNS.LOG_VERBOSE) self.open_port() - if self.serial.is_open: self.configure_device() - except Exception as e: RNS.log("Error while reconnecting port, the contained exception was: "+str(e), RNS.LOG_ERROR) + if self.serial.is_open: + self.configure_device() + except Exception as e: + RNS.log("Error while reconnecting port, the contained exception was: "+str(e), RNS.LOG_ERROR) - self.reconnecting = False - if self.online: RNS.log("Reconnected serial port for "+str(self)) + RNS.log("Reconnected serial port for "+str(self)) - def should_ingress_limit(self): return False + def should_ingress_limit(self): + return False - def __str__(self): return "SerialInterface["+self.name+"]" + def __str__(self): + return "SerialInterface["+self.name+"]" diff --git a/RNS/Interfaces/TCPInterface.py b/RNS/Interfaces/TCPInterface.py index 6c5a4362..c0b66ba1 100644 --- a/RNS/Interfaces/TCPInterface.py +++ b/RNS/Interfaces/TCPInterface.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -126,8 +126,6 @@ class TCPClientInterface(Interface): self.writing = False self.online = False self.detached = False - self.tunnels_allowed = True - self.lossless_medium = True self.kiss_framing = kiss_framing self.i2p_tunneled = i2p_tunneled self.mode = RNS.Interfaces.Interface.Interface.MODE_FULL @@ -160,13 +158,13 @@ class TCPClientInterface(Interface): self.connect_timeout = connect_timeout else: self.connect_timeout = TCPClientInterface.INITIAL_CONNECT_TIMEOUT - - def final_init(self): - if TCPClientInterface.SYNCHRONOUS_START: self.initial_connect() - else: - thread = threading.Thread(target=self.initial_connect) - thread.daemon = True - thread.start() + + if TCPClientInterface.SYNCHRONOUS_START: + self.initial_connect() + else: + thread = threading.Thread(target=self.initial_connect) + thread.daemon = True + thread.start() def initial_connect(self): if not self.connect(initial=True): @@ -177,6 +175,8 @@ class TCPClientInterface(Interface): thread = threading.Thread(target=self.read_loop) thread.daemon = True thread.start() + if not self.kiss_framing: + self.wants_tunnel = True def set_timeouts_linux(self): if not self.i2p_tunneled: @@ -208,7 +208,6 @@ class TCPClientInterface(Interface): def detach(self): self.online = False - self.detached = True if self.socket != None: if hasattr(self.socket, "close"): if callable(self.socket.close): @@ -228,20 +227,6 @@ class TCPClientInterface(Interface): self.socket = None - def early_synthesis(self, packet): - if not self.detached: - if not packet.packed: packet.pack() - if self.ifac_identity: raw = RNS.Transport.handle_outgoing_ifac(self, packet.raw); - else: raw = packet.raw - - if self.kiss_framing: frame = bytes([KISS.FEND])+bytes([KISS.CMD_DATA])+KISS.escape(raw)+bytes([KISS.FEND]) - else: frame = bytes([HDLC.FLAG])+HDLC.escape(raw)+bytes([HDLC.FLAG]) - - self.socket.sendall(frame) - self.txb += len(frame) - if hasattr(self, "parent_interface") and self.parent_interface != None: - self.parent_interface.txb += len(frame) - def connect(self, initial=False): try: if initial: @@ -256,13 +241,6 @@ class TCPClientInterface(Interface): self.socket.setsockopt(socket.IPPROTO_TCP, socket.TCP_NODELAY, 1) self.socket.connect(target_address) self.socket.settimeout(None) - - if not self.kiss_framing: - self.wants_tunnel = True - self.remote_transport = None - self.synthesis_received = False - RNS.Transport.synthesize_tunnel(self) - self.online = True if initial: @@ -294,7 +272,7 @@ class TCPClientInterface(Interface): if not self.reconnecting: self.reconnecting = True attempts = 0 - while not self.online and not self.detached: + while not self.online: time.sleep(TCPClientInterface.RECONNECT_WAIT) attempts += 1 @@ -303,7 +281,9 @@ class TCPClientInterface(Interface): self.teardown() break - try: self.connect() + try: + self.connect() + except Exception as e: RNS.log("Connection attempt for "+str(self)+" failed: "+str(e), RNS.LOG_DEBUG) @@ -314,14 +294,19 @@ class TCPClientInterface(Interface): thread = threading.Thread(target=self.read_loop) thread.daemon = True thread.start() + if not self.kiss_framing: + RNS.Transport.synthesize_tunnel(self) else: RNS.log("Attempt to reconnect on a non-initiator TCP interface. This should not happen.", RNS.LOG_ERROR) raise IOError("Attempt to reconnect on a non-initiator TCP interface") def process_incoming(self, data): - if not data: return if self.online and not self.detached: + self.rxb += len(data) + if hasattr(self, "parent_interface") and self.parent_interface != None: + self.parent_interface.rxb += len(data) + self.owner.inbound(data, self) def process_outgoing(self, data): @@ -441,7 +426,7 @@ class TCPClientInterface(Interface): self.online = False RNS.log("An interface error occurred for "+str(self)+", the contained exception was: "+str(e), RNS.LOG_WARNING) - if self.initiator and not self.detached: + if self.initiator: RNS.log("Attempting to reconnect...", RNS.LOG_WARNING) self.reconnect() else: @@ -467,9 +452,12 @@ class TCPClientInterface(Interface): if not self.initiator: RNS.Transport.remove_interface(self) + def __str__(self): - if ":" in self.target_ip: ip_str = f"[{self.target_ip}]" - else: ip_str = f"{self.target_ip}" + if ":" in self.target_ip: + ip_str = f"[{self.target_ip}]" + else: + ip_str = f"{self.target_ip}" return "TCPInterface["+str(self.name)+"/"+ip_str+":"+str(self.target_port)+"]" @@ -546,8 +534,6 @@ class TCPServerInterface(Interface): self.OUT = False self.name = name self.detached = False - self.tunnels_allowed = True - self.lossless_medium = True self.i2p_tunneled = i2p_tunneled self.mode = RNS.Interfaces.Interface.Interface.MODE_FULL @@ -620,9 +606,6 @@ class TCPServerInterface(Interface): spawned_interface.ic_pr_burst_freq_new = self.ic_pr_burst_freq_new spawned_interface.ic_pr_burst_freq = self.ic_pr_burst_freq - spawned_interface._destination_cost = self._destination_cost - spawned_interface._pr_cost = self._pr_cost - spawned_interface.target_ip = handler.client_address[0] spawned_interface.target_port = str(handler.client_address[1]) spawned_interface.parent_interface = self @@ -654,11 +637,6 @@ class TCPServerInterface(Interface): spawned_interface.announce_rate_penalty = self.announce_rate_penalty spawned_interface.mode = self.mode spawned_interface.gravity = self.gravity - spawned_interface.hop_limiter = self.hop_limiter - spawned_interface.recursive_prs = self.recursive_prs - spawned_interface.announces_from_internal = self.announces_from_internal - spawned_interface.announces_to_internal = self.announces_to_internal - spawned_interface.announce_cap = self.announce_cap spawned_interface.HW_MTU = self.HW_MTU spawned_interface.online = True RNS.log("Spawned new TCPClient Interface: "+str(spawned_interface), RNS.LOG_VERBOSE) @@ -708,8 +686,10 @@ class TCPServerInterface(Interface): def __str__(self): - if ":" in self.bind_ip: ip_str = f"[{self.bind_ip}]" - else: ip_str = f"{self.bind_ip}" + if ":" in self.bind_ip: + ip_str = f"[{self.bind_ip}]" + else: + ip_str = f"{self.bind_ip}" return "TCPServerInterface["+self.name+"/"+ip_str+":"+str(self.bind_port)+"]" diff --git a/RNS/Interfaces/UDPInterface.py b/RNS/Interfaces/UDPInterface.py index e24c5dd8..8dd9c78e 100644 --- a/RNS/Interfaces/UDPInterface.py +++ b/RNS/Interfaces/UDPInterface.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -113,17 +113,9 @@ class UDPInterface(Interface): self.forward_ip = forwardip self.forward_port = forwardport - def detach(self): - self.detached = True - self.online = False - if self.server: - try: - self.server.server_close() - self.server.shutdown() - except Exception as e: RNS.log(f"Could not shut down UDP listener for {self}: {e}", RNS.LOG_ERROR) def process_incoming(self, data): - if not data: return + self.rxb += len(data) self.owner.inbound(data, self) def process_outgoing(self,data): diff --git a/RNS/Interfaces/WeaveInterface.py b/RNS/Interfaces/WeaveInterface.py index fa8cbd80..33d00afb 100644 --- a/RNS/Interfaces/WeaveInterface.py +++ b/RNS/Interfaces/WeaveInterface.py @@ -249,6 +249,7 @@ class WDCL(): self.online = True def process_incoming(self, data): + self.rxb += len(data) if self.device: while len(self.frame_queue): self.device.incoming_frame(self.frame_queue.pop()) self.device.incoming_frame(data) @@ -932,17 +933,9 @@ class WeaveInterface(Interface): spawned_interface.ic_new_time = self.ic_new_time spawned_interface.ic_burst_penalty = self.ic_burst_penalty spawned_interface.ic_held_release_interval = self.ic_held_release_interval - - spawned_interface.announces_to_internal = self.announces_to_internal - spawned_interface.announces_from_internal = self.announces_from_internal - spawned_interface.announce_cap = self.announce_cap - - spawned_interface._destination_cost = self._destination_cost - spawned_interface._pr_cost = self._pr_cost spawned_interface.parent_interface = self spawned_interface.bitrate = self.bitrate - spawned_interface.recursive_prs = self.recursive_prs spawned_interface.ifac_size = self.ifac_size spawned_interface.ifac_netname = self.ifac_netname @@ -967,18 +960,10 @@ class WeaveInterface(Interface): spawned_interface.announce_rate_target = self.announce_rate_target spawned_interface.announce_rate_grace = self.announce_rate_grace spawned_interface.announce_rate_penalty = self.announce_rate_penalty - - spawned_interface.egress_control = self.egress_control - spawned_interface.ec_pr_freq = self.ec_pr_freq - spawned_interface.ic_pr_burst_freq_new = self.ic_pr_burst_freq_new - spawned_interface.ic_pr_burst_freq = self.ic_pr_burst_freq - spawned_interface.mode = self.mode spawned_interface.gravity = self.gravity - spawned_interface.hop_limiter = self.hop_limiter spawned_interface.HW_MTU = self.HW_MTU spawned_interface._online = True - RNS.Transport.add_interface(spawned_interface) if endpoint_addr in self.spawned_interfaces: self.spawned_interfaces[endpoint_addr].detach() @@ -1060,6 +1045,8 @@ class WeaveInterfacePeer(Interface): self.owner.refresh_peer(self.endpoint_addr) self.owner.mif_deque.append(data_hash) self.owner.mif_deque_times.append([data_hash, time.time()]) + self.rxb += len(data) + self.owner.rxb += len(data) self.owner.owner.inbound(data, self) def process_outgoing(self, data): diff --git a/RNS/Interfaces/util/HDLC.py b/RNS/Interfaces/util/HDLC.py index bd7fd976..ab0f1735 100644 --- a/RNS/Interfaces/util/HDLC.py +++ b/RNS/Interfaces/util/HDLC.py @@ -50,15 +50,6 @@ class HDLC(): frame = frame.replace(HDLC.ESCPD_ESC, HDLC.ESC_B) return frame - @staticmethod - def frame(data): - esc = HDLC.escape(data) - frame = bytearray(len(esc)+2) - frame[0] = HDLC.FLAG - frame[1:-1] = esc - frame[-1] = HDLC.FLAG - return frame - class ReceiveBuffer(): def __init__(self, mtu, min_frame_len, max_frame_len=None, on_frame=None, on_invalid=None): self._mtu = mtu diff --git a/RNS/Link.py b/RNS/Link.py index aeb9e4cb..df7997f5 100644 --- a/RNS/Link.py +++ b/RNS/Link.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -28,8 +28,8 @@ # OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE # SOFTWARE. -from RNS.Cryptography import X25519PrivateKey, X25519PublicKey, Ed25519PrivateKey, Ed25519PublicKey, Token -from RNS.Stamps import stamp_valid, stamp_value, generate_stamped_key, cancel_work +from RNS.Cryptography import X25519PrivateKey, X25519PublicKey, Ed25519PrivateKey, Ed25519PublicKey +from RNS.Cryptography import Token from RNS.Channel import Channel, LinkChannelOutlet from time import sleep @@ -70,7 +70,7 @@ class Link: ECPUBSIZE = 32+32 KEYSIZE = 32 - MDU = math.floor((RNS.Reticulum.MTU-RNS.Reticulum.IFAC_MIN_SIZE-RNS.Reticulum.HEADER_MINSIZE-RNS.Identity.TOKEN_OVERHEAD)/RNS.Identity.AES256_BLOCKSIZE)*RNS.Identity.AES256_BLOCKSIZE - 1 + MDU = math.floor((RNS.Reticulum.MTU-RNS.Reticulum.IFAC_MIN_SIZE-RNS.Reticulum.HEADER_MINSIZE-RNS.Identity.TOKEN_OVERHEAD)/RNS.Identity.AES128_BLOCKSIZE)*RNS.Identity.AES128_BLOCKSIZE - 1 ESTABLISHMENT_TIMEOUT_PER_HOP = RNS.Reticulum.DEFAULT_PER_HOP_TIMEOUT """ @@ -116,7 +116,6 @@ class Link: TIMEOUT = 0x01 INITIATOR_CLOSED = 0x02 DESTINATION_CLOSED = 0x03 - STAMP_FAILURE = 0x04 ACCEPT_NONE = 0x00 ACCEPT_APP = 0x01 @@ -187,17 +186,8 @@ class Link: def validate_request(owner, data, packet): if len(data) == Link.ECPUBSIZE or len(data) == Link.ECPUBSIZE+Link.LINK_MTU_SIZE: try: - peer_pub_bytes = data[:Link.ECPUBSIZE//2] - peer_sig_pub_bytes = data[Link.ECPUBSIZE//2:Link.ECPUBSIZE] - stamp_material = owner.hash + peer_sig_pub_bytes - value = stamp_value(stamp_material, peer_pub_bytes) - - if RNS.Transport.LR_STAMPS_ENFORCED and not stamp_valid(peer_pub_bytes, owner.get_link_cost(), stamp_material): raise ValueError(f"Insufficient link request stamp value {value}") - - link = Link(owner=owner, peer_pub_bytes=peer_pub_bytes, peer_sig_pub_bytes=peer_sig_pub_bytes) + link = Link(owner = owner, peer_pub_bytes=data[:Link.ECPUBSIZE//2], peer_sig_pub_bytes=data[Link.ECPUBSIZE//2:Link.ECPUBSIZE]) link.set_link_id(packet) - link.stamp_cost = value - link.stamp_status = True if len(data) == Link.ECPUBSIZE+Link.LINK_MTU_SIZE: RNS.log("Link request includes MTU signalling", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None @@ -213,7 +203,7 @@ class Link: link.destination = packet.destination link.establishment_timeout = Link.ESTABLISHMENT_TIMEOUT_PER_HOP * max(1, packet.hops) + Link.KEEPALIVE link.establishment_cost += len(packet.raw) - RNS.log(f"Validating link request {RNS.prettyhexrep(link.link_id)} with value {value}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None + RNS.log(f"Validating link request {RNS.prettyhexrep(link.link_id)}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None RNS.log(f"Link MTU configured to {RNS.prettysize(link.mtu)}", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None RNS.log(f"Establishment timeout is {RNS.prettytime(link.establishment_timeout)} for incoming link request {RNS.prettyhexrep(link.link_id)}", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None link.handshake() @@ -229,7 +219,7 @@ class Link: return link except Exception as e: - RNS.log(f"Validating incoming link request failed: {e}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None + RNS.log(f"Validating link request failed: {e}", RNS.LOG_VERBOSE) if RNS.sl(RNS.LOG_VERBOSE) else None return None else: @@ -239,9 +229,7 @@ class Link: def __init__(self, destination=None, established_callback=None, closed_callback=None, owner=None, peer_pub_bytes=None, peer_sig_pub_bytes=None, mode=MODE_DEFAULT): if destination != None and destination.type != RNS.Destination.SINGLE: raise TypeError("Links can only be established to the \"single\" destination type") - if not mode in Link.ENABLED_MODES: raise TypeError(f"Requested link mode {Link.MODE_DESCRIPTIONS[mode]} not enabled") self.mode = mode - self.link_id = None self.rtt = None self.mtu = RNS.Reticulum.MTU self.establishment_cost = 0 @@ -272,8 +260,6 @@ class Link: self.stale_time = Link.STALE_TIME self.watchdog_lock = False self.status = Link.PENDING - self.stamp_status = None - self.stamp_job_id = None self.activated_at = None self.type = RNS.Destination.LINK self.owner = owner @@ -281,19 +267,6 @@ class Link: self.expected_hops = None self.rebalanced = None self.attached_interface = None - self.stamp_cost = None - self.stamp_material = None - self.packet = None - self.token = None - self.hash = None - self.prv = None - self.prv_bytes = None - self.sig_prv = None - self.pub = None - self.pub_bytes = None - self.sig_pub = None - self.sig_pub_bytes = None - self.__defer_keys = False self.__remote_identity = None self.__track_phy_stats = False self._channel = None @@ -306,24 +279,21 @@ class Link: else: self.initiator = True self.expected_hops = RNS.Transport.hops_to(self.destination.hash) - self.establishment_timeout = RNS.Reticulum.get_instance().get_first_hop_timeout(self.destination.hash) - self.establishment_timeout += Link.ESTABLISHMENT_TIMEOUT_PER_HOP * max(1, RNS.Transport.hops_to(self.destination.hash)) - self.stamp_cost = RNS.Identity.recall_link_cost(self.destination.hash) - if self.stamp_cost == None and RNS.Transport.ALWAYS_STAMP_LRS: self.stamp_cost = RNS.Transport.LR_COST + self.establishment_timeout = RNS.Reticulum.get_instance().get_first_hop_timeout(destination.hash) + self.establishment_timeout += Link.ESTABLISHMENT_TIMEOUT_PER_HOP * max(1, RNS.Transport.hops_to(destination.hash)) + self.prv = X25519PrivateKey.generate() + self.sig_prv = Ed25519PrivateKey.generate() - if self.stamp_cost and RNS.Transport.STAMP_LRS: self.__defer_keys = True - else: - self.prv = X25519PrivateKey.generate() - self.sig_prv = Ed25519PrivateKey.generate() + self.token = None + + self.pub = self.prv.public_key() + self.pub_bytes = self.pub.public_bytes() - if not self.__defer_keys: - self.pub = self.prv.public_key() - self.pub_bytes = self.pub.public_bytes() - self.sig_pub = self.sig_prv.public_key() - self.sig_pub_bytes = self.sig_pub.public_bytes() + self.sig_pub = self.sig_prv.public_key() + self.sig_pub_bytes = self.sig_pub.public_bytes() if peer_pub_bytes == None: - self.peer_pub = None + self.peer_pub = None self.peer_pub_bytes = None else: self.load_peer(peer_pub_bytes, peer_sig_pub_bytes) @@ -332,82 +302,26 @@ class Link: if closed_callback != None: self.set_link_closed_callback(closed_callback) if self.initiator: - if not self.__defer_keys: self.__initiate() - else: threading.Thread(target=self.__initiate, daemon=True).start() + signalling_bytes = b"" + nh_hw_mtu = RNS.Transport.next_hop_interface_hw_mtu(destination.hash) + if RNS.Reticulum.link_mtu_discovery() and nh_hw_mtu: + signalling_bytes = Link.signalling_bytes(nh_hw_mtu, self.mode) + RNS.log(f"Signalling link MTU of {RNS.prettysize(nh_hw_mtu)} for link", RNS.LOG_DEBUG) # TODO: Remove debug + else: signalling_bytes = Link.signalling_bytes(RNS.Reticulum.MTU, self.mode) + RNS.log(f"Establishing link with mode {Link.MODE_DESCRIPTIONS[self.mode]}", RNS.LOG_DEBUG) # TODO: Remove debug + self.request_data = self.pub_bytes+self.sig_pub_bytes+signalling_bytes + self.packet = RNS.Packet(destination, self.request_data, packet_type=RNS.Packet.LINKREQUEST) + self.packet.pack() + self.establishment_cost += len(self.packet.raw) + self.set_link_id(self.packet) + RNS.Transport.register_link(self) + self.request_time = time.time() + self.start_watchdog() + self.packet.send() + self.had_outbound() + RNS.log("Link request "+RNS.prettyhexrep(self.link_id)+" sent to "+str(self.destination), RNS.LOG_DEBUG) + RNS.log(f"Establishment timeout is {RNS.prettytime(self.establishment_timeout)} for link request "+RNS.prettyhexrep(self.link_id), RNS.LOG_EXTREME) - def __stamp_failed(self): - if self.status != Link.CLOSED: - self.teardown_reason = Link.STAMP_FAILURE - self.stamp_status = False - self.status = Link.CLOSED - self.link_closed() - - def __initiate(self): - if self.status != Link.PENDING: return - if self.__defer_keys: - try: - def stamp_watchdog(): - deadline = time.time() + RNS.Transport.LINK_STAMP_TIMEOUT - while self.stamp_status == None and time.time() <= deadline: time.sleep(1) - if time.time() > deadline and self.stamp_job_id and not self.stamp_status: - cancel_work(self.stamp_job_id) - RNS.log(f"Stamp generation timed out for link request to {RNS.prettyhexrep(self.destination.hash)}", RNS.LOG_NOTICE) - - self.sig_prv = Ed25519PrivateKey.generate() - self.sig_pub = self.sig_prv.public_key() - self.sig_pub_bytes = self.sig_pub.public_bytes() - self.stamp_material = self.destination.hash + self.sig_pub_bytes - - RNS.log(f"Starting stamp generation for link request to {self.destination}", RNS.LOG_DEBUG) - self.stamp_job_id = self.stamp_material - threading.Thread(target=stamp_watchdog, daemon=True).start() - stamped_key, v = generate_stamped_key(material=self.stamp_material, stamp_cost=self.stamp_cost) - self.stamp_job_id = None - - if stamped_key: - stamped_prv = stamped_key[0] - self.prv = X25519PrivateKey.from_private_bytes(stamped_prv) - self.prv_bytes = self.prv.private_bytes() - self.pub = self.prv.public_key() - self.pub_bytes = self.pub.public_bytes() - - if self.prv_bytes != stamped_prv or self.prv.public_key().public_bytes() != stamped_key[1]: - RNS.log(f"Stamped link request key generation mismatch, aborting link establishment", RNS.LOG_WARNING) - self.__stamp_failed() - return - - self.stamp_status = True - - else: - self.__stamp_failed() - return - - except Exception as e: - RNS.log(f"Error while generating link request stamp: {e}", RNS.LOG_ERROR) - RNS.trace_exception(e) - self.__stamp_failed() - return - - if self.status != Link.PENDING: return - - signalling_bytes = b"" - nh_hw_mtu = RNS.Transport.next_hop_interface_hw_mtu(self.destination.hash) - if RNS.Reticulum.link_mtu_discovery() and nh_hw_mtu: - signalling_bytes = Link.signalling_bytes(nh_hw_mtu, self.mode) - RNS.log(f"Signalling link MTU of {RNS.prettysize(nh_hw_mtu)} for link", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None - else: signalling_bytes = Link.signalling_bytes(RNS.Reticulum.MTU, self.mode) - request_data = self.pub_bytes+self.sig_pub_bytes+signalling_bytes - self.packet = RNS.Packet(self.destination, request_data, packet_type=RNS.Packet.LINKREQUEST) - self.packet.pack() - self.establishment_cost += len(self.packet.raw) - self.set_link_id(self.packet) - RNS.Transport.register_link(self) - self.request_time = time.time() - self.start_watchdog() - self.packet.send() - self.had_outbound() - RNS.log(f"Link request {RNS.prettyhexrep(self.link_id)} sent to {self.destination}", RNS.LOG_DEBUG) - RNS.log(f"Establishment timeout is {RNS.prettytime(self.establishment_timeout)} for link request {RNS.prettyhexrep(self.link_id)}", RNS.LOG_EXTREME) def load_peer(self, peer_pub_bytes, peer_sig_pub_bytes): self.peer_pub_bytes = peer_pub_bytes @@ -511,7 +425,6 @@ class Link: self.activated_at = time.time() self.last_proof = self.activated_at RNS.Transport.activate_link(self) - RNS.Transport.mark_path_responsive(self.destination.hash) RNS.log(f"Link {self} established with {self.destination}, RTT is {RNS.prettyshorttime(self.rtt)}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None if self.rtt != None and self.establishment_cost != None and self.rtt > 0 and self.establishment_cost > 0: @@ -598,7 +511,7 @@ class Link: def update_mdu(self): self.mdu = self.mtu - RNS.Reticulum.HEADER_MAXSIZE - RNS.Reticulum.IFAC_MIN_SIZE - self.mdu = math.floor((self.mtu-RNS.Reticulum.IFAC_MIN_SIZE-RNS.Reticulum.HEADER_MINSIZE-RNS.Identity.TOKEN_OVERHEAD)/RNS.Identity.AES256_BLOCKSIZE)*RNS.Identity.AES256_BLOCKSIZE - 1 + self.mdu = math.floor((self.mtu-RNS.Reticulum.IFAC_MIN_SIZE-RNS.Reticulum.HEADER_MINSIZE-RNS.Identity.TOKEN_OVERHEAD)/RNS.Identity.AES128_BLOCKSIZE)*RNS.Identity.AES128_BLOCKSIZE - 1 def rtt_packet(self, packet): try: @@ -680,7 +593,7 @@ class Link: def get_expected_rate(self): """ - :returns: The expected in-flight data rate of an established link. + :returns: The packet expected in-flight data rate of an established link. """ if self.status == Link.ACTIVE: return self.expected_rate else: return None @@ -756,7 +669,6 @@ class Link: self.status = Link.CLOSED if self.initiator: self.teardown_reason = Link.INITIATOR_CLOSED else: self.teardown_reason = Link.DESTINATION_CLOSED - if self.stamp_job_id: cancel_work(self.stamp_job_id); self.stamp_status = False self.link_closed() def teardown_packet(self, packet): @@ -1031,7 +943,6 @@ class Link: if packet.context != RNS.Packet.KEEPALIVE: self.last_data = self.last_inbound self.rx += 1 self.rxbytes += len(packet.data) - RNS.Transport.link_rxb += len(packet.raw) if self.status == Link.STALE: self.status = Link.ACTIVE if packet.packet_type == RNS.Packet.DATA: @@ -1394,7 +1305,7 @@ class Link: if len(self.outgoing_resources) > 0: return False else: return True - def __str__(self): return RNS.prettyhexrep(self.link_id) if self.link_id else "" + def __str__(self): return RNS.prettyhexrep(self.link_id) class RequestReceipt(): @@ -1484,7 +1395,7 @@ class RequestReceipt(): time.sleep(0.1) def request_timed_out(self, packet_receipt): - if self in self.link.pending_requests and self.status in [RequestReceipt.DELIVERED, RequestReceipt.SENT]: + if self in self.link.pending_requests and self.status == RequestReceipt.DELIVERED: self.status = RequestReceipt.FAILED self.concluded_at = time.time() self.link.pending_requests.remove(self) @@ -1494,7 +1405,7 @@ class RequestReceipt(): except Exception as e: RNS.log("Error while executing request timed out callback from "+str(self)+". The contained exception was: "+str(e), RNS.LOG_ERROR) def response_rejected(self): - if self in self.link.pending_requests and self.status in [RequestReceipt.DELIVERED, RequestReceipt.SENT]: + if self in self.link.pending_requests and self.status == RequestReceipt.DELIVERED: self.status = RequestReceipt.FAILED self.concluded_at = time.time() self.link.pending_requests.remove(self) diff --git a/RNS/Packet.py b/RNS/Packet.py index 4158e88b..74712b77 100755 --- a/RNS/Packet.py +++ b/RNS/Packet.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -103,7 +103,7 @@ class Packet: # With an MTU of 500, the maximum of data we can # send in a single encrypted packet is given by # the below calculation; 383 bytes. - ENCRYPTED_MDU = math.floor((RNS.Reticulum.MDU-RNS.Identity.TOKEN_OVERHEAD-RNS.Identity.KEYSIZE//16)/RNS.Identity.AES256_BLOCKSIZE)*RNS.Identity.AES256_BLOCKSIZE - 1 + ENCRYPTED_MDU = math.floor((RNS.Reticulum.MDU-RNS.Identity.TOKEN_OVERHEAD-RNS.Identity.KEYSIZE//16)/RNS.Identity.AES128_BLOCKSIZE)*RNS.Identity.AES128_BLOCKSIZE - 1 """ The maximum size of the payload data in a single encrypted packet """ @@ -116,13 +116,12 @@ class Packet: __slots__ = "hops", "header", "header_type", "packet_type", "transport_type", "context", "context_flag", "destination" __slots__ += "transport_id", "data", "flags", "raw", "packed", "sent", "create_receipt", "receipt", "fromPacked", "MTU" - __slots__ += "sent_at", "packet_hash", "ratchet_id", "receiving_interface", "attached_interface", "blocked_interfaces" - __slots__ += "rssi", "snr", "q", "ciphertext", "plaintext", "destination_hash", "destination_type", "link", "map_hash" - __slots__ += "is_outbound_pr", "traffic_class", "announce_signature_validated" + __slots__ += "sent_at", "packet_hash", "ratchet_id", "attached_interface", "receiving_interface", "rssi", "snr", "q" + __slots__ += "ciphertext", "plaintext", "destination_hash", "destination_type", "link", "map_hash", "is_outbound_pr" + __slots__ += "traffic_class", "announce_signature_validated" - def __init__(self, destination, data, packet_type=DATA, context=NONE, transport_type=RNS.Transport.BROADCAST, - header_type=HEADER_1, transport_id=None, attached_interface=None, blocked_interfaces=None, - create_receipt=True, context_flag=FLAG_UNSET): + def __init__(self, destination, data, packet_type = DATA, context = NONE, transport_type = RNS.Transport.BROADCAST, + header_type = HEADER_1, transport_id = None, attached_interface = None, create_receipt = True, context_flag=FLAG_UNSET): if destination != None: if transport_type == None: @@ -164,7 +163,6 @@ class Packet: self.traffic_class = None self.announce_signature_validated = None self.attached_interface = attached_interface - self.blocked_interfaces = blocked_interfaces self.receiving_interface = None self.is_outbound_pr = False self.rssi = None @@ -237,13 +235,8 @@ class Packet: self.header += bytes([self.context]) self.raw = self.header + self.ciphertext - if self.packet_type == Packet.ANNOUNCE and self.header_type == Packet.HEADER_1: - transport_id_length = RNS.Reticulum.TRUNCATED_HASHLENGTH//8 - if len(self.raw)+transport_id_length > self.MTU: - raise IOError(f"Transport-inserted announce packet size of {len(self.raw)+transport_id_length} exceeds MTU of {self.MTU} bytes") - if len(self.raw) > self.MTU: - raise IOError(f"Packet size of {len(self.raw)} exceeds MTU of {self.MTU} bytes") + raise IOError("Packet size of "+str(len(self.raw))+" exceeds MTU of "+str(self.MTU)+" bytes") self.packed = True self.update_hash() @@ -286,7 +279,7 @@ class Packet: return True except Exception as e: - RNS.log(f"Dropping malformed packet. The contained exception was: {e}", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None + RNS.log(f"Received malformed packet, dropping it. The contained exception was: {e}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None return False def send(self): @@ -309,13 +302,10 @@ class Packet: self.destination.last_outbound = time.time() self.destination.tx += 1 self.destination.txbytes += len(self.ciphertext) - RNS.Transport.link_txb += len(self.raw) if RNS.Transport.outbound(self): return self.receipt else: - if not self.attached_interface: - RNS.log(f"No interfaces could process the outbound {self.hops} hop, type {self.packet_type} packet for {self.destination}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - + RNS.log(f"No interfaces could process the outbound {self.hops} hop, type {self.packet_type} packet for {self.destination}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None self.sent = False self.receipt = None return False diff --git a/RNS/Resolver.py b/RNS/Resolver.py index 61b9c619..9f0b1a52 100644 --- a/RNS/Resolver.py +++ b/RNS/Resolver.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal diff --git a/RNS/Resource.py b/RNS/Resource.py index c0eafd37..5faf0dbf 100644 --- a/RNS/Resource.py +++ b/RNS/Resource.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -30,7 +30,6 @@ import RNS import os -import io import bz2 import math import time @@ -139,7 +138,6 @@ class Resource: HASHMAP_IS_NOT_EXHAUSTED = 0x00 HASHMAP_IS_EXHAUSTED = 0xFF - HASHMAP_IS_EMPTY = 0xFE # Status constants NONE = 0x00 @@ -183,7 +181,6 @@ class Resource: resource.hashmap_raw = adv.m resource.encrypted = True if resource.flags & 0x01 else False resource.compressed = True if resource.flags >> 1 & 0x01 else False - resource.app_flag = True if resource.flags >> 6 & 0x01 else False resource.initiator = False resource.callback = callback resource.__progress_callback = progress_callback @@ -249,7 +246,7 @@ class Resource: # The data passed can be either a bytes-array or a file opened # in binary read mode. def __init__(self, data, link, metadata=None, advertise=True, auto_compress=True, callback=None, progress_callback=None, - timeout=None, segment_index = 1, original_hash=None, request_id=None, is_response=False, app_flag=False, sent_metadata_size=0): + timeout = None, segment_index = 1, original_hash = None, request_id = None, is_response = False, sent_metadata_size=0): data_size = None resource_data = None @@ -259,7 +256,6 @@ class Resource: self.metadata = None self.has_metadata = False self.metadata_size = sent_metadata_size - self.app_flag = app_flag if metadata != None: packed_metadata = umsgpack.packb(metadata) @@ -284,18 +280,15 @@ class Resource: if hasattr(data, "read"): if data_size == None: data_size = os.stat(data.name).st_size - if data_size == 0: - if isinstance(data, io.BufferedReader): - RNS.log(f"Attempting to proxy stream data...", RNS.LOG_DEBUG) - stream_proxy = tempfile.TemporaryFile() - stream_proxy.write(data.read()) - stream_proxy.flush(); stream_proxy.seek(0) - data_size = os.stat(stream_proxy.name).st_size - if data_size: RNS.log(f"Stream proxy succeeded, final data size is {RNS.prettysize(data_size)}", RNS.LOG_DEBUG) - else: RNS.log(f"Resource initialisation received an invalid readable input, or stream data that could not be proxied, the transfer will likely fail.", RNS.LOG_WARNING) - data = stream_proxy - else: RNS.log(f"Got zero-sized readable at resource initialisation, the transfer will likely.", RNS.LOG_WARNING) + if data_size == 0: + RNS.log(f"Zero-sized stat at resource init, probably stream. Attempting to proxy stream data...", RNS.LOG_DEBUG) + stream_proxy = tempfile.TemporaryFile() + stream_proxy.write(data.read()) + data_size = os.stat(stream_proxy.name).st_size + if data_size: RNS.log(f"Stream proxy succeeded, final data size is {RNS.prettysize(data_size)}", RNS.LOG_DEBUG) + else: RNS.log(f"Resource initialisation received an invalid readable input, or stream data that could not be proxied, the transfer will likely fail.", RNS.LOG_WARNING) + data = stream_proxy self.total_size = data_size + self.metadata_size @@ -506,12 +499,11 @@ class Resource: if self.hashmap[i+segment*seg_len] == None: self.hashmap_height += 1 self.hashmap[i+segment*seg_len] = hashmap[i*Resource.MAPHASH_LEN:(i+1)*Resource.MAPHASH_LEN] - if hashes < 1 and segment != 0: + if hashes < 1: RNS.log("Invalid HMU received, cancelling transfer", RNS.LOG_ERROR) self.cancel() else: - if hashes == 0 and segment == 0: RNS.log(f"Received HMU-less resource advertisement, requesting initial hashmap", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None self.waiting_for_hmu = False self.request_next() @@ -539,7 +531,7 @@ class Resource: else: return True def __advertise_job(self): - self.advertisement_packet = RNS.Packet(self.link, ResourceAdvertisement(self, mdu=self.link.mdu).pack(), context=RNS.Packet.RESOURCE_ADV) + self.advertisement_packet = RNS.Packet(self.link, ResourceAdvertisement(self).pack(), context=RNS.Packet.RESOURCE_ADV) while not self.link.ready_for_new_resource(): self.status = Resource.QUEUED sleep(0.25) @@ -598,7 +590,7 @@ class Resource: RNS.log("No part requests received, retrying resource advertisement...", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None self.retries_left -= 1 if not self.ensure_link(): return - self.advertisement_packet = RNS.Packet(self.link, ResourceAdvertisement(self, mdu=self.link.mdu).pack(), context=RNS.Packet.RESOURCE_ADV) + self.advertisement_packet = RNS.Packet(self.link, ResourceAdvertisement(self).pack(), context=RNS.Packet.RESOURCE_ADV) self.advertisement_packet.send() self.last_activity = time.time() self.adv_sent = self.last_activity @@ -793,7 +785,6 @@ class Resource: is_response = self.is_response, advertise = False, auto_compress = self.auto_compress_option, - app_flag = self.app_flag, sent_metadata_size = self.metadata_size) if self.__progress_callback: self.next_segment.progress_callback(self.__progress_callback) @@ -954,30 +945,23 @@ class Resource: hashmap_exhausted = Resource.HASHMAP_IS_NOT_EXHAUSTED requested_hashes = b"" - # Initial advertisement-carried hashmap was empty, - # we can't request any real parts, and need an - # actual hashmap update first - if self.hashmap[0] == None: - hashmap_exhausted = Resource.HASHMAP_IS_EMPTY + i = 0; pn = self.consecutive_completed_height+1 + search_start = pn + search_size = self.window + + for part in self.parts[search_start:search_start+search_size]: + if part == None: + part_hash = self.hashmap[pn] + if part_hash != None: + requested_hashes += part_hash + self.outstanding_parts += 1 + i += 1 + else: + hashmap_exhausted = Resource.HASHMAP_IS_EXHAUSTED - else: - i = 0; pn = self.consecutive_completed_height+1 - search_start = pn - search_size = self.window - - for part in self.parts[search_start:search_start+search_size]: - if part == None: - part_hash = self.hashmap[pn] - if part_hash != None: - requested_hashes += part_hash - self.outstanding_parts += 1 - i += 1 - else: - hashmap_exhausted = Resource.HASHMAP_IS_EXHAUSTED - - pn += 1 - if i >= self.window or hashmap_exhausted == Resource.HASHMAP_IS_EXHAUSTED: - break + pn += 1 + if i >= self.window or hashmap_exhausted == Resource.HASHMAP_IS_EXHAUSTED: + break hmu_part = bytes([hashmap_exhausted]) if hashmap_exhausted == Resource.HASHMAP_IS_EXHAUSTED: @@ -985,9 +969,6 @@ class Resource: hmu_part += last_map_hash self.waiting_for_hmu = True - if hashmap_exhausted == Resource.HASHMAP_IS_EMPTY: - self.waiting_for_hmu = True - request_data = hmu_part + self.hash + requested_hashes request_packet = RNS.Packet(self.link, request_data, context = RNS.Packet.RESOURCE_REQ) @@ -1018,16 +999,8 @@ class Resource: self.retries_left = self.max_retries - pad = 1 - hashmap_is_empty = False - wants_more_hashmap = False - if request_data[0] == Resource.HASHMAP_IS_EMPTY: - wants_more_hashmap = True - hashmap_is_empty = True - - if request_data[0] == Resource.HASHMAP_IS_EXHAUSTED: - wants_more_hashmap = True - pad += Resource.MAPHASH_LEN + wants_more_hashmap = True if request_data[0] == Resource.HASHMAP_IS_EXHAUSTED else False + pad = 1+Resource.MAPHASH_LEN if wants_more_hashmap else 1 requested_hashes = request_data[pad+RNS.Identity.HASHLENGTH//8:] @@ -1063,15 +1036,15 @@ class Resource: last_map_hash = request_data[1:Resource.MAPHASH_LEN+1] part_index = self.receiver_min_consecutive_height - search_start = part_index if not hashmap_is_empty else 0 - search_end = self.receiver_min_consecutive_height+ResourceAdvertisement.COLLISION_GUARD_SIZE if not hashmap_is_empty else 0 + search_start = part_index + search_end = self.receiver_min_consecutive_height+ResourceAdvertisement.COLLISION_GUARD_SIZE for part in self.parts[search_start:search_end]: part_index += 1 if part.map_hash == last_map_hash: break self.receiver_min_consecutive_height = max(part_index-1-Resource.WINDOW_MAX, 0) - if not hashmap_is_empty and part_index % ResourceAdvertisement.HASHMAP_MAX_LEN != 0: + if part_index % ResourceAdvertisement.HASHMAP_MAX_LEN != 0: RNS.log("Resource sequencing error, cancelling transfer!", RNS.LOG_ERROR) self.cancel() return @@ -1309,9 +1282,8 @@ class ResourceAdvertisement: adv = ResourceAdvertisement.unpack(advertisement_packet.plaintext) return adv.d - def __init__(self, resource=None, request_id=None, is_response=False, mdu=None): + def __init__(self, resource=None, request_id=None, is_response=False): self.link = None - self.mdu = mdu or RNS.Link.MDU if resource != None: self.t = resource.size # Transfer size self.d = resource.total_size # Total uncompressed data size @@ -1322,7 +1294,6 @@ class ResourceAdvertisement: self.m = resource.hashmap # Resource hashmap self.c = resource.compressed # Compression flag self.e = resource.encrypted # Encryption flag - self.a = resource.app_flag # Application flag self.s = resource.split # Split flag self.x = resource.has_metadata # Metadata flag self.i = resource.segment_index # Segment index @@ -1340,7 +1311,7 @@ class ResourceAdvertisement: self.p = True # Flags - self.f = 0x00 | self.a << 6 | self.x << 5 | self.p << 4 | self.u << 3 | self.s << 2 | self.c << 1 | self.e + self.f = 0x00 | self.x << 5 | self.p << 4 | self.u << 3 | self.s << 2 | self.c << 1 | self.e def get_transfer_size(self): return self.t def get_data_size(self): return self.d @@ -1350,7 +1321,6 @@ class ResourceAdvertisement: def is_compressed(self): return self.c def has_metadata(self): return self.x def get_link(self): return self.link - def app_flag_set(self): return self.f >> 6 & 0x01 def pack(self, segment=0): hashmap_start = segment*ResourceAdvertisement.HASHMAP_MAX_LEN @@ -1372,13 +1342,7 @@ class ResourceAdvertisement: "f": self.f, # Resource flags "m": hashmap } - packed_adv = umsgpack.packb(dictionary) - if len(packed_adv) > self.mdu: - RNS.log(f"Resource advertisement ({RNS.prettysize(len(packed_adv))}) exceeds link MDU, deferring initial HMU", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - dictionary["m"] = b"" - packed_adv = umsgpack.packb(dictionary) - - return packed_adv + return umsgpack.packb(dictionary) @staticmethod def unpack(data): @@ -1402,7 +1366,6 @@ class ResourceAdvertisement: adv.u = True if ((adv.f >> 3) & 0x01) == 0x01 else False adv.p = True if ((adv.f >> 4) & 0x01) == 0x01 else False adv.x = True if ((adv.f >> 5) & 0x01) == 0x01 else False - adv.a = True if ((adv.f >> 6) & 0x01) == 0x01 else False if adv.t > Resource.MAX_EFFICIENT_SIZE*3: raise ValueError("Invalid transfer size") diff --git a/RNS/Reticulum.py b/RNS/Reticulum.py index e08103cd..77b742f5 100755 --- a/RNS/Reticulum.py +++ b/RNS/Reticulum.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -53,7 +53,6 @@ import configparser import multiprocessing.connection import importlib.util import threading -import weakref import signal import atexit import struct @@ -176,35 +175,17 @@ class Reticulum: gracious_persist_lock = Lock() __instance = None - __pid = os.getpid() __interface_detach_ran = False __exit_handler_ran = False - RPC_EXIT_TIMEOUT = 0.5 @staticmethod def exit_handler(): # This exit handler is called whenever Reticulum is asked to # shut down, and will in turn call exit handlers in other # classes, saving necessary information to disk and carrying # out cleanup operations. - if not os.getpid() == Reticulum.__pid: - Reticulum.__exit_handler_ran = True - if not Reticulum.__exit_handler_ran: Reticulum.__exit_handler_ran = True - - for conn in list(Reticulum.__open_rpc_conns): - try: conn.close() - except Exception: pass - - try: - if Reticulum.__instance.is_connected_to_shared_instance: - deregister_job = threading.Thread(target=Reticulum.__instance.unwants_all_destination_types, daemon=True) - deregister_job.start() - deregister_job.join(timeout=Reticulum.RPC_EXIT_TIMEOUT) - if deregister_job.is_alive(): RNS.log("Shared instance RPC timed out during exit", RNS.LOG_DEBUG) - except Exception as e: RNS.log(f"Could not deregister destination types at exit: {e}", RNS.LOG_DEBUG) - if not Reticulum.__interface_detach_ran: RNS.Transport.detach_interfaces() RNS.Transport.exit_handler() RNS.Identity.exit_handler() @@ -214,13 +195,13 @@ class Reticulum: @staticmethod def sigint_handler(signal, frame): - if os.getpid() == Reticulum.__pid: RNS.Transport.detach_interfaces() + RNS.Transport.detach_interfaces() Reticulum.__interface_detach_ran = True RNS.exit() @staticmethod def sigterm_handler(signal, frame): - if os.getpid() == Reticulum.__pid: RNS.Transport.detach_interfaces() + RNS.Transport.detach_interfaces() Reticulum.__interface_detach_ran = True RNS.exit() @@ -231,16 +212,8 @@ class Reticulum: """ return Reticulum.__instance - @staticmethod - def get_instance_pid(): - """ - Returns the main process ID of the currently running Reticulum instance. - """ - return Reticulum.__pid - def __init__(self,configdir=None, loglevel=None, logdest=None, verbosity=None, - require_shared_instance=False, shared_instance_type=None, - enable_stamping=False, enforce_stamps=False): + require_shared_instance=False, shared_instance_type=None): """ Initialises and starts a Reticulum instance. This must be done before any other operations, and Reticulum will not @@ -284,16 +257,11 @@ class Reticulum: Reticulum.__local_hops_delta = False Reticulum.__link_mtu_discovery = Reticulum.LINK_MTU_DISCOVERY Reticulum.__remote_management_enabled = False - Reticulum.__interface_management_enabled = True Reticulum.__use_implicit_proof = True Reticulum.__allow_probes = False Reticulum.__discovery_enabled = False Reticulum.__discover_interfaces = False Reticulum.__autoconnect_discovered_interfaces = False - Reticulum.__autoconnect_unverified = False - Reticulum.__autoconnect_warn = 6 - Reticulum.__autoconnect_cap = 12 - Reticulum.__autoconnect_caps_disabled = False Reticulum.__autoconnect_interface_mode = None Reticulum.__autoconnect_interface_gravity = None Reticulum.__autoconnect_announces_to_internal = None @@ -378,16 +346,9 @@ class Reticulum: RNS.log(f"Utilising cryptography backend \"{RNS.Cryptography.Provider.backend()}\"", RNS.LOG_DEBUG) RNS.log(f"Configuration loaded from {self.configpath}", RNS.LOG_VERBOSE) - if enable_stamping: - RNS.log(f"Network stamp generation activated", RNS.LOG_VERBOSE) - RNS.Transport.STAMP_DESTINATIONS = True - RNS.Transport.STAMP_PRS = True - RNS.Transport.STAMP_LRS = True - - if enforce_stamps: - RNS.log(f"Network stamp enforcement activated", RNS.LOG_VERBOSE) - RNS.Transport.STAMPS_ENFORCED = True - RNS.Transport.LR_STAMPS_ENFORCED = True + RNS.Identity.load_known_destinations() + if not self.is_connected_to_shared_instance: RNS.Identity._clean_ratchets() + RNS.Transport.start(self) if self.use_af_unix: self.rpc_addr = f"\0rns/{self.local_socket_path}/rpc" @@ -399,12 +360,8 @@ class Reticulum: if self.rpc_key == None: self.rpc_key = RNS.Identity.full_hash(RNS.Transport.internal_identity().get_private_key()) - RNS.Identity.load_known_destinations() - if not self.is_connected_to_shared_instance: RNS.Identity._clean_ratchets() - RNS.Transport.start(self) - if self.is_shared_instance: - self.rpc_listener = multiprocessing.connection.Listener(self.rpc_addr, family=self.rpc_type, backlog=128, authkey=self.rpc_key) + self.rpc_listener = multiprocessing.connection.Listener(self.rpc_addr, family=self.rpc_type, authkey=self.rpc_key) thread = threading.Thread(target=self.rpc_loop) thread.daemon = True thread.start() @@ -512,80 +469,6 @@ class Reticulum: value = self.config["logging"].as_bool(option) RNS.logtimestamps = bool(value) - if "filter" in self.config: - for option in self.config["filter"]: - if option == "required_only": - v = self.config["filter"].as_bool(option) - RNS.Transport.required_destinations_only = v - - if option == "ignored_types": - entries = self.config["filter"].as_list(option) - for entry in entries: RNS.Transport.block_destination_type(entry) - - if option == "allowed_types": - entries = self.config["filter"].as_list(option) - for entry in entries: RNS.Transport.allow_destination_type(entry) - - if option == "hop_limiter": - v = self.config["filter"].as_int(option) - RNS.Transport.HOP_LIMITER = max(0, min(v, RNS.Transport.PATHFINDER_M)) - - if "stamps" in self.config: - for option in self.config["stamps"]: - if option == "enforce_stamps": - value = self.config["stamps"].as_bool(option) - if value == True: - RNS.Transport.STAMPS_ENFORCED = True - RNS.Transport.LR_STAMPS_ENFORCED = True - - if option == "stamp_destinations": - value = self.config["stamps"].as_bool(option) - if value == True: RNS.Transport.STAMP_DESTINATIONS = True - - if option == "stamp_prs": - value = self.config["stamps"].as_bool(option) - if value == True: RNS.Transport.STAMP_PRS = True - - if option == "always_stamp_lrs": - value = self.config["stamps"].as_bool(option) - if value == True: RNS.Transport.ALWAYS_STAMP_LRS = True - - if option == "destination_cost": - v = self.config["stamps"].as_float(option) - RNS.Transport.DESTINATION_COST = max(0, min(v, RNS.Transport.STAMP_COST_CAP)) - - if option == "destination_value": - v = self.config["stamps"].as_float(option) - RNS.Transport.DESTINATION_VALUE = max(0, min(v, RNS.Transport.STAMP_COST_CAP)) - - if option == "pr_cost": - v = self.config["stamps"].as_float(option) - RNS.Transport.PR_COST = max(0, min(v, RNS.Transport.STAMP_COST_CAP)) - - if option == "pr_value": - v = self.config["stamps"].as_float(option) - RNS.Transport.PR_VALUE = max(0, min(v, RNS.Transport.STAMP_COST_CAP)) - - if option == "lr_cost": - v = self.config["stamps"].as_float(option) - RNS.Transport.LR_COST = max(0, min(v, RNS.Transport.LINK_COST_CAP)) - - if option == "lr_stamp_timeout": - v = self.config["stamps"].as_float(option) - RNS.Transport.LINK_STAMP_TIMEOUT = max(0.020, v) - - if option == "pr_stamp_timeout": - v = self.config["stamps"].as_float(option) - RNS.Transport.PR_STAMP_TIMEOUT = max(0.020, v) - - if option == "max_workers": - v = self.config["stamps"].as_int(option) - RNS.Stamps.MAX_WORKERS = max(1, v) - - if option == "worker_niceness": - v = self.config["stamps"].as_int(option) - RNS.Stamps.NICENESS = min(20, max(0, v)) - if "reticulum" in self.config: for option in self.config["reticulum"]: value = self.config["reticulum"][option] @@ -624,7 +507,7 @@ class Reticulum: if option == "enable_transport": v = self.config["reticulum"].as_bool(option) if v == True: Reticulum.__transport_enabled = True - + if option == "static_transport_identity": v = self.config["reticulum"].as_bool(option) if v == True: Reticulum.__static_transport_identity = True @@ -665,11 +548,6 @@ class Reticulum: v = self.config["reticulum"].as_bool(option) if v == True: Reticulum.__remote_management_enabled = True - if option == "enable_interface_management": - v = self.config["reticulum"].as_bool(option) - if v == False: Reticulum.__interface_management_enabled = False - else: Reticulum.__interface_management_enabled = True - if option == "remote_management_allowed": v = self.config["reticulum"].as_list(option) for hexhash in v: @@ -708,7 +586,7 @@ class Reticulum: if v == False: Reticulum.__discover_interfaces = False if option == "required_discovery_value": - v = self.config["reticulum"].as_float(option) + v = self.config["reticulum"].as_int(option) if v > 0: Reticulum.__required_discovery_value = v else: Reticulum.__required_discovery_value = None @@ -740,36 +618,9 @@ class Reticulum: except Exception as e: raise ValueError(f"Invalid identity hash for interface discovery source: {hexhash}") if not source_identity_hash in Reticulum.__interface_sources: Reticulum.__interface_sources.append(source_identity_hash) - if option == "autoconnect_discovered_interfaces_disable_caps": - v = self.config["reticulum"].as_bool(option) - if v: Reticulum.__autoconnect_caps_disabled = True - if option == "autoconnect_discovered_interfaces": v = self.config["reticulum"].as_int(option) if v > 0: Reticulum.__autoconnect_discovered_interfaces = v - if not Reticulum.__autoconnect_caps_disabled: - if Reticulum.__autoconnect_discovered_interfaces > Reticulum.__autoconnect_cap: - Reticulum.__autoconnect_discovered_interfaces = Reticulum.__autoconnect_cap - RNS.log(f"", RNS.LOG_WARNING) - RNS.log(f"Auto-connect interface target was capped to {Reticulum.__autoconnect_discovered_interfaces}", RNS.LOG_WARNING) - RNS.log(f"Using large numbers of auto-connected interfaces will not lead to better", RNS.LOG_WARNING) - RNS.log(f"connectivity or redundancy. If you really know what you're doing, and are", RNS.LOG_WARNING) - RNS.log(f"certain that you need this, you will also know how to get around this check.", RNS.LOG_WARNING) - if Reticulum.__autoconnect_discovered_interfaces > Reticulum.__autoconnect_warn: - RNS.log(f"", RNS.LOG_WARNING) - RNS.log(f"You have configured more than {Reticulum.__autoconnect_warn} auto-connect interfaces.", RNS.LOG_WARNING) - RNS.log(f"In almost all situations, this is excessive, and should be avoided.", RNS.LOG_WARNING) - RNS.log(f"For a normal home or office node, 2-3 autoconnects will be sufficient.", RNS.LOG_WARNING) - RNS.log(f"", RNS.LOG_WARNING) - RNS.log(f"If you're running a fast, well-connected transport node that can actually", RNS.LOG_WARNING) - RNS.log(f"provide additional capacity and transport to the network, you can consider", RNS.LOG_WARNING) - RNS.log(f"raising this number to {Reticulum.__autoconnect_warn}-{Reticulum.__autoconnect_warn+3}. Only in the rarest of cases will going beyond", RNS.LOG_WARNING) - RNS.log(f"this actually provide any benefit.", RNS.LOG_WARNING) - RNS.log(f"", RNS.LOG_WARNING) - - if option == "autoconnect_unverified_implementations": - v = self.config["reticulum"].as_bool(option) - Reticulum.__autoconnect_unverified = v if option == "autoconnect_interface_mode": v = None; dmode = str(self.config["reticulum"]["autoconnect_interface_mode"]).lower() @@ -884,50 +735,11 @@ class Reticulum: if self.local_socket_path == None and self.use_af_unix: self.local_socket_path = "default" - if os.path.isfile(Reticulum.configdir+"/blocked_ips"): - try: - with open(Reticulum.configdir+"/blocked_ips", "r") as f: - expire = time.time()+(60*60*24*365.25*1000) - blocked_ips = f.read().strip().splitlines() - blocked_count = 0 - for line in blocked_ips: - blocked_ip = line.strip() - if blocked_ip.startswith("#"): continue - if RNS.Discovery.is_ip_address(blocked_ip): - BackboneInterface.BackboneInterface.fast_flapping[blocked_ip] = [expire, expire, 0xFFFF] - blocked_count += 1 - RNS.log(f"Loaded {blocked_count} blocked IPs", RNS.LOG_VERBOSE) - - except Exception as e: RNS.log(f"Error while loading blocked IP list: {e}", RNS.LOG_ERROR) - - if os.path.isfile(Reticulum.configdir+"/known_destination_types"): - try: - with open(Reticulum.configdir+"/known_destination_types", "r") as f: - dst_types = f.read().strip().splitlines() - for line in dst_types: - dst_type = line.strip() - if dst_type.startswith("#"): continue - RNS.Transport.destination_type_map[RNS.Destination.name_hash(dst_type)] = dst_type - - except Exception as e: RNS.log(f"Error while loading known destination types list: {e}", RNS.LOG_ERROR) - - if os.path.isfile(Reticulum.configdir+"/flagged_destination_types"): - try: - with open(Reticulum.configdir+"/flagged_destination_types", "r") as f: - dst_types = f.read().strip().splitlines() - for line in dst_types: - dst_type = line.strip() - if dst_type.startswith("#"): continue - RNS.Transport.flagged_type_map[RNS.Destination.name_hash(dst_type)] = dst_type - - except Exception as e: RNS.log(f"Error while loading flagged destination types list: {e}", RNS.LOG_ERROR) - dql = RNS.Reticulum.default_data_queue_length() or RNS.Transport.INBOUND_DA_QUEUE_LENGTH BackboneInterface.BackboneInterface.DP_IC_HIGH_WM = max(4, int((BackboneInterface.BackboneInterface.DP_IC_HIGH_WM_PCT/100.0) * dql)) BackboneInterface.BackboneInterface.DP_IC_MID_WM = max(2, int((BackboneInterface.BackboneInterface.DP_IC_MID_WM_PCT/100.0) * dql)) BackboneInterface.BackboneInterface.DP_IC_LOW_WM = max(0, int((BackboneInterface.BackboneInterface.DP_IC_LOW_WM_PCT/100.0) * dql)) - RNS.Transport.ensure_identity() self.__start_local_interface() if self.is_shared_instance or self.is_standalone_instance: @@ -945,92 +757,7 @@ class Reticulum: RNS.log("System interfaces are ready", RNS.LOG_VERBOSE) - def _attach_interface(self, name, internal_forced=False): - if not internal_forced and not Reticulum.__interface_management_enabled: return False - try: - interfaces = { iface.name: iface for iface in RNS.Transport.interfaces } - if name in interfaces: - RNS.log(f"Attempt to attach existing interface \"{name}\"", RNS.LOG_WARNING) - return False - - else: - try: config = ConfigObj(self.configpath) - except Exception as e: - RNS.log(f"Could not parse the configuration at {self.configpath} during interface attach", RNS.LOG_ERROR) - return None - - if "interfaces" in config: - if not name in config["interfaces"]: - RNS.log(f"Cannot attach interface \"{name}\", no configuration entry exists", RNS.LOG_ERROR) - return None - - else: - interface_config = config["interfaces"][name] - self._synthesize_interface(interface_config, name, force_attach=True) - RNS.log(f"Interface \"{name}\" was attached", RNS.LOG_NOTICE) - return True - - except Exception as e: RNS.log(f"Error while detaching interface \"{name}\": {e}", RNS.LOG_ERROR) - return False - - def _detach_interface(self, name, internal_forced=False, interface_instance=None): - if not internal_forced and not Reticulum.__interface_management_enabled: return False - try: - if interface_instance: interface = interface_instance - else: - interfaces = { iface.name: iface for iface in RNS.Transport.interfaces } - interface = interfaces.get(name, None) - if not interface: - try: tunnel_id = bytes.fromhex(name) - except: return None - tunnel_ids = { iface.tunnel_id: iface for iface in RNS.Transport.interfaces if iface.tunnel_id } - local_tunnel_ids = { iface.local_tunnel_id: iface for iface in RNS.Transport.interfaces if iface.local_tunnel_id } - interface = tunnel_ids.get(tunnel_id, None) or local_tunnel_ids.get(tunnel_id, None) - - if not interface: - RNS.log(f"Attempt to detach non-existing interface \"{name or interface}\"", RNS.LOG_WARNING) - return None - - else: - if isinstance(interface, I2PInterface.I2PInterface): return False - if isinstance(interface, LocalInterface.LocalClientInterface): return False - if isinstance(interface, LocalInterface.LocalServerInterface): return False - if interface.spawned_interfaces: - if type(interface.spawned_interfaces) == dict: spawned = list(interface.spawned_interfaces.values()) - elif type(interface.spawned_interfaces) == list: spawned = interface.spawned_interfaces.copy() - for s in spawned: - s.detach() - s.teardown() - RNS.Transport.remove_interface(s) - - interface.detach() - if interface.parent_interface and interface.parent_interface.spawned_interfaces: - if interface in interface.parent_interface.spawned_interfaces: - interface.teardown() - - RNS.Transport.remove_interface(interface) - RNS.log(f"Interface {interface} was detached", RNS.LOG_NOTICE) - return True - - except Exception as e: RNS.log(f"Error while detaching interface \"{name}\": {e}", RNS.LOG_ERROR); RNS.trace_exception(e) - return False - - def _reload_interface(self, name, internal_forced=False): - if not internal_forced and not Reticulum.__interface_management_enabled: return False - interfaces = { iface.name: iface for iface in RNS.Transport.interfaces } - if not name in interfaces: - RNS.log(f"Attempt to reload non-existing interface \"{name}\"", RNS.LOG_WARNING) - return None - - if self._detach_interface(name, internal_forced=internal_forced) and self._attach_interface(name, internal_forced=internal_forced): - RNS.log(f"Interface \"{name}\" was reloaded", RNS.LOG_NOTICE) - return True - - else: - RNS.log(f"Could not reload interface \"{name}\"", RNS.LOG_NOTICE) - return False - - def _synthesize_interface(self, config, name, instance_init=False, force_attach=False): + def _synthesize_interface(self, config, name, instance_init=False): c = config interface_mode = Interface.Interface.MODE_FULL @@ -1071,40 +798,21 @@ class Reticulum: gravity = self._default_gravity() if "gravity" in c: gravity = c.as_int("gravity") - hop_limiter = None - if "hop_limiter" in c: - v = c.as_int("hop_limiter") - hop_limiter = max(0, min(v, RNS.Transport.PATHFINDER_M)) - - destination_cost = None - if "destination_cost" in c: - v = c.as_float("destination_cost") - destination_cost = max(0, min(v, RNS.Transport.STAMP_COST_CAP)) - - pr_cost = None - if "pr_cost" in c: - v = c.as_float("pr_cost") - pr_cost = max(0, min(v, RNS.Transport.STAMP_COST_CAP)) - ifac_size = None if "ifac_size" in c: if c.as_int("ifac_size") >= Reticulum.IFAC_MIN_SIZE*8: ifac_size = c.as_int("ifac_size")//8 - + ifac_netname = None if "networkname" in c: - if c["networkname"] == "None": RNS.log("Ambiguous IFAC network name \"None\", this value is ignored and an IFAC network name has NOT been set", RNS.LOG_WARNING) - if c["networkname"] != "" and c["networkname"] != "None": ifac_netname = c["networkname"] + if c["networkname"] != "": ifac_netname = c["networkname"] if "network_name" in c: - if c["network_name"] == "None": RNS.log("Ambiguous IFAC network name \"None\", this value is ignored and an IFAC network name has NOT been set", RNS.LOG_WARNING) - if c["network_name"] != "" and c["network_name"] != "None": ifac_netname = c["network_name"] + if c["network_name"] != "": ifac_netname = c["network_name"] ifac_netkey = None if "passphrase" in c: - if c["passphrase"] == "None": RNS.log("Ambiguous IFAC passphrase \"None\", this value is ignored and an IFAC passphrase has NOT been set", RNS.LOG_WARNING) - if c["passphrase"] != "" and c["passphrase"] != "None": ifac_netkey = c["passphrase"] + if c["passphrase"] != "": ifac_netkey = c["passphrase"] if "pass_phrase" in c: - if c["pass_phrase"] == "None": RNS.log("Ambiguous IFAC passphrase \"None\", this value is ignored and an IFAC passphrase has NOT been set", RNS.LOG_WARNING) - if c["pass_phrase"] != "" and c["pass_phrase"] != "None": ifac_netkey = c["pass_phrase"] + if c["pass_phrase"] != "": ifac_netkey = c["pass_phrase"] ingress_control = True if "ingress_control" in c: ingress_control = c.as_bool("ingress_control") @@ -1194,16 +902,12 @@ class Reticulum: discoverable = c.as_bool("discoverable") if discoverable: Reticulum.__discovery_enabled = True - if not Reticulum.__static_transport_identity and not Reticulum.__transport_enabled: - RNS.log(f"Discoverable interface was configured, enabling static transport identity on non-transport instance", RNS.LOG_WARNING) - Reticulum.__static_transport_identity = True - if "announce_interval" in c: discovery_announce_interval = c.as_int("announce_interval")*60 if discovery_announce_interval < 5*60: discovery_announce_interval = 5*60 if discovery_announce_interval == None: discovery_announce_interval = 6*60*60 - if "discovery_stamp_value" in c: discovery_stamp_value = c.as_float("discovery_stamp_value") + if "discovery_stamp_value" in c: discovery_stamp_value = c.as_int("discovery_stamp_value") if "discovery_name" in c: discovery_name = c["discovery_name"] if "discovery_encrypt" in c: discovery_encrypt = c.as_bool("discovery_encrypt") if "reachable_on" in c: reachable_on = c["reachable_on"] @@ -1236,12 +940,11 @@ class Reticulum: if "outgoing" in c and c.as_bool("outgoing") == False: interface.OUT = False else: interface.OUT = True - interface.mode = interface_mode - interface.gravity = gravity - interface.hop_limiter = hop_limiter - interface.announce_cap = announce_cap - interface.bootstrap_only = bootstrap_only - if configured_bitrate: interface.bitrate = configured_bitrate + interface.mode = interface_mode + interface.gravity = gravity + interface.announce_cap = announce_cap + interface.bootstrap_only = bootstrap_only + if configured_bitrate: interface.bitrate = configured_bitrate interface.optimise_mtu() if ifac_size != None: interface.ifac_size = ifac_size @@ -1271,9 +974,6 @@ class Reticulum: interface.announce_rate_penalty = announce_rate_penalty interface.ingress_control = ingress_control - interface._destination_cost = destination_cost - interface._pr_cost = pr_cost - if egress_control != None: interface.egress_control = egress_control if ic_max_held_announces != None: interface.ic_max_held_announces = ic_max_held_announces if ic_burst_hold != None: interface.ic_burst_hold = ic_burst_hold @@ -1305,16 +1005,11 @@ class Reticulum: interface.ifac_identity = RNS.Identity.from_bytes(interface.ifac_key) interface.ifac_signature = interface.ifac_identity.sign(RNS.Identity.full_hash(interface.ifac_key)) - elif interface.discoverable and interface.discovery_publish_ifac: - RNS.log(f"IFAC publishing was enabled for discoverable interface {interface}, but neither IFAC netname nor passphrase is configured", RNS.LOG_WARNING) - RNS.log(f"Disabling IFAC publishing for {interface}", RNS.LOG_WARNING) - interface.discovery_publish_ifac = False - RNS.Transport.add_interface(interface) interface.final_init() interface = None - if (("interface_enabled" in c) and c.as_bool("interface_enabled") == True) or (("enabled" in c) and c.as_bool("enabled") == True) or force_attach: + if (("interface_enabled" in c) and c.as_bool("interface_enabled") == True) or (("enabled" in c) and c.as_bool("enabled") == True): interface_config = c interface_config["name"] = name interface_config["selected_interface_mode"] = interface_mode @@ -1418,6 +1113,7 @@ class Reticulum: except Exception as e: RNS.log(f"External interface initialisation failed for {interface_type} / {name}", RNS.LOG_ERROR) RNS.trace_exception(e) + else: RNS.log("Skipping disabled interface \""+name+"\"", RNS.LOG_DEBUG) @@ -1559,7 +1255,7 @@ class Reticulum: filepath = self.cachepath + "/" + filename mtime = os.path.getmtime(filepath) age = now - mtime - if age > RNS.Transport.PATH_TIMEOUT: os.unlink(filepath) + if age > RNS.Transport.DESTINATION_TIMEOUT: os.unlink(filepath) if background: time.sleep(0.001) except Exception as e: @@ -1577,7 +1273,6 @@ class Reticulum: def rpc_loop(self): while RNS.Transport._should_run: - conn = None try: conn = self.rpc_listener.accept() call = mp.unpackb(conn.recv_bytes()) @@ -1591,14 +1286,12 @@ class Reticulum: if path == "interface_stats": self.rpc_return(conn, self.get_interface_stats()) if path == "rate_table": self.rpc_return(conn, self.get_rate_table()) - if path == "known_destinations": self.rpc_return(conn, self.get_known_destinations()) if path == "next_hop_if_name": self.rpc_return(conn, self.get_next_hop_if_name(call["destination_hash"])) if path == "next_hop": self.rpc_return(conn, self.get_next_hop(call["destination_hash"])) if path == "first_hop_timeout": self.rpc_return(conn, self.get_first_hop_timeout(call["destination_hash"])) if path == "lowest_interface_bitrate": self.rpc_return(conn, self.get_lowest_interface_bitrate()) if path == "medium_path_timeout": self.rpc_return(conn, self.get_medium_path_timeout()) if path == "link_count": self.rpc_return(conn, self.get_link_count()) - if path == "link_distribution": self.rpc_return(conn, self.get_link_distribution()) if path == "active_link_count": self.rpc_return(conn, self.get_active_link_count()) if path == "packet_rssi": self.rpc_return(conn, self.get_packet_rssi(call["packet_hash"])) if path == "packet_snr": self.rpc_return(conn, self.get_packet_snr(call["packet_hash"])) @@ -1607,12 +1300,6 @@ class Reticulum: if path == "blackholed_identities": self.rpc_return(conn, self.get_blackholed_identities()) if path == "is_blackholed": self.rpc_return(conn, self.is_blackholed(call["identity_hash"])) - if "manage" in call: - path = call["manage"] - if path == "attach_interface": self.rpc_return(conn, self.attach_interface(call["name"])) - if path == "detach_interface": self.rpc_return(conn, self.detach_interface(call["name"])) - if path == "reload_interface": self.rpc_return(conn, self.reload_interface(call["name"])) - if "drop" in call: path = call["drop"] if path == "path": self.rpc_return(conn, self.drop_path(call["destination_hash"])) @@ -1629,23 +1316,6 @@ class Reticulum: identity_hash = call["unblackhole_identity"] self.rpc_return(conn, self.unblackhole_identity(identity_hash)) - if "wants_destination_type" in call: - full_name = call["wants_destination_type"] - requester = call["requester"] - signature = call["signature"] - self.rpc_return(conn, self.wants_destination_type(full_name, requester, signature)) - - if "unwants_destination_type" in call: - full_name = call["unwants_destination_type"] - requester = call["requester"] - signature = call["signature"] - self.rpc_return(conn, self.unwants_destination_type(full_name, requester, signature)) - - if "unwants_all_destination_types" in call: - requester = call["requester"] - signature = call["signature"] - self.rpc_return(conn, self.unwants_all_destination_types(requester, signature)) - if "destination_data" in call: operation = call["destination_data"] destination_hash = call["destination_hash"] @@ -1658,14 +1328,12 @@ class Reticulum: identity_hash = call["identity_hash"] if operation == "retain": self.rpc_return(conn, self._retain_identity(identity_hash)) - except Exception as e: RNS.log("An error ocurred while handling RPC call from local client: "+str(e), RNS.LOG_ERROR) - finally: conn.close() if conn else None + conn.close() - __open_rpc_conns = weakref.WeakSet() - def get_rpc_client(self): - conn = multiprocessing.connection.Client(self.rpc_addr, family=self.rpc_type, authkey=self.rpc_key) - Reticulum.__open_rpc_conns.add(conn) - return conn + except Exception as e: + RNS.log("An error ocurred while handling RPC call from local client: "+str(e), RNS.LOG_ERROR) + + def get_rpc_client(self): return multiprocessing.connection.Client(self.rpc_addr, family=self.rpc_type, authkey=self.rpc_key) def _used_destination_data(self, destination_hash): if self.is_connected_to_shared_instance: @@ -1728,15 +1396,10 @@ class Reticulum: def get_interface_stats(self): if self.is_connected_to_shared_instance: - try: - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"get": "interface_stats"})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response - - except Exception as e: - RNS.log(f"Shared instance RPC failed while getting interface stats: {e}", RNS.LOG_ERROR) - return None + rpc_connection = self.get_rpc_client() + rpc_connection.send_bytes(mp.packb({"get": "interface_stats"})) + response = mp.unpackb(rpc_connection.recv_bytes()) + return response else: interfaces = [] @@ -1771,16 +1434,6 @@ class Reticulum: else: ifstats["tunnelstate"] = None - if hasattr(interface, "r_stat_rssi"): ifstats["rssi"] = interface.r_stat_rssi - if hasattr(interface, "r_stat_snr"): ifstats["snr"] = interface.r_stat_snr - if hasattr(interface, "r_stat_q"): ifstats["signal_quality"] = interface.r_stat_q - if hasattr(interface, "r_frequency"): ifstats["frequency"] = interface.r_frequency - if hasattr(interface, "r_bandwidth"): ifstats["bandwidth"] = interface.r_bandwidth - if hasattr(interface, "r_txpower"): ifstats["txpower"] = interface.r_txpower - if hasattr(interface, "r_sf"): ifstats["sf"] = interface.r_sf - if hasattr(interface, "r_cr"): ifstats["cr"] = interface.r_cr - if hasattr(interface, "r_channel"): ifstats["channel"] = interface.r_channel - if hasattr(interface, "modulation"): ifstats["modulation"] = interface.modulation if hasattr(interface, "r_airtime_short"): ifstats["airtime_short"] = interface.r_airtime_short if hasattr(interface, "r_airtime_long"): ifstats["airtime_long"] = interface.r_airtime_long if hasattr(interface, "r_channel_load_short"): ifstats["channel_load_short"] = interface.r_channel_load_short @@ -1825,16 +1478,6 @@ class Reticulum: else: ifstats["txs"] = 0 else: ifstats["txs"] = 0 - if hasattr(interface, "current_frx_speed"): - if interface.current_frx_speed != None: ifstats["frxs"] = interface.current_frx_speed - else: ifstats["frxs"] = 0 - else: ifstats["frxs"] = 0 - - if hasattr(interface, "current_ftx_speed"): - if interface.current_ftx_speed != None: ifstats["ftxs"] = interface.current_ftx_speed - else: ifstats["ftxs"] = 0 - else: ifstats["ftxs"] = 0 - if hasattr(interface, "current_arx_speed"): if interface.current_arx_speed != None: ifstats["arxs"] = interface.current_arx_speed else: ifstats["arxs"] = 0 @@ -1888,13 +1531,10 @@ class Reticulum: ifstats["mtu"] = interface.HW_MTU ifstats["rxb"] = interface.rxb ifstats["txb"] = interface.txb - ifstats["frxb"] = interface.frxb - ifstats["ftxb"] = interface.ftxb ifstats["arxb"] = interface.arxb ifstats["atxb"] = interface.atxb ifstats["arxc"] = interface.arxc ifstats["atxc"] = interface.atxc - ifstats["afrxc"] = interface.afrxc ifstats["prxb"] = interface.prxb ifstats["ptxb"] = interface.ptxb ifstats["prxc"] = interface.prxc @@ -1924,21 +1564,6 @@ class Reticulum: ifstats["protocol_violations"] = interface.protocol_violations ifstats["ifac_violations"] = interface.ifac_violations ifstats["packet_filter_hits"] = interface.packet_filter_hits - ifstats["tunnel_id"] = interface.tunnel_id or interface.local_tunnel_id - ifstats["remote_transport_id"] = interface.remote_transport.hash if interface.remote_transport else None - - if interface.shared_medium: - ifstats["rem_impl"] = None - ifstats["rem_vers"] = None - ifstats["rem_is_tn"] = None - ifstats["rem_dst_cost"] = None - ifstats["rem_pr_cost"] = None - else: - ifstats["rem_impl"] = interface.remote_impl - ifstats["rem_vers"] = interface.remote_vers - ifstats["rem_is_tn"] = interface.remote_is_tn - ifstats["rem_dst_cost"] = interface.remote_dst_cost - ifstats["rem_pr_cost"] = interface.remote_pr_cost interfaces.append(ifstats) @@ -1948,7 +1573,6 @@ class Reticulum: pql = RNS.Transport.INBOUND_PR_QUEUE_LENGTH ilql = RNS.Transport.INBOUND_IL_QUEUE_LENGTH tql = dql+aql+pql+ilql - ppcs = RNS.Transport.path_pool_counts() stats = {} stats["interfaces"] = interfaces @@ -1956,14 +1580,6 @@ class Reticulum: stats["txb"] = RNS.Transport.traffic_txb stats["rxs"] = RNS.Transport.speed_rx stats["txs"] = RNS.Transport.speed_tx - stats["lrxb"] = RNS.Transport.link_rxb - stats["ltxb"] = RNS.Transport.link_txb - stats["lrxs"] = RNS.Transport.link_speed_rx - stats["ltxs"] = RNS.Transport.link_speed_tx - stats["frxb"] = RNS.Transport.filtered_rxb - stats["ftxb"] = RNS.Transport.filtered_txb - stats["frxs"] = RNS.Transport.filtered_speed_rx - stats["ftxs"] = RNS.Transport.filtered_speed_tx stats["arxb"] = RNS.Transport.announce_rxb stats["atxb"] = RNS.Transport.announce_txb stats["arxs"] = RNS.Transport.announce_speed_rx @@ -1978,12 +1594,6 @@ class Reticulum: stats["ptxf"] = RNS.Transport.pr_freq_tx stats["rxpps"] = RNS.Transport.rx_pps stats["txpps"] = RNS.Transport.tx_pps - stats["rxpkts"] = RNS.Transport.rx_packets - stats["txpkts"] = RNS.Transport.tx_packets - stats["arxpkts"] = RNS.Transport.announce_rxc - stats["atxpkts"] = RNS.Transport.announce_txc - stats["prxpkts"] = RNS.Transport.pr_rxc - stats["ptxpkts"] = RNS.Transport.pr_txc stats["rxqt"] = qsnapshot[0] stats["rxqd"] = qsnapshot[1][0] stats["rxqa"] = qsnapshot[1][1] @@ -2000,12 +1610,6 @@ class Reticulum: stats["pqpressure"] = qsnapshot[1][2]/pql if qsnapshot[1][2] else 0 stats["ilqpressure"] = qsnapshot[1][3]/ilql if qsnapshot[1][3] else 0 stats["txq"] = None - stats["tlinks"] = RNS.Transport.link_count() - stats["alinks"] = RNS.Transport.active_link_count() - stats["plinks"] = stats["tlinks"]-stats["alinks"] - stats["tpcount"] = ppcs[0] - stats["unupcount"] = ppcs[1] - stats["actpcount"] = stats["tpcount"] - stats["unupcount"] if Reticulum.transport_enabled(): stats["transport_id"] = RNS.Transport.identity.hash @@ -2025,73 +1629,45 @@ class Reticulum: def get_path_table(self, max_hops=None): if self.is_connected_to_shared_instance: - try: - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"get": "path_table", "max_hops": max_hops})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response - except Exception as e: - RNS.log(f"Shared instance RPC failed while getting path table: {e}", RNS.LOG_ERROR) - return [] + rpc_connection = self.get_rpc_client() + rpc_connection.send_bytes(mp.packb({"get": "path_table", "max_hops": max_hops})) + response = mp.unpackb(rpc_connection.recv_bytes()) + return response else: path_table = [] for dst_hash in RNS.Transport.path_table: path_hops = RNS.Transport.path_table[dst_hash][2] if max_hops == None or path_hops <= max_hops: - known_destination = RNS.Identity.known_destinations.get(dst_hash, None) - dst_value = known_destination[6] if known_destination else None - lr_cost = known_destination[7] if known_destination else None entry = { "hash": dst_hash, "timestamp": RNS.Transport.path_table[dst_hash][0], "via": RNS.Transport.path_table[dst_hash][1], "hops": path_hops, - "expires": RNS.Transport.path_table[dst_hash][3], "value": dst_value, - "used": RNS.Transport.path_table[dst_hash][7], "lr_cost": lr_cost, - "interface": str(RNS.Transport.path_table[dst_hash][5]), - "interface_hash": RNS.Transport.path_table[dst_hash][5].get_hash(), - "state": RNS.Transport.get_path_state(dst_hash) } + "expires": RNS.Transport.path_table[dst_hash][3], + "interface": str(RNS.Transport.path_table[dst_hash][5]) } path_table.append(entry) return path_table def get_rate_table(self): if self.is_connected_to_shared_instance: - try: - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"get": "rate_table"})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response - except Exception as e: - RNS.log(f"Shared instance RPC failed while getting rate table: {e}", RNS.LOG_ERROR) - return [] + rpc_connection = self.get_rpc_client() + rpc_connection.send_bytes(mp.packb({"get": "rate_table"})) + response = mp.unpackb(rpc_connection.recv_bytes()) + return response else: rate_table = [] - with RNS.Transport.announce_rate_table_lock: - for dst_hash, entry in RNS.Transport.announce_rate_table.items(): - entry["hash"] = dst_hash - rate_table.append(entry) + for dst_hash in RNS.Transport.announce_rate_table: + entry = { + "hash": dst_hash, + "last": RNS.Transport.announce_rate_table[dst_hash]["last"], + "rate_violations": RNS.Transport.announce_rate_table[dst_hash]["rate_violations"], + "blocked_until": RNS.Transport.announce_rate_table[dst_hash]["blocked_until"], + "timestamps": RNS.Transport.announce_rate_table[dst_hash]["timestamps"], + } + rate_table.append(entry) return rate_table - def get_known_destinations(self): - if self.is_connected_to_shared_instance: - try: - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"get": "known_destinations"})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response - except Exception as e: - RNS.log(f"Shared instance RPC failed while getting known destinations: {e}", RNS.LOG_ERROR) - return {} - - else: - known_destinations = {} - with RNS.Identity.known_destinations_lock: - for dst_hash in RNS.Identity.known_destinations: - known_destinations[dst_hash] = RNS.Identity.known_destinations[dst_hash] - - return known_destinations - def drop_path(self, destination): if self.is_connected_to_shared_instance: rpc_connection = self.get_rpc_client() @@ -2238,30 +1814,12 @@ class Reticulum: else: return RNS.Transport.active_link_count() - def get_link_distribution(self): - if self.is_connected_to_shared_instance: - try: - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"get": "link_distribution"})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response - except Exception as e: - RNS.log(f"Shared instance RPC failed while getting link distribution: {e}", RNS.LOG_ERROR) - return None - - else: - return RNS.Transport.link_distribution() - def get_packet_rssi(self, packet_hash): if self.is_connected_to_shared_instance: - try: - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"get": "packet_rssi", "packet_hash": packet_hash})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response - except Exception as e: - RNS.log(f"Shared instance RPC failed while getting packet RSSI: {e}", RNS.LOG_ERROR) - return None + rpc_connection = self.get_rpc_client() + rpc_connection.send_bytes(mp.packb({"get": "packet_rssi", "packet_hash": packet_hash})) + response = mp.unpackb(rpc_connection.recv_bytes()) + return response else: for entry in RNS.Transport.local_client_rssi_cache: @@ -2272,14 +1830,10 @@ class Reticulum: def get_packet_snr(self, packet_hash): if self.is_connected_to_shared_instance: - try: - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"get": "packet_snr", "packet_hash": packet_hash})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response - except Exception as e: - RNS.log(f"Shared instance RPC failed while getting packet SNR: {e}", RNS.LOG_ERROR) - return None + rpc_connection = self.get_rpc_client() + rpc_connection.send_bytes(mp.packb({"get": "packet_snr", "packet_hash": packet_hash})) + response = mp.unpackb(rpc_connection.recv_bytes()) + return response else: for entry in RNS.Transport.local_client_snr_cache: @@ -2290,14 +1844,10 @@ class Reticulum: def get_packet_q(self, packet_hash): if self.is_connected_to_shared_instance: - try: - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"get": "packet_q", "packet_hash": packet_hash})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response - except Exception as e: - RNS.log(f"Shared instance RPC failed while getting packet link quality: {e}", RNS.LOG_ERROR) - return None + rpc_connection = self.get_rpc_client() + rpc_connection.send_bytes(mp.packb({"get": "packet_q", "packet_hash": packet_hash})) + response = mp.unpackb(rpc_connection.recv_bytes()) + return response else: for entry in RNS.Transport.local_client_q_cache: @@ -2317,39 +1867,21 @@ class Reticulum: if RNS.Profiler.ran(): return RNS.Profiler.results() else: return None - def attach_interface(self, interface_name): - if self.is_connected_to_shared_instance: - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"manage": "attach_interface", "name": interface_name})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response - - else: return self._attach_interface(interface_name) + def halt_interface(self, interface): + pass - def detach_interface(self, interface_name): - if self.is_connected_to_shared_instance: - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"manage": "detach_interface", "name": interface_name})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response - - else: return self._detach_interface(interface_name) + def resume_interface(self, interface): + pass - def reload_interface(self, interface_name): - if self.is_connected_to_shared_instance: - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"manage": "reload_interface", "name": interface_name})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response - - else: return self._reload_interface(interface_name) + def reload_interface(self, interface): + pass def get_blackholed_identities(self): if self.is_connected_to_shared_instance: - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"get": "blackholed_identities"})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response + rpc_connection = self.get_rpc_client() + rpc_connection.send_bytes(mp.packb({"get": "blackholed_identities"})) + response = mp.unpackb(rpc_connection.recv_bytes()) + return response else: return RNS.Transport.blackholed_identities @@ -2360,10 +1892,10 @@ class Reticulum: if len(identity_hash) != RNS.Reticulum.TRUNCATED_HASHLENGTH//8: raise ValueError("Invalid identity hash length for blackhole check") if self.is_connected_to_shared_instance: - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"get": "is_blackholed", "identity_hash": identity_hash})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response + rpc_connection = self.get_rpc_client() + rpc_connection.send_bytes(mp.packb({"get": "is_blackholed", "identity_hash": identity_hash})) + response = mp.unpackb(rpc_connection.recv_bytes()) + return response else: return identity_hash in RNS.Transport.blackholed_identities @@ -2389,62 +1921,6 @@ class Reticulum: else: return RNS.Transport.unblackhole_identity(identity_hash) - # For now, this is available on shared instance clients - # only, so an application cannot squelch announce ingress - # for other applications and the node as a whole. - def required_announces_only(self, enabled=True): - if not enabled in [True, False]: return False - if not self.is_connected_to_shared_instance: return False - else: RNS.Transport.required_destinations_only = enabled - if enabled: RNS.log(f"Setting announce filtering to required only", RNS.LOG_DEBUG) - else: RNS.log(f"Setting announce filtering to all", RNS.LOG_DEBUG) - return True - - def wants_destination_type(self, full_name, requester=None, signature=None): - if not requester: requester = RNS.Transport.application_identity.hash - if self.is_connected_to_shared_instance: - try: - RNS.Transport._wants_destination_type(full_name, requester, signature) - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"wants_destination_type": full_name, "requester": requester, "signature": signature})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response - except Exception as e: - RNS.log(f"Shared instance RPC failed while setting destination type filters: {e}", RNS.LOG_DEBUG) - return False - - else: return RNS.Transport._wants_destination_type(full_name, requester, signature) - - def unwants_destination_type(self, full_name, requester=None, signature=None): - if not requester: requester = RNS.Transport.application_identity.hash - if self.is_connected_to_shared_instance: - try: - RNS.Transport._unwants_destination_type(full_name, requester, signature) - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"unwants_destination_type": full_name, "requester": requester, "signature": signature})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response - except Exception as e: - RNS.log(f"Shared instance RPC failed while setting destination type filters: {e}", RNS.LOG_DEBUG) - return False - - else: return RNS.Transport._unwants_destination_type(full_name, requester, signature) - - def unwants_all_destination_types(self, requester=None, signature=None): - if not requester: requester = RNS.Transport.application_identity.hash - if self.is_connected_to_shared_instance: - try: - RNS.Transport._unwants_all_destination_types(requester, signature) - rpc_connection = self.get_rpc_client() - rpc_connection.send_bytes(mp.packb({"unwants_all_destination_types": True, "requester": requester, "signature": signature})) - response = mp.unpackb(rpc_connection.recv_bytes()) - return response - except Exception as e: - RNS.log(f"Shared instance RPC failed while setting destination type filters: {e}", RNS.LOG_DEBUG) - return False - - else: return RNS.Transport._unwants_all_destination_types(requester, signature) - @staticmethod def should_use_implicit_proof(): """ @@ -2505,7 +1981,7 @@ class Reticulum: Returns the required stamp value for a discovered interface to be considered valid and remembered. - :returns: The required stamp value as a float. + :returns: The required stamp value as an integer. """ return Reticulum.__required_discovery_value @@ -2556,10 +2032,6 @@ class Reticulum: def should_autoconnect_discovered_interfaces(): return Reticulum.__autoconnect_discovered_interfaces > 0 - @staticmethod - def should_autoconnect_unverified_implementations(): - return Reticulum.__autoconnect_unverified - @staticmethod def autoconnect_interface_mode(): return Reticulum.__autoconnect_interface_mode @@ -2601,8 +2073,7 @@ class Reticulum: return Reticulum.__inbound_il_queue_length # Default configuration file: -__default_rns_config__ = '''########################################################## -# This is the default Reticulum config file. +__default_rns_config__ = '''# This is the default Reticulum config file. # You should probably edit it to include any additional, # interfaces and settings you might need. @@ -2686,22 +2157,6 @@ instance_name = default # blackhole_sources = 521c87a83afb8f29e4455e77930b973b -########################################################## -# This section configures stamping behaviour and defaults. -# In most cases, you do not need to change this, but on -# constrained systems especially, tuning these parameters -# can be very beneficial. See "rnsd --exampleconfig" or -# the manual for a full explanation of these parameters. - -[stamps] - -# destination_cost = 23.5 -# destination_value = 25.0 -# pr_cost = 15.8 -# pr_value = 15.8 -# lr_cost = 12.5 -# lr_stamp_timeout = 15 -# pr_stamp_timeout = 15 [logging] # Valid log levels are 0 through 8: @@ -2717,7 +2172,7 @@ instance_name = default loglevel = 4 -########################################################## + # The interfaces section defines the physical and virtual # interfaces Reticulum will use to communicate on. This # section will contain examples for a variety of interface diff --git a/RNS/Stamps.py b/RNS/Stamps.py deleted file mode 100644 index 7252e6c0..00000000 --- a/RNS/Stamps.py +++ /dev/null @@ -1,1093 +0,0 @@ -# Reticulum License -# -# Copyright (c) 2016-2026 Mark Qvist -# -# Permission is hereby granted, free of charge, to any person obtaining a copy -# of this software and associated documentation files (the "Software"), to deal -# in the Software without restriction, including without limitation the rights -# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -# copies of the Software, and to permit persons to whom the Software is -# furnished to do so, subject to the following conditions: -# -# - The Software shall not be used in any kind of system which includes amongst -# its functions the ability to purposefully do harm to human beings. -# -# - The Software shall not be used, directly or indirectly, in the creation of -# an artificial intelligence, machine learning or language model training -# dataset, including but not limited to any use that contributes to the -# training or development of such a model or algorithm. -# -# - The above copyright notice and this permission notice shall be included in -# all copies or substantial portions of the Software. -# -# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE -# SOFTWARE. - -import RNS -import RNS.vendor.umsgpack as msgpack -from RNS.Cryptography import sha256 - -import os -import sys -import time -import math -import mmap -import itertools -import contextlib -import multiprocessing -from bisect import bisect_right - -WORKBLOCK_EXPAND_CHUNK = 256 -WORKBLOCK_EXPAND_ROUNDS = 3000 -EXPAND_PROBE_COUNT = 8 -RSTATE_MULTIPLIER = 2 -STAMP_SIZE = 32 -PN_VALIDATION_POOL_MIN_SIZE = 256 -USE_WORKER_MANAGER = False -MAX_WORKERS = None -NICENESS = 16 -POOLING_THRESHOLD_COST = 14 -KEYSTAMP_POOLING_THRESHOLD = 10 -STOP_CHECK_INTERVAL = 64 - -MODE_STAMP = 0x00 -MODE_KEYSTAMP = 0x01 - -active_jobs = {} - -if sys.version_info[0] >= 3 and sys.version_info[1] >= 14: - USE_WORKER_MANAGER = True - -@contextlib.contextmanager -def worker_context(ctx, stamp_cost, workblock, message_id): - stop_event = ctx.Event() - result_queue = ctx.Queue(1) - rounds_queue = ctx.Queue() - - active_jobs[message_id] = [stop_event, result_queue] - job_procs = [] - - try: yield stop_event, result_queue, rounds_queue, job_procs - finally: - if message_id in active_jobs: del active_jobs[message_id] - stop_event.set() - - for p in job_procs: - if p.is_alive(): p.terminate() - - for p in job_procs: p.join(timeout=0.5) - - result_queue.close() - result_queue.join_thread() - rounds_queue.close() - rounds_queue.join_thread() - stop_event.clear() - -def stamp_workblock(material, expand_rounds=WORKBLOCK_EXPAND_ROUNDS, no_expand=False): - return _stamp_workblock(material, expand_rounds=expand_rounds, no_expand=no_expand) - -def _stamp_workblock(material, expand_rounds=WORKBLOCK_EXPAND_ROUNDS, no_expand=False): - if no_expand or not expand_rounds: return material - wb_st = time.time() - workblock = bytearray() - for n in range(expand_rounds): - workblock += RNS.Cryptography.hkdf(length=WORKBLOCK_EXPAND_CHUNK, derive_from=material, - salt=RNS.Identity.full_hash(material+msgpack.packb(n)), - context=None) - wb_time = time.time() - wb_st - - return bytes(workblock) - -def _stamp_workblock_future(material, expand_rounds=WORKBLOCK_EXPAND_ROUNDS, no_expand=False): - if no_expand or not expand_rounds: return material - - # Method aliases - hkdf = RNS.Cryptography.hkdf - full_hash = RNS.Identity.full_hash - - # Generation parameters - probe_len = 64 # SHA-256 block size - chunk_len = WORKBLOCK_EXPAND_CHUNK # Must be a multiple of probe_len - assert chunk_len % probe_len == 0 - - # State initialization - workblock = bytearray() - rstate = hkdf(length=chunk_len*RSTATE_MULTIPLIER, derive_from=full_hash(material), salt=None, context=None) - - # Expansion loop - for n in range(expand_rounds): - # Pack round number to bytes - pn = msgpack.packb(n) - - ############################################################# - # For every round (after we have enough existing material), - # we perform a pseudo-random extraction from the already - # expanded part of the workblock. - if len(workblock) < probe_len: pgmat = b"" - else: - pgmat = bytearray() - for k in range(EXPAND_PROBE_COUNT): - # Pseudo-randomly determine an extraction index over the - # entire surface of the expanded workblock so far. Since - # each index is derived from the rolling chain state at - # its round, the material required at later rounds is - # unknowable while the workblock is being built, and no - # part of it can therefore be safely(*) discarded before - # the entire expansion is complete. Any dropped part would - # have to be regenerated whenever a subsequent extraction - # happens to require it, binding the extraction to memory. - pk = msgpack.packb(k) - index = (int.from_bytes(full_hash(rstate+pn+pk), byteorder="big") % (len(workblock)//probe_len)) * probe_len - # (*) Yes, in theory, you could keep a LRU cache of WB - # chunks and rstate entries. For the configuration used - # here, you can save ~12% memory before the required - # compute cost for those savings explode into absurdity. - # The set of parameters used here were chosen to minimize - # verifier cost while ensuring a very steep (practically - # infeasible) compute saturation point at around 15%. - - # Extract probe_len bytes at the determined index as the - # previously generated material component for the genera- - # tion of the next chunk. - pgmat.extend(workblock[index:index+probe_len]) - - pgmat = bytes(pgmat) - - # Compute the salt for this round as the SHA-256 hash of the - # concatenation of the rolling state value, the extracted - # previously generated material and the round number. - salt = full_hash(rstate+pgmat+pn) - - # Derive the current workblock chunk from the rolling state - # value and the previously generated material component, - # using the salt we just computed. - chunk = hkdf(length=chunk_len, derive_from=rstate+pgmat, salt=salt, context=None) - - workblock.extend(chunk) - rstate = hkdf(length=chunk_len*RSTATE_MULTIPLIER, derive_from=rstate+chunk, salt=None, context=None) - - return bytes(workblock) - -def stamp_value_legacy(workblock, stamp): - if not workblock: workblock = b"" - stamp_product = RNS.Identity.full_hash(workblock+stamp) - return 256 - int.from_bytes(stamp_product, byteorder="big").bit_length() - -def stamp_value(workblock, stamp): - # This function is very little code, and a whole lot of - # comments. The actual method employed here is relatively - # simple, but without proper explanation, it is also very - # opaque, and could induce a lot of head-scratching. - - if not workblock: workblock = b"" - stamp_product = RNS.Identity.full_hash(workblock+stamp) # Bytes representation - hn = int.from_bytes(stamp_product, byteorder="big") # Numerical representation - if hn == 0: return 256 # Yeah, but *if* it happens, you know... - nb = MANTISSA_BITS+1 # Normalized mantissa bit count - bl = hn.bit_length() # Bit length of the stamp product - lz = 256 - bl # Leading zeros of the stamp product - - ############################################################## - # # - # Simplified mantissa extraction example with # - # smaller numbers; 32-bit stamp product and 8 # - # mantissa bits. In the actual version, it is # - # 256-bit stamp products and 33-bit mantissa. # - # # - # mb = 8 nb = 9 (8+1) # - # bl = 27 lz = 5 (32-27) # - # # - # shift = bl - nb = 18 # - # # - # hn = 0b00000111101101101110111010110111 # - # >>18 0b00000000000000000000000111101101|101110111010110111 # - # | \_____ gone # - # The leading one | # - # 8 significand mantissa bits # - # # - # mn = 0b111101101 (normalized with the leading 1) # - # # - ############################################################## - - # Normalize mantissa to the scale of TAB: Total of 34 - # bits, 33 mantissa bits. The leading one required to - # match TAB entries is guaranteed by the construction: - # Since we're shifting by the *difference* between the - # normalized mantissa bit length and the stamp product - # bit length, we always end up with a leading one, and - # then the required number of *actual* mantissa bits. - # See the example above for a simplified illustration. - if bl > nb: mn = (hn >> (bl - nb)) - else: mn = (hn << (nb - bl)) # Again, better safe than sorry. You may notice - # here that in this case, we will have a more - # coarse mantissa part, which is inherent to - # the methodology, but in practice the best thing - # we can do. Additionally, this can only happen - # at absolutely extreme values, far above the - # stamp cap anyway. It is only here to handle the - # absurd case where a stamp product randomly lands - # on an astronomically improbable leading zero count. - - # We can now construct the fixed-point value representation: - # - # The leading zero count is equivalent to the legacy value, an - # integer representation. Thus, (lz+1)< target: return False - else: return True - -# Synthetic stop check function used where -# worker mechanism provides no support for -# semaphore-based cancellation. -def _never(): return False - -# The hash-mode loop primitive, shared -# between platform variants. -def _loop_hash(workblock, target, size, stop_check, progress=None, max_rounds=0, fh=None): - if fh == None: fh = RNS.Identity.full_hash - urandom = os.urandom - rounds = 0 - found = False - pstamp = urandom(size) - c = 0 - - while True: - c += 1 - if c >= STOP_CHECK_INTERVAL: - c = 0 - if stop_check(): break - - if int.from_bytes(fh(workblock+pstamp), byteorder="big") <= target: - found = True; break - pstamp = urandom(size); rounds += 1 - - if progress != None and rounds % 250000 == 0: progress(rounds) - if max_rounds != 0 and rounds >= max_rounds: break - - return pstamp, rounds, found - -# The key-mode loop primitive, shared -# between platform variants. -def _loop_key(material, target, stop_check, max_rounds=0): - fh = RNS.Identity.full_hash - generate = RNS.Cryptography.X25519PrivateKey.generate - rounds = 0 - found = False - keypair = None - - while True: - if stop_check(): break - - key = generate() - pub_bytes = key.public_key().public_bytes() - if int.from_bytes(fh(material+pub_bytes), byteorder="big") <= target: - keypair = (key.private_bytes(), pub_bytes) - found = True; break - rounds += 1 - - if max_rounds != 0 and rounds >= max_rounds: break - - return keypair, rounds, found - -# Generates a normal, detached, hash-based stamp for any -# bytes material (message_id), which is usually a hash -# of some input material, but can be any sequence of bytes. -def generate_stamp(message_id, stamp_cost, expand_rounds=WORKBLOCK_EXPAND_ROUNDS, no_expand=False, size=STAMP_SIZE): - if stamp_cost < 0 or stamp_cost > RNS.Transport.STAMP_COST_CAP: raise ValueError("Invalid stamp cost, cannot generate") - workblock = stamp_workblock(message_id, expand_rounds=expand_rounds, no_expand=no_expand) - - if message_id in active_jobs: raise RuntimeError(f"Duplicate stamp generation job for {RNS.prettyhexrep(message_id)}") - RNS.log(f"Generating stamp with cost {stamp_cost} for <{RNS.hexrep(message_id[:16], delimit=False)}{'…' if len(message_id) > 16 else ''}>", RNS.LOG_DEBUG) - - stamp_cost = cost_to_fp(stamp_cost) - start_time = time.time() - stamp = None - value = None - rounds = 0 - - if RNS.vendor.platformutils.is_windows() or RNS.vendor.platformutils.is_darwin(): - RNS.log(f"Multi-core stamp generation on this platform is not supported, work limited to single CPU core.", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - - if RNS.vendor.platformutils.is_windows() or RNS.vendor.platformutils.is_darwin(): stamp, rounds = job_simple(stamp_cost, workblock, message_id, size) - elif RNS.vendor.platformutils.is_android(): stamp, rounds = job_android(stamp_cost, workblock, message_id, size) - else: - if USE_WORKER_MANAGER: stamp, rounds = job_linux_managed(stamp_cost, workblock, message_id, size) if stamp_cost >= POOLING_THRESHOLD_COST_FP else job_simple(stamp_cost, workblock, message_id, size) - else: stamp, rounds = job_linux(stamp_cost, workblock, message_id, size) if stamp_cost >= POOLING_THRESHOLD_COST_FP else job_simple(stamp_cost, workblock, message_id, size) - - duration = max(time.time()-start_time, 1E-6) - speed = rounds/duration - if stamp != None: value = stamp_value(workblock, stamp) - - if value != None: RNS.log(f"Stamp with value {value} generated in {RNS.prettytime(duration)}, {rounds} rounds, {RNS.prettysize(speed, suffix='rps')}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - else: RNS.log(f"Stamp generation aborted or failed after {RNS.prettytime(duration)}, {rounds} rounds", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - - return stamp, value - -# Generates a new, internally stamped X25519 keypair. The -# public key carries the stamp value itself, so no detached -# stamp is created. Unlike the detached stamp generator, this -# method returns the private+public X25519 keypair, and the -# private key can be loaded normally to create a full, stamped -# Reticulum Identity. The stamp value is verifiable to anyone -# knowing the public key (and the optional input material). -# -# For a transparently verifiable stamped identity, you should -# generally always use the provided `RNS.Identity(value=n)` -# primitive, and not generate raw stamped keys manually. Using -# the API primitive correctly binds the full identity keyset -# together with the stamped portion of the key. Situations do -# exist where you may want a bare, no-material stamped key, -# but this should be considered hazardous materials territory! -# -# For custom stamped keys, where the stamped key is intended -# to be tied to a specific domain, for example a link request -# or other one-time use, the `material` argument must be the -# relevant uniquely identifying nonce of such use that the -# stamped key is bound to. -# -# Key stamp validation uses the normal validation methods, -# simply provide the public key bytes directly *as* the stamp, -# and any domain material as the workblock, for example: -# -# - stamp_valid(public_key_bytes, required_cost, material) -# - stamp_value(material, public_key_bytes) -# -# WARNING: Never attempt to use this for Ed25519 *signature* key -# creation, it is NOT a valid approach. The keypairs emitted by -# this function must ONLY be used as X25519 keys. -def generate_stamped_key(material, stamp_cost): - if material == None: material = b"" - if material in active_jobs: raise RuntimeError(f"Duplicate stamped key generation job for {RNS.prettyhexrep(material)}") - if stamp_cost < 0 or stamp_cost > RNS.Transport.STAMP_COST_CAP: raise ValueError("Invalid stamp cost, cannot generate") - for_str = f" for <{RNS.hexrep(material[:16], delimit=False)}{'…' if len(material) > 16 else ''}>" if material else "" - RNS.log(f"Generating stamped key with cost {stamp_cost}{for_str}", RNS.LOG_DEBUG) - - stamp_cost = cost_to_fp(stamp_cost) - start_time = time.time() - keypair = None - value = None - rounds = 0 - - if RNS.vendor.platformutils.is_windows() or RNS.vendor.platformutils.is_darwin(): - RNS.log(f"Multi-core stamp generation on this platform is not supported, work limited to single CPU core.", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - - if RNS.vendor.platformutils.is_windows() or RNS.vendor.platformutils.is_darwin(): keypair, rounds = job_simple(stamp_cost, material, material, 0, MODE_KEYSTAMP) - elif RNS.vendor.platformutils.is_android(): keypair, rounds = job_android(stamp_cost, material, material, 0, MODE_KEYSTAMP) - else: - if USE_WORKER_MANAGER: keypair, rounds = job_linux_managed(stamp_cost, material, material, 0, MODE_KEYSTAMP) if stamp_cost >= KEYSTAMP_POOLING_THRESHOLD_FP else job_simple(stamp_cost, material, material, 0, MODE_KEYSTAMP) - else: keypair, rounds = job_linux(stamp_cost, material, material, 0, MODE_KEYSTAMP) if stamp_cost >= KEYSTAMP_POOLING_THRESHOLD_FP else job_simple(stamp_cost, material, material, 0, MODE_KEYSTAMP) - - duration = max(time.time()-start_time, 1E-6) - speed = rounds/duration - if keypair != None: value = stamp_value(material, keypair[1]) - - if value != None: RNS.log(f"Stamped key with value {value} generated in {RNS.prettyshorttime(duration)}, {rounds} rounds, {RNS.prettysize(speed, suffix='rps')}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - else: RNS.log(f"Stamp generation aborted or failed after {RNS.prettytime(duration)}, {rounds} rounds", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - - return keypair, value - -def cancel_all_work(): - RNS.log(f"Stopping all stamp workers", RNS.LOG_DEBUG) - active_ids = list(active_jobs.keys()) - for active_id in active_ids: cancel_work(active_id) - -def cancel_work(message_id): - if RNS.vendor.platformutils.is_windows() or RNS.vendor.platformutils.is_darwin(): - try: - if message_id in active_jobs: active_jobs[message_id] = True - else: return False - - except Exception as e: - RNS.log("Error while terminating stamp generation workers: {e}", RNS.LOG_ERROR) - RNS.trace_exception(e) - return False - - elif RNS.vendor.platformutils.is_android(): - try: - if message_id in active_jobs: active_jobs[message_id] = True - else: return False - - except Exception as e: - RNS.log("Error while terminating stamp generation workers: {e}", RNS.LOG_ERROR) - RNS.trace_exception(e) - return False - - else: - try: - job_entry = active_jobs.get(message_id, None) - if job_entry != None: - if type(job_entry) != list: active_jobs[message_id] = True - else: - stop_event = job_entry[0] - result_queue = job_entry[1] - stop_event.set() - result_queue.put(None) - active_jobs.pop(message_id) - else: return False - - except Exception as e: - RNS.log("Error while terminating stamp generation workers: {e}", RNS.LOG_ERROR) - RNS.trace_exception(e) - return False - - return True - -def job_simple(stamp_cost, workblock, message_id, size, mode=MODE_STAMP): - # A simple, single-process stamp generator. - # should work on any platform, and is used - # as a fall-back, in case of limited multi- - # processing and/or acceleration support. - # - # In key mode, the workblock argument is - # used for the stamp material, and the - # size argument is ignored. - - st = time.time() - target = target_from_fp(stamp_cost) - - active_jobs[message_id] = False - - def stop_check(): return active_jobs[message_id] - def progress(r): - speed = r / max(time.time()-st, 1E-6) - RNS.log(f"Stamp generation running. {r} rounds completed so far, {RNS.prettysize(speed, suffix='')} rounds per second", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - - if mode == MODE_STAMP: result, rounds, _ = _loop_hash(workblock, target, size, stop_check, progress) - else: result, rounds, _ = _loop_key(workblock, target, stop_check) - - cancelled = (active_jobs[message_id] == True) - active_jobs.pop(message_id) - return (None if cancelled else result), rounds - -def job_linux_managed(stamp_cost, workblock, message_id, size, mode=MODE_STAMP): - ctx = multiprocessing.get_context("fork") - cores = multiprocessing.cpu_count() - jobs = cores if cores <= 12 else int(cores/2) - if MAX_WORKERS and jobs > MAX_WORKERS: jobs = MAX_WORKERS - - allow_kill = True - stamp = None - total_rounds = 0 - - with worker_context(ctx, stamp_cost, workblock, message_id) as (stop_event, result_queue, rounds_queue, job_procs): - RNS.log(f"Starting {jobs} stamp generation workers", RNS.LOG_DEBUG) - - def job(stop_event, sc, wb, pn, mode): - try: os.nice(NICENESS) - except: pass - - target = target_from_fp(sc) - - if mode == MODE_STAMP: result, rounds, _ = _loop_hash(wb, target, size, stop_event.is_set) - else: result, rounds, _ = _loop_key(wb, target, stop_event.is_set) - - if not stop_event.is_set(): - stop_event.set() - try: result_queue.put_nowait(result) - except: pass - - try: rounds_queue.put_nowait(rounds) - except: pass - - for jpn in range(jobs): - p = ctx.Process(target=job, args=(stop_event, stamp_cost, workblock, jpn, mode), daemon=True) - job_procs.append(p) - p.start() - - try: stamp = result_queue.get(timeout=None) - except Exception as e: - RNS.log(f"Failed to get result from workers: {e}", RNS.LOG_ERROR) - stamp = None - - # Collect any potential spurious - # results from worker queue. - try: - while True: result_queue.get_nowait() - except: pass - - for j in range(jobs): - nrounds = 0 - try: - nrounds = rounds_queue.get(timeout=2) - except Exception as e: - RNS.log(f"Failed to get round stats part {j}: {e}", RNS.LOG_ERROR) - total_rounds += nrounds - - all_exited = False - exit_timeout = time.time() + 5 - while time.time() < exit_timeout: - if not any(p.is_alive() for p in job_procs): - all_exited = True - break - time.sleep(0.005) - - if not all_exited: - RNS.log("Stamp generation IPC timeout, possible worker deadlock. Terminating remaining processes.", RNS.LOG_ERROR) - if allow_kill: - for j in range(jobs): - process = job_procs[j] - process.kill() - else: - return None - - else: - for j in range(jobs): - process = job_procs[j] - process.join() - # RNS.log(f"Joined {j} / {process}", RNS.LOG_DEBUG) # TODO: Remove - - return stamp, total_rounds - -def job_linux(stamp_cost, workblock, message_id, size, mode=MODE_STAMP): - allow_kill = True - stamp = None - total_rounds = 0 - cores = multiprocessing.cpu_count() - jobs = cores if cores <= 12 else int(cores/2) - stop_event = multiprocessing.Event() - result_queue = multiprocessing.Queue(1) - rounds_queue = multiprocessing.Queue() - if MAX_WORKERS and jobs > MAX_WORKERS: jobs = MAX_WORKERS - - def job(stop_event, pn, sc, wb, mode): - try: os.nice(NICENESS) - except: pass - - target = target_from_fp(sc) - - if mode == MODE_STAMP: result, rounds, _ = _loop_hash(wb, target, size, stop_event.is_set) - else: result, rounds, _ = _loop_key(wb, target, stop_event.is_set) - - if not stop_event.is_set(): - stop_event.set() - result_queue.put(result) - - rounds_queue.put(rounds) - - job_procs = [] - RNS.log(f"Starting {jobs} stamp generation workers", RNS.LOG_DEBUG) - for jpn in range(jobs): - process = multiprocessing.get_context("fork").Process(target=job, kwargs={"stop_event": stop_event, "pn": jpn, "sc": stamp_cost, "wb": workblock, "mode": mode}, daemon=True) - job_procs.append(process) - process.start() - - active_jobs[message_id] = [stop_event, result_queue] - - try: - stamp = result_queue.get() - - # Collect any potential spurious - # results from worker queue. - try: - while True: result_queue.get_nowait() - except: pass - - for j in range(jobs): - nrounds = 0 - try: - nrounds = rounds_queue.get(timeout=2) - except Exception as e: - RNS.log(f"Failed to get round stats part {j}: {e}", RNS.LOG_ERROR) - total_rounds += nrounds - - all_exited = False - exit_timeout = time.time() + 5 - while time.time() < exit_timeout: - if not any(p.is_alive() for p in job_procs): - all_exited = True - break - time.sleep(0.005) - - if not all_exited: - RNS.log("Stamp generation IPC timeout, possible worker deadlock. Terminating remaining processes.", RNS.LOG_ERROR) - if allow_kill: - for j in range(jobs): - process = job_procs[j] - process.kill() - else: - return None - - else: - for j in range(jobs): - process = job_procs[j] - process.join() - - except Exception as e: RNS.log(f"Error while getting stamp generation result: {e}", RNS.LOG_ERROR) - finally: active_jobs.pop(message_id, None) - - return stamp, total_rounds - -ANDROID_PREFER_NACL = True -ANDROID_USE_PERSISTENT = True -ANDROID_LOW_DIFFICULTY_JOBS = 1 -ANDROID_NO_POOL_WB_EXPAND_MAX = 4 -ANDROID_POOLING_THRESHOLD_COST = 8 -ANDROID_KEYSTAMP_POOLING_THRESHOLD = 6 -def job_android(stamp_cost, workblock, message_id, size, mode=MODE_STAMP): - if ANDROID_USE_PERSISTENT: return job_android_persistent(stamp_cost, workblock, message_id, size, mode) - else: return job_android_legacy(stamp_cost, workblock, message_id, size, mode) - -def job_android_legacy(stamp_cost, workblock, message_id, size, mode=MODE_STAMP): - # Semaphore support is flaky to non-existent on - # Android, so we need to manually dispatch and - # manage workloads here, while periodically - # checking in on the progress. - - stamp = None - start_time = time.time() - total_rounds = 0 - rounds_per_worker = 1000 - - use_nacl = False - try: - if ANDROID_PREFER_NACL: - import nacl.encoding - import nacl.hash - use_nacl = True - except: pass - - if use_nacl: - def full_hash(m): return nacl.hash.sha256(m, encoder=nacl.encoding.RawEncoder) - else: - def full_hash(m): return RNS.Identity.full_hash(m) - - wm = multiprocessing.Manager() - jobs = multiprocessing.cpu_count() - - def job(procnum=None, results_dict=None, wb=None, sc=None, jr=None, mode=MODE_STAMP): - try: - found_result = None - target = target_from_fp(sc) - - if mode == MODE_STAMP: result, rounds, found = _loop_hash(wb, target, size, _never, None, jr, full_hash) - else: result, rounds, found = _loop_key(wb, target, _never, jr) - - if found: found_result = result - results_dict[procnum] = [found_result, rounds] - - except Exception as e: - RNS.log(f"Stamp generation worker error: {e}", RNS.LOG_ERROR) - RNS.trace_exception(e) - - active_jobs[message_id] = False; - - RNS.log(f"Dispatching {jobs} workers for stamp generation...", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - - results_dict = wm.dict() - while stamp == None and active_jobs[message_id] == False: - job_procs = [] - try: - for pnum in range(jobs): - pargs = {"procnum":pnum, "results_dict": results_dict, "wb": workblock, "sc":stamp_cost, "jr":rounds_per_worker, "mode":mode} - process = multiprocessing.Process(target=job, kwargs=pargs) - job_procs.append(process) - process.start() - - for process in job_procs: - process.join() - - for j in results_dict: - r = results_dict[j] - total_rounds += r[1] - if r[0] != None: - stamp = r[0] - - if stamp == None: - elapsed = max(time.time()-start_time, 1E-6) - speed = total_rounds/elapsed - RNS.log(f"Stamp generation running. {total_rounds} rounds completed so far, {RNS.prettysize(speed, suffix='rps')}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - - except Exception as e: - RNS.log(f"Stamp generation job error: {e}", RNS.LOG_ERROR) - RNS.trace_exception(e) - - active_jobs.pop(message_id) - - return stamp, total_rounds - -def job_android_persistent(stamp_cost, workblock, message_id, size, mode=MODE_STAMP): - stamp = None - start_time = time.time() - total_rounds = 0 - - use_nacl = False - try: - if ANDROID_PREFER_NACL: - import nacl.encoding - import nacl.hash - use_nacl = True - except: pass - - if use_nacl: - def full_hash(m): return nacl.hash.sha256(m, encoder=nacl.encoding.RawEncoder) - else: - def full_hash(m): return RNS.Identity.full_hash(m) - - ctx = multiprocessing.get_context("fork") - wm = ctx.Manager() - try: jobs = len(os.sched_getaffinity(0)) - except Exception: jobs = multiprocessing.cpu_count() - - if MAX_WORKERS and jobs > MAX_WORKERS: jobs = MAX_WORKERS - - no_pool = False - if len(workblock) <= WORKBLOCK_EXPAND_CHUNK*ANDROID_NO_POOL_WB_EXPAND_MAX: - if mode == MODE_STAMP and stamp_cost < ANDROID_POOLING_THRESHOLD_COST_FP: no_pool = True - elif mode == MODE_KEYSTAMP and stamp_cost < ANDROID_KEYSTAMP_POOLING_THRESHOLD_FP: no_pool = True - - if no_pool: - RNS.log(f"Low stamp difficulty, using {ANDROID_LOW_DIFFICULTY_JOBS} worker{'s' if ANDROID_LOW_DIFFICULTY_JOBS != 1 else ''} instead of {jobs}", RNS.LOG_DEBUG) - jobs = ANDROID_LOW_DIFFICULTY_JOBS - - results_dict = wm.dict() - stop_flag = mmap.mmap(-1, 1, flags=mmap.MAP_SHARED | getattr(mmap, "MAP_ANONYMOUS", 0)) - active_jobs[message_id] = False - - RNS.log(f"Dispatching {jobs} worker{'s' if jobs != 1 else ''} for stamp generation...", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - - def job(worker_id): - rounds = 0 - found_result = None - try: - target = target_from_fp(stamp_cost) - stop_check = lambda: stop_flag[0] != 0 - - if mode == MODE_STAMP: result, rounds, found = _loop_hash(workblock, target, size, stop_check, None, 0, full_hash) - else: result, rounds, found = _loop_key(workblock, target, stop_check, 0) - - if found: - found_result = result - results_dict["found"] = [found_result, rounds] - stop_flag[0] = 1 - - results_dict[worker_id] = [found_result, rounds] - - except Exception as e: - RNS.log(f"Stamp generation worker error: {e}", RNS.LOG_ERROR) - RNS.trace_exception(e) - try: results_dict[worker_id] = [None, rounds] - except Exception: pass - - job_procs = [] - try: - for pnum in range(jobs): - process = ctx.Process(target=job, kwargs={"worker_id": pnum}, daemon=True) - job_procs.append(process) - process.start() - - last_progress = time.time() - while stamp == None and active_jobs.get(message_id) == False: - if "found" in results_dict: stamp = results_dict["found"][0] - if stamp == None: - if not any(p.is_alive() for p in job_procs): break - - if time.time()-last_progress > 10: - elapsed = max(time.time()-start_time, 1E-6) - RNS.log(f"Stamp ({cost_from_fp(stamp_cost)}) generation running, {RNS.prettyshorttime(elapsed)} elapsed", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - last_progress = time.time() - - if message_id in active_jobs and active_jobs[message_id] == True: stop_flag[0] = 1 - - time.sleep(0.05) - - finally: - stop_flag[0] = 1 - - for process in job_procs: - try: process.join(timeout=2) - except Exception: pass - - for worker_id in list(results_dict.keys()): - try: - if worker_id == "found": continue - r = results_dict[worker_id] - if r != None: total_rounds += r[1] - except Exception: pass - - active_jobs.pop(message_id, None) - try: wm.shutdown() - except Exception: pass - - return stamp, total_rounds - -####################### -# Fixed-point Helpers # -####################### - -# Fixed-point stamp target mantissa table -# TAB[f] = floor(2^33 * 2^(f/256)), f = 0..255 -TAB_DIGEST = "55ba3ce1df224895b0dfdc102eb4359fc2f5a7efefee68df0cc90c8a8ac24f48" -PRM_DIGEST = "21436fc98e76a12cad7c52ebeb6ab76c2ae93b4cd768949df7fdd4e2f98c378d" -MANTISSA_BITS = 33 -COST_FP_BITS = 8 -COST_FP = 1 << COST_FP_BITS - -# These values are authoritative. DO NOT attempt to -# invent your own, calculate them at load time, or -# generate them on the fly. You have been warned. -TAB = ( - 0x200000000, 0x201635f4b, 0x202c7b53f, 0x2042d0287, 0x2059347ce, 0x206fa85c2, - 0x20862bd0d, 0x209cbee5e, 0x20b361a62, 0x20ca141c7, 0x20e0d653b, 0x20f7a856e, - 0x210e8a30e, 0x21257becc, 0x213c7d958, 0x21538f363, 0x216ab0d9f, 0x2181e28bc, - 0x21992456e, 0x21b076467, 0x21c7d865a, 0x21df4abfb, 0x21f6cd5ff, 0x220e6051a, - 0x222603a02, 0x223db756b, 0x22557b80d, 0x226d5029e, 0x2285355d5, 0x229d2b269, - 0x22b531914, 0x22cd48a8e, 0x22e57078f, 0x22fda90d2, 0x2315f2711, 0x232e4cb06, - 0x2346b7d6d, 0x235f33f02, 0x2377c1080, 0x23905f2a5, 0x23a90e62d, 0x23c1cebd6, - 0x23daa045f, 0x23f383087, 0x240c7710c, 0x24257c6af, 0x243e9322f, 0x2457bb44f, - 0x2470f4dce, 0x248a3ff70, 0x24a39c9f6, 0x24bd0ae23, 0x24d68acbc, 0x24f01c683, - 0x2509bfc3e, 0x252374eb2, 0x253d3bea3, 0x255714cda, 0x2570ffa1b, 0x258afc72e, - 0x25a50b4dc, 0x25bf2c3ec, 0x25d95f527, 0x25f3a4957, 0x260dfc146, 0x262865dbd, - 0x2642e1f89, 0x265d70775, 0x26781164c, 0x2692c4cdc, 0x26ad8abf2, 0x26c86345b, - 0x26e34e6e7, 0x26fe4c463, 0x27195cda0, 0x27348036e, 0x274fb669c, 0x276aff7fd, - 0x27865b862, 0x27a1ca89d, 0x27bd4c982, 0x27d8e1be3, 0x27f48a095, 0x28104586c, - 0x282c1443e, 0x2847f64e1, 0x2863ebb2a, 0x287ff47f0, 0x289c10c0c, 0x28b840854, - 0x28d483da3, 0x28f0dacd1, 0x290d456b8, 0x2929c3c32, 0x294655e1a, 0x2962fbd4d, - 0x297fb5aa6, 0x299c83702, 0x29b96533f, 0x29d65b03b, 0x29f364ed3, 0x2a1082fe8, - 0x2a2db5459, 0x2a4afbd07, 0x2a6856ad3, 0x2a85c5e9e, 0x2aa34994b, 0x2ac0e1bbd, - 0x2ade8e6d6, 0x2afc4fb7c, 0x2b1a25a92, 0x2b38104ff, 0x2b560fba9, 0x2b7423f75, - 0x2b924d14b, 0x2bb08b213, 0x2bcede2b5, 0x2bed4641b, 0x2c0bc372e, 0x2c2a55cd9, - 0x2c48fd607, 0x2c67ba3a3, 0x2c868c699, 0x2ca573fd7, 0x2cc47104a, 0x2ce3838e1, - 0x2d02aba89, 0x2d21e9633, 0x2d413cccf, 0x2d60a5f4e, 0x2d8024ea1, 0x2d9fb9bba, - 0x2dbf6478c, 0x2ddf2530b, 0x2dfefbf2a, 0x2e1ee8cde, 0x2e3eebd1d, 0x2e5f050dd, - 0x2e7f34914, 0x2e9f7a6ba, 0x2ebfd6ac8, 0x2ee049635, 0x2f00d29fb, 0x2f2172715, - 0x2f4228e7d, 0x2f62f612e, 0x2f83da026, 0x2fa4d4c5f, 0x2fc5e66d9, 0x2fe70f092, - 0x30084ea87, 0x3029a55ba, 0x304b13329, 0x306c983d7, 0x308e348c4, 0x30afe82f3, - 0x30d1b3368, 0x30f395b26, 0x31158fb31, 0x3137a148f, 0x3159ca845, 0x317c0b75a, - 0x319e642d6, 0x31c0d4bc1, 0x31e35d322, 0x3205fda05, 0x3228b6172, 0x324b86a75, - 0x326e6f619, 0x32917056b, 0x32b489979, 0x32d7bb34e, 0x32fb053fb, 0x331e67c8f, - 0x3341e2e19, 0x3365769aa, 0x338923054, 0x33ace8329, 0x33d0c633c, 0x33f4bd1a0, - 0x3418ccf6b, 0x343cf5db1, 0x346137d89, 0x348593008, 0x34aa07647, 0x34ce9515e, - 0x34f33c266, 0x3517fca78, 0x353cd6aaf, 0x3561ca426, 0x3586d77fa, 0x35abfe747, - 0x35d13f32b, 0x35f699cc4, 0x361c0e531, 0x36419cd93, 0x366745709, 0x368d082b6, - 0x36b2e51bc, 0x36d8dc53e, 0x36feede5f, 0x372519e44, 0x374b60614, 0x3771c16f3, - 0x37983d209, 0x37bed387e, 0x37e584b7a, 0x380c50c28, 0x383337bb0, 0x385a39b3f, - 0x388156bff, 0x38a88ef1f, 0x38cfe25ca, 0x38f751131, 0x391edb280, 0x394680aea, - 0x396e41b9d, 0x39961e5cd, 0x39be16aab, 0x39e62ab6b, 0x3a0e5a940, 0x3a36a6561, - 0x3a5f0e101, 0x3a8791d59, 0x3ab031b9f, 0x3ad8edd0c, 0x3b01c62d9, 0x3b2abae3f, - 0x3b53cc07b, 0x3b7cf9ac7, 0x3ba643e60, 0x3bcfaac83, 0x3bf92e66f, 0x3c22ced63, - 0x3c4c8c29e, 0x3c7666762, 0x3ca05dcf1, 0x3cca7248c, 0x3cf4a3f78, 0x3d1ef2ef9, - 0x3d495f454, 0x3d73e90cf, 0x3d9e905b1, 0x3dc955443, 0x3df437dcc, 0x3e1f38396, - 0x3e4a566ed, 0x3e759291b, 0x3ea0ecb6d, 0x3ecc64f31, 0x3ef7fb5b3, 0x3f23b0044, - 0x3f4f83033, 0x3f7b746d2, 0x3fa784571, 0x3fd3b2d65 ) - -assert len(TAB) == COST_FP -assert TAB[0] == 1 << MANTISSA_BITS -assert all(b > a for a, b in zip(TAB, TAB[1:])) -assert sha256(",".join(str(v) for v in TAB).encode("ascii")) == bytes.fromhex(TAB_DIGEST) -assert sha256(f"master|{TAB_DIGEST}|{MANTISSA_BITS}|{len(TAB)}|{COST_FP_BITS}|{COST_FP}|".encode("utf-8")) == bytes.fromhex(PRM_DIGEST) - -def cost_to_fp(cost): - v = math.floor(float(cost) * COST_FP + 0.5) - return max(0, min(v, RNS.Transport.STAMP_COST_CAP * COST_FP)) - -def fp_to_bytes(fp): - return bytes(((fp >> COST_FP_BITS) & 0xFF, fp & 0xFF)) - -def cost_to_bytes(cost): - return fp_to_bytes(cost_to_fp(cost)) - -def fp_from_bytes(b): - return (b[0] << COST_FP_BITS) | b[1] - -def cost_from_fp(fp): - return fp/COST_FP - -def cost_from_bytes(b): - return cost_from_fp(fp_from_bytes(b)) - -def quantize_cost(cost): - return cost_from_fp(cost_to_fp(cost)) - -def target_from_fp(fp): - assert 0 <= fp <= RNS.Transport.STAMP_COST_CAP * COST_FP - # Extract the integer and fractional parts - # by modular division, here equivalent to: - # ((256*COST_FP) // COST_FP, (256*COST_FP) % COST_FP) - # i = quotient f = remainder - i, f = divmod(256*COST_FP - fp, COST_FP) - - # Then, construct the numerical representation - # by getting the quantized fractional mantissa - # from TAB, and raising it to i (the exponent) - # and right-shifting it by MANTISSA_BITS. - return (TAB[f] << i) >> MANTISSA_BITS - -def target_from_cost(cost): - return target_from_fp(cost_to_fp(cost)) - -def cost_int(fp): return fp >> COST_FP_BITS # Legacy integer display representation -def cost_str(fp): return f"{fp / COST_FP:g}" # Display only, remember, the floats are only in your head - -########################### -# Persistence and loading # -########################### - -DESTINATION_STAMP_EXTENSION = ".dstamp" -STAMP_FILE_VERSION = 1 - -def stamps_dir(create=False): - storagepath = RNS.Reticulum.storagepath - if not storagepath: return None - path = os.path.join(storagepath, "stamps") - if create and not os.path.isdir(path): - try: os.makedirs(path, exist_ok=True) - except Exception as e: - RNS.log(f"An error occurred while creating destination stamp storage path: {e}", RNS.LOG_WARNING) - return None - return path - -def destination_stamp_file(destination_hash, create=False): - dir_path = stamps_dir(create=create) - if dir_path == None: return None - return os.path.join(dir_path, RNS.hexrep(destination_hash, delimit=False)+DESTINATION_STAMP_EXTENSION) - -def store_destination_stamp(destination_hash, stamp, stamp_value): - file_path = destination_stamp_file(destination_hash, create=True) - if file_path == None: - RNS.log("No storage path available, destination stamp not persisted", RNS.LOG_WARNING) - return False - - try: - data = msgpack.packb({"v": STAMP_FILE_VERSION, "stamp": stamp, - "value": stamp_value, "generated": time.time()}) - - temp_path = file_path+f".{os.getpid()}.tmp" - with open(temp_path, "wb") as temp_file: temp_file.write(data) - os.replace(temp_path, file_path) - return True - - except Exception as e: - RNS.log(f"An error occurred while persisting destination stamp: {e}", RNS.LOG_WARNING) - return False - -def load_destination_stamp(destination_hash, material, required_value): - file_path = destination_stamp_file(destination_hash) - if file_path == None or not os.path.isfile(file_path): return None - - try: - with open(file_path, "rb") as stamp_file: entry = msgpack.unpackb(stamp_file.read()) - if entry.get("v") != STAMP_FILE_VERSION: return None - workblock = stamp_workblock(material, expand_rounds=0) - - stamp = entry["stamp"] - if not isinstance(stamp, bytes) or len(stamp) != RNS.Identity.STAMPLENGTH: - RNS.log(f"Stored stamp for {RNS.prettyhexrep(destination_hash)} has invalid format. Regenerating on next announce.", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - return None - - value = stamp_value(workblock, stamp) - if not stamp_valid(stamp, required_value, workblock): - RNS.log(f"Stored stamp for {RNS.prettyhexrep(destination_hash)} has value {value}, below required {required_value}. Regenerating on next announce.", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - return None - - return (stamp, value) - - except Exception as e: - RNS.log(f"Ignoring unreadable destination stamp file for {RNS.prettyhexrep(destination_hash)}: {e}", RNS.LOG_WARNING) - return None - -######################### -# Pooling Configuration # -######################### - -POOLING_THRESHOLD_COST_FP = POOLING_THRESHOLD_COST*COST_FP -KEYSTAMP_POOLING_THRESHOLD_FP = KEYSTAMP_POOLING_THRESHOLD*COST_FP -ANDROID_POOLING_THRESHOLD_COST_FP = ANDROID_POOLING_THRESHOLD_COST*COST_FP -ANDROID_KEYSTAMP_POOLING_THRESHOLD_FP = ANDROID_KEYSTAMP_POOLING_THRESHOLD*COST_FP - -######################### -# Multiprocessing Patch # -######################### - -# CPython has a bug in multiprocessing's bootstrap code, -# where the initial stdin close() will deadlock if any -# part of the forking process is already holding the -# buffered I/O lock for the stdin fd. Since the locking -# state is inherited by the child process, this lock can -# never be released, and all children deadlock immediately -# before any application code is reached. -# -# This code run-time patches multiprocessing to detach -# stdin via a lock-free fd duplication instead, and parks -# the hazardous file descriptor to avoid potential later, -# GC-initiated deadlocking. -# -# All downstream forks from this process are affected by -# this, yes, and it might seem a tad aggressive, but I'd -# argue that this is what CPython should have done in the -# first place, and that it is strictly a better approach. - -_stale_stdin = None - -def _patched_close_stdin(): - if sys.stdin is None: return - try: - fd = os.open(os.devnull, os.O_RDONLY) - try: os.dup2(fd, 0) - finally: os.close(fd) - except OSError: pass - - # We ensure a global anchor to the old - # stdin, so GC cannot inadvertly hit a - # deadlocking close() via __del__ - global _stale_stdin - _stale_stdin = sys.stdin - - try: sys.stdin = open(0, encoding="utf-8", closefd=False) - except Exception: sys.stdin = None - -_patched_close_stdin._rns_safe = True - -def _patch_mp_stdin(): - try: - import multiprocessing.util as mputil - except ImportError: return - current = getattr(mputil, "_close_stdin", None) - - # If future CPython removes _close_stdin, - # we'll abort the patch here. - if current is None: return - - # Only patch if we haven't already done so, - # or, in a potential future fixed CPython, - # detected that the method is now safe. - if getattr(current, "_rns_safe", False): return - mputil._close_stdin = _patched_close_stdin - -# Only attempt patching on POSIX -if not RNS.vendor.platformutils.is_windows(): _patch_mp_stdin() \ No newline at end of file diff --git a/RNS/Storage.py b/RNS/Storage.py deleted file mode 100644 index 44579600..00000000 --- a/RNS/Storage.py +++ /dev/null @@ -1,851 +0,0 @@ -# Reticulum License -# -# Copyright (c) 2016-2026 Mark Qvist -# -# Permission is hereby granted, free of charge, to any person obtaining a copy -# of this software and associated documentation files (the "Software"), to deal -# in the Software without restriction, including without limitation the rights -# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -# copies of the Software, and to permit persons to whom the Software is -# furnished to do so, subject to the following conditions: -# -# - The Software shall not be used in any kind of system which includes amongst -# its functions the ability to purposefully do harm to human beings. -# -# - The Software shall not be used, directly or indirectly, in the creation of -# an artificial intelligence, machine learning or language model training -# dataset, including but not limited to any use that contributes to the -# training or development of such a model or algorithm. -# -# - The above copyright notice and this permission notice shall be included in -# all copies or substantial portions of the Software. -# -# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE -# SOFTWARE. - -import RNS -import hashlib -import struct -import sys -import threading -import os -import time -from array import array - -class AnnounceRateTable: - # Columnar store for announce rate tracking. Layout: - # _index : dict[destination_hash -> slot] - # _keys : list[slot] -> destination_hash (for swap-remove bookkeeping) - # _last : array('d') last non-violating announce time - # _blocked: array('d') blocked_until - # _viol : array('i') rate_violations - # _ts : array('d') flat ring of max_timestamps doubles per slot - # _ts_len : array('B') valid timestamp count per slot - # _ts_head: array('B') ring write cursor per slot - - def __init__(self, max_timestamps=16): - assert max_timestamps <= 255, "Timestamp ring size must fit in a single byte" - self.max_ts = max_timestamps - self._index = {} - self._keys = [] - self._last = array('d') - self._blocked = array('d') - self._viol = array('i') - self._ts = array('d') - self._ts_len = array('B') - self._ts_head = array('B') - self._cursor = 0 - - def __len__(self): return len(self._keys) - def __contains__(self, destination_hash): return destination_hash in self._index - - # Perform the announce-rate check-and-update for one announce. - # Caller must hold the announce_rate_table_lock. - def check_and_update(self, destination_hash, now, target, grace, penalty): - slot = self._index.get(destination_hash) - - if slot is None: - slot = len(self._keys) - self._index[destination_hash] = slot - self._keys.append(destination_hash) - self._last.append(now) - self._blocked.append(0.0) - self._viol.append(0) - self._ts.extend([0.0]*self.max_ts) - self._ts[slot*self.max_ts] = now - self._ts_len.append(1) - self._ts_head.append(1 % self.max_ts) - return False - - base = slot*self.max_ts - head = self._ts_head[slot] - self._ts[base+head] = now - self._ts_head[slot] = (head+1) % self.max_ts - if self._ts_len[slot] < self.max_ts: self._ts_len[slot] += 1 - - current_rate = now - self._last[slot] - rate_blocked = False - - if now > self._blocked[slot]: - if current_rate < target: self._viol[slot] += 1 - else: - v = self._viol[slot] - 1 - self._viol[slot] = v if v > 0 else 0 - - if self._viol[slot] > grace: - self._blocked[slot] = self._last[slot] + target + penalty - rate_blocked = True - else: self._last[slot] = now - - else: rate_blocked = True - - return rate_blocked - - # Caller must hold the table lock - def cull(self, now, ttl, max_scan=1024, max_cull=None): - if max_cull is None: max_cull = max_scan - horizon = now - ttl - culled = 0 - scanned = 0 - n = len(self._keys) - - while scanned < max_scan and culled < max_cull and n > 0: - if self._cursor >= n: self._cursor = 0 - slot = self._cursor - - if self._last[slot] < horizon and self._blocked[slot] <= now: - last_i = n - 1 - stale_key = self._keys[slot] - - if slot != last_i: - moved_key = self._keys[last_i] - self._keys[slot] = moved_key - self._index[moved_key] = slot - self._last[slot] = self._last[last_i] - self._blocked[slot] = self._blocked[last_i] - self._viol[slot] = self._viol[last_i] - self._ts_len[slot] = self._ts_len[last_i] - self._ts_head[slot] = self._ts_head[last_i] - - f = last_i*self.max_ts; t = slot*self.max_ts - self._ts[t:t+self.max_ts] = self._ts[f:f+self.max_ts] - - self._keys.pop() - self._last.pop(); self._blocked.pop(); self._viol.pop() - self._ts_len.pop(); self._ts_head.pop() - del self._ts[len(self._ts)-self.max_ts:] # drop tail block of removed slot - del self._index[stale_key] - - n -= 1 - culled += 1 - # Do not advance cursor, re-examine the slot a moved entry landed in - - else: - self._cursor = slot + 1 - scanned += 1 - - if self._cursor >= n: self._cursor = 0 - - return culled - - # Hold table lock, or accept a possibly inconsistent snapshot - def items(self): - for slot, key in enumerate(self._keys): - n = self._ts_len[slot] - head = self._ts_head[slot] - base = slot*self.max_ts - if n < self.max_ts: ts = list(self._ts[base:base+n]) - else: ts = list(self._ts[base+head:base+self.max_ts]) + list(self._ts[base:base+head]) - yield key, { "last": self._last[slot], "rate_violations": self._viol[slot], - "blocked_until": self._blocked[slot], "timestamps": ts } - - # Persists the announce rate table to a file, in - # compacted, little-endian binary format: - # - # Header (16 bytes) - # 0x00 6 Magic bytes - # 0x06 1 Format version - # 0x07 1 Flags, reserved, must be zero - # 0x08 1 Timestamp ring size (max_ts) - # 0x09 1 Destination hash length in bytes (keylen) - # 0x0A 2 Reserved, zero - # 0x0C 4 Entry count, uint32, little-endian - # - # Entries (columnar, in native slot order) - # Destination hash keys, followed by the _last, _blocked, - # _viol, _ts_len, _ts_head and _ts columns, all encoded as - # little-endian fixed-width values. - # - # Caller must hold the announce rate table lock - - PERSIST_MAGIC = b"RNSART" - PERSIST_VERSION = 0x01 - def persist(self, path, retain=None): - try: - count = len(self._keys) - - if count > 0: - keylen = len(self._keys[0]) - for key in self._keys: - if len(key) != keylen: raise ValueError("Inconsistent destination hash lengths in table") - else: - keylen = RNS.Identity.TRUNCATED_HASHLENGTH//8 - - if retain != None and count > 0: - now = time.time() - horizon = now - retain - keep = [slot for slot in range(count) if not (self._last[slot] < horizon and self._blocked[slot] <= now)] - else: - keep = None - - if keep != None and len(keep) != count: - count = len(keep) - keys = [self._keys[slot] for slot in keep] - last = array("d", [self._last[slot] for slot in keep]) - blocked = array("d", [self._blocked[slot] for slot in keep]) - viol = array("i", [self._viol[slot] for slot in keep]) - ts_len = array("B", [self._ts_len[slot] for slot in keep]) - ts_head = array("B", [self._ts_head[slot] for slot in keep]) - ts = array("d") - for slot in keep: ts.extend(self._ts[slot*self.max_ts:(slot+1)*self.max_ts]) - else: - keys = self._keys - last = self._last - blocked = self._blocked - viol = self._viol - ts_len = self._ts_len - ts_head = self._ts_head - ts = self._ts - - if last.itemsize != 8 or viol.itemsize != 4: - raise ValueError(f"Unsupported array itemsize at persist: d={last.itemsize}, i={viol.itemsize}") - - header = self.PERSIST_MAGIC - header += bytes([self.PERSIST_VERSION, 0x00, self.max_ts & 0xFF, keylen & 0xFF]) - header += struct.pack(" 255: return False - if keylen < 1: return False - - entry_size = keylen+22+file_max_ts*8 - if len(blob) != 16+count*entry_size: return False - - if file_max_ts == self.max_ts: - # Ring size matches, load directly - keys = [blob[16+slot*keylen : 16+(slot+1)*keylen] for slot in range(count)] - index = {} - for slot in range(count): - if keys[slot] in index: return False - index[keys[slot]] = slot - - offset = 16+count*keylen - last = self._column_from_le("d", blob[offset:offset+count*8]); offset += count*8 - blocked = self._column_from_le("d", blob[offset:offset+count*8]); offset += count*8 - viol = self._column_from_le("i", blob[offset:offset+count*4]); offset += count*4 - ts_len = array("B", blob[offset:offset+count]); offset += count - ts_head = array("B", blob[offset:offset+count]); offset += count - ts = self._column_from_le("d", blob[offset:offset+count*self.max_ts*8]); offset += count*self.max_ts*8 - - for slot in range(count): - if ts_len[slot] > self.max_ts or ts_head[slot] >= self.max_ts: return False - - else: - # Different ring sizes from current running config, - # rebuild entries best effort. - keys = [blob[16+slot*keylen : 16+(slot+1)*keylen] for slot in range(count)] - index = {} - for slot in range(count): - if keys[slot] in index: return False - index[keys[slot]] = slot - - offset = 16+count*keylen - last = self._column_from_le("d", blob[offset:offset+count*8]); offset += count*8 - blocked = self._column_from_le("d", blob[offset:offset+count*8]); offset += count*8 - viol = self._column_from_le("i", blob[offset:offset+count*4]); offset += count*4 - f_ts_len = array("B", blob[offset:offset+count]); offset += count - f_ts_head = array("B", blob[offset:offset+count]); offset += count - f_ts = self._column_from_le("d", blob[offset:offset+count*file_max_ts*8]); offset += count*file_max_ts*8 - - for slot in range(count): - if f_ts_len[slot] > file_max_ts or f_ts_head[slot] >= file_max_ts: return False - - ts_len = array("B"); ts_head = array("B"); ts = array("d") - for slot in range(count): - base = slot*file_max_ts - if f_ts_len[slot] < file_max_ts: chronological = list(f_ts[base:base+f_ts_len[slot]]) - else: chronological = list(f_ts[base+f_ts_head[slot]:base+file_max_ts])+list(f_ts[base:base+f_ts_head[slot]]) - chronological = chronological[-self.max_ts:] - ts_count = len(chronological) - - ts_len.append(ts_count) - ts.extend(chronological) - if ts_count < self.max_ts: ts.extend([0.0]*(self.max_ts-ts_count)) - ts_head.append(ts_count % self.max_ts) - - self._index = index - self._keys = keys - self._last = last - self._blocked = blocked - self._viol = viol - self._ts = ts - self._ts_len = ts_len - self._ts_head = ts_head - self._cursor = 0 - - return True - - except Exception as e: - RNS.log(f"Could not load announce rate table from {path}: {e}", RNS.LOG_ERROR) - return False - - def _column_le(self, column): - if sys.byteorder == "big": swapped = array(column.typecode, column); swapped.byteswap(); return swapped.tobytes() - else: return column.tobytes() - - def _column_from_le(self, typecode, data): - column = array(typecode); column.frombytes(data) - if sys.byteorder == "big": column.byteswap() - return column - -class PacketHashlist: - # Bucketed byte-blob packet filter hashlist, with the primary - # design goal of memory coherence and density. All operations - # are safe to call without holding a lock. - - def __init__(self, hash_width=32, bucket_count=16384): - assert bucket_count > 0 and bucket_count & (bucket_count-1) == 0, "Bucket count must be a power of two" - self.width = hash_width - self._nb = bucket_count - self._mask = bucket_count - 1 - self._cur = [bytearray() for _ in range(bucket_count)] - self._prv = [bytearray() for _ in range(bucket_count)] - self._count = 0 - - def __len__(self): - return self._count - - def __contains__(self, packet_hash): - bucket = (packet_hash[0] | (packet_hash[1] << 8)) & self._mask - return packet_hash in self._cur[bucket] or packet_hash in self._prv[bucket] - - def add(self, packet_hash): - assert len(packet_hash) == self.width, "Packet hash width mismatch" - bucket = (packet_hash[0] | (packet_hash[1] << 8)) & self._mask - if packet_hash not in self._cur[bucket]: - self._cur[bucket].extend(packet_hash) - self._count += 1 - - def discard(self, packet_hash): - w = self.width - bucket = (packet_hash[0] | (packet_hash[1] << 8)) & self._mask - for generation in (self._cur, self._prv): - entries = generation[bucket] - pos = entries.find(packet_hash) - while pos != -1: - if pos % w == 0: - del entries[pos:pos+w] - if generation is self._cur: self._count -= 1 - pos = entries.find(packet_hash, pos) - else: - pos = entries.find(packet_hash, pos+1) - - def swap(self): - self._prv = self._cur - self._cur = [bytearray() for _ in range(self._nb)] - self._count = 0 - - # Current-generation buckets for persist operations - def buckets(self): return tuple(self._cur) - -class KnownDestinationsStore: - # Write-behind SQLite storage backend for known destinations. - # The actual in-memory table is used directly for all transport - # operations; this serves purely as the store, and no read operations - # utilize the database directly. - - def __init__(self, db_path, hash_width=16, read_only=False): - import sqlite3 - self.sqlite3 = sqlite3 - self.db_path = db_path - self.hash_width = hash_width - self.read_only = read_only - self._dirty_upsert = set() - self._dirty_delete = set() - self._ratchet_upserts = {} - self._ratchet_deletes = set() - self._kd_quarantine = {} - self._ratchet_quarantine = {} - self._flush_lock = threading.Lock() - - if read_only: self._conn = sqlite3.connect(f"file:{db_path}?mode=ro", uri=True, check_same_thread=False, isolation_level=None, cached_statements=0) - else: - self._conn = sqlite3.connect(db_path, check_same_thread=False, isolation_level=None, cached_statements=0) - self._conn.execute("PRAGMA journal_mode=WAL") - self._conn.execute("PRAGMA synchronous=NORMAL") - self._conn.execute("PRAGMA journal_size_limit=8388608") - self.__create_schema() - - def close(self): - if self._conn != None: - self._conn.close() - self._conn = None - - def __create_schema(self): - db_version = self._conn.execute("PRAGMA user_version").fetchone()[0] - - # Pre-release database cleanup - # TODO: Remove this in 1.6.1 - if db_version > 0: - RNS.log(f"Pre-release database detected, rebuilding known destinations DB to release format", RNS.LOG_WARNING) - self._conn.execute("DROP TABLE IF EXISTS known_destinations") - - self._conn.execute("""CREATE TABLE IF NOT EXISTS known_destinations ( - destination_hash BLOB PRIMARY KEY, - last_heard REAL NOT NULL, - packet_hash BLOB, - public_key BLOB NOT NULL, - app_data BLOB, - used REAL NOT NULL DEFAULT 0, - stamp BLOB, - stamp_value REAL, - lr_cost REAL, - identity_hash BLOB NOT NULL)""") - - self._conn.execute("""CREATE TABLE IF NOT EXISTS ratchets ( - destination_hash BLOB PRIMARY KEY, - ratchet BLOB NOT NULL, - received REAL NOT NULL)""") - - # Schema migrations - try: - self._conn.execute("BEGIN") - # No migrations yet - self._conn.execute("PRAGMA user_version = 0") - self._conn.execute("COMMIT") - self._conn.commit() - - except Exception as e: - RNS.log(f"Known destinations database version migration failed: {e}", RNS.LOG_CRITICAL) - RNS.log(f"You will need to remove the known_destinations.db* files from your storage directory so it can be rebuilt", RNS.LOG_CRITICAL) - - def __entry_row(self, destination_hash, entry): - stamp = entry[5] if len(entry) > 5 else None - stamp_value = entry[6] if len(entry) > 6 else 0 - lr_cost = entry[7] if len(entry) > 7 else None - identity_hash = hashlib.sha256(entry[2]).digest()[:self.hash_width] - return (destination_hash, entry[0], entry[1], entry[2], entry[3], entry[4], stamp, stamp_value, lr_cost, identity_hash) - - # Caller must hold Identity.known_destinations_lock - def mark_dirty(self, destination_hash): - if self.read_only: return - self._dirty_delete.discard(destination_hash) - self._kd_quarantine.pop(destination_hash, None) - self._dirty_upsert.add(destination_hash) - - # Caller must hold Identity.known_destinations_lock - def mark_deleted(self, destination_hash): - if self.read_only: return - self._dirty_upsert.discard(destination_hash) - self._dirty_delete.add(destination_hash) - self._kd_quarantine.pop(destination_hash, None) - self._ratchet_quarantine.pop(destination_hash, None) - - # Caller must hold Identity.known_destinations_lock - def take_pending(self): - if self.read_only: return set(), set(), {}, set() - upserts = self._dirty_upsert - deletes = self._dirty_delete - ratchet_upserts = self._ratchet_upserts - ratchet_deletes = self._ratchet_deletes - self._dirty_upsert = set() - self._dirty_delete = set() - self._ratchet_upserts = {} - self._ratchet_deletes = set() - return upserts, deletes, ratchet_upserts, ratchet_deletes - - # Caller must hold the flush lock and have an already open transaction - def __wrap_exec(self, sql, rows): - rejects = [] - - # By default, run batched queries in chunks. - for i in range(0, len(rows), 4096): - chunk = rows[i:i+4096] - try: - self._conn.execute("SAVEPOINT chunk") - self._conn.executemany(sql, chunk) - self._conn.execute("RELEASE chunk") - - # But on integrity and data errors, roll back the chunk - # and iterate per-row, so we can catch any violating - # entries and quarantine them. A later, sane update - # will then unquarantine and heal upon arrival. - # - # Other exceptions are intentionally not caught here, - # so they can propagate directly. - except (self.sqlite3.IntegrityError, self.sqlite3.DataError): - self._conn.execute("ROLLBACK TO chunk") - for row in chunk: - try: - self._conn.execute("SAVEPOINT row") - self._conn.execute(sql, row) - self._conn.execute("RELEASE row") - - except (self.sqlite3.IntegrityError, self.sqlite3.DataError) as e: - self._conn.execute("ROLLBACK TO row") - rejects.append((row[0], str(e))) - - self._conn.execute("RELEASE chunk") - - return rejects - - # May be called without any locks held - def apply(self, upserts, deletes, ratchet_upserts, ratchet_deletes, known_destinations): - if self.read_only: return 0 - if len(upserts) == 0 and len(deletes) == 0 and len(ratchet_upserts) == 0 and len(ratchet_deletes) == 0: return 0 - - with self._flush_lock: - rows = [] - removables = [] - ratchet_rows = [] - ratchet_removables = [] - - for destination_hash in upserts: - if destination_hash in self._kd_quarantine: continue - entry = known_destinations.get(destination_hash) - if entry != None: rows.append(self.__entry_row(destination_hash, entry)) - - for destination_hash in deletes: - if destination_hash not in known_destinations: removables.append((destination_hash,)) - - for destination_hash, ratchet_entry in ratchet_upserts.items(): - # Ratchets of purged destinations must be removed as well - if destination_hash not in known_destinations: ratchet_removables.append((destination_hash,)) - elif destination_hash not in self._ratchet_quarantine: ratchet_rows.append((destination_hash, *ratchet_entry)) - - for destination_hash in ratchet_deletes: - if destination_hash not in known_destinations: ratchet_removables.append((destination_hash,)) - - kd_rejects = [] - ratchet_rejects = [] - try: - self._conn.execute("BEGIN") - kd_rejects += self.__wrap_exec("INSERT INTO known_destinations (destination_hash, last_heard, packet_hash, public_key, app_data, used, stamp, stamp_value, lr_cost, identity_hash) VALUES (?,?,?,?,?,?,?,?,?,?) ON CONFLICT(destination_hash) DO UPDATE SET last_heard=excluded.last_heard, packet_hash=excluded.packet_hash, public_key=excluded.public_key, app_data=excluded.app_data, used=excluded.used, stamp=excluded.stamp, stamp_value=excluded.stamp_value, lr_cost=excluded.lr_cost, identity_hash=excluded.identity_hash", rows) - kd_rejects += self.__wrap_exec("DELETE FROM known_destinations WHERE destination_hash=?", removables) - ratchet_rejects += self.__wrap_exec("INSERT INTO ratchets VALUES (?,?,?) ON CONFLICT(destination_hash) DO UPDATE SET ratchet=excluded.ratchet, received=excluded.received", ratchet_rows) - ratchet_rejects += self.__wrap_exec("DELETE FROM ratchets WHERE destination_hash=?", ratchet_removables) - self._conn.commit() - - except Exception: - # If an exception is not handled in the batch query wrapper, - # we will have to roll back the transaction, and mark all - # attempted entries as dirty. A failure state like such - # should not happen, and this is a last resort; at this - # point, writes may stall until an updated entry for - # the violating row(s) arrive and heal the invalid - # dirty entries, so this is raised for logging. - self._dirty_upsert |= {row[0] for row in rows} - self._dirty_delete |= {row[0] for row in removables} - self._ratchet_upserts |= {row[0]: row[1:] for row in ratchet_rows} - self._ratchet_deletes |= {row[0] for row in ratchet_removables} - self._conn.rollback() - raise - - # Track failed persists and one-time log per failure. A later - # update of the destination clears the quarantine state and - # allows persist to retry with the (hopefully) valid data. - if len(kd_rejects) > 0 or len(ratchet_rejects) > 0: - for destination_hash, error in kd_rejects: - self._kd_quarantine[destination_hash] = (error, time.time()) - RNS.log(f"Invalid known destination data for {RNS.prettyhexrep(destination_hash)} at persist. The contained exception was: {error}", RNS.LOG_ERROR) - - for destination_hash, error in ratchet_rejects: - self._ratchet_quarantine[destination_hash] = (error, time.time()) - RNS.log(f"Invalid ratchet data for {RNS.prettyhexrep(destination_hash)} at persist. The contained exception was: {error}", RNS.LOG_ERROR) - - return len(rows)+len(removables)+len(ratchet_rows)+len(ratchet_removables)-len(kd_rejects)-len(ratchet_rejects) - - def load_all(self): - cursor = self._conn.execute("SELECT destination_hash, last_heard, packet_hash, public_key, app_data, used, stamp, stamp_value, lr_cost FROM known_destinations") - while True: - rows = cursor.fetchmany(4096) - if not rows: break - for row in rows: yield row[0], [row[1], row[2], row[3], row[4], row[5], row[6], row[7], row[8]] - - def remember_ratchet(self, destination_hash, ratchet, now): - if self.read_only: return False - self._ratchet_quarantine.pop(destination_hash, None) - - pending = self._ratchet_upserts.get(destination_hash) - if pending != None: - if pending[0] == ratchet: - self._ratchet_deletes.discard(destination_hash) - return False - - else: - with self._flush_lock: - row = self._conn.execute("SELECT ratchet FROM ratchets WHERE destination_hash=?", (destination_hash,)).fetchone() - - if row != None and row[0] == ratchet: - # Discard any pending delete mark queued - # before this ratchet arrived - self._ratchet_deletes.discard(destination_hash) - return False - - self._ratchet_upserts[destination_hash] = (ratchet, now) - self._ratchet_deletes.discard(destination_hash) - return True - - def fetch_ratchet(self, destination_hash): - pending = self._ratchet_upserts.get(destination_hash) - if pending != None: return pending[0], pending[1] - if destination_hash in self._ratchet_deletes: return None - - with self._flush_lock: - row = self._conn.execute("SELECT ratchet, received FROM ratchets WHERE destination_hash=?", (destination_hash,)).fetchone() - - if row != None: return row[0], row[1] - - return None - - # Caller must hold Identity.known_destinations_lock - def mark_ratchet_deleted(self, destination_hash): - if self.read_only: return - self._ratchet_upserts.pop(destination_hash, None) - self._ratchet_deletes.add(destination_hash) - self._ratchet_quarantine.pop(destination_hash, None) - - def expire_ratchets(self, cutoff): - if self.read_only: return [] - - with self._flush_lock: - # Drop expired entries in pending as well - expired = set(row[0] for row in self._conn.execute("SELECT destination_hash FROM ratchets WHERE received 0: - self._conn.execute("BEGIN") - for i in range(0, len(expired), 4096): - self._conn.executemany("DELETE FROM ratchets WHERE destination_hash=?", [(h,) for h in list(expired)[i:i+4096]]) - self._conn.commit() - - return list(expired) - - def load_ratchets(self): - cursor = self._conn.execute("SELECT destination_hash, ratchet, received FROM ratchets") - while True: - rows = cursor.fetchmany(4096) - if not rows: break - for row in rows: yield row[0], row[1], row[2] - - def import_legacy_ratchets(self, dir_path, expiry_cutoff, known_destinations, ratchet_width=32): - from .vendor import umsgpack - imported = 0 - for filename in os.listdir(dir_path): - file_path = os.path.join(dir_path, filename) - try: - if not os.path.isfile(file_path): continue - with open(file_path, "rb") as rf: - ratchet_data = umsgpack.unpackb(rf.read()) - - destination_hash = bytes.fromhex(filename) - ratchet = ratchet_data["ratchet"]; received = ratchet_data["received"] - if len(ratchet) != ratchet_width: raise ValueError("Invalid ratchet width") - if received < expiry_cutoff: raise ValueError("Ratchet expired") - if destination_hash not in known_destinations: raise ValueError("Destination unknown") - - self._ratchet_upserts[destination_hash] = (ratchet, received) - imported += 1 - os.unlink(file_path) - - except Exception as e: - RNS.log(f"Could not import ratchet for {filename}: {e}", RNS.LOG_WARNING) - try: os.unlink(file_path) - except: pass - - pending = self._ratchet_upserts - self._ratchet_upserts = {} - self.apply(set(), set(), pending, set(), known_destinations) - - return imported - - def import_legacy(self, path): - from .vendor import umsgpack - with open(path, "rb") as file: legacy = umsgpack.load(file) - - rows = [] - now = time.time() - for destination_hash, entry in legacy.items(): - if len(entry) < 5: continue - entry = list(entry) - while len(entry) < 8: entry.append(None if len(entry) in (5, 7) else 0) - if entry[0] == None or entry[0] <= 0: entry[0] = now - rows.append(self.__entry_row(destination_hash, entry)) - - self._conn.execute("BEGIN") - for i in range(0, len(rows), 4096): self._conn.executemany("INSERT OR REPLACE INTO known_destinations (destination_hash, last_heard, packet_hash, public_key, app_data, used, stamp, stamp_value, lr_cost, identity_hash) VALUES (?,?,?,?,?,?,?,?,?,?)", rows[i:i+4096]) - self._conn.commit() - - return len(rows) - -class AnnounceCache: - - def __init__(self, db_path): - import sqlite3 - self.db_path = db_path - self._pending = {} - self._flush_lock = threading.Lock() - self._conn = sqlite3.connect(db_path, check_same_thread=False, isolation_level=None, cached_statements=0) - - self._conn.execute("PRAGMA auto_vacuum=INCREMENTAL") - self._conn.execute("PRAGMA journal_mode=WAL") - self._conn.execute("PRAGMA synchronous=NORMAL") - self._conn.execute("PRAGMA journal_size_limit=8388608") - self.__create_schema() - - def __create_schema(self): - self._conn.execute("""CREATE TABLE IF NOT EXISTS cached_announces ( - packet_hash BLOB PRIMARY KEY, - received REAL NOT NULL, - raw BLOB NOT NULL, - interface_reference TEXT)""") - - self._conn.execute("PRAGMA user_version = 1") - - def store(self, packet_hash, raw, interface_reference): - self._pending[packet_hash] = (time.time(), raw, interface_reference) - - def pending_count(self): - return len(self._pending) - - def fetch(self, packet_hash): - pending = self._pending.get(packet_hash) - if pending != None: return pending[1], pending[2] - - with self._flush_lock: - row = self._conn.execute("SELECT raw, interface_reference FROM cached_announces WHERE packet_hash=?", (packet_hash,)).fetchone() - - if row != None: return row[0], row[1] - - return None - - def flush(self): - with self._flush_lock: return self.__apply_pending() - - def __apply_pending(self): - pending = self._pending - self._pending = {} - if len(pending) == 0: return 0 - - try: - self._conn.execute("BEGIN") - items = list(pending.items()) - for i in range(0, len(items), 4096): - self._conn.executemany("INSERT INTO cached_announces VALUES (?,?,?,?) ON CONFLICT(packet_hash) DO UPDATE SET received=excluded.received, raw=excluded.raw, interface_reference=excluded.interface_reference", - [(packet_hash, *entry) for packet_hash, entry in items[i:i+4096]]) - self._conn.commit() - - except Exception: - # Re-mark everything as pending, so the changes - # are retried on the next flush, then propagate. - self._pending.update(pending) - self._conn.rollback() - raise - - return len(pending) - - def clean(self, active_hashes): - with self._flush_lock: - self.__apply_pending() - - try: - self._conn.execute("BEGIN") - self._conn.execute("DROP TABLE IF EXISTS temp.active_announces") - self._conn.execute("CREATE TEMP TABLE active_announces (packet_hash BLOB PRIMARY KEY)") - active_list = list(active_hashes) - for i in range(0, len(active_list), 4096): - self._conn.executemany("INSERT OR IGNORE INTO active_announces VALUES (?)", [(h,) for h in active_list[i:i+4096]]) - - changes_before = self._conn.total_changes - self._conn.execute("DELETE FROM cached_announces WHERE packet_hash NOT IN (SELECT packet_hash FROM active_announces)") - removed = self._conn.total_changes - changes_before - self._conn.commit() - - except Exception: - self._conn.rollback() - raise - - if removed > 0: self._conn.execute("PRAGMA incremental_vacuum") - - return removed - - def import_legacy(self, dir_path): - from .vendor import umsgpack - imported = 0 - for filename in os.listdir(dir_path): - file_path = os.path.join(dir_path, filename) - try: - if not os.path.isfile(file_path): continue - with open(file_path, "rb") as file: - cached_data = umsgpack.unpackb(file.read()) - - packet_hash = bytes.fromhex(filename) - interface_reference = cached_data[1] if len(cached_data) > 1 else None - self.store(packet_hash, cached_data[0], interface_reference) - imported += 1 - os.unlink(file_path) - - except Exception: - try: os.unlink(file_path) - except Exception: pass - - self.flush() - return imported - - def close(self): - if self._conn != None: - self._conn.close() - self._conn = None diff --git a/RNS/Transport.py b/RNS/Transport.py index 260950b3..ca4fab8f 100755 --- a/RNS/Transport.py +++ b/RNS/Transport.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -33,8 +33,6 @@ import gc import RNS import time import math -import ctypes -import ctypes.util import struct import inspect import threading @@ -44,8 +42,6 @@ from queue import Full, Empty from threading import Lock, Condition from .vendor import umsgpack as umsgpack from RNS.Interfaces.BackboneInterface import BackboneInterface -from RNS.Storage import AnnounceRateTable, PacketHashlist, AnnounceCache -from RNS.Stamps import generate_stamp, stamp_workblock, stamp_valid, stamp_value, quantize_cost, cancel_work class InboundQueues: __slots__ = ("_cond", "_queues", "_sizes", "_dropped", "_hw_mark") @@ -96,46 +92,6 @@ class InboundQueues: dropped = tuple(d for d in self._dropped) return (sum(heights), heights, dropped) -class WorkerQueues: - __slots__ = ("_cond", "_queues", "_sizes") - - def __init__(self, sizes): - self._cond = Condition() - self._queues = [deque() for _ in sizes] - self._sizes = sizes - - def put(self, priority, key, item): - with self._cond: - q = self._queues[priority] - - if key != None: - i = 0 - while i < len(q): - if q[i][0] == key: del q[i] - else: i += 1 - - if len(q) >= self._sizes[priority]: raise Full - - q.append((key, item)) - self._cond.notify() - - def get(self, block=True, timeout=None): - deadline = None if timeout is None else time.monotonic() + timeout - with self._cond: - while True: - # Scan queues in priority order - for q in self._queues: - if q: return q.popleft() - if not block: raise Empty - remaining = None if deadline is None else deadline - time.monotonic() - if remaining is not None and remaining <= 0: raise Empty - self._cond.wait(remaining) - - def qsize(self, priority=None): - with self._cond: - if priority != None: return len(self._queues[priority]) - else: return sum(len(q) for q in self._queues) - class Transport: """ Through static methods of this class you can interact with the @@ -167,6 +123,7 @@ class Transport: PATHFINDER_R = 1 # Retransmit retries PATHFINDER_G = 5 # Retry grace period PATHFINDER_RW = 0.5 # Random window for announce rebroadcast + PATHFINDER_E = 60*60*24*7 # Path expiration of one week AP_PATH_TIME = 60*60*24 # Path expiration of one day for Access Point paths ROAMING_PATH_TIME = 60*60*6 # Path expiration of 6 hours for Roaming paths @@ -188,55 +145,17 @@ class Transport: INBOUND_PR_QUEUE_LENGTH = 128 INBOUND_IL_QUEUE_LENGTH = 8 - STAMPS_ENABLED = True # Whether to check for and validate stamps on announces and path requests - STAMPS_ENFORCED = False # Whether to enforce stamp requirements - LR_STAMPS_ENFORCED = False # Whether to enforce link request stamp requirements - STAMP_DESTINATIONS = True # Whether to stamp destination announces emitted from this instance - STAMP_PRS = True # Whether to stamp path requests emitted from this instance - STAMP_LRS = True # Whether to stamp link requests emitted from this instance - ALWAYS_STAMP_LRS = False # Whether to stamp link requests even when no link cost is announced - STAMP_COST_CAP = 100 # Global hard cap on stamp cost to ensure search-space viability at 14-byte stamp sizes - LINK_COST_CAP = 40 # Global hard cap on link request cost, separate from detached stamps - DESTINATION_COST = 23.5 # Default required announce cost if no specifics configured or determined - DESTINATION_VALUE = 25.0 # Default target stamp value for emitted announces - PR_COST = 15.8 # Default required path request cost if no specifics configured or determined - PR_VALUE = 15.8 # Default target stamp value for emitted path requests - LR_COST = 12.5 # Default required link request cost if not explicitly announced or configured - LINK_STAMP_TIMEOUT = 15 # Default link request stamp generation timeout - PR_STAMP_TIMEOUT = 15 # Default path request stamp generation timeout - HOP_LIMITER = PATHFINDER_M - - STAMPER_PR_QUEUE_LENGTH = 32 # TODO: Provisional, wire to config - STAMPER_AN_QUEUE_LENGTH = 32 # TODO: Provisional, wire to config - STAMP_PR_PRIORITY = 0 - STAMP_DST_PRIORITY = 1 - stamper_thread = None - stamper_thread_lock = Lock() - stamp_queues = WorkerQueues((STAMPER_PR_QUEUE_LENGTH, STAMPER_AN_QUEUE_LENGTH)) - pr_stamp_cache = {} # Cache of generated path request stamps, keyed on stamp material - pr_stamp_cache_max = 256 # Maximum number of cached path request stamps - pr_stamp_cache_lock = Lock() - STATE_UNKNOWN = 0x00 STATE_UNRESPONSIVE = 0x01 STATE_RESPONSIVE = 0x02 LINK_TIMEOUT = RNS.Link.STALE_TIME * 1.25 ALLOW_LINK_PATH_REBALANCE = True - REVERSE_TIMEOUT = 3*60 # Reverse table entries are removed after 3 minutes - PATH_TIMEOUT = 60*60*24*7 # Path table entry retainment after last cryptographically verifiable liveness event - UNUSED_PATH_LINGER = 60*60*1.75 # Linger time for never used paths - UNUSED_PATH_LINGER_LEAF = 60*12 # Linger time for never used paths on non-transport instances - UNUSED_DESTINATION_LINGER = 60*6 # Linger time for pathless and never used destinations - PATH_POOL_UNUSED_MAX = 1536 # Max unused path table pool target, unused destinations are culled to reach it - PATH_POOL_UNUSED_MIN = 512 # Min unused path table pool target - PATH_POOL_USED_TARGET = 2048 # Unused path pool will start decreasing once this used target is reached - PATH_SLOW_BITRATE = 25000 # Bitrate threshold for interfaces to be considered slow - PATH_SLOW_LINGER_FACTOR = 10 # Linger time multiplier for never used paths on slow interfaces + REVERSE_TIMEOUT = 8*60 # Reverse table entries are removed after 8 minutes + DESTINATION_TIMEOUT = 60*60*24*7 # Destination table entries are removed if unused for one week + UNUSED_DESTINATION_LINGER = 6*60 # Linger time for pathless and never used destinations TUNNEL_TIMEOUT = 60*60*8 # Tunnel table entries are removed if unused for eight hours TUNNEL_PATH_TIMEOUT = 60*60*8 # Tunnel path table entries are removed if unused for eight hours - TUNNEL_RECONNECT_WINDOW = 60*10 # Tunnel table entries await interface reappearance for 10 minutes - RATE_TABLE_RETAIN = 60*60 # Default announce rate table retainment, increased dynamically MAX_RECEIPTS = 1024 # Maximum number of receipts to keep track of MAX_RATE_TIMESTAMPS = 16 # Maximum number of announce timestamps to keep per destination PERSIST_RANDOM_BLOBS = 32 # Maximum number of random blobs per destination to persist to disk @@ -250,8 +169,9 @@ class Transport: active_links = [] # Links that are active pending_links_map = {} # Link ID hash map of pending links active_links_map = {} # Link ID hash map of active links + packet_hashlist = set() # A list of packet hashes for duplicate detection + packet_hashlist_prev = set() receipts = [] # Receipts of all outgoing packets for proof processing - packet_hashlist = PacketHashlist(hash_width=RNS.Identity.HASHLENGTH//8) # Notes on memory usage: 1 megabyte of memory can store approximately # 55.100 path table entries or approximately 22.300 link table entries. @@ -261,20 +181,13 @@ class Transport: reverse_table = {} # A lookup table for storing packet hashes used to return proofs and replies link_table = {} # A lookup table containing hops for links held_announces = {} # A table containing temporarily held announce-table entries - announce_handlers = {} # A table storing externally registered announce handlers - pending_callbacks = [] # A table storing pending callbacks + announce_handlers = [] # A table storing externally registered announce handlers tunnels = {} # A table storing tunnels to other transport instances + announce_rate_table = {} # A table for keeping track of announce rates path_requests = {} # A table for storing path request timestamps inflight_path_requests = {} # A table for tracking in-flight path request path_states = {} # A table for keeping track of path states blackholed_identities = {} # A table for keeping track of blackholed identities - blocked_destination_types = {} # A table for keeping track of ignored destination types - allowed_destination_types = {} # A table for keeping track of allowed destination types - client_destination_types = {} # A table for keeping track of destination types needed by applications - destination_type_map = {} # Lookup table for destination type names - flagged_type_map = {} # Lookup table for flagged destination type names - required_destinations_only = False - announce_rate_table = AnnounceRateTable(max_timestamps=MAX_RATE_TIMESTAMPS) discovery_path_requests = {} # A table for keeping track of path requests on behalf of other nodes discovery_pr_tags = set() # A table for keeping track of tagged path requests @@ -347,58 +260,24 @@ class Transport: known_destinations_interval = 5*60 tables_last_culled = 0.0 tables_cull_interval = 5.0 - rate_table_last_culled = 0.0 - rate_table_cull_interval = 5.0 - rate_table_cull_chunk = 1024 - pool_size_last_checked = 0.0 - pool_size_check_interval = 5*60 - kd_flush_interval = 10.0 - announce_cache = None - ac_flush_interval = 15.0 - ac_last_flush = 0.0 - announce_cache_max_pending = 10000 - kd_last_flush = 0.0 interface_last_jobs = 0.0 interface_jobs_interval = 5.0 last_mgmt_announce = 0 - mem_trim_throttle = 300 - last_mem_trim = 0 - collect_throttle = 1440 - last_collect = 0 - mem_trim_pad = 0 - mem_trim_gate_mb = 8 - last_trim_rss_kb = -1 mgmt_announce_interval = 2*60*60 blackhole_last_checked = 0 blackhole_check_interval = 60 - should_collect = False - mem_dirty = False - unused_path_linger = None interface_announcer = None discovery_handler = None blackhole_updater = None traffic_rxb = 0 traffic_txb = 0 - link_rxb = 0 - link_txb = 0 - filtered_rxb = 0 - filtered_txb = 0 - filtered_arxc = 0 - announce_rxc = 0 - announce_txc = 0 announce_rxb = 0 announce_txb = 0 - pr_rxc = 0 - pr_txc = 0 pr_rxb = 0 pr_txb = 0 speed_rx = 0 speed_tx = 0 - link_speed_rx = 0 - link_speed_tx = 0 - filtered_speed_rx = 0 - filtered_speed_tx = 0 announce_speed_rx = 0 announce_speed_tx = 0 announce_freq_rx = 0 @@ -417,17 +296,26 @@ class Transport: identity = None network_identity = None - application_identity = None _identity = None _should_run = True - _unused_path_count_estimate = 0 @staticmethod def internal_identity(): return Transport._identity @staticmethod - def ensure_identity(): + def start(reticulum_instance): + Transport.owner = reticulum_instance + + Transport.INBOUND_DA_QUEUE_LENGTH = RNS.Reticulum.default_data_queue_length() or Transport.INBOUND_DA_QUEUE_LENGTH + Transport.INBOUND_AN_QUEUE_LENGTH = RNS.Reticulum.default_announce_queue_length() or Transport.INBOUND_AN_QUEUE_LENGTH + Transport.INBOUND_PR_QUEUE_LENGTH = RNS.Reticulum.default_pr_queue_length() or Transport.INBOUND_PR_QUEUE_LENGTH + Transport.INBOUND_IL_QUEUE_LENGTH = RNS.Reticulum.default_il_queue_length() or Transport.INBOUND_IL_QUEUE_LENGTH + Transport.inbound_queues = InboundQueues((Transport.INBOUND_DA_QUEUE_LENGTH, + Transport.INBOUND_AN_QUEUE_LENGTH, + Transport.INBOUND_PR_QUEUE_LENGTH, + Transport.INBOUND_IL_QUEUE_LENGTH)) + if Transport.identity == None: transport_identity_path = RNS.Reticulum.storagepath+"/transport_identity" if os.path.isfile(transport_identity_path): @@ -443,41 +331,13 @@ class Transport: Transport._identity = Transport.identity if not RNS.Reticulum.transport_enabled() and not RNS.Reticulum.static_transport_identity(): Transport._identity = Transport.identity - Transport.identity = RNS.Identity() + Transport.identity = RNS.Identity() RNS.log(f"Initialized ephemeral transport identity {RNS.prettyhexrep(Transport.identity.hash)}", RNS.LOG_VERBOSE) if RNS.sl(RNS.LOG_VERBOSE) else None if RNS.Reticulum.local_hops_delta(): Transport.local_hops_delta = (ord(os.urandom(1))%6)+2 - if Transport.application_identity == None: Transport.application_identity = RNS.Identity() - - @staticmethod - def start(reticulum_instance): - Transport.owner = reticulum_instance - - Transport.INBOUND_DA_QUEUE_LENGTH = RNS.Reticulum.default_data_queue_length() or Transport.INBOUND_DA_QUEUE_LENGTH - Transport.INBOUND_AN_QUEUE_LENGTH = RNS.Reticulum.default_announce_queue_length() or Transport.INBOUND_AN_QUEUE_LENGTH - Transport.INBOUND_PR_QUEUE_LENGTH = RNS.Reticulum.default_pr_queue_length() or Transport.INBOUND_PR_QUEUE_LENGTH - Transport.INBOUND_IL_QUEUE_LENGTH = RNS.Reticulum.default_il_queue_length() or Transport.INBOUND_IL_QUEUE_LENGTH - Transport.inbound_queues = InboundQueues((Transport.INBOUND_DA_QUEUE_LENGTH, - Transport.INBOUND_AN_QUEUE_LENGTH, - Transport.INBOUND_PR_QUEUE_LENGTH, - Transport.INBOUND_IL_QUEUE_LENGTH)) - - Transport.ensure_identity() - - if not RNS.Reticulum.transport_enabled() or Transport.owner.is_connected_to_shared_instance: - Transport.unused_path_linger = Transport.UNUSED_PATH_LINGER_LEAF - else: - Transport.unused_path_linger = Transport.UNUSED_PATH_LINGER - RNS.log(f"Unused path linger time is {RNS.prettytime(Transport.unused_path_linger)}", RNS.LOG_DEBUG) - - packet_hashlist_path = RNS.Reticulum.storagepath+"/packet_hashlist.raw" - announce_rate_table_path = RNS.Reticulum.storagepath+"/announce_rate_table" + packet_hashlist_path = RNS.Reticulum.storagepath+"/packet_hashlist.raw" if RNS.Reticulum.transport_enabled() and not Transport.owner.is_connected_to_shared_instance: - if os.path.isfile(announce_rate_table_path): - if Transport.announce_rate_table.load(announce_rate_table_path): RNS.log(f"Loaded announce rate table from storage", RNS.LOG_DEBUG) if RNS.LOG_DEBUG else None - else: RNS.log(f"Could not load announce rate table from storage, initialized empty", RNS.LOG_WARNING) - if os.path.isfile(packet_hashlist_path): try: with open(packet_hashlist_path, "rb") as file: @@ -514,7 +374,6 @@ class Transport: if RNS.Reticulum.publish_blackhole_enabled() and not Transport.owner.is_connected_to_shared_instance: Transport.blackhole_destination = RNS.Destination(Transport.identity, RNS.Destination.IN, RNS.Destination.SINGLE, Transport.APP_NAME, "info", "blackhole") - Transport.blackhole_destination.set_link_cost(5.25) Transport.blackhole_destination.register_request_handler("/list", response_generator = Transport.blackhole_list_handler, allow=RNS.Destination.ALLOW_ALL) Transport.mgmt_destinations.append(Transport.blackhole_destination) Transport.mgmt_hashes.append(Transport.blackhole_destination.hash) @@ -534,13 +393,6 @@ class Transport: # Defer cleaning known destinations Transport.destinations_last_cleaned = time.time() - # Defer path table unused pool cull - Transport.pool_size_last_checked = time.time() - - # Defer memory trim - Transport.last_collect = time.time() - Transport.last_mem_trim = time.time() - # Defer sending management announces for 15 seconds Transport.last_mgmt_announce = time.time() - Transport.mgmt_announce_interval + 15 @@ -549,10 +401,6 @@ class Transport: threading.Thread(target=Transport.count_traffic_loop, daemon=True).start() # Load transport-related data - if not Transport.owner.is_connected_to_shared_instance: Transport.init_announce_cache() - - if Transport.HOP_LIMITER != Transport.PATHFINDER_M: RNS.log(f"Transport hop limit set to {Transport.HOP_LIMITER}", RNS.LOG_VERBOSE) - if RNS.Reticulum.transport_enabled(): path_table_path = RNS.Reticulum.storagepath+"/destination_table" tunnel_table_path = RNS.Reticulum.storagepath+"/tunnels" @@ -564,8 +412,6 @@ class Transport: serialised_destinations = umsgpack.unpackb(file.read()) file.close() - filtered = 0 - now = time.time() for serialised_entry in serialised_destinations: destination_hash = serialised_entry[0] @@ -577,12 +423,11 @@ class Transport: random_blobs = serialised_entry[5] receiving_interface = Transport.find_interface_from_hash(serialised_entry[6]) announce_packet = Transport.get_cached_packet(serialised_entry[7], packet_type="announce") - used = serialised_entry[8] if len(serialised_entry) > 8 else now blackholed = False if len(Transport.blackholed_identities) > 0: path_identity = RNS.Identity.recall(destination_hash, _no_use=True) - if path_identity and path_identity.hash in Transport.blackholed_identities: blackholed = True + if path_identity in Transport.blackholed_identities: blackholed = True del path_identity if announce_packet != None and receiving_interface != None and blackholed == False: @@ -592,32 +437,27 @@ class Transport: # over an interface. It is cached with it's non- # increased hop-count. announce_packet.hops += 1 - name_hash = announce_packet.data[RNS.Identity.KEYSIZE//8:RNS.Identity.KEYSIZE//8+RNS.Identity.NAME_HASH_LENGTH//8] - if name_hash in Transport.blocked_destination_types or Transport.required_destinations_only and name_hash not in Transport.allowed_destination_types: - filtered += 1 - continue - with Transport.path_table_lock: - Transport.path_table[destination_hash] = [timestamp, received_from, hops, expires, - random_blobs, receiving_interface, - announce_packet.packet_hash, used] - - RNS.log(f"Loaded path table entry for {RNS.prettyhexrep(destination_hash)} from storage", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None + Transport.path_table[destination_hash] = [timestamp, received_from, hops, expires, random_blobs, receiving_interface, announce_packet.packet_hash] + RNS.log("Loaded path table entry for "+RNS.prettyhexrep(destination_hash)+" from storage", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None else: - RNS.log(f"Could not reconstruct path table entry from storage for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None - if announce_packet == None: RNS.log("The announce packet could not be loaded from cache", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None - if receiving_interface == None: RNS.log("The interface is no longer available", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None - if blackholed: RNS.log("The associated identity is blackholed", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None + RNS.log("Could not reconstruct path table entry from storage for "+RNS.prettyhexrep(destination_hash), RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None + if announce_packet == None: + RNS.log("The announce packet could not be loaded from cache", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None + if receiving_interface == None: + RNS.log("The interface is no longer available", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None + if blackholed: + RNS.log("The associated identity is blackholed", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None if len(Transport.path_table) == 1: specifier = "entry" else: specifier = "entries" - RNS.log(f"Loaded {len(Transport.path_table)} path table {specifier} from storage{', '+str(filtered)+' filtered' if filtered else ''}", RNS.LOG_VERBOSE) if RNS.sl(RNS.LOG_VERBOSE) else None - garbage_collect() + RNS.log("Loaded "+str(len(Transport.path_table))+" path table "+specifier+" from storage", RNS.LOG_VERBOSE) if RNS.sl(RNS.LOG_VERBOSE) else None + gc.collect() except Exception as e: - RNS.log(f"Could not load path table from storage, the contained exception was: {e}", RNS.LOG_ERROR) - garbage_collect() + RNS.log("Could not load destination table from storage, the contained exception was: "+str(e), RNS.LOG_ERROR) + gc.collect() if os.path.isfile(tunnel_table_path) and not Transport.owner.is_connected_to_shared_instance: serialised_tunnels = [] @@ -626,16 +466,12 @@ class Transport: serialised_tunnels = umsgpack.unpackb(file.read()) file.close() - now = time.time() for serialised_tunnel in serialised_tunnels: tunnel_id = serialised_tunnel[IDX_TT_TUNNEL_ID] interface_hash = serialised_tunnel[IDX_TT_IF] serialised_paths = serialised_tunnel[IDX_TT_PATHS] expires = serialised_tunnel[IDX_TT_EXPIRES] - if expires > now+Transport.TUNNEL_RECONNECT_WINDOW: - expires = now+Transport.TUNNEL_RECONNECT_WINDOW - tunnel_paths = {} for serialised_entry in serialised_paths: destination_hash = serialised_entry[0] @@ -646,7 +482,6 @@ class Transport: random_blobs = list(set(serialised_entry[5])) receiving_interface = Transport.find_interface_from_hash(serialised_entry[6]) announce_packet = Transport.get_cached_packet(serialised_entry[7], packet_type="announce") - used = serialised_entry[8] if len(serialised_entry) > 8 else now if announce_packet != None: if not announce_packet.unpack(): continue @@ -656,7 +491,7 @@ class Transport: # increased hop-count. announce_packet.hops += 1 - tunnel_path = [timestamp, received_from, hops, path_expires, random_blobs, receiving_interface, announce_packet.packet_hash, used] + tunnel_path = [timestamp, received_from, hops, path_expires, random_blobs, receiving_interface, announce_packet.packet_hash] tunnel_paths[destination_hash] = tunnel_path if len(tunnel_paths) > 0: @@ -667,11 +502,11 @@ class Transport: else: specifier = "entries" RNS.log("Loaded "+str(len(Transport.tunnels))+" tunnel table "+specifier+" from storage", RNS.LOG_VERBOSE) if RNS.sl(RNS.LOG_VERBOSE) else None - garbage_collect() + gc.collect() except Exception as e: RNS.log("Could not load tunnel table from storage, the contained exception was: "+str(e), RNS.LOG_ERROR) - garbage_collect() + gc.collect() if RNS.Reticulum.probe_destination_enabled(): Transport.probe_destination = RNS.Destination(Transport.identity, RNS.Destination.IN, RNS.Destination.SINGLE, Transport.APP_NAME, "probe") @@ -693,31 +528,21 @@ class Transport: if Transport.USE_INBOUND_QUEUE: threading.Thread(target=Transport.inbound_job, daemon=True).start() if Transport.USE_OUTBOUND_QUEUE: threading.Thread(target=Transport.outbound_job, daemon=True).start() - # Spawn the stamp worker - Transport.ensure_stamper() - Transport.ready = True # Synthesize tunnels for any interfaces wanting it - # TODO: This is, in practice deprecated, since - # interfaces requiring tunnels are now early- - # init synthesizing on connect. Clean up at - # opportune moment. for interface in Transport.interfaces: interface.tunnel_id = None if hasattr(interface, "wants_tunnel") and interface.wants_tunnel: Transport.synthesize_tunnel(interface) - garbage_collect() + gc.collect() @staticmethod def add_interface(interface): with Transport.interfaces_lock: if not interface in Transport.interfaces: Transport.interfaces.append(interface) - if interface.announce_rate_target and interface.announce_rate_target > Transport.RATE_TABLE_RETAIN: - Transport.RATE_TABLE_RETAIN = interface.announce_rate_target - RNS.log(f"Increased announce rate table retainment time to {RNS.prettytime(Transport.RATE_TABLE_RETAIN)}", RNS.LOG_DEBUG) @staticmethod def remove_interface(interface): @@ -764,8 +589,7 @@ class Transport: @staticmethod def count_traffic_loop(): - rxp = 0; txp = 0; cts = None - lrxb = 0; ltxb = 0; + rxp = 0; txp = 0; cts = None while True: time.sleep(1) @@ -773,19 +597,17 @@ class Transport: rxb = 0; txb = 0; rxs = 0; txs = 0; arxb = 0; atxb = 0; arxs = 0; atxs = 0; prxb = 0; ptxb = 0; prxs = 0; ptxs = 0; - frxb = 0; ftxb = 0; frxs = 0; ftxs = 0; iafreq = 0; oafreq = 0; ipfreq = 0; opfreq = 0 - for interface in Transport.interfaces.copy(): - if interface.parent_interface == None: - if interface.is_local_shared_instance: continue + for interface in Transport.interfaces: + if not hasattr(interface, "parent_interface") or interface.parent_interface == None: + if hasattr(interface, "is_local_shared_instance"): continue if hasattr(interface, "transport_traffic_counter"): - now = time.monotonic() + now = time.time() irxb = interface.rxb; itxb = interface.txb iarxb = interface.arxb; iatxb = interface.atxb iprxb = interface.prxb; iptxb = interface.ptxb - ifrxb = interface.frxb; iftxb = interface.ftxb tc = interface.transport_traffic_counter ts_diff = now - tc["ts"] @@ -793,7 +615,6 @@ class Transport: rx_diff = irxb - tc["rxb"]; tx_diff = itxb - tc["txb"] arx_diff = iarxb - tc["arxb"]; atx_diff = iatxb - tc["atxb"] prx_diff = iprxb - tc["prxb"]; ptx_diff = iptxb - tc["ptxb"] - frx_diff = ifrxb - tc["frxb"]; ftx_diff = iftxb - tc["ftxb"] rxb += rx_diff; crxs = (rx_diff*8)/ts_diff txb += tx_diff; ctxs = (tx_diff*8)/ts_diff @@ -801,8 +622,6 @@ class Transport: atxb += atx_diff; catxs = (atx_diff*8)/ts_diff prxb += prx_diff; cprxs = (prx_diff*8)/ts_diff ptxb += ptx_diff; cptxs = (ptx_diff*8)/ts_diff - frxb += frx_diff; cfrxs = (frx_diff*8)/ts_diff - ftxb += ftx_diff; cftxs = (ftx_diff*8)/ts_diff iafreq += interface.incoming_announce_frequency() oafreq += interface.outgoing_announce_frequency() @@ -815,34 +634,25 @@ class Transport: interface.current_atx_speed = catxs; atxs += catxs interface.current_prx_speed = cprxs; prxs += cprxs interface.current_ptx_speed = cptxs; ptxs += cptxs - interface.current_frx_speed = cfrxs; frxs += cfrxs - interface.current_ftx_speed = cftxs; ftxs += cftxs tc["ts"] = now tc["rxb"] = irxb; tc["txb"] = itxb tc["arxb"] = iarxb; tc["atxb"] = iatxb tc["prxb"] = iprxb; tc["ptxb"] = iptxb - tc["frxb"] = ifrxb; tc["ftxb"] = iftxb else: - interface.transport_traffic_counter = { "ts": time.monotonic(), "rxb": interface.rxb, "txb": interface.txb, + interface.transport_traffic_counter = { "ts": time.time(), "rxb": interface.rxb, "txb": interface.txb, "arxb": interface.arxb, "atxb": interface.atxb, - "prxb": interface.prxb, "ptxb": interface.ptxb, - "frxb": interface.frxb, "ftxb": interface.ftxb } - - if not Transport.start_time: rpps = 0; tpps = 0; lrxs = 0; ltxs = 0 + "prxb": interface.prxb, "ptxb": interface.ptxb } + if not Transport.start_time: rpps = 0; tpps = 0 else: if not cts: ts = Transport.start_time else: ts = cts - cts = time.monotonic(); td = cts - ts + cts = time.time(); td = cts - ts rpps = (Transport.rx_packets - rxp) / td tpps = (Transport.tx_packets - txp) / td rxp = Transport.rx_packets txp = Transport.tx_packets - lrxs = (Transport.link_rxb - lrxb)*8 / td - ltxs = (Transport.link_txb - ltxb)*8 / td - lrxb = Transport.link_rxb - ltxb = Transport.link_txb Transport.rx_pps = int(round(rpps)) Transport.tx_pps = int(round(tpps)) @@ -850,12 +660,6 @@ class Transport: Transport.traffic_txb += txb Transport.speed_rx = rxs Transport.speed_tx = txs - Transport.link_speed_rx = lrxs - Transport.link_speed_tx = ltxs - Transport.filtered_rxb += frxb - Transport.filtered_txb += ftxb - Transport.filtered_speed_rx = frxs - Transport.filtered_speed_tx = ftxs Transport.announce_rxb += arxb Transport.announce_txb += atxb Transport.announce_speed_rx = arxs @@ -871,10 +675,6 @@ class Transport: except Exception as e: RNS.log(f"An error occurred while counting interface traffic: {e}", RNS.LOG_ERROR) - ################## - # Transport Jobs # - ################## - @staticmethod def jobloop(): while (Transport._should_run): @@ -889,6 +689,8 @@ class Transport: try: with Transport.jobs_lock: + should_collect = False + # Process active and pending link lists if time.time() > Transport.links_last_checked+Transport.links_check_interval: @@ -899,9 +701,7 @@ class Transport: # If we are not a Transport Instance, finding a pending link # that was never activated will trigger an expiry of the path # to the destination, and an attempt to rediscover the path. - path_entry = Transport.path_table.get(link.destination.hash, None) - local_destination = path_entry and path_entry[IDX_PT_HOPS] == 0 - if not local_destination and not RNS.Reticulum.transport_enabled(): + if not RNS.Reticulum.transport_enabled(): Transport.expire_path(link.destination.hash) # If we are connected to a shared instance, it will take @@ -946,7 +746,7 @@ class Transport: culled_receipt = Transport.receipts.pop(0) culled_receipt.timeout = -1 culled_receipt.check_timeout() - Transport.should_collect = True + should_collect = True # TODO: Actually, this whole thing might need re- # thinking a bit, but may require moving receipts @@ -982,7 +782,6 @@ class Transport: packet = announce_entry[IDX_AT_PACKET] block_rebroadcasts = announce_entry[IDX_AT_BLCK_RBRD] attached_interface = announce_entry[IDX_AT_ATTCHD_IF] - blocked_interfaces = announce_entry[IDX_AT_DEDUP_IFS] announce_context = RNS.Packet.NONE if block_rebroadcasts: announce_context = RNS.Packet.PATH_RESPONSE announce_data = packet.data @@ -1004,7 +803,6 @@ class Transport: transport_type = Transport.TRANSPORT, transport_id = Transport.identity.hash, attached_interface = attached_interface, - blocked_interfaces = blocked_interfaces or None, context_flag = packet.context_flag) new_packet.hops = announce_entry[4] @@ -1030,9 +828,10 @@ class Transport: Transport.announces_last_checked = time.time() - # Swap the packet hashlist generations if it has reached its max size + # Cull the packet hashlist if it has reached its max size if len(Transport.packet_hashlist) > Transport.hashlist_maxsize//2: - Transport.packet_hashlist.swap() + Transport.packet_hashlist_prev = Transport.packet_hashlist + Transport.packet_hashlist = set() # Cull invalidated path requests if time.time() > Transport.pending_prs_last_checked+Transport.pending_prs_check_interval: @@ -1053,24 +852,6 @@ class Transport: Transport.discovery_pr_tags_prev = Transport.discovery_pr_tags Transport.discovery_pr_tags = set() - # Incrementally cull stale announce rate table entries - if time.time() > Transport.rate_table_last_culled+Transport.rate_table_cull_interval: - with Transport.announce_rate_table_lock: - Transport.announce_rate_table.cull(time.time(), Transport.RATE_TABLE_RETAIN, - Transport.rate_table_cull_chunk, Transport.rate_table_cull_chunk) - - Transport.rate_table_last_culled = time.time() - - # Flush pending known destinations to storage - if RNS.Identity.known_destinations_store != None and time.time() > Transport.kd_last_flush+Transport.kd_flush_interval: - Transport.kd_last_flush = time.time() - RNS.Identity.flush_known_destinations() - - # Flush pending cached announces to storage - if Transport.announce_cache != None and (time.time() > Transport.ac_last_flush+Transport.ac_flush_interval or Transport.announce_cache.pending_count() > Transport.announce_cache_max_pending): - Transport.ac_last_flush = time.time() - Transport.announce_cache.flush() - if time.time() > Transport.tables_last_culled + Transport.tables_cull_interval: # Remove unneeded path state entries stale_path_states = [] @@ -1102,7 +883,6 @@ class Transport: else: if time.time() > link_entry[IDX_LT_PROOF_TMO]: stale_links.append(link_id) - blocked_if = None last_path_request = 0 with Transport.path_requests_lock: @@ -1124,9 +904,8 @@ class Transport: # attempt to rediscover a path to the destination, if this # has not already happened recently. elif not path_request_throttle and lr_taken_hops == 0: - if not Transport.hops_to(link_entry[IDX_LT_DSTHASH]) == 0: - RNS.log("Trying to rediscover path for "+RNS.prettyhexrep(link_entry[IDX_LT_DSTHASH])+" since an attempted local client link was never established", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None - path_request_conditions = True + RNS.log("Trying to rediscover path for "+RNS.prettyhexrep(link_entry[IDX_LT_DSTHASH])+" since an attempted local client link was never established", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None + path_request_conditions = True # If the link destination was previously only 1 hop # away, this likely means that it was local to one @@ -1178,58 +957,25 @@ class Transport: # Cull the path table stale_paths = [] with Transport.path_table_lock: - now = time.time() - check_unused = now > Transport.pool_size_last_checked+Transport.pool_size_check_interval - unused_paths = [] - used_count = 0 - unused_count = 0 - for destination_hash in Transport.path_table: - path_entry = Transport.path_table[destination_hash] - attached_interface = path_entry[IDX_PT_RVCD_IF] - path_timestamp = path_entry[IDX_PT_TIMESTAMP] - path_expiry = path_entry[IDX_PT_EXPIRES] - path_used = path_entry[IDX_PT_USED] - path_hops = path_entry[IDX_PT_HOPS] + destination_entry = Transport.path_table[destination_hash] + attached_interface = destination_entry[IDX_PT_RVCD_IF] - interface_bitrate = getattr(attached_interface, "bitrate", None) - slow_interface = interface_bitrate != None and 0 < interface_bitrate < Transport.PATH_SLOW_BITRATE + if attached_interface != None and hasattr(attached_interface, "mode") and attached_interface.mode == RNS.Interfaces.Interface.Interface.MODE_ACCESS_POINT: + destination_expiry = destination_entry[IDX_PT_TIMESTAMP] + Transport.AP_PATH_TIME + elif attached_interface != None and hasattr(attached_interface, "mode") and attached_interface.mode == RNS.Interfaces.Interface.Interface.MODE_ROAMING: + destination_expiry = destination_entry[IDX_PT_TIMESTAMP] + Transport.ROAMING_PATH_TIME + else: + destination_expiry = destination_entry[IDX_PT_TIMESTAMP] + Transport.DESTINATION_TIMEOUT - if path_used: used_count += 1 - else: unused_count += 1 - - if check_unused and not path_used: - unused_paths.append(((1 if slow_interface else 0), path_expiry, destination_hash)) - - if now > path_expiry and path_hops != 0: + if time.time() > destination_expiry: stale_paths.append(destination_hash) - Transport.should_collect = True - RNS.log(f"Path to {RNS.prettyhexrep(destination_hash)} timed out and was removed", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None + should_collect = True + RNS.log("Path to "+RNS.prettyhexrep(destination_hash)+" timed out and was removed", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None elif not attached_interface in Transport.interfaces: stale_paths.append(destination_hash) - Transport.should_collect = True - RNS.log(f"Path to {RNS.prettyhexrep(destination_hash)} was removed since the attached interface no longer exists", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None - elif path_hops != 0 and path_used == 0 and now > path_timestamp + (Transport.unused_path_linger * (Transport.PATH_SLOW_LINGER_FACTOR if slow_interface else 1)): - stale_paths.append(destination_hash) - Transport.should_collect = True - RNS.log(f"Removing never used path to {RNS.prettyhexrep(destination_hash)}", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None - elif path_hops > Transport.HOP_LIMITER: - stale_paths.append(destination_hash) - Transport.should_collect = True - RNS.log(f"Removing excessive hops path to {RNS.prettyhexrep(destination_hash)}", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None - - unused_trim = max(0, used_count-Transport.PATH_POOL_USED_TARGET) - unused_pool_target = max(Transport.PATH_POOL_UNUSED_MIN, Transport.PATH_POOL_UNUSED_MAX-unused_trim) - if len(unused_paths) > unused_pool_target: - cull_count = len(unused_paths) - unused_pool_target - RNS.log(f"Culling {cull_count} never used path table entries to reach pool size target {unused_pool_target}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - unused_paths.sort() - for cull_entry in unused_paths[:cull_count]: - stale_paths.append(cull_entry[2]) - - if check_unused: - Transport._unused_path_count_estimate = len(unused_paths) - Transport.pool_size_last_checked = time.time() + should_collect = True + RNS.log("Path to "+RNS.prettyhexrep(destination_hash)+" was removed since the attached interface no longer exists", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None # Cull the pending path requests table stale_path_requests = [] @@ -1263,7 +1009,7 @@ class Transport: if time.time() > entry["timeout"]: stale_discovery_path_requests.append(destination_hash) - Transport.should_collect = True + should_collect = True RNS.log("Waiting path request for "+RNS.prettyhexrep(destination_hash)+" timed out and was removed", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None # Cull the tunnel table @@ -1274,17 +1020,16 @@ class Transport: expires = tunnel_entry[IDX_TT_EXPIRES] if expires > time.time() + Transport.TUNNEL_TIMEOUT*2: - stale_tunnels.append(tunnel_id); Transport.should_collect = True + stale_tunnels.append(tunnel_id); should_collect = True RNS.log("Tunnel "+RNS.prettyhexrep(tunnel_id)+" with excessive expiry was removed", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None elif time.time() > expires: - stale_tunnels.append(tunnel_id); Transport.should_collect = True + stale_tunnels.append(tunnel_id); should_collect = True RNS.log("Tunnel "+RNS.prettyhexrep(tunnel_id)+" timed out and was removed", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None else: if tunnel_entry[IDX_TT_IF] and not tunnel_entry[IDX_TT_IF] in Transport.interfaces: RNS.log(f"Removing non-existent tunnel interface {tunnel_entry[IDX_TT_IF]}", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None - tunnel_entry[IDX_TT_EXPIRES] = time.time() + Transport.TUNNEL_RECONNECT_WINDOW tunnel_entry[IDX_TT_IF] = None stale_tunnel_paths = [] @@ -1293,7 +1038,7 @@ class Transport: tunnel_path_entry = tunnel_paths[tunnel_path] if time.time() > tunnel_path_entry[0] + Transport.TUNNEL_PATH_TIMEOUT: - stale_tunnel_paths.append(tunnel_path); Transport.should_collect = True + stale_tunnel_paths.append(tunnel_path); should_collect = True RNS.log("Tunnel path to "+RNS.prettyhexrep(tunnel_path)+" timed out and was removed", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None else: @@ -1308,7 +1053,7 @@ class Transport: tunnel_announce_timebase = Transport.timebase_from_random_blobs(random_blobs) if current_path_timebase > tunnel_announce_timebase: - stale_tunnel_paths.append(tunnel_path); Transport.should_collect = True + stale_tunnel_paths.append(tunnel_path); should_collect = True RNS.log("Tunnel path to "+RNS.prettyhexrep(tunnel_path)+" was removed due to more recent active path", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None for tunnel_path in stale_tunnel_paths: @@ -1410,7 +1155,6 @@ class Transport: interface.should_ingress_limit_pr() interface.process_held_announces() if interface.phy_keepalive: interface.send_keepalive() - if interface.wants_tunnel and interface.online: Transport.synthesize_tunnel(interface) Transport.interface_last_jobs = time.time() except Exception as e: RNS.log(f"Error while processing held per-interface announces: {e}", RNS.LOG_WARNING) @@ -1468,20 +1212,7 @@ class Transport: except Exception as e: RNS.log(f"Error while checking blackholed identities: {e}", RNS.LOG_ERROR) - # Launch deferred callbacks - while Transport.pending_callbacks: - try: Transport.pending_callbacks.pop(0).start() - except Exception as e: RNS.log(f"Could not launch pending callback: {e}", RNS.LOG_WARNING) - - if Transport.should_collect: - Transport.mem_dirty = True - if time.time() > Transport.last_collect+Transport.collect_throttle: - garbage_collect() - - trim_surplus = _trim_due(time.time()) - if trim_surplus is not None: - Transport.mem_dirty = False; trim_heap() - Transport.last_mem_trim = time.time() + if should_collect: gc.collect() except Exception as e: RNS.log("An exception occurred while running Transport jobs.", RNS.LOG_ERROR) @@ -1508,69 +1239,35 @@ class Transport: RNS.log(f"Error while finalizing transport jobs: {e}", RNS.LOG_ERROR) RNS.trace_exception(e) + discovery_pr_tx_throttle = 0.5 + discovery_pr_tx_lock = Lock() + discovery_pr_handle_lock = Lock() + pending_discovery_prs = deque(maxlen=max_queued_discovery_prs) + @staticmethod + def handle_disovery_path_requests(): + if Transport.discovery_pr_handle_lock.locked(): return + with Transport.discovery_pr_handle_lock: + while len(Transport.pending_discovery_prs): + time.sleep(Transport.discovery_pr_tx_throttle) + destination_hash = None + blocked_if = None + with Transport.discovery_pr_tx_lock: + entry = Transport.pending_discovery_prs.popleft() + destination_hash = entry[0] + blocked_if = entry[1] + + if destination_hash: + if blocked_if == None: Transport.request_path(destination_hash) + else: + for interface in Transport.interfaces: + if interface != blocked_if: Transport.request_path(destination_hash, on_interface=interface) + else: pass + + @staticmethod def handle_outgoing_announces(outgoing): for packet in sorted(outgoing, key=lambda p: p.hops): packet.send() - ######################### - # Stamp Work Management # - ######################### - - @staticmethod - def ensure_stamper(): - if Transport.stamper_thread != None and Transport.stamper_thread.is_alive(): return - with Transport.stamper_thread_lock: - if Transport.stamper_thread == None or not Transport.stamper_thread.is_alive(): - Transport.stamper_thread = threading.Thread(target=Transport.stamper_job, daemon=True) - RNS.log("Starting stamp worker", RNS.LOG_DEBUG) - Transport.stamper_thread.start() - - @staticmethod - def enqueue_stamped_announce(destination, app_data=None, path_response=False, attached_interface=None, tag=None): - priority = Transport.STAMP_PR_PRIORITY if path_response else Transport.STAMP_DST_PRIORITY - key = None if path_response else destination.hash - - try: Transport.stamp_queues.put(priority, key, ("announce", destination, app_data, path_response, attached_interface, tag)) - except Full: - RNS.log(f"Stamp queue full, dropping announce for {RNS.prettyhexrep(destination.hash)}", RNS.LOG_DEBUG) - return - - Transport.ensure_stamper() - - @staticmethod - def enqueue_stamped_pr(destination_hash, on_interface=None, tag=None, recursive=False): - key = destination_hash if on_interface == None else destination_hash+on_interface.get_hash() - try: Transport.stamp_queues.put(Transport.STAMP_PR_PRIORITY, key, ("pr", destination_hash, on_interface, tag, recursive)) - except Full: - RNS.log(f"Stamp queue full, dropping path request for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_DEBUG) - return - - Transport.ensure_stamper() - - @staticmethod - def stamper_job(): - while Transport._should_run: - try: key, job = Transport.stamp_queues.get(block=True, timeout=1) - except Empty: continue - job_type = job[0] - - try: - if job_type == "pr": - jt, destination_hash, on_interface, tag, recursive = job - Transport.stamp_path_request(destination_hash, on_interface=on_interface, tag=tag, recursive=recursive) - else: - jt, destination, app_data, path_response, attached_interface, tag = job - destination._announce(app_data=app_data, path_response=path_response, attached_interface=attached_interface, tag=tag, send=True) - - except Exception as e: - target = RNS.prettyhexrep(job[1]) if job_type == "pr" else RNS.prettyhexrep(job[1].hash) - RNS.log(f"Error while stamping and emitting {job_type} for {target}: {e}", RNS.LOG_ERROR) - RNS.trace_exception(e) - - ############ - # Core I/O # - ############ - @staticmethod def handle_outgoing_ifac(interface, raw): # Calculate packet access code @@ -1626,8 +1323,9 @@ class Transport: @staticmethod def transmit(interface, raw): try: - if interface.ifac_identity != None: interface.process_outgoing(Transport.handle_outgoing_ifac(interface, raw)) - else: interface.process_outgoing(raw) + if hasattr(interface, "ifac_identity") and interface.ifac_identity != None: + interface.process_outgoing(Transport.handle_outgoing_ifac(interface, raw)) + else: interface.process_outgoing(raw) Transport.tx_packets += 1 except Exception as e: RNS.log("Error while transmitting on "+str(interface)+". The contained exception was: "+str(e), RNS.LOG_ERROR) @@ -1689,7 +1387,6 @@ class Transport: return False outbound_interface = path_entry[IDX_PT_RVCD_IF] - path_entry[IDX_PT_USED] = outbound_time # If there's more than one hop to the destination, and we know # a path, we insert the packet into transport by adding the next @@ -1706,6 +1403,7 @@ class Transport: new_raw += packet.raw[2:] packet_sent(packet) Transport.transmit(outbound_interface, new_raw) + path_entry[IDX_PT_TIMESTAMP] = time.time() sent = True # In the special case where we are connected to a local shared @@ -1725,6 +1423,7 @@ class Transport: new_raw += packet.raw[2:] packet_sent(packet) Transport.transmit(outbound_interface, new_raw) + path_entry[IDX_PT_TIMESTAMP] = time.time() sent = True # If none of the above applies, we know the destination is @@ -1744,9 +1443,7 @@ class Transport: else: stored_hash = False if packet.attached_interface: potential_interfaces = [packet.attached_interface] - else: - if not packet.blocked_interfaces: potential_interfaces = Transport.interfaces - else: potential_interfaces = [interface for interface in Transport.interfaces if not interface in packet.blocked_interfaces] + else: potential_interfaces = Transport.interfaces for interface in potential_interfaces: if interface.OUT and interface.online: @@ -1823,6 +1520,11 @@ class Transport: # allowed, and do not conform to bandwidth caps. # TODO: Rethink whether this is actually optimal. if packet.hops > 0: + + if not hasattr(interface, "announce_cap"): interface.announce_cap = RNS.Reticulum.ANNOUNCE_CAP + if not hasattr(interface, "announce_allowed_at"): interface.announce_allowed_at = 0 + if not hasattr(interface, "announce_queue"): interface.announce_queue = [] + queued_announces = True if len(interface.announce_queue) > 0 else False if not queued_announces and outbound_time > interface.announce_allowed_at and interface.bitrate != None and interface.bitrate != 0: tx_time = (len(packet.raw)*8) / interface.bitrate @@ -1867,12 +1569,18 @@ class Transport: timer.start() if RNS.sl(RNS.LOG_EXTREME): - RNS.log(f"Added announce to queue (height {len(interface.announce_queue)}) on {interface} for processing in {RNS.prettyshorttime(wait_time, compact=True, tight=True)}", RNS.LOG_EXTREME) + if wait_time < 1: wait_time_str = str(round(wait_time*1000,2))+"ms" + else: wait_time_str = str(round(wait_time*1,2))+"s" + ql_str = str(len(interface.announce_queue)) + RNS.log("Added announce to queue (height "+ql_str+") on "+str(interface)+" for processing in "+wait_time_str, RNS.LOG_EXTREME) else: if RNS.sl(RNS.LOG_EXTREME): wait_time = max(interface.announce_allowed_at - time.time(), 0) - RNS.log(f"Added announce to queue (height {len(interface.announce_queue)}) on {interface} for processing in {RNS.prettyshorttime(wait_time, compact=True, tight=True)}", RNS.LOG_EXTREME) + if wait_time < 1: wait_time_str = str(round(wait_time*1000,2))+"ms" + else: wait_time_str = str(round(wait_time*1,2))+"s" + ql_str = str(len(interface.announce_queue)) + RNS.log("Added announce to queue (height "+ql_str+") on "+str(interface)+" for processing in "+wait_time_str, RNS.LOG_EXTREME) else: pass @@ -1889,8 +1597,8 @@ class Transport: else: raw = Transport.mangle_hops(packet.raw, Transport.local_hops_delta, transport_insert=packet.header_type==RNS.Packet.HEADER_1) Transport.transmit(interface, raw) - if packet.packet_type == RNS.Packet.ANNOUNCE: interface.sent_announce(size=len(raw)); Transport.announce_txc += 1 - if packet.destination.type == RNS.Destination.PLAIN and packet.is_outbound_pr: interface.sent_path_request(size=len(raw)); Transport.pr_txc += 1 + if packet.packet_type == RNS.Packet.ANNOUNCE: interface.sent_announce(size=len(raw)) + if packet.destination.type == RNS.Destination.PLAIN and packet.is_outbound_pr: interface.sent_path_request(size=len(raw)) packet_sent(packet) sent = True @@ -1957,10 +1665,11 @@ class Transport: if packet.receiving_interface: packet.receiving_interface.protocol_violation("Announce packet with GROUP type") return False - if not packet.packet_hash in Transport.packet_hashlist: return True + if not packet.packet_hash in Transport.packet_hashlist and not packet.packet_hash in Transport.packet_hashlist_prev: return True else: if packet.packet_type == RNS.Packet.ANNOUNCE: - if packet.destination_type == RNS.Destination.SINGLE: return True + if packet.destination_type == RNS.Destination.SINGLE: + return True else: RNS.log("Dropped invalid announce packet", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None if packet.receiving_interface: packet.receiving_interface.protocol_violation("Announce packet with invalid destination type") @@ -1970,29 +1679,11 @@ class Transport: return False @staticmethod - def filtered_inbound(raw=None, interface=None): - if interface: - raw_len = len(raw) if raw else 0 - interface.frxb += raw_len - if interface.parent_interface: interface.parent_interface.frxb += raw_len - - @staticmethod - def accepted_inbound(raw=None, interface=None): - if interface: - raw_len = len(raw) if raw else 0 - interface.rxb += raw_len - if interface.parent_interface: interface.parent_interface.rxb += raw_len - - @staticmethod - def inbound(raw, interface=None, tc=None, ifac_handled=False, no_accounting=False): - try: - accepted = Transport.preprocess_inbound(raw=raw, interface=interface, tc=tc, ifac_handled=ifac_handled, no_accounting=no_accounting) - if accepted: Transport.accepted_inbound(raw=raw, interface=interface) if not no_accounting else None - else: Transport.filtered_inbound(raw=raw, interface=interface) if not no_accounting else None + def inbound(raw, interface=None, tc=None, ifac_handled=False): + try: Transport.preprocess_inbound(raw=raw, interface=interface, tc=tc, ifac_handled=ifac_handled) except Exception as e: RNS.log(f"Error while processing inbound on {interface}: {e}", RNS.LOG_ERROR) RNS.trace_exception(e) - Transport.filtered_inbound(raw=raw, interface=interface) if not no_accounting else None @staticmethod def handle_ifac(raw, interface): @@ -2059,29 +1750,25 @@ class Transport: return False, None @staticmethod - def preprocess_inbound(raw, interface=None, tc=None, ifac_handled=False, no_accounting=False): - if not interface: - RNS.log(f"No interface set on inbound packet, dropping", RNS.LOG_WARNING) - return None - + def preprocess_inbound(raw, interface=None, tc=None, ifac_handled=False): if not Transport.ready: wait_start = time.time() while not Transport.ready: time.sleep(0.25) if time.time() > wait_start + Transport.READY_WAIT: RNS.log("Inbound packet timed out waiting for transport startup, dropping", RNS.LOG_WARNING) - return None + return # If interface access codes are enabled, # we must authenticate each packet. if len(raw) > 2: - if interface != None and interface.ifac_identity != None: + if interface != None and hasattr(interface, "ifac_identity") and interface.ifac_identity != None: if not ifac_handled: # Check that IFAC flag is set if raw[0] & 0x80 == 0x80: if len(raw) > 2+interface.ifac_size: ifac_valid, raw = Transport.handle_ifac(raw, interface) - if not ifac_valid: return None + if not ifac_valid: return else: return interface.ifac_violation("Insufficient packet size for IFAC packet") @@ -2100,91 +1787,62 @@ class Transport: if Transport.identity == None: return - if interface and len(raw) > interface.HW_MTU + (interface.ifac_size or 0): # TODO: Check, we shouldn't need to add IFAC size here + if interface and len(raw) > interface.HW_MTU + (interface.ifac_size or 0): return interface.protocol_violation(f"Frame size exceeded MTU of {interface.HW_MTU} on {interface}") packet = RNS.Packet(None, raw) - if not packet.unpack(): return interface.protocol_violation(f"Malformed packet ({len(raw)} bytes)", level=RNS.LOG_EXTREME) if interface else None - if interface.hop_limiter and not packet.hops < interface.hop_limiter: return interface.hop_limiter_hit() - if not packet.hops < Transport.HOP_LIMITER: return interface.hop_limiter_hit() + if not packet.unpack(): return interface.protocol_violation(f"Malformed packet ({len(raw)} bytes)") if interface else None if not Transport.packet_filter(packet): return interface.packet_filter_hit() traffic_class = tc or Transport.TC_DATA + Transport.rx_packets += 1 packet.receiving_interface = interface packet.hops += 1 # Ingress limit announces early if packet.packet_type == RNS.Packet.ANNOUNCE: - if len(raw) > RNS.Reticulum.MTU: return packet.receiving_interface.protocol_violation(f"Excessive announce packet frame size of {len(raw)} bytes") - if packet.header_type == RNS.Packet.HEADER_1 and RNS.Reticulum.MTU-len(raw) < RNS.Reticulum.TRUNCATED_HASHLENGTH//8: return packet.receiving_interface.protocol_violation(f"Excessive announce payload of {len(packet.data)} bytes") - if len(packet.data) < RNS.Identity.KEYSIZE//8+RNS.Identity.NAME_HASH_LENGTH//8+10: return packet.receiving_interface.protocol_violation(f"Insufficient announce payload of {len(packet.data)} bytes") - name_hash = packet.data[RNS.Identity.KEYSIZE//8:RNS.Identity.KEYSIZE//8+RNS.Identity.NAME_HASH_LENGTH//8] - - if Transport.blocked_destination_types and name_hash in Transport.blocked_destination_types: return - if Transport.required_destinations_only: - if name_hash in Transport.allowed_destination_types: allowed = True - elif name_hash in Transport.client_destination_types: allowed = True - elif Transport.is_local_client_interface(packet.receiving_interface): allowed = True if packet.hops == 1 else False # 1 == 0 really, yes it's weird ~. . .~ - elif Transport.interface_to_shared_instance(packet.receiving_interface): allowed = True if packet.hops == 1 else False # 1 == 0 really, yes it's weird `-` - else: allowed = False - if not allowed: return packet.receiving_interface.filtered_announce() - - path_entry = Transport.path_table.get(packet.destination_hash) - announced_destination_known = path_entry != None - if announced_destination_known: - # Prefilter announces we can already now determine would - # never provide path table updates or other functionality - prefilter_conditions = packet.context != RNS.Packet.PATH_RESPONSE \ - and not packet.destination_hash in Transport.path_requests \ - and not packet.destination_hash in Transport.discovery_path_requests \ - and not packet.destination_hash in Transport.announce_table \ - - if prefilter_conditions and not Transport.announce_prefilter(packet, path_entry): - packet.receiving_interface.received_announce(size=0) - return packet.receiving_interface.filtered_announce() - + if len(raw) > RNS.Reticulum.MTU: return packet.receiving_interface.protocol_violation(f"Excessive announce packet frame size of {len(raw)} bytes") if packet.receiving_interface else None if traffic_class < Transport.TC_ANNOUNCE: traffic_class = Transport.TC_ANNOUNCE - announce_signature_valid = RNS.Identity.validate_announce(packet, only_validate_signature=True, signal_blackholed=True, signal_stamp=True) - if announce_signature_valid == "blackholed": return packet.receiving_interface.filtered_announce() - elif announce_signature_valid == "no_stamp": return packet.receiving_interface.filtered_announce() - elif announce_signature_valid == "invalid_stamp": return packet.receiving_interface.filtered_announce() + announce_signature_valid = RNS.Identity.validate_announce(packet, only_validate_signature=True, signal_blackholed=True) + if announce_signature_valid == "blackholed": return None elif not announce_signature_valid: - return packet.receiving_interface.protocol_violation(f"Invalid announce signature for {RNS.prettyhexrep(packet.destination_hash)}") + return packet.receiving_interface.protocol_violation(f"Invalid announce signature for {RNS.prettyhexrep(packet.destination_hash)}") if packet.receiving_interface else None + + elif packet.receiving_interface != None: packet.receiving_interface.received_announce(size=len(packet.raw)) + announced_destination_known = packet.destination_hash in Transport.path_table - announce_size = len(raw) if not announced_destination_known: # This is an unknown destination, and we'll apply # potential ingress limiting. Already known # destinations will have re-announces controlled # by normal announce rate limiting. if packet.destination_hash in Transport.path_requests or packet.destination_hash in Transport.discovery_path_requests: - RNS.log(f"Skipping ingress limit check for {RNS.prettyhexrep(packet.destination_hash)} due to waiting path requests", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None + # RNS.log(f"Skipping ingress limit check for {RNS.prettyhexrep(packet.destination_hash)} due to waiting path requests", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None + pass elif packet.receiving_interface.should_ingress_limit(): packet.receiving_interface.hold_announce(packet) - packet.receiving_interface.received_announce(size=0) - return False - - packet.receiving_interface.received_announce(size=announce_size) - Transport.announce_rxc += 1 + return # Ingress limit path requests early elif packet.destination_hash == Transport.pr_destination_hash: if traffic_class < Transport.TC_PATH_REQUEST: traffic_class = Transport.TC_PATH_REQUEST if not len(packet.data) >= RNS.Identity.TRUNCATED_HASHLENGTH//8: return - elif len(packet.data) > Transport.PR_STAMPED_LENGTH: return packet.receiving_interface.protocol_violation(f"Excessive path request size of {len(packet.data)} bytes") else: - pr = Transport.parse_path_request(packet.data) - if pr == None: return packet.receiving_interface.protocol_violation("Tagless path request", level=RNS.LOG_PATHING) - else: - destination_hash = pr[0] - tag_bytes = pr[2] - ext_payload = pr[3] - tag_valid = False + tag_bytes = None + tag_valid = False + destination_hash = packet.data[:RNS.Identity.TRUNCATED_HASHLENGTH//8] + if len(packet.data) > (RNS.Identity.TRUNCATED_HASHLENGTH//8)*2: tag_bytes = packet.data[RNS.Identity.TRUNCATED_HASHLENGTH//8*2:] + elif len(packet.data) > (RNS.Identity.TRUNCATED_HASHLENGTH//8): tag_bytes = packet.data[RNS.Identity.TRUNCATED_HASHLENGTH//8:] - pr_length = len(packet.data) - if pr_length != Transport.PR_STAMPED_LENGTH and pr_length != Transport.PR_LENGTH and pr_length != Transport.PR_LEGACY_LENGTH: # TODO: Only allow stamped size after transition - return packet.receiving_interface.protocol_violation(f"Invalid path request size {pr_length}", level=RNS.LOG_PATHING) + if tag_bytes == None: + RNS.log("Ignoring tagless path request for "+RNS.prettyhexrep(destination_hash), RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None + return packet.receiving_interface.protocol_violation("Tagless path request") if packet.receiving_interface else None + + else: + if len(tag_bytes) > RNS.Identity.TRUNCATED_HASHLENGTH//8: + tag_bytes = tag_bytes[:RNS.Identity.TRUNCATED_HASHLENGTH//8] + if packet.receiving_interface: packet.receiving_interface.protocol_violation("Excessive path request tag size") unique_tag = destination_hash+tag_bytes @@ -2194,43 +1852,10 @@ class Transport: tag_valid = True if not tag_valid: - RNS.log(f"Ignoring duplicate path request for {RNS.prettyhexrep(destination_hash)} with tag {RNS.prettyhexrep(unique_tag)}", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None + RNS.log("Ignoring duplicate path request for "+RNS.prettyhexrep(destination_hash)+" with tag "+RNS.prettyhexrep(unique_tag), RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None return - if Transport.STAMPS_ENABLED: - stamp_ok = False - if ext_payload != None: - if ext_payload[0] == RNS.Identity.EXTPAYLOADMARKER: - required_value = packet.receiving_interface.pr_cost - stamp = ext_payload[Transport.PR_EXT_HEADERLENGTH:] - stamp_ok = Transport.validate_pr_stamp(stamp, destination_hash, tag_bytes, required_value=required_value) - - # TODO: Remove debug block ################################################# - dval = None - if RNS.sl(RNS.LOG_PATHING): - workblock = stamp_workblock(Transport.pr_stamp_material(destination_hash, tag_bytes), expand_rounds=0) # TODO: Remove - dval = stamp_value(workblock, ext_payload[Transport.PR_EXT_HEADERLENGTH:]) - if not ext_payload[1] == 0xFF: RNS.log(f"Stamped path request for {RNS.prettyhexrep(destination_hash)} with value {dval}", RNS.LOG_PATHING) - else: RNS.log(f"Lenient-relayed path request for {RNS.prettyhexrep(destination_hash)} with value {dval}", RNS.LOG_PATHING) - ############################################################################ - - if not stamp_ok: - if ext_payload[1] == 0xFF: RNS.log(f"Unstamped relayed path request from stamp-aware node for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None # TODO: Remove this transitory diagnostics check once enforcement is enabled - # else: RNS.log(f"Invalid or insufficient path request stamp for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None - # TODO: Reset else block to collapsed LOG_EXTREME message commented out above ##### - else: - if RNS.sl(RNS.LOG_PATHING): - if dval: RNS.log(f"Invalid or insufficient (v:{dval}) path request stamp for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None - else: RNS.log(f"Invalid or insufficient path request stamp for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None - ######################################################################## - else: RNS.log(f"Unrecognized stamp payload in path request for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None - else: RNS.log(f"Unstamped path request for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None # TODO: Remove after transition, simply drop - - if not stamp_ok: - if Transport.STAMPS_ENFORCED: return None - - packet.receiving_interface.received_path_request(size=len(raw)) - Transport.pr_rxc += 1 + if packet.receiving_interface: packet.receiving_interface.received_path_request(size=len(raw)) if interface.should_ingress_limit_pr(): traffic_class = Transport.TC_INGRESS_LIMITED @@ -2256,23 +1881,20 @@ class Transport: Transport.discovery_path_requests[destination_hash] = pr_entry - return True + return # TODO: Add early filtering here for non-transport nodes; there's no # reason to process further if we know we don't have the destination # locally on this system. Might need adding a local_client_dest_map, # but this will need to be kept *tightly* in-sync. - Transport.rx_packets += 1 - if not Transport.USE_INBOUND_QUEUE: Transport._inbound(packet) + if not Transport.USE_INBOUND_QUEUE: return Transport._inbound(packet) else: if traffic_class == Transport.TC_INGRESS_LIMITED: packet.traffic_class = Transport.TC_INGRESS_LIMITED try: Transport.inbound_queues.put(traffic_class, packet, block=False) except Full: RNS.log(f"Dropping inbound packet, queue is full (tc={traffic_class})", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None except Exception as e: RNS.log(f"Error while inserting into inbound queue: {e}", RNS.LOG_ERROR) - return True - @staticmethod def inbound_job(): while Transport._should_run: @@ -2414,7 +2036,7 @@ class Transport: new_raw += struct.pack("!B", packet.hops) new_raw += packet.raw[(RNS.Identity.TRUNCATED_HASHLENGTH//8)+2:] elif remaining_hops == 0: - if to_local_client and Transport.local_hops_delta != 0: + if to_local_client and RNS.Transport.local_hops_delta != 0: if packet.header_type == RNS.Packet.HEADER_2: # Strip transport headers and transmit new_flags = (RNS.Packet.HEADER_1) << 6 | (Transport.BROADCAST) << 4 | (packet.flags & 0b00001111) @@ -2473,8 +2095,7 @@ class Transport: packet.hops, # 5: Taken hops packet.destination_hash, # 6: Original destination hash False, # 7: Validated - proof_timeout, # 8: Proof timeout timestamp - 0 ] # 9: Traffic counter + proof_timeout ] # 8: Proof timeout timestamp with Transport.link_table_lock: Transport.link_table[RNS.Link.link_id_from_lr_packet(packet)] = link_entry link_request_handled = True @@ -2489,7 +2110,7 @@ class Transport: if Transport.local_hops_delta != 0 and from_local_client and not to_local_client: new_raw = Transport.mangle_hops(new_raw, Transport.local_hops_delta) Transport.transmit(outbound_interface, new_raw) - path_entry[IDX_PT_USED] = time.time() + path_entry[IDX_PT_TIMESTAMP] = time.time() else: # TODO: There should probably be some kind of REJECT @@ -2506,9 +2127,6 @@ class Transport: RNS.log(f"Pre-validation link packet from {packet.receiving_interface}", RNS.LOG_WARNING) # TODO: Remove return packet.receiving_interface.protocol_violation("Link packet received before link validation") if packet.receiving_interface else None - if not Transport.is_local_client_interface(packet.receiving_interface): - Transport.link_rxb += len(packet.raw) - # If receiving and outbound interface is # the same for this link, direction doesn't # matter, and we simply repeat the packet. @@ -2541,14 +2159,7 @@ class Transport: new_raw += struct.pack("!B", packet.hops if not from_local_client or instance_local_link or Transport.local_hops_delta == 0 else Transport.local_hops_delta) new_raw += packet.raw[2:] Transport.transmit(outbound_interface, new_raw) - - raw_len = len(new_raw) - active_time = time.time() - if not Transport.is_local_client_interface(outbound_interface): Transport.link_txb += raw_len - Transport.link_table[packet.destination_hash][IDX_LT_TIMESTAMP] = active_time - Transport.link_table[packet.destination_hash][IDX_LT_TRXB] += raw_len - link_path_entry = Transport.path_table.get(Transport.link_table[packet.destination_hash][IDX_LT_DSTHASH]) - if link_path_entry: link_path_entry[IDX_PT_USED] = active_time + Transport.link_table[packet.destination_hash][IDX_LT_TIMESTAMP] = time.time() else: RNS.log(f"No-outbound return on link packet from {packet.receiving_interface}", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None @@ -2602,31 +2213,27 @@ class Transport: if local_and_hops_condition: announce_emitted = Transport.announce_emitted(packet) - path_used = 0 random_blobs = [] random_blob = packet.data[RNS.Identity.KEYSIZE//8+RNS.Identity.NAME_HASH_LENGTH//8:RNS.Identity.KEYSIZE//8+RNS.Identity.NAME_HASH_LENGTH//8+10] if not random_blob: return packet.receiving_interface.protocol_violation("No random blob in data") if packet.receiving_interface else None with Transport.inbound_announce_lock: - table_insertion_only = False - existing_path_entry = Transport.path_table.get(packet.destination_hash) - announced_destination_known = existing_path_entry != None + announced_destination_known = packet.destination_hash in Transport.path_table if not announced_destination_known: # If this destination is unknown in our table # we should add it should_add = True else: - random_blobs = existing_path_entry[IDX_PT_RANDBLOBS] - current_gravity = existing_path_entry[IDX_PT_RVCD_IF].gravity - path_used = existing_path_entry[IDX_PT_USED] + random_blobs = Transport.path_table[packet.destination_hash][IDX_PT_RANDBLOBS] + current_gravity = Transport.path_table[packet.destination_hash][IDX_PT_RVCD_IF].gravity announce_gravity = packet.receiving_interface.gravity if packet.receiving_interface != None else None # If we already have a path to the announced destination, # but a more recently emitted announce arrives with a hop # count equal to or less than the existing path, we will # update our tables. - if packet.hops <= existing_path_entry[IDX_PT_HOPS]: + if packet.hops <= Transport.path_table[packet.destination_hash][IDX_PT_HOPS]: path_timebase = Transport.timebase_from_random_blobs(random_blobs) if not random_blob in random_blobs and announce_emitted > path_timebase: Transport.mark_path_unknown_state(packet.destination_hash) @@ -2648,7 +2255,7 @@ class Transport: # ignore it, unless the path is expired, or # the emission timestamp is more recent. now = time.time() - path_expires = existing_path_entry[IDX_PT_EXPIRES] + path_expires = Transport.path_table[packet.destination_hash][IDX_PT_EXPIRES] path_announce_emitted = 0 for path_random_blob in random_blobs: @@ -2686,26 +2293,42 @@ class Transport: if Transport.path_is_unresponsive(packet.destination_hash): RNS.log("Replacing path table entry for "+str(RNS.prettyhexrep(packet.destination_hash))+" with new announce, since previously tried path was unresponsive", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None should_add = True - table_insertion_only = True else: should_add = False - if not should_add: - waiting_announce = Transport.announce_table.get(packet.destination_hash, None) - if waiting_announce and waiting_announce[IDX_AT_PACKET].packet_hash == packet.packet_hash: - if not packet.receiving_interface.shared_medium: - waiting_announce[IDX_AT_DEDUP_IFS].add(packet.receiving_interface) - - else: + if should_add: now = time.time() is_from_local_client = Transport.from_local_client(packet) rate_blocked = False if packet.context != RNS.Packet.PATH_RESPONSE and packet.receiving_interface.announce_rate_target != None: with Transport.announce_rate_table_lock: - rate_blocked = Transport.announce_rate_table.check_and_update(packet.destination_hash, now, - packet.receiving_interface.announce_rate_target, - packet.receiving_interface.announce_rate_grace, - packet.receiving_interface.announce_rate_penalty) + if not packet.destination_hash in Transport.announce_rate_table: + rate_entry = { "last": now, "rate_violations": 0, "blocked_until": 0, "timestamps": [now]} + Transport.announce_rate_table[packet.destination_hash] = rate_entry + + else: + rate_entry = Transport.announce_rate_table[packet.destination_hash] + rate_entry["timestamps"].append(now) + + while len(rate_entry["timestamps"]) > Transport.MAX_RATE_TIMESTAMPS: + rate_entry["timestamps"].pop(0) + + current_rate = now - rate_entry["last"] + + if now > rate_entry["blocked_until"]: + if current_rate < packet.receiving_interface.announce_rate_target: rate_entry["rate_violations"] += 1 + else: rate_entry["rate_violations"] = max(0, rate_entry["rate_violations"]-1) + + if rate_entry["rate_violations"] > packet.receiving_interface.announce_rate_grace: + rate_target = packet.receiving_interface.announce_rate_target + rate_penalty = packet.receiving_interface.announce_rate_penalty + rate_entry["blocked_until"] = rate_entry["last"] + rate_target + rate_penalty + rate_blocked = True + else: + rate_entry["last"] = now + + else: rate_blocked = True + retries = 0 announce_hops = packet.hops local_rebroadcasts = 0 @@ -2713,7 +2336,13 @@ class Transport: attached_interface = None retransmit_timeout = now + (RNS.rand() * Transport.PATHFINDER_RW) - expires = now + Transport.path_timeout_from_interface(packet.receiving_interface) + + if hasattr(packet.receiving_interface, "mode") and packet.receiving_interface.mode == RNS.Interfaces.Interface.Interface.MODE_ACCESS_POINT: + expires = now + Transport.AP_PATH_TIME + elif hasattr(packet.receiving_interface, "mode") and packet.receiving_interface.mode == RNS.Interfaces.Interface.Interface.MODE_ROAMING: + expires = now + Transport.ROAMING_PATH_TIME + else: + expires = now + Transport.PATHFINDER_E if not random_blob in random_blobs: random_blobs.append(random_blob) @@ -2730,33 +2359,28 @@ class Transport: retransmit_timeout = now retries = Transport.PATHFINDER_R - if not table_insertion_only: - with Transport.announce_table_lock: - Transport.announce_table[packet.destination_hash] = [ - now, # 0: IDX_AT_TIMESTAMP - retransmit_timeout, # 1: IDX_AT_RTRNS_TMO - retries, # 2: IDX_AT_RETRIES - received_from, # 3: IDX_AT_RCVD_IF - announce_hops, # 4: IDX_AT_HOPS - packet, # 5: IDX_AT_PACKET - local_rebroadcasts, # 6: IDX_AT_LCL_RBRD - block_rebroadcasts, # 7: IDX_AT_BLCK_RBRD - attached_interface, # 8: IDX_AT_ATTCHD_IF - set(), # 9: IDX_AT_DEDUP_IFS - ] + with Transport.announce_table_lock: + Transport.announce_table[packet.destination_hash] = [ + now, # 0: IDX_AT_TIMESTAMP + retransmit_timeout, # 1: IDX_AT_RTRNS_TMO + retries, # 2: IDX_AT_RETRIES + received_from, # 3: IDX_AT_RCVD_IF + announce_hops, # 4: IDX_AT_HOPS + packet, # 5: IDX_AT_PACKET + local_rebroadcasts, # 6: IDX_AT_LCL_RBRD + block_rebroadcasts, # 7: IDX_AT_BLCK_RBRD + attached_interface, # 8: IDX_AT_ATTCHD_IF + ] elif is_from_local_client and packet.context == RNS.Packet.PATH_RESPONSE: # If this is a path response from a local client, # check if any external interfaces have pending # path requests. - Transport.mark_path_responsive(packet.destination_hash) with Transport.pending_local_prs_lock: if packet.destination_hash in Transport.pending_local_path_requests: desiring_interface = Transport.pending_local_path_requests.pop(packet.destination_hash) retransmit_timeout = now - retries = Transport.PATHFINDER_R - attached_interface = desiring_interface - block_rebroadcasts = True + retries = Transport.PATHFINDER_R with Transport.announce_table_lock: Transport.announce_table[packet.destination_hash] = [ @@ -2768,44 +2392,41 @@ class Transport: packet, local_rebroadcasts, block_rebroadcasts, - attached_interface, - set(), + attached_interface ] # If we have any local clients connected, we re- # transmit the announce to them immediately - if len(Transport.local_client_interfaces): + if (len(Transport.local_client_interfaces)): announce_identity = RNS.Identity.recall(packet.destination_hash, _no_use=True) - if not announce_identity: RNS.log(f"Aborting local-client announce rebroadcast for {RNS.prettyhexrep(destination_hash)}, the path was cleaned while waiting for announce rebroadcast", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None + announce_destination = RNS.Destination(announce_identity, RNS.Destination.OUT, RNS.Destination.SINGLE, "unknown", "unknown"); + announce_destination.hash = packet.destination_hash + announce_destination.hexhash = announce_destination.hash.hex() + announce_context = RNS.Packet.NONE + announce_data = packet.data + + # TODO: Shouldn't the context be PATH_RESPONSE in the first case here? + if is_from_local_client and packet.context == RNS.Packet.PATH_RESPONSE: + for local_interface in Transport.local_client_interfaces: + if packet.receiving_interface != local_interface: + new_announce = RNS.Packet(announce_destination, announce_data, RNS.Packet.ANNOUNCE, # <-- This one? + context = announce_context, header_type = RNS.Packet.HEADER_2, + transport_type = Transport.TRANSPORT, transport_id = Transport.identity.hash, + attached_interface = local_interface, context_flag = packet.context_flag) + + new_announce.hops = packet.hops + new_announce.send() + else: - announce_destination = RNS.Destination(announce_identity, RNS.Destination.OUT, RNS.Destination.SINGLE, "unknown", "unknown"); - announce_destination.hash = packet.destination_hash - announce_destination.hexhash = announce_destination.hash.hex() - announce_context = RNS.Packet.NONE - announce_data = packet.data + for local_interface in Transport.local_client_interfaces: + if packet.receiving_interface != local_interface: + new_announce = RNS.Packet(announce_destination, announce_data, RNS.Packet.ANNOUNCE, + context = announce_context, header_type = RNS.Packet.HEADER_2, + transport_type = Transport.TRANSPORT, transport_id = Transport.identity.hash, + attached_interface = local_interface, context_flag = packet.context_flag) - # TODO: Shouldn't the context be PATH_RESPONSE in the first case here? - if is_from_local_client and packet.context == RNS.Packet.PATH_RESPONSE: - for local_interface in Transport.local_client_interfaces: - if packet.receiving_interface != local_interface: - new_announce = RNS.Packet(announce_destination, announce_data, RNS.Packet.ANNOUNCE, # <-- This one? - context = announce_context, header_type = RNS.Packet.HEADER_2, - transport_type = Transport.TRANSPORT, transport_id = Transport.identity.hash, - attached_interface = local_interface, context_flag = packet.context_flag) - - new_announce.hops = packet.hops - new_announce.send() - - else: - for local_interface in Transport.local_client_interfaces: - if packet.receiving_interface != local_interface: - new_announce = RNS.Packet(announce_destination, announce_data, RNS.Packet.ANNOUNCE, - context = announce_context, header_type = RNS.Packet.HEADER_2, - transport_type = Transport.TRANSPORT, transport_id = Transport.identity.hash, - attached_interface = local_interface, context_flag = packet.context_flag) - - new_announce.hops = packet.hops - new_announce.send() + new_announce.hops = packet.hops + new_announce.send() # If we have any waiting discovery path requests # for this destination, we retransmit to that @@ -2819,58 +2440,37 @@ class Transport: interface_str = " on "+str(attached_interface) RNS.log("Got matching announce, answering waiting discovery path request for "+RNS.prettyhexrep(packet.destination_hash)+interface_str, RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None announce_identity = RNS.Identity.recall(packet.destination_hash, _no_use=False) - if not announce_identity: RNS.log(f"Aborting path request answer for {RNS.prettyhexrep(destination_hash)}, the path was cleaned while waiting for the response", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None - else: - announce_destination = RNS.Destination(announce_identity, RNS.Destination.OUT, RNS.Destination.SINGLE, "unknown", "unknown"); - announce_destination.hash = packet.destination_hash - announce_destination.hexhash = announce_destination.hash.hex() - announce_context = RNS.Packet.NONE - announce_data = packet.data + announce_destination = RNS.Destination(announce_identity, RNS.Destination.OUT, RNS.Destination.SINGLE, "unknown", "unknown"); + announce_destination.hash = packet.destination_hash + announce_destination.hexhash = announce_destination.hash.hex() + announce_context = RNS.Packet.NONE + announce_data = packet.data - new_announce = RNS.Packet(announce_destination, announce_data, RNS.Packet.ANNOUNCE, - context = RNS.Packet.PATH_RESPONSE, header_type = RNS.Packet.HEADER_2, - transport_type = Transport.TRANSPORT, transport_id = Transport.identity.hash, - attached_interface = attached_interface, context_flag = packet.context_flag) + new_announce = RNS.Packet(announce_destination, announce_data, RNS.Packet.ANNOUNCE, + context = RNS.Packet.PATH_RESPONSE, header_type = RNS.Packet.HEADER_2, + transport_type = Transport.TRANSPORT, transport_id = Transport.identity.hash, + attached_interface = attached_interface, context_flag = packet.context_flag) - new_announce.hops = packet.hops - new_announce.send() + new_announce.hops = packet.hops + new_announce.send() if not Transport.owner.is_connected_to_shared_instance: Transport.cache(packet, force_cache=True, packet_type="announce") - if rate_blocked: - # Rate-limited announces do not update liveness - # metrics, only the essential routing data. - with Transport.path_table_lock: - rate_limited_path_entry = Transport.path_table.get(packet.destination_hash) - if rate_limited_path_entry != None: - rate_limited_path_entry[IDX_PT_NEXT_HOP] = received_from - rate_limited_path_entry[IDX_PT_HOPS] = announce_hops - rate_limited_path_entry[IDX_PT_RANDBLOBS] = random_blobs - rate_limited_path_entry[IDX_PT_RVCD_IF] = packet.receiving_interface - rate_limited_path_entry[IDX_PT_PACKET] = packet.packet_hash - else: - path_table_entry = [now, received_from, announce_hops, expires, random_blobs, packet.receiving_interface, packet.packet_hash, path_used] - with Transport.path_table_lock: Transport.path_table[packet.destination_hash] = path_table_entry - - if is_from_local_client: Transport.mark_path_responsive(packet.destination_hash) - else: Transport.mark_path_unknown_state(packet.destination_hash) - - if RNS.sl(RNS.LOG_PATHING): - destination_value = RNS.Identity.recall_stamp_value(packet.destination_hash) - value_str = f" (v:{RNS.prettycost(destination_value)})" if destination_value else " (v:n)" - RNS.log(f"Destination {RNS.prettyhexrep(packet.destination_hash)}{value_str} is now {announce_hops} hops away via {RNS.prettyhexrep(received_from)} on {packet.receiving_interface}", RNS.LOG_PATHING) - + path_table_entry = [now, received_from, announce_hops, expires, random_blobs, packet.receiving_interface, packet.packet_hash] + with Transport.path_table_lock: Transport.path_table[packet.destination_hash] = path_table_entry + Transport.mark_path_unknown_state(packet.destination_hash) + RNS.log("Destination "+RNS.prettyhexrep(packet.destination_hash)+" is now "+str(announce_hops)+" hops away via "+RNS.prettyhexrep(received_from)+" on "+str(packet.receiving_interface), RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None if packet.destination_hash in Transport.path_requests: RNS.Reticulum.get_instance()._used_destination_data(packet.destination_hash) # If the receiving interface is a tunnel, we add the # announce to the tunnels table - if not rate_blocked and hasattr(packet.receiving_interface, "tunnel_id") and packet.receiving_interface.tunnel_id != None: + if hasattr(packet.receiving_interface, "tunnel_id") and packet.receiving_interface.tunnel_id != None: with Transport.tunnels_lock: if not packet.receiving_interface.tunnel_id in Transport.tunnels: RNS.log(f"Tunnel ID for {packet.receiving_interface} was not found in tunnel table", RNS.LOG_WARNING) else: tunnel_entry = Transport.tunnels[packet.receiving_interface.tunnel_id] paths = tunnel_entry[IDX_TT_PATHS] - paths[packet.destination_hash] = [now, received_from, announce_hops, expires, random_blobs, None, packet.packet_hash, path_used] + paths[packet.destination_hash] = [now, received_from, announce_hops, expires, random_blobs, None, packet.packet_hash] expires = time.time() + Transport.TUNNEL_TIMEOUT tunnel_entry[IDX_TT_EXPIRES] = expires RNS.log("Path to "+RNS.prettyhexrep(packet.destination_hash)+" associated with tunnel "+RNS.prettyhexrep(packet.receiving_interface.tunnel_id), RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None @@ -2883,21 +2483,19 @@ class Transport: # Call externally registered callbacks from apps # wanting to know when an announce arrives with Transport.announce_handler_lock: - name_hash = packet.data[RNS.Identity.KEYSIZE//8:RNS.Identity.KEYSIZE//8+RNS.Identity.NAME_HASH_LENGTH//8] - announce_identity = None - announce_app_data = None - - announce_handlers = [] - announce_handlers.extend(Transport.announce_handlers.get(name_hash, [])) - announce_handlers.extend(Transport.announce_handlers.get(None, [])) - for handler in announce_handlers: - if not announce_identity: announce_identity = RNS.Identity.recall(packet.destination_hash, _no_use=True) - if not announce_identity: break - if handler.paused: continue + for handler in Transport.announce_handlers: try: - handler_args = handler._rns_transport_cb_signature_len - handler_job = None - execute_callback = True + # Check that the announced destination matches + # the handlers aspect filter + execute_callback = False + announce_identity = RNS.Identity.recall(packet.destination_hash, _no_use=True) + + # If the handlers aspect filter is set to + # None, we execute the callback in all cases + if handler.aspect_filter == None: execute_callback = True + else: + handler_expected_hash = RNS.Destination.hash_from_name_and_identity(handler.aspect_filter, announce_identity) + if packet.destination_hash == handler_expected_hash: execute_callback = True # If this is a path response, check whether the # handler wants to receive it. @@ -2906,34 +2504,36 @@ class Transport: else: execute_callback = False if execute_callback: - if not announce_app_data: - announce_app_data = RNS.Identity.recall_app_data(packet.destination_hash, _no_use=True) - - if handler_args == 3: + if len(inspect.signature(handler.received_announce).parameters) == 3: def job(handler=handler, packet=packet, announce_identity=announce_identity): - handler.received_announce(destination_hash=packet.destination_hash, announced_identity=announce_identity, - app_data=announce_app_data) - handler_job = job - - elif handler_args == 4: + handler.received_announce(destination_hash=packet.destination_hash, + announced_identity=announce_identity, + app_data=RNS.Identity.recall_app_data(packet.destination_hash, _no_use=True)) + threading.Thread(target=job, daemon=True).start() + + elif len(inspect.signature(handler.received_announce).parameters) == 4: def job(handler=handler, packet=packet, announce_identity=announce_identity): - handler.received_announce(destination_hash=packet.destination_hash, announced_identity=announce_identity, - app_data=announce_app_data, announce_packet_hash=packet.packet_hash) - handler_job = job - - elif handler_args == 5: + handler.received_announce(destination_hash=packet.destination_hash, + announced_identity=announce_identity, + app_data=RNS.Identity.recall_app_data(packet.destination_hash, _no_use=True), + announce_packet_hash = packet.packet_hash) + threading.Thread(target=job, daemon=True).start() + + elif len(inspect.signature(handler.received_announce).parameters) == 5: def job(handler=handler, packet=packet, announce_identity=announce_identity): - handler.received_announce(destination_hash=packet.destination_hash, announced_identity=announce_identity, - app_data=announce_app_data, announce_packet_hash=packet.packet_hash, - is_path_response=packet.context == RNS.Packet.PATH_RESPONSE) - handler_job = job + handler.received_announce(destination_hash=packet.destination_hash, + announced_identity=announce_identity, + app_data=RNS.Identity.recall_app_data(packet.destination_hash, _no_use=True), + announce_packet_hash = packet.packet_hash, + is_path_response = packet.context == RNS.Packet.PATH_RESPONSE) + threading.Thread(target=job, daemon=True).start() - else: raise TypeError("Invalid signature for announce handler callback") - - if handler_job: Transport.pending_callbacks.append(threading.Thread(target=job, daemon=True)) + else: + raise TypeError("Invalid signature for announce handler callback") except Exception as e: - RNS.log(f"Error while processing external announce callback: {e}", RNS.LOG_ERROR) + RNS.log("Error while processing external announce callback.", RNS.LOG_ERROR) + RNS.log("The contained exception was: "+str(e), RNS.LOG_ERROR) RNS.trace_exception(e) # Handling for link requests to local destinations @@ -2990,7 +2590,8 @@ class Transport: # to another path, we remove this packet hash from # the filter hashlist so the link can receive the # packet when it finally arrives over another path. - Transport.packet_hashlist.discard(packet.packet_hash) + while packet.packet_hash in Transport.packet_hashlist: Transport.packet_hashlist.remove(packet.packet_hash) + while packet.packet_hash in Transport.packet_hashlist_prev: Transport.packet_hashlist_prev.remove(packet.packet_hash) else: destination = Transport.destinations_map.get(packet.destination_hash) if destination and destination.type == packet.destination_type: @@ -3031,7 +2632,6 @@ class Transport: link_entry[IDX_LT_REM_HOPS] = packet.hops path_entry = Transport.path_table.get(link_destination) if path_entry: path_entry[IDX_PT_HOPS] = packet.hops - Transport.mark_path_responsive(link_destination) elif not link_entry[IDX_LT_VALIDATED]: RNS.log(f"Aborting link request proof path re-balancing for {RNS.prettyhexrep(link_destination)} on link {RNS.prettyhexrep(packet.destination_hash)} due to invalid signature", REBALANCE_LOGLEVEL) if RNS.sl(REBALANCE_LOGLEVEL) else None else: pass @@ -3062,7 +2662,6 @@ class Transport: Transport.transmit(link_entry[IDX_LT_RCVD_IF], new_raw) if not Transport.owner.is_connected_to_shared_instance: RNS.Identity._used_destination_data(link_entry[IDX_LT_DSTHASH]) - Transport.mark_path_responsive(link_entry[IDX_LT_DSTHASH]) else: RNS.log("Invalid link request proof in transport for link "+RNS.prettyhexrep(packet.destination_hash)+", dropping proof.", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None @@ -3107,7 +2706,6 @@ class Transport: if path_entry: path_entry[IDX_PT_HOPS] = packet.hops RNS.log(f"Path table re-balanced for {RNS.prettyhexrep(link.destination.hash)}", REBALANCE_LOGLEVEL) if RNS.sl(REBALANCE_LOGLEVEL) else None - Transport.mark_path_responsive(link.destination.hash) else: RNS.log(f"Aborting path re-balancing at link terminus for {RNS.prettyhexrep(link.destination.hash)} on link {link} due to invalid signature", REBALANCE_LOGLEVEL) if RNS.sl(REBALANCE_LOGLEVEL) else None except Exception as e: RNS.log("Error while validating link request proof for path re-balancing at link terminus. The contained exception was: "+str(e), REBALANCE_LOGLEVEL) if RNS.sl(REBALANCE_LOGLEVEL) else None @@ -3162,134 +2760,49 @@ class Transport: with Transport.receipts_lock: if receipt in Transport.receipts: Transport.receipts.remove(receipt) - ##################### - # Tunnel Management # - ##################### - @staticmethod - def synthesize_tunnel(interface, reverse=False): - if not Transport.identity: return - if not reverse and not interface.wants_tunnel: return - + def synthesize_tunnel(interface): try: - ext_info = { RNS.Discovery.TRANSPORT_IMPL: RNS.Discovery.IMPLEMENTATION_NAME, - RNS.Discovery.TRANSPORT_VERS: RNS.Discovery.RNS_VERSION, - RNS.Discovery.TRANSPORT: RNS.Reticulum.transport_enabled(), - RNS.Discovery.DST_COST: interface.destination_cost, - RNS.Discovery.PR_COST: interface.pr_cost } - interface_hash = interface.get_hash() - public_key = Transport.identity.get_public_key() + public_key = RNS.Transport.identity.get_public_key() random_hash = RNS.Identity.get_random_hash() tunnel_id_data = public_key+interface_hash tunnel_id = RNS.Identity.full_hash(tunnel_id_data) - ext_payload = umsgpack.packb(ext_info) - signed_data = tunnel_id_data+random_hash+ext_payload + signed_data = tunnel_id_data+random_hash signature = Transport.identity.sign(signed_data) - - data = tunnel_id_data+random_hash+signature+ext_payload + + data = signed_data+signature tnl_snth_dst = RNS.Destination(None, RNS.Destination.OUT, RNS.Destination.PLAIN, Transport.APP_NAME, "tunnel", "synthesize") packet = RNS.Packet(tnl_snth_dst, data, packet_type = RNS.Packet.DATA, transport_type = RNS.Transport.BROADCAST, header_type = RNS.Packet.HEADER_1, attached_interface = interface) - interface.synthesis_emitted = True - - if interface.online: packet.send() - elif hasattr(interface, "early_synthesis"): interface.early_synthesis(packet) - else: return + packet.send() interface.wants_tunnel = False - if not reverse: interface.local_tunnel_id = tunnel_id except Exception as e: RNS.log(f"Could not synthesize tunnel for {interface}: {e}", RNS.LOG_ERROR) @staticmethod def tunnel_synthesize_handler(data, packet): try: - if not packet.receiving_interface: return - if not packet.receiving_interface.tunnels_allowed: return - if packet.receiving_interface.remote_transport: return packet.receiving_interface.protocol_violation(f"Tunnel synthesis packet on already established tunnel") - if packet.receiving_interface.synthesis_received: return packet.receiving_interface.protocol_violation(f"Additional synthesis packet received") - interface = packet.receiving_interface - interface.synthesis_received = True - - data_len = len(data) - max_len = RNS.Packet.MDU - required_len = RNS.Identity.KEYSIZE//8+RNS.Identity.HASHLENGTH//8+RNS.Reticulum.TRUNCATED_HASHLENGTH//8+RNS.Identity.SIGLENGTH//8 - if data_len > max_len: return interface.protocol_violation("Excessive tunnel synthesis packet size") - if data_len < required_len: return interface.protocol_violation("Insufficient tunnel synthesis packet size") - else: - key_size = RNS.Identity.KEYSIZE//8 - sig_len = RNS.Identity.SIGLENGTH//8 - hash_len = RNS.Identity.HASHLENGTH//8 - trunc_hash_len = RNS.Reticulum.TRUNCATED_HASHLENGTH//8 - - ext_payload = b"" - public_key = data[:key_size] - interface_hash = data[key_size:key_size+hash_len] + expected_length = RNS.Identity.KEYSIZE//8+RNS.Identity.HASHLENGTH//8+RNS.Reticulum.TRUNCATED_HASHLENGTH//8+RNS.Identity.SIGLENGTH//8 + if len(data) == expected_length: + public_key = data[:RNS.Identity.KEYSIZE//8] + interface_hash = data[RNS.Identity.KEYSIZE//8:RNS.Identity.KEYSIZE//8+RNS.Identity.HASHLENGTH//8] tunnel_id_data = public_key+interface_hash tunnel_id = RNS.Identity.full_hash(tunnel_id_data) - random_hash = data[key_size+hash_len:key_size+hash_len+trunc_hash_len] - - if data_len > required_len: - ext_payload = data[required_len:] + random_hash = data[RNS.Identity.KEYSIZE//8+RNS.Identity.HASHLENGTH//8:RNS.Identity.KEYSIZE//8+RNS.Identity.HASHLENGTH//8+RNS.Reticulum.TRUNCATED_HASHLENGTH//8] - signature = data[key_size+hash_len+trunc_hash_len:key_size+hash_len+trunc_hash_len+sig_len] - signed_data = tunnel_id_data+random_hash+ext_payload + signature = data[RNS.Identity.KEYSIZE//8+RNS.Identity.HASHLENGTH//8+RNS.Reticulum.TRUNCATED_HASHLENGTH//8:expected_length] + signed_data = tunnel_id_data+random_hash remote_transport_identity = RNS.Identity(create_keys=False) remote_transport_identity.load_public_key(public_key) - if not remote_transport_identity.validate(signature, signed_data): - RNS.log(f"Invalid tunnel synthesis signature, tearing down {interface}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - RNS.Reticulum.get_instance()._detach_interface(None, interface_instance=interface, internal_forced=True) - - else: - if remote_transport_identity.hash in Transport.blackholed_identities: - RNS.log(f"Tunnel synthesis from blackholed transport node {RNS.prettyhexrep(remote_transport_identity.hash)}, tearing down {interface}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - RNS.Reticulum.get_instance()._detach_interface(None, interface_instance=interface, internal_forced=True) - - else: - if ext_payload: - try: ext_payload = umsgpack.unpackb(ext_payload) - except Exception as e: return interface.protocol_violation("Undecodable ext_payload in tunnel synthesis packet") - if type(ext_payload) != dict: return interface.protocol_violation("Invalid ext_payload data type in tunnel synthesis packet") - if not RNS.Discovery.TRANSPORT_IMPL in ext_payload: return interface.protocol_violation("Missing implementation info in tunnel synthesis packet") - if not RNS.Discovery.TRANSPORT_VERS in ext_payload: return interface.protocol_violation("Missing version info in tunnel synthesis packet") - if not RNS.Discovery.TRANSPORT in ext_payload: return interface.protocol_violation("Missing transport status in tunnel synthesis packet") - if not RNS.Discovery.DST_COST in ext_payload: return interface.protocol_violation("Missing destination cost in tunnel synthesis packet") - if not RNS.Discovery.PR_COST in ext_payload: return interface.protocol_violation("Missing path request cost in tunnel synthesis packet") - - try: - ext_impl_name = ext_payload[RNS.Discovery.TRANSPORT_IMPL] - ext_impl_vers = ext_payload[RNS.Discovery.TRANSPORT_VERS] - ext_transport = ext_payload[RNS.Discovery.TRANSPORT] - ext_dst_cost = ext_payload[RNS.Discovery.DST_COST] - ext_pr_cost = ext_payload[RNS.Discovery.PR_COST] - remote_impl = RNS.Discovery.InterfaceAnnounceHandler.sanitize_name(ext_impl_name) - remote_vers = RNS.Discovery.version_tuple(ext_impl_vers) - - if not remote_vers: return interface.protocol_violation("Invalid version info in tunnel synthesis packet") - if not remote_impl or not remote_impl == ext_impl_name: return interface.protocol_violation("Invalid implementation info in tunnel synthesis packet") - if not type(ext_dst_cost) == float: return interface.protocol_violation("Invalid destination cost in tunnel synthesis packet") - if not type(ext_pr_cost) == float: return interface.protocol_violation("Invalid path request cost in tunnel synthesis packet") - if not type(ext_transport) == bool: return interface.protocol_violation("Invalid transport status in tunnel synthesis packet") - - interface.remote_impl = remote_impl - interface.remote_vers = remote_vers - interface.remote_dst_cost = quantize_cost(ext_dst_cost) - interface.remote_pr_cost = quantize_cost(ext_pr_cost) - interface.remote_is_tn = ext_transport - - if not interface.synthesis_emitted: Transport.synthesize_tunnel(interface, reverse=True) - - except Exception as e: return interface.protocol_violation(f"Tunnel synthesis parsing caused exception: {e}") - - if not interface.local_tunnel_id: interface.tunnel_id = tunnel_id - interface.remote_transport = remote_transport_identity - if not interface.local_tunnel_id: Transport.handle_tunnel(tunnel_id, interface) + if remote_transport_identity.validate(signature, signed_data): + Transport.handle_tunnel(tunnel_id, packet.receiving_interface) except Exception as e: RNS.log("An error occurred while validating tunnel establishment packet.", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None @@ -3311,26 +2824,26 @@ class Transport: paths = {} with Transport.tunnels_lock: tunnel_entry = [tunnel_id, interface, paths, expires] + interface.tunnel_id = tunnel_id Transport.tunnels[tunnel_id] = tunnel_entry else: RNS.log("Tunnel endpoint "+RNS.prettyhexrep(tunnel_id)+" reappeared. Restoring paths...", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None tunnel_entry = Transport.tunnels[tunnel_id] tunnel_entry[IDX_TT_IF] = interface tunnel_entry[IDX_TT_EXPIRES] = expires + interface.tunnel_id = tunnel_id paths = tunnel_entry[IDX_TT_PATHS] deprecated_paths = [] with Transport.tunnels_lock: for destination_hash, path_entry in paths.items(): - path_timestamp = path_entry[0] received_from = path_entry[1] announce_hops = path_entry[2] expires = path_entry[3] random_blobs = list(set(path_entry[4])) receiving_interface = interface packet_hash = path_entry[6] - used = path_entry[7] - new_entry = [path_timestamp, received_from, announce_hops, expires, random_blobs, receiving_interface, packet_hash, used] + new_entry = [time.time(), received_from, announce_hops, expires, random_blobs, receiving_interface, packet_hash] should_add = False with Transport.path_table_lock: @@ -3360,10 +2873,6 @@ class Transport: RNS.log("Removing path to "+RNS.prettyhexrep(deprecated_path)+" from tunnel "+RNS.prettyhexrep(tunnel_id), RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None with Transport.tunnels_lock: paths.pop(deprecated_path) - ######################## - # Destination Handling # - ######################## - @staticmethod def clean_destinations_map(): with Transport.destinations_lock: @@ -3415,57 +2924,6 @@ class Transport: if destination.hash in Transport.destinations_map: Transport.destinations_map.pop(destination.hash) - @staticmethod - def register_announce_handler(handler): - """ - Registers an announce handler. - - :param handler: Must be an object with an *aspect_filter* attribute and a *received_announce(destination_hash, announced_identity, app_data)* - or *received_announce(destination_hash, announced_identity, app_data, announce_packet_hash)* or - *received_announce(destination_hash, announced_identity, app_data, announce_packet_hash, is_path_response)* callable. Can - optionally have a *receive_path_responses* attribute set to ``True``, to also receive all path responses, in addition to live - announces. See the :ref:`Announce Example` for more info. - """ - with Transport.announce_handler_lock: - if hasattr(handler, "received_announce") and callable(handler.received_announce): - if hasattr(handler, "aspect_filter"): - try: - name_hash = RNS.Destination.name_hash(handler.aspect_filter) if handler.aspect_filter else None - handler._rns_transport_cb_signature_len = len(inspect.signature(handler.received_announce).parameters) - if not hasattr(handler, "paused"): handler.paused = False - handlers = Transport.announce_handlers.get(name_hash, []) - if not handler in handlers: handlers.append(handler) - Transport.announce_handlers[name_hash] = handlers - except Exception as e: - RNS.log(f"Could not register announce handler for {handler.aspect_filter}: {e}", RNS.LOG_WARNING) - RNS.trace_exception(e) - - @staticmethod - def deregister_announce_handler(handler): - """ - Deregisters an announce handler. - - :param handler: The announce handler to be deregistered. - """ - with Transport.announce_handler_lock: - if hasattr(handler, "aspect_filter"): - try: - name_hash = RNS.Destination.name_hash(handler.aspect_filter) if handler.aspect_filter else None - handlers = Transport.announce_handlers.get(name_hash, None) - if handlers: - while handler in handlers: handlers.remove(handler) - if handlers: Transport.announce_handlers[name_hash] = handlers - else: Transport.announce_handlers.pop(name_hash) - except Exception as e: - RNS.log(f"Could not deregister announce handler for {handler.aspect_filter}: {e}", RNS.LOG_WARNING) - RNS.trace_exception(e) - - Transport.should_collect = True - - ################# - # Link Handling # - ################# - @staticmethod def register_link(link): RNS.log("Registering link "+str(link), RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None @@ -3494,24 +2952,44 @@ class Transport: else: RNS.log("Attempted to activate a link that was not in the pending table", RNS.LOG_ERROR) - ################## - # Cache Handling # - ################## + @staticmethod + def register_announce_handler(handler): + """ + Registers an announce handler. + + :param handler: Must be an object with an *aspect_filter* attribute and a *received_announce(destination_hash, announced_identity, app_data)* + or *received_announce(destination_hash, announced_identity, app_data, announce_packet_hash)* or + *received_announce(destination_hash, announced_identity, app_data, announce_packet_hash, is_path_response)* callable. Can + optionally have a *receive_path_responses* attribute set to ``True``, to also receive all path responses, in addition to live + announces. See the :ref:`Announce Example` for more info. + """ + with Transport.announce_handler_lock: + if hasattr(handler, "received_announce") and callable(handler.received_announce): + if hasattr(handler, "aspect_filter"): Transport.announce_handlers.append(handler) @staticmethod - def init_announce_cache(): - try: - Transport.announce_cache = AnnounceCache(os.path.join(RNS.Reticulum.cachepath, "announces.db")) + def deregister_announce_handler(handler): + """ + Deregisters an announce handler. - legacy_dir = os.path.join(RNS.Reticulum.cachepath, "announces") - if os.path.isdir(legacy_dir) and len(os.listdir(legacy_dir)) > 0: - st = time.time() - imported = Transport.announce_cache.import_legacy(legacy_dir) - RNS.log(f"Imported {imported} cached announces from legacy file storage in {RNS.prettyshorttime(time.time()-st)}", RNS.LOG_VERBOSE) + :param handler: The announce handler to be deregistered. + """ + with Transport.announce_handler_lock: + while handler in Transport.announce_handlers: Transport.announce_handlers.remove(handler) - except Exception as e: - RNS.log("Could not initialise announce cache database, falling back to file-based caching. The contained exception was: "+str(e), RNS.LOG_ERROR) - Transport.announce_cache = None + gc.collect() + + @staticmethod + def interface_hashes(): + return {interface.get_hash() for interface in Transport.interfaces} + + @staticmethod + def find_interface_from_hash(interface_hash): + for interface in Transport.interfaces: + if interface.get_hash() == interface_hash: + return interface + + return None @staticmethod def should_cache(packet): @@ -3546,17 +3024,10 @@ class Transport: @staticmethod def clean_announce_cache(): st = time.time() - with Transport.path_table_lock: active_path_hashes = set([Transport.path_table[dst_hash][IDX_PT_PACKET] for dst_hash in Transport.path_table]) - with Transport.tunnels_lock: tunnel_path_hashes = set([path_dict[dst_hash][IDX_PT_PACKET] for path_dict in [Transport.tunnels[tunnel_id][IDX_TT_PATHS] for tunnel_id in Transport.tunnels] for dst_hash in path_dict]) - active_path_hashes |= tunnel_path_hashes - - if Transport.announce_cache != None: - removed = Transport.announce_cache.clean(active_path_hashes) - if removed > 0: RNS.log(f"Removed {removed} cached announces in {RNS.prettytime(time.time()-st)}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - return - target_path = os.path.join(RNS.Reticulum.cachepath, "announces") cached_announce_hashes = os.listdir(target_path) + with Transport.path_table_lock: active_path_hashes = list(set([Transport.path_table[dst_hash][IDX_PT_PACKET] for dst_hash in Transport.path_table])) + with Transport.tunnels_lock: tunnel_path_hashes = list(set([path_dict[dst_hash][IDX_PT_PACKET] for path_dict in [Transport.tunnels[tunnel_id][IDX_TT_PATHS] for tunnel_id in Transport.tunnels] for dst_hash in path_dict])) removed = 0; total = 0 for packet_hash in cached_announce_hashes: remove = False @@ -3580,42 +3051,24 @@ class Transport: # the packet cache. @staticmethod def cache(packet, force_cache=False, packet_type=None): - if force_cache or Transport.should_cache(packet): + if force_cache or RNS.Transport.should_cache(packet): try: + packet_hash = RNS.hexrep(packet.get_hash(), delimit=False) interface_reference = None if packet.receiving_interface != None: interface_reference = str(packet.receiving_interface) - - if packet_type == "announce": - if Transport.announce_cache != None: - Transport.announce_cache.store(packet.get_hash(), packet.raw, interface_reference) - return - - cachepath = os.path.join(RNS.Reticulum.cachepath, "announces", RNS.hexrep(packet.get_hash(), delimit=False)) - else: - cachepath = os.path.join(RNS.Reticulum.cachepath, RNS.hexrep(packet.get_hash(), delimit=False)) + if packet_type == "announce": cachepath = os.path.join(RNS.Reticulum.cachepath, "announces", packet_hash) + else: cachepath = os.path.join(RNS.Reticulum.cachepath, packet_hash) file = open(cachepath, "wb") file.write(umsgpack.packb([packet.raw, interface_reference])) file.close() - except Exception as e: RNS.log("Error writing packet to cache. The contained exception was: "+str(e), RNS.LOG_ERROR) + except Exception as e: + RNS.log("Error writing packet to cache. The contained exception was: "+str(e), RNS.LOG_ERROR) @staticmethod def get_cached_packet(packet_hash, packet_type=None): try: - if packet_type == "announce" and Transport.announce_cache != None: - cached = Transport.announce_cache.fetch(packet_hash) - if cached == None: return None - - packet = RNS.Packet(None, cached[0]) - interface_reference = cached[1] - - for interface in Transport.interfaces: - if str(interface) == interface_reference: - packet.receiving_interface = interface - - return packet - packet_hash = RNS.hexrep(packet_hash, delimit=False) if packet_type == "announce": path = os.path.join(RNS.Reticulum.cachepath, "announces", packet_hash) else: path = os.path.join(RNS.Reticulum.cachepath, packet_hash) @@ -3651,7 +3104,7 @@ class Transport: # cache, replay it to the Transport instance, # so that it can be directed towards it original # destination. - Transport.inbound(packet.raw, packet.receiving_interface, ifac_handled=True, no_accounting=True) + Transport.inbound(packet.raw, packet.receiving_interface, ifac_handled=True) return True else: return False @@ -3663,16 +3116,12 @@ class Transport: if cached_packet: # The packet was found in the local cache, # replay it to the Transport instance. - Transport.inbound(cached_packet.raw, cached_packet.receiving_interface, ifac_handled=True, no_accounting=True) + Transport.inbound(cached_packet.raw, cached_packet.receiving_interface, ifac_handled=True) else: # The packet is not in the local cache, # query the network. RNS.Packet(destination, packet_hash, context = RNS.Packet.CACHE_REQUEST).send() - ################### - # Various Helpers # - ################### - @staticmethod def has_path(destination_hash): """ @@ -3758,22 +3207,6 @@ class Transport: if not Transport.lowest_interface_bitrate: return 0 return 2*(RNS.Reticulum.MTU*8/max(Transport.lowest_interface_bitrate, RNS.Reticulum.MINIMUM_BITRATE)) + RNS.Reticulum.DEFAULT_PER_HOP_TIMEOUT - @staticmethod - def path_count(): - return len(Transport.path_table) - - @staticmethod - def unused_path_count(): - with Transport.path_table_lock: - return sum(1 for e in Transport.path_table.values() if not e[IDX_PT_USED]) - - @staticmethod - def path_pool_counts(): - with Transport.path_table_lock: - total = len(Transport.path_table) - unused = sum(1 for e in Transport.path_table.values() if not e[IDX_PT_USED]) - return total, unused - @staticmethod def link_count(): return len(Transport.link_table) @@ -3782,60 +3215,16 @@ class Transport: def active_link_count(): return sum(1 for e in (True for entry in Transport.link_table if entry[IDX_LT_VALIDATED])) - @staticmethod - def link_distribution(): - link_destinations = {} - - try: - for link_id in Transport.link_table: - link_entry = Transport.link_table.get(link_id) - if link_entry: - active = link_entry[IDX_LT_VALIDATED] - link_destination = link_entry[IDX_LT_DSTHASH] - link_traffic = link_entry[IDX_LT_TRXB] - from_interface = link_entry[IDX_LT_RCVD_IF] - from_ifhash = from_interface.get_hash() - - entry = link_destinations.get(link_destination, None) - if not entry: - entry = { "active": 0, "pending": 0, - "traffic": 0, "from_ifs": [] } - - link_destinations[link_destination] = entry - - entry["traffic"] += link_traffic - if not from_ifhash in entry["from_ifs"]: entry["from_ifs"].append(from_ifhash) - if active: entry["active"] += 1 - else: entry["pending"] += 1 - - - return link_destinations - - except Exception as e: RNS.log(f"Error while getting link distribution stats: {e}", RNS.LOG_DEBUG) - return {} - - ################# - # Path Handling # - ################# - @staticmethod def expire_path(destination_hash): with Transport.path_table_lock: if destination_hash in Transport.path_table: Transport.path_table[destination_hash][IDX_PT_TIMESTAMP] = 0 - Transport.path_table[destination_hash][IDX_PT_EXPIRES] = 0 Transport.tables_last_culled = 0 return True else: return False - @staticmethod - def path_timeout_from_interface(interface): - if interface != None and hasattr(interface, "mode"): - if interface.mode == RNS.Interfaces.Interface.Interface.MODE_ACCESS_POINT: return Transport.AP_PATH_TIME - elif interface.mode == RNS.Interfaces.Interface.Interface.MODE_ROAMING: return Transport.ROAMING_PATH_TIME - return Transport.PATH_TIMEOUT - @staticmethod def mark_path_unresponsive(destination_hash): if destination_hash in Transport.path_table: @@ -3846,22 +3235,11 @@ class Transport: @staticmethod def mark_path_responsive(destination_hash): - # Marking a path live must only occur on events that - # cryptographically prove recent destination liveness. - now = time.time() - with Transport.path_table_lock: - path_entry = Transport.path_table.get(destination_hash) - if path_entry != None: - path_entry[IDX_PT_TIMESTAMP] = now - path_entry[IDX_PT_EXPIRES] = now + Transport.path_timeout_from_interface(path_entry[IDX_PT_RVCD_IF]) - path_entry[IDX_PT_USED] = now - - with Transport.path_states_lock: - Transport.path_states[destination_hash] = Transport.STATE_RESPONSIVE - - return True - - else: return False + if destination_hash in Transport.path_table: + with Transport.path_states_lock: Transport.path_states[destination_hash] = Transport.STATE_RESPONSIVE + return True + + else: return False @staticmethod def mark_path_unknown_state(destination_hash): @@ -3880,10 +3258,6 @@ class Transport: return False - @staticmethod - def get_path_state(destination_hash): - return Transport.path_states.get(destination_hash, Transport.STATE_UNKNOWN) - @staticmethod def await_path(destination_hash, timeout=None, on_interface=None): """ @@ -3902,7 +3276,7 @@ class Transport: return Transport.has_path(destination_hash) @staticmethod - def request_path(destination_hash, on_interface=None, tag=None, recursive=False, ext_payload=None): + def request_path(destination_hash, on_interface=None, tag=None, recursive=False): """ Requests a path to the destination from the network. If another reachable peer on the network knows a path, it @@ -3910,38 +3284,25 @@ class Transport: :param destination_hash: A destination hash as *bytes*. :param on_interface: If specified, the path request will only be sent on this interface. In normal use, Reticulum handles this automatically, and this parameter should not be used. - :param ext_payload: Internal use by :ref:`RNS.Transport`. Ignore. """ if on_interface and recursive and on_interface.should_egress_limit_pr(): RNS.log(f"Blocking recursive path request on {on_interface} due to active egress limiting", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None return - # From version 1.6.0, path requests always carry transport ID if tag == None: request_tag = RNS.Identity.get_random_hash() - else: request_tag = tag[:RNS.Identity.TRUNCATED_HASHLENGTH//8] - path_request_data = destination_hash+Transport.identity.hash+request_tag + else: request_tag = tag - # If a stamped extension is ready, include it - if ext_payload != None: path_request_data += ext_payload - - # Otherwise, check if we need to include a PR stamp - elif Transport.STAMP_PRS: - material = Transport.pr_stamp_material(destination_hash, request_tag) - with Transport.pr_stamp_cache_lock: stamp = Transport.pr_stamp_cache.get(material, None) - - # No cached stamp available, start generating - if not stamp: - with Transport.path_requests_lock: Transport.path_requests[destination_hash] = time.time() - Transport.enqueue_stamped_pr(destination_hash, on_interface=on_interface, tag=request_tag, recursive=recursive) - return - - # Cached stamp available, append for immediate dispatch - else: path_request_data += bytes([RNS.Identity.EXTPAYLOADMARKER, 0x00])+stamp + if RNS.Reticulum.transport_enabled(): path_request_data = destination_hash+Transport.identity.hash+request_tag + else: path_request_data = destination_hash+request_tag path_request_dst = RNS.Destination(None, RNS.Destination.OUT, RNS.Destination.PLAIN, Transport.APP_NAME, "path", "request") packet = RNS.Packet(path_request_dst, path_request_data, packet_type = RNS.Packet.DATA, transport_type = RNS.Transport.BROADCAST, header_type = RNS.Packet.HEADER_1, attached_interface = on_interface) if on_interface != None and recursive: + if not hasattr(on_interface, "announce_cap"): on_interface.announce_cap = RNS.Reticulum.ANNOUNCE_CAP + if not hasattr(on_interface, "announce_allowed_at"): on_interface.announce_allowed_at = 0 + if not hasattr(on_interface, "announce_queue"): on_interface.announce_queue = [] + queued_announces = True if len(on_interface.announce_queue) > 0 else False if queued_announces: RNS.log("Blocking recursive path request on "+str(on_interface)+" due to queued announces", RNS.LOG_EXTREME) if RNS.sl(RNS.LOG_EXTREME) else None @@ -3960,30 +3321,103 @@ class Transport: with Transport.path_requests_lock: Transport.path_requests[destination_hash] = time.time() packet.send() + @staticmethod + def remote_status_handler(path, data, request_id, link_id, remote_identity, requested_at): + if remote_identity != None: + response = None + try: + if isinstance(data, list) and len(data) > 0: + response = [] + response.append(Transport.owner.get_interface_stats()) + if data[0] == True: response.append(Transport.owner.get_link_count()) + + if len(data) >= 2: + if data[1] == True: response.append(Transport.owner.get_profiling_results()) + + return response + + except Exception as e: + RNS.log("An error occurred while processing remote status request from "+str(remote_identity), RNS.LOG_ERROR) + RNS.log("The contained exception was: "+str(e), RNS.LOG_ERROR) + + return None + + @staticmethod + def remote_path_handler(path, data, request_id, link_id, remote_identity, requested_at): + if remote_identity != None: + response = None + try: + if isinstance(data, list) and len(data) > 0: + command = data[0] + destination_hash = None + max_hops = None + if len(data) > 1: destination_hash = data[1] + if len(data) > 2: max_hops = data[2] + + if command == "table": + table = Transport.owner.get_path_table(max_hops=max_hops) + response = [] + for path in table: + if destination_hash == None or destination_hash == path["hash"]: + response.append(path) + + elif command == "rates": + table = Transport.owner.get_rate_table() + response = [] + for path in table: + if destination_hash == None or destination_hash == path["hash"]: + response.append(path) + + return response + + except Exception as e: + RNS.log("An error occurred while processing remote status request from "+str(remote_identity), RNS.LOG_ERROR) + RNS.log("The contained exception was: "+str(e), RNS.LOG_ERROR) + + return None + @staticmethod def path_request_handler(data, packet): try: - pr = Transport.parse_path_request(data) - if pr == None: - if len(data) >= RNS.Identity.TRUNCATED_HASHLENGTH//8: - destination_hash = data[:RNS.Identity.TRUNCATED_HASHLENGTH//8] - RNS.log("Ignoring tagless path request for "+RNS.prettyhexrep(destination_hash), RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None - return + # If there is at least bytes enough for a destination + # hash in the packet, we assume those bytes are the + # destination being requested. + if len(data) >= RNS.Identity.TRUNCATED_HASHLENGTH//8: + destination_hash = data[:RNS.Identity.TRUNCATED_HASHLENGTH//8] + # If there is also enough bytes for a transport + # instance ID and at least one tag byte, we + # assume the next bytes to be the trasport ID + # of the requesting transport instance. + if len(data) > (RNS.Identity.TRUNCATED_HASHLENGTH//8)*2: + requesting_transport_instance = data[RNS.Identity.TRUNCATED_HASHLENGTH//8:(RNS.Identity.TRUNCATED_HASHLENGTH//8)*2] + else: + requesting_transport_instance = None - destination_hash = pr[0] - requesting_tid = pr[1] - tag_bytes = pr[2] - ext_payload = pr[3] - ingress_limited = packet.traffic_class == Transport.TC_INGRESS_LIMITED + tag_bytes = None + if len(data) > (RNS.Identity.TRUNCATED_HASHLENGTH//8)*2: + tag_bytes = data[RNS.Identity.TRUNCATED_HASHLENGTH//8*2:] - Transport.path_request(destination_hash, Transport.from_local_client(packet), packet.receiving_interface, - requestor_transport_id=requesting_tid, tag=tag_bytes, ingress_limited=ingress_limited, - ext_payload=ext_payload) + elif len(data) > (RNS.Identity.TRUNCATED_HASHLENGTH//8): + tag_bytes = data[RNS.Identity.TRUNCATED_HASHLENGTH//8:] + if tag_bytes != None: + if len(tag_bytes) > RNS.Identity.TRUNCATED_HASHLENGTH//8: + tag_bytes = tag_bytes[:RNS.Identity.TRUNCATED_HASHLENGTH//8] + + unique_tag = destination_hash+tag_bytes + + Transport.path_request(destination_hash, + Transport.from_local_client(packet), + packet.receiving_interface, + requestor_transport_id = requesting_transport_instance, + tag=tag_bytes, + ingress_limited=packet.traffic_class == Transport.TC_INGRESS_LIMITED) + + else: RNS.log("Ignoring tagless path request for "+RNS.prettyhexrep(destination_hash), RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None except Exception as e: RNS.log(f"Error while handling path request. The contained exception was: {e}", RNS.LOG_ERROR) @staticmethod - def path_request(destination_hash, is_from_local_client, attached_interface, requestor_transport_id=None, tag=None, ingress_limited=False, ext_payload=None): + def path_request(destination_hash, is_from_local_client, attached_interface, requestor_transport_id=None, tag=None, ingress_limited=False): should_search_for_unknown = False should_ingress_limit = False search_mode_filter = None @@ -4082,17 +3516,18 @@ class Transport: Transport.held_announces[packet.destination_hash] = held_entry with Transport.announce_table_lock: - Transport.announce_table[packet.destination_hash] = [now, retransmit_timeout, retries, received_from, announce_hops, packet, local_rebroadcasts, block_rebroadcasts, attached_interface, set()] + Transport.announce_table[packet.destination_hash] = [now, retransmit_timeout, retries, received_from, announce_hops, packet, local_rebroadcasts, block_rebroadcasts, attached_interface] if not Transport.owner.is_connected_to_shared_instance: RNS.Identity._used_destination_data(packet.destination_hash) elif is_from_local_client: # Forward path request on all interfaces # except the local client - RNS.log(f"Forwarding path request from local client for {RNS.prettyhexrep(destination_hash)+interface_str} to all other interfaces", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None + RNS.log("Forwarding path request from local client for "+RNS.prettyhexrep(destination_hash)+interface_str+" to all other interfaces", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None + request_tag = RNS.Identity.get_random_hash() for interface in Transport.interfaces: if not interface == attached_interface: - Transport.request_path(destination_hash, interface, tag=tag, ext_payload=ext_payload) + Transport.request_path(destination_hash, interface, tag = request_tag) elif should_search_for_unknown: with Transport.discovery_pr_lock: @@ -4103,16 +3538,9 @@ class Transport: discovery_path_request_exists = False path_request_engaged = False - if discovery_path_request_exists and path_request_engaged: RNS.log("There is already a waiting path request for "+RNS.prettyhexrep(destination_hash)+" on behalf of path request"+interface_str, RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None + if discovery_path_request_exists and path_request_engaged: + RNS.log("There is already a waiting path request for "+RNS.prettyhexrep(destination_hash)+" on behalf of path request"+interface_str, RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None else: - # Sentinel check for potential enforcement logic leaks. - # This branch should never fire, but better have it made - # visible and explicit if for some unexpected reason it does. - if ext_payload == None and Transport.STAMPS_ENFORCED: - # TODO: Remove *after* enforcement transition and verification. - RNS.log(f"Reached rebroadcast decision for unstamped path request for {RNS.prettyhexrep(destination_hash)} under stamp enforcement. This should not happen.", RNS.LOG_CRITICAL) - return - # Abort recursive path request if receiving # interface has PR burst active, or should # otherwise ingress limit path requests. @@ -4143,14 +3571,6 @@ class Transport: Transport.discovery_path_requests[destination_hash] = pr_entry - # TODO: Remove - # Don't generate stamps for non-stamped recursive - # path requests received from non-stamping nodes - # during the transition period where this node may - # be stamping, but still accepting unstamped PRs. - if ext_payload == None and Transport.STAMP_PRS: - ext_payload = bytes([RNS.Identity.EXTPAYLOADMARKER, 0xFF])+bytes(RNS.Identity.STAMPLENGTH) - for interface in Transport.interfaces: if search_mode_filter and not interface.mode in search_mode_filter: continue if not interface.online: continue @@ -4160,23 +3580,17 @@ class Transport: else: # Use the previously extracted tag from this path request # on the new path requests as well, to avoid potential loops - Transport.request_path(destination_hash, on_interface=interface, tag=tag, recursive=True, ext_payload=ext_payload) + Transport.request_path(destination_hash, on_interface=interface, tag=tag, recursive=True) elif not is_from_local_client and len(Transport.local_client_interfaces) > 0: - # TODO: Remove - # Don't generate stamps for non-stamped external - # path requests received from non-stamping nodes - # during the transition period where this node may - # be stamping, but still accepting unstamped PRs. - if ext_payload == None and Transport.STAMP_PRS: - ext_payload = bytes([RNS.Identity.EXTPAYLOADMARKER, 0xFF])+bytes(RNS.Identity.STAMPLENGTH) - - # Forward the path request on all local client interfaces - RNS.log(f"Forwarding path request for {RNS.prettyhexrep(destination_hash)}{interface_str} to local clients", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None + # Forward the path request on all local + # client interfaces + RNS.log("Forwarding path request for "+RNS.prettyhexrep(destination_hash)+interface_str+" to local clients", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None for interface in Transport.local_client_interfaces: - Transport.request_path(destination_hash, on_interface=interface, tag=tag, ext_payload=ext_payload) + Transport.request_path(destination_hash, on_interface=interface) + else: - RNS.log(f"Ignoring path request for {RNS.prettyhexrep(destination_hash)}{interface_str}, no path known", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None + RNS.log("Ignoring path request for "+RNS.prettyhexrep(destination_hash)+interface_str+", no path known", RNS.LOG_PATHING) if RNS.sl(RNS.LOG_PATHING) else None if answered: # Resolve potential in-flight path requests @@ -4184,122 +3598,6 @@ class Transport: if destination_hash in Transport.inflight_path_requests: Transport.inflight_path_requests.pop(destination_hash) - ######################## - # Path Request Helpers # - ######################## - - PR_EXT_HEADERLENGTH = 2 - PR_EXT_STAMPLENGTH = RNS.Identity.STAMPLENGTH - PR_EXT_PAYLOADLENGTH = PR_EXT_HEADERLENGTH+PR_EXT_STAMPLENGTH - PR_LENGTH = 3*RNS.Identity.TRUNCATED_HASHLENGTH//8 - PR_STAMPED_LENGTH = PR_LENGTH+PR_EXT_PAYLOADLENGTH - PR_LEGACY_LENGTH = 2*RNS.Identity.TRUNCATED_HASHLENGTH//8 # TODO: Remove after transition - @staticmethod - def parse_path_request(data): - DL = RNS.Identity.TRUNCATED_HASHLENGTH//8 - if len(data) < DL: return None - destination_hash = data[:DL] - - # Stamped 1.6.0+ format (dst_hash|tid|tag|ext) - if len(data) == Transport.PR_STAMPED_LENGTH: - return (destination_hash, data[DL:DL*2], data[DL*2:DL*3], data[DL*3:]) - - # TODO: Remove after transition - # Unstamped, pre 1.6.0 format (dst_hash|tid|tag), - # potentially variable tag size, although RNS will - # always emit 16-byte tags. Truncates oversized tags. - elif len(data) > DL*2: - tag = data[DL*2:] - if len(tag) > DL: tag = tag[:DL] - return (destination_hash, data[DL:DL*2], tag, None) - - # TODO: Remove after transition - # Legacy format without transport ID, but with tag - elif len(data) > DL: return (destination_hash, None, data[DL:], None) - - # Ancient tagless path request, invalid - else: return None - - @staticmethod - def pr_stamp_material(destination_hash, tag): - return destination_hash+tag - - @staticmethod - def validate_pr_stamp(stamp, destination_hash, tag, required_value=None): - if required_value == None: required_value = Transport.PR_COST - if not stamp or len(stamp) != RNS.Identity.STAMPLENGTH: return False - workblock = stamp_workblock(Transport.pr_stamp_material(destination_hash, tag), expand_rounds=0) - return stamp_valid(stamp, required_value, workblock) - - @staticmethod - def stamp_path_request(destination_hash, on_interface=None, tag=None, recursive=False, return_payload=False): - if tag == None: request_tag = RNS.Identity.get_random_hash() - else: request_tag = tag - - material = Transport.pr_stamp_material(destination_hash, request_tag) - with Transport.pr_stamp_cache_lock: stamp = Transport.pr_stamp_cache.get(material, None) - - if not stamp: - stamp_status = None - stamp_job_id = material - def stamp_watchdog(): - deadline = time.time() + RNS.Transport.PR_STAMP_TIMEOUT - while stamp_status == None and time.time() <= deadline: time.sleep(1) - if time.time() > deadline and stamp_job_id and not stamp_status: cancel_work(stamp_job_id) - - threading.Thread(target=stamp_watchdog, daemon=True).start() - stamp, value = generate_stamp(material, stamp_cost=Transport.PR_VALUE, expand_rounds=0, size=RNS.Identity.STAMPLENGTH) - stamp_job_id = None - - if stamp: stamp_status = True - else: - stamp_status = False - RNS.log(f"Could not generate path request stamp for {RNS.prettyhexrep(destination_hash)}, path request emission cancelled", RNS.LOG_WARNING) - return - - with Transport.pr_stamp_cache_lock: - Transport.pr_stamp_cache[material] = stamp - while len(Transport.pr_stamp_cache) > Transport.pr_stamp_cache_max: - Transport.pr_stamp_cache.pop(next(iter(Transport.pr_stamp_cache))) - - ext_payload = bytes([RNS.Identity.EXTPAYLOADMARKER, 0x00])+stamp - if return_payload: return request_tag, ext_payload - else: Transport.request_path(destination_hash, on_interface=on_interface, tag=request_tag, recursive=recursive, ext_payload=ext_payload) - - discovery_pr_tx_throttle = 0.5 - discovery_pr_tx_lock = Lock() - discovery_pr_handle_lock = Lock() - pending_discovery_prs = deque(maxlen=max_queued_discovery_prs) - @staticmethod - def handle_disovery_path_requests(): - if Transport.discovery_pr_handle_lock.locked(): return - with Transport.discovery_pr_handle_lock: - while len(Transport.pending_discovery_prs): - time.sleep(Transport.discovery_pr_tx_throttle) - destination_hash = None - blocked_if = None - with Transport.discovery_pr_tx_lock: - entry = Transport.pending_discovery_prs.popleft() - destination_hash = entry[0] - blocked_if = entry[1] - - if destination_hash: - if blocked_if == None: Transport.request_path(destination_hash) - else: - request_tag = RNS.Identity.get_random_hash() - ext_payload = None - if Transport.STAMP_PRS: - RNS.log(f"Stamping discovery path request for {RNS.prettyhexrep(destination_hash)}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - request_tag, ext_payload = Transport.stamp_path_request(destination_hash, tag=request_tag, return_payload=True) - - for interface in Transport.interfaces: - if interface != blocked_if: Transport.request_path(destination_hash, on_interface=interface, tag=request_tag, ext_payload=ext_payload) - else: pass - - ################################# - # Interface helpers & utilities # - ################################# - @staticmethod def from_local_client(packet): if hasattr(packet.receiving_interface, "parent_interface"): @@ -4308,32 +3606,20 @@ class Transport: @staticmethod def is_local_client_interface(interface): - if interface.parent_interface: - if interface.parent_interface.is_local_shared_instance: return True - else: return False - else: return False + if hasattr(interface, "parent_interface"): + if hasattr(interface.parent_interface, "is_local_shared_instance"): return True + else: return False + else: return False @staticmethod def is_shared_instance(interface): - if interface.is_local_shared_instance: return True - else: return False + if hasattr(interface, "is_local_shared_instance"): return True + else: return False @staticmethod def interface_to_shared_instance(interface): - if interface.is_connected_to_shared_instance: return True - else: return False - - @staticmethod - def interface_hashes(): - return {interface.get_hash() for interface in Transport.interfaces} - - @staticmethod - def find_interface_from_hash(interface_hash): - for interface in Transport.interfaces: - if interface.get_hash() == interface_hash: - return interface - - return None + if hasattr(interface, "is_connected_to_shared_instance"): return True + else: return False @staticmethod def detach_interfaces(): @@ -4422,10 +3708,6 @@ class Transport: if registered_destination.type == RNS.Destination.SINGLE: registered_destination.announce(path_response=True) - #################### - # Announce Helpers # - #################### - @staticmethod def drop_announce_queues(): for interface in Transport.interfaces: @@ -4437,7 +3719,7 @@ class Transport: interface.announce_queue = [] RNS.log("Dropped "+na_str+" on "+str(interface), RNS.LOG_VERBOSE) if RNS.sl(RNS.LOG_VERBOSE) else None - Transport.should_collect = True + gc.collect() @staticmethod def timebase_from_random_blob(random_blob): @@ -4459,30 +3741,6 @@ class Transport: return announce_emitted - @staticmethod - def announce_prefilter(announce_packet, path_entry): - destination_hash = announce_packet.destination_hash - receiving_interface = path_entry[IDX_PT_RVCD_IF] - if receiving_interface == None: return True - - announce_emitted = RNS.Transport.announce_emitted(announce_packet) - path_timebase = 0 - for random_blob in path_entry[IDX_PT_RANDBLOBS][:]: - emitted = RNS.Transport.timebase_from_random_blob(random_blob) - if emitted > path_timebase: path_timebase = emitted - if path_timebase > announce_emitted: break - - if announce_emitted > path_timebase: return True - if announce_emitted < path_timebase: return False - if announce_packet.receiving_interface.gravity > receiving_interface.gravity: - return True - - return RNS.Transport.path_states.get(destination_hash) == RNS.Transport.STATE_UNRESPONSIVE - - ##################### - # State Persistence # - ##################### - @staticmethod def save_packet_hashlist(background=False): if not Transport.owner.is_connected_to_shared_instance: @@ -4509,20 +3767,23 @@ class Transport: packet_hashlist_path = RNS.Reticulum.storagepath+"/packet_hashlist.raw" with open(packet_hashlist_path, "wb") as file: - for bucket in Transport.packet_hashlist.buckets(): + for packet_hash in Transport.packet_hashlist.copy(): if background: if time.time() - round_started_at > yield_threshold: # Low priority, yield thread round_started_at = time.time() time.sleep(0.001) - file.write(bucket) + file.write(packet_hash) RNS.log(f"Saved packet hashlist in {RNS.prettyshorttime(time.time()-save_start)}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None except Exception as e: RNS.log("Could not save packet hashlist to storage, the contained exception was: "+str(e), RNS.LOG_ERROR) finally: Transport.saving_packet_hashlist = False + gc.collect() + + @staticmethod def save_path_table(background=False): if not Transport.owner.is_connected_to_shared_instance: @@ -4578,7 +3839,6 @@ class Transport: expires = de[IDX_PT_EXPIRES] random_blobs = de[IDX_PT_RANDBLOBS] packet_hash = de[IDX_PT_PACKET] - used = de[IDX_PT_USED] interface_hash = interface.get_hash() serialised_entry = [ destination_hash, @@ -4588,8 +3848,7 @@ class Transport: expires, random_blobs, interface_hash, - packet_hash, - used ] + packet_hash ] serialised_destinations.append(serialised_entry) @@ -4613,6 +3872,8 @@ class Transport: RNS.trace_exception(e) Transport.saving_path_table = False + gc.collect() + @staticmethod def save_tunnel_table(background=False): @@ -4661,7 +3922,6 @@ class Transport: path_expires = de[3] random_blobs = de[4][-Transport.PERSIST_RANDOM_BLOBS:] packet_hash = de[6] - used = de[7] serialised_entry = [ destination_hash, @@ -4671,8 +3931,7 @@ class Transport: path_expires, random_blobs, interface_hash, - packet_hash, - used, + packet_hash ] serialised_paths.append(serialised_entry) @@ -4697,13 +3956,7 @@ class Transport: RNS.log("Could not save tunnel table to storage, the contained exception was: "+str(e), RNS.LOG_ERROR) Transport.saving_tunnel_table = False - - @staticmethod - def save_announce_rate_table(background=False): - if RNS.Reticulum.transport_enabled() and not Transport.owner.is_connected_to_shared_instance: - RNS.log("Saving announce rate table to storage...", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None - st = time.time(); Transport.announce_rate_table.persist(RNS.Reticulum.storagepath+"/announce_rate_table") - RNS.log(f"Saved announce rate table to storage in {RNS.prettyshorttime(time.time()-st, compact=True)}", RNS.LOG_DEBUG) if RNS.sl(RNS.LOG_DEBUG) else None + gc.collect() @staticmethod def persist_data(background=False): @@ -4712,11 +3965,20 @@ class Transport: Transport.save_packet_hashlist(background=background) Transport.save_path_table(background=background) Transport.save_tunnel_table(background=background) - Transport.save_announce_rate_table(background=background) + gc.collect() - ######################## - # Blackhole Management # - ######################## + @staticmethod + def void_queues(): + Transport.held_announces = {} + Transport.receipts = [] + Transport.reverse_table = {} + + @staticmethod + def exit_handler(): + Transport._should_run = False + Transport.void_queues() + if not Transport.owner.is_connected_to_shared_instance: + Transport.persist_data() @staticmethod def blackhole_identity(identity_hash, until=None, reason=None): @@ -4734,7 +3996,6 @@ class Transport: Transport.blackholed_identities[identity_hash] = entry Transport.persist_blackhole() Transport.remove_blackholed_paths() - RNS.Identity._reset_validation_caches() RNS.log(f"Blackholed identity {RNS.prettyhexrep(identity_hash)}", RNS.LOG_INFO) return True @@ -4756,7 +4017,6 @@ class Transport: if identity_hash in Transport.blackholed_identities: Transport.blackholed_identities.pop(identity_hash) Transport.persist_blackhole() - RNS.Identity._reset_validation_caches() RNS.log(f"Lifted blackhole for identity {RNS.prettyhexrep(identity_hash)}", RNS.LOG_INFO) return True @@ -4804,10 +4064,8 @@ class Transport: RNS.log(f"Could not load blackholed identities from source file {filename}: {e}", RNS.LOG_ERROR) RNS.trace_exception(e) - RNS.Identity._reset_validation_caches() Transport.remove_blackholed_paths() - @staticmethod def remove_blackholed_paths(): drop_destinations = [] for destination_hash in Transport.path_table.copy(): @@ -4829,15 +4087,6 @@ class Transport: ms = "" if len(drop_destinations) == 1 else "s" RNS.log(f"Removed {len(drop_destinations)} destination{ms} associated with blackholed identities from path table", RNS.LOG_INFO) - detach_interfaces = [] - for interface in Transport.interfaces: - if interface.remote_transport and interface.remote_transport.hash in Transport.blackholed_identities: - detach_interfaces.append(interface) - - for interface in detach_interfaces: - RNS.log(f"Tearing down {interface} from blackholed transport node {RNS.prettyhexrep(interface.remote_transport.hash)}", RNS.LOG_INFO) - RNS.Reticulum.get_instance()._detach_interface(None, interface_instance=interface, internal_forced=True) - @staticmethod def blackhole_list_handler(path, data, request_id, link_id, remote_identity, requested_at): try: return Transport.blackholed_identities @@ -4866,272 +4115,8 @@ class Transport: RNS.log(f"Error while persisting blackhole list: {e}", RNS.LOG_ERROR) RNS.trace_exception(e) - ############################## - # Destination Type Filtering # - ############################## - destination_filters_lock = threading.Lock() - - @staticmethod - def block_destination_type(full_name): - try: - name_hash = None - if not full_name: return - if full_name.startswith("<") and full_name.endswith(">"): - full_name = full_name[1:1+RNS.Identity.NAME_HASH_LENGTH//8*2] - try: name_hash = bytes.fromhex(full_name) - except: name_hash = None - - name_hash = name_hash or RNS.Destination.name_hash(full_name) - with Transport.destination_filters_lock: - Transport.blocked_destination_types[name_hash] = [True] - Transport.client_destination_types.pop(name_hash, None) - Transport.destination_type_map[name_hash] = full_name - Transport.flagged_type_map[name_hash] = full_name - RNS.log(f"Blocked {full_name} {RNS.prettyhexrep(name_hash)} destinations", RNS.LOG_DEBUG) - return True - except Exception as e: RNS.log(f"Could not add {full_name} destination type to blocked list: {e}", RNS.LOG_ERROR) - return False - - @staticmethod - def allow_destination_type(full_name): - try: - name_hash = None - if not full_name: return - if full_name.startswith("<") and full_name.endswith(">"): - full_name = full_name[1:1+RNS.Identity.NAME_HASH_LENGTH//8*2] - try: name_hash = bytes.fromhex(full_name) - except: name_hash = None - - name_hash = name_hash or RNS.Destination.name_hash(full_name) - with Transport.destination_filters_lock: - Transport.allowed_destination_types[name_hash] = [True] - Transport.destination_type_map[name_hash] = full_name - if Transport.required_destinations_only: RNS.log(f"Allowing {Transport.destination_type_name(name_hash)} {RNS.prettyhexrep(name_hash)} destinations", RNS.LOG_DEBUG) - return True - except Exception as e: RNS.log(f"Could not add {Transport.destination_type_name(name_hash)} destination type to allowed list: {e}", RNS.LOG_ERROR) - return False - - @staticmethod - def _wants_destination_type(full_name, requester, signature): - try: - name_hash = RNS.Destination.name_hash(full_name) - if not name_hash in Transport.blocked_destination_types: - with Transport.destination_filters_lock: - # TODO: Add requester signature validation - entry = Transport.client_destination_types.get(name_hash, [True, {}]) - entry[1][requester] = [True] - Transport.client_destination_types[name_hash] = entry - Transport.destination_type_map[name_hash] = full_name - RNS.log(f"Registered {Transport.destination_type_name(name_hash)} {RNS.prettyhexrep(name_hash)} destinations requirement for {RNS.prettyhexrep(requester)}", RNS.LOG_DEBUG) - return True - - except Exception as e: RNS.log(f"Could not add {Transport.destination_type_name(name_hash)} destination type to clients required list: {e}", RNS.LOG_ERROR) - return False - - @staticmethod - def _unwants_destination_type(full_name, requester, signature, name_hash=None): - try: - if not name_hash: name_hash = RNS.Destination.name_hash(full_name) - with Transport.destination_filters_lock: - # TODO: Add requester signature validation - entry = Transport.client_destination_types.get(name_hash, None) - if entry: - was_registered = entry[1].pop(requester, None) - if was_registered: RNS.log(f"Deregistered {Transport.destination_type_name(name_hash)} {RNS.prettyhexrep(name_hash)} destinations requirement for {RNS.prettyhexrep(requester)}", RNS.LOG_DEBUG) - if len(entry[1]) == 0: - Transport.client_destination_types.pop(name_hash, None) - RNS.log(f"No remaining requesters for {Transport.destination_type_name(name_hash)} {RNS.prettyhexrep(name_hash)} destinations, type deregistered", RNS.LOG_DEBUG) - if was_registered: return True - - except Exception as e: RNS.log(f"Could not remove {Transport.destination_type_name(name_hash)} destination type for {RNS.prettyhexrep(requester)} from clients required list: {e}", RNS.LOG_ERROR) - return False - - @staticmethod - def _unwants_all_destination_types(requester, signature): - try: - for name_hash in Transport.client_destination_types.copy(): - Transport._unwants_destination_type(None, requester, signature, name_hash=name_hash) - RNS.log(f"Deregistered all destination requirements for {RNS.prettyhexrep(requester)}", RNS.LOG_DEBUG) - return True - - except Exception as e: RNS.log(f"Could not deregister all destination types for {RNS.prettyhexrep(requester)} from clients required list: {e}", RNS.LOG_ERROR); RNS.trace_exception(e) - return False - - @staticmethod - def destination_type_name(name_hash): - if name_hash in Transport.destination_type_map: return Transport.destination_type_map[name_hash] - elif name_hash in Transport.flagged_type_map: return Transport.flagged_type_map[name_hash] - else: return RNS.hexrep(name_hash, delimit=False) - - ################### - # Various Helpers # - ################### - - @staticmethod - def void_queues(): - Transport.held_announces = {} - Transport.receipts = [] - Transport.reverse_table = {} - - @staticmethod - def exit_handler(): - if not os.getpid() == RNS.Reticulum.get_instance_pid(): return - Transport._should_run = False - Transport.void_queues() - if hasattr(Transport, "owner") and not Transport.owner.is_connected_to_shared_instance: - Transport.persist_data() - if Transport.announce_cache != None: Transport.announce_cache.flush() - - ##################### - # Remote Management # - ##################### - - @staticmethod - def remote_status_handler(path, data, request_id, link_id, remote_identity, requested_at): - if remote_identity != None: - response = None - try: - if isinstance(data, list) and len(data) > 0: - response = [] - response.append(Transport.owner.get_interface_stats()) - if data[0] == True: response.append(Transport.owner.get_link_count()) - - if len(data) >= 2: - if data[1] == True: response.append(Transport.owner.get_profiling_results()) - - return response - - except Exception as e: - RNS.log("An error occurred while processing remote status request from "+str(remote_identity), RNS.LOG_ERROR) - RNS.log("The contained exception was: "+str(e), RNS.LOG_ERROR) - - return None - - @staticmethod - def remote_path_handler(path, data, request_id, link_id, remote_identity, requested_at): - if remote_identity != None: - response = None - try: - if isinstance(data, list) and len(data) > 0: - command = data[0] - destination_hash = None - max_hops = None - if len(data) > 1: destination_hash = data[1] - if len(data) > 2: max_hops = data[2] - - if command == "table": - table = Transport.owner.get_path_table(max_hops=max_hops) - response = [] - for path in table: - if destination_hash == None or destination_hash == path["hash"]: - response.append(path) - - elif command == "rates": - table = Transport.owner.get_rate_table() - response = [] - for path in table: - if destination_hash == None or destination_hash == path["hash"]: - response.append(path) - - return response - - except Exception as e: - RNS.log("An error occurred while processing remote status request from "+str(remote_identity), RNS.LOG_ERROR) - RNS.log("The contained exception was: "+str(e), RNS.LOG_ERROR) - - return None - -##################### -# Memory Management # -##################### - -MEM_TRIM_FLOOR = 60 -_trim_impl = None -_trim_resolved = False - -def garbage_collect(): - Transport.should_collect = False - gc.collect(); Transport.mem_dirty = True - Transport.last_collect = time.time() - -def trim_heap(): - global _trim_impl, _trim_resolved - if not _trim_resolved: - _trim_resolved = True - _trim_impl = _resolve_trim() - - if _trim_impl is not None: - try: - _trim_impl(Transport.mem_trim_pad) - Transport.last_trim_rss_kb = _proc_status_kb("VmRSS")["VmRSS"] - if Transport.last_trim_rss_kb >= 0: - RNS.log(f"Heap trimmed, RSS {RNS.prettysize(Transport.last_trim_rss_kb*1024)}", RNS.LOG_DEBUG) - except Exception as e: RNS.log(f"Memory trim error: {e}", RNS.LOG_DEBUG) - -def _proc_status_kb(*fields): - # Map missing fields to -1 - values = {field: -1 for field in fields} - try: - with open("/proc/self/status") as status_file: - for line in status_file: - for field in fields: - if line.startswith(field): - values[field] = int(line.split()[1]) - except (OSError, ValueError): pass - return values - -def _trim_due(now): - if not Transport.mem_dirty: return None - elapsed = now - Transport.last_mem_trim - - # If no gate configured, rely solely on throttle - if Transport.mem_trim_gate_mb <= 0: - if now > Transport.last_mem_trim+Transport.mem_trim_throttle: return -1 - return None - - # Hard limit trim cadence - if elapsed < MEM_TRIM_FLOOR: return None - - # First gated trim, no baseline yet - if Transport.last_trim_rss_kb < 0: return -1 - - rss = _proc_status_kb("VmRSS")["VmRSS"] - if rss < 0: # No RSS introspection available, fall back to the timer - if now > Transport.last_mem_trim+Transport.mem_trim_throttle: return -1 - return None - - surplus = rss - Transport.last_trim_rss_kb - if surplus >= Transport.mem_trim_gate_mb*1024: return surplus - return None - -def _resolve_trim(): - try: - if RNS.vendor.platformutils.is_linux(): - f = getattr(ctypes.CDLL(None), "malloc_trim", None) # Not available on musl - if f is None: return None - return lambda pad: f(pad) - elif RNS.vendor.platformutils.is_darwin(): - libc = ctypes.CDLL(ctypes.util.find_library("c")) - f = getattr(libc, "malloc_zone_pressure_relief", None) - if f is None: return None - def trim(pad): f(None, 0); f(None, 0) # Yes, it's strange, see Apple's malloc.h - return trim - elif RNS.vendor.platformutils.is_android(): - libc = ctypes.CDLL("libc.so") - return lambda pad: libc.mallopt(-101, 0) # M_PURGE, API 28+ - elif RNS.vendor.platformutils.is_windows(): - k32 = ctypes.WinDLL("kernel32") - heap = k32.GetProcessHeap() - f = k32.HeapTrim # Will raise AttributeError on Windows < 8 - return lambda pad: f(heap, 0) - except Exception as e: RNS.log(f"Heap trim unavailable: {e}", RNS.LOG_DEBUG) - RNS.log(f"No working memory trim mechanism on this platform, memory management will be sub-optimal", RNS.LOG_WARNING) - return None - -####################### -# Table entry indices # -####################### +# Table entry indices # Transport.path_table entry indices IDX_PT_TIMESTAMP = 0 @@ -5141,7 +4126,6 @@ IDX_PT_EXPIRES = 3 IDX_PT_RANDBLOBS = 4 IDX_PT_RVCD_IF = 5 IDX_PT_PACKET = 6 -IDX_PT_USED = 7 # Transport.reverse_table entry indices IDX_RT_RCVD_IF = 0 @@ -5158,7 +4142,6 @@ IDX_AT_PACKET = 5 IDX_AT_LCL_RBRD = 6 IDX_AT_BLCK_RBRD = 7 IDX_AT_ATTCHD_IF = 8 -IDX_AT_DEDUP_IFS = 9 # Transport.link_table entry indices IDX_LT_TIMESTAMP = 0 @@ -5170,7 +4153,6 @@ IDX_LT_HOPS = 5 IDX_LT_DSTHASH = 6 IDX_LT_VALIDATED = 7 IDX_LT_PROOF_TMO = 8 -IDX_LT_TRXB = 9 # Transport.tunnels entry indices IDX_TT_TUNNEL_ID = 0 diff --git a/RNS/Utilities/__init__.py b/RNS/Utilities/__init__.py index 1f227878..454b31ff 100644 --- a/RNS/Utilities/__init__.py +++ b/RNS/Utilities/__init__.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal diff --git a/RNS/Utilities/rncp.py b/RNS/Utilities/rncp.py index e56baacf..151a5723 100644 --- a/RNS/Utilities/rncp.py +++ b/RNS/Utilities/rncp.py @@ -2,7 +2,7 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -387,7 +387,6 @@ def fetch(configdir, identitypath = None, verbosity = 0, quietness = 0, destinat RNS.exit(1) reticulum = RNS.Reticulum(configdir=configdir, loglevel=targetloglevel) - reticulum.wants_destination_type(f"{APP_NAME}.receive") if identity == None: prepare_identity(identitypath) @@ -644,7 +643,6 @@ def send(configdir, identitypath = None, verbosity = 0, quietness = 0, destinati print(f"{erase_str}", end="") reticulum = RNS.Reticulum(configdir=configdir, loglevel=targetloglevel) - reticulum.wants_destination_type(f"{APP_NAME}.receive") if identity == None: prepare_identity(identitypath) diff --git a/RNS/Utilities/rngit/client.py b/RNS/Utilities/rngit/client.py index bc2681ee..454bea20 100644 --- a/RNS/Utilities/rngit/client.py +++ b/RNS/Utilities/rngit/client.py @@ -154,8 +154,6 @@ class ReticulumGitClient(): print(f"Failed to initialize Reticulum: {e}", file=sys.stderr) return - self.reticulum.wants_destination_type(f"{APP_NAME}.repositories") - self.__apply_config() self.ready = True diff --git a/RNS/Utilities/rngit/media.py b/RNS/Utilities/rngit/media.py deleted file mode 100644 index 75008c29..00000000 --- a/RNS/Utilities/rngit/media.py +++ /dev/null @@ -1,239 +0,0 @@ -# Reticulum License -# -# Copyright (c) 2016-2026 Mark Qvist -# -# Permission is hereby granted, free of charge, to any person obtaining a copy -# of this software and associated documentation files (the "Software"), to deal -# in the Software without restriction, including without limitation the rights -# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -# copies of the Software, and to permit persons to whom the Software is -# furnished to do so, subject to the following conditions: -# -# - The Software shall not be used in any kind of system which includes amongst -# its functions the ability to purposefully do harm to human beings. -# -# - The Software shall not be used, directly or indirectly, in the creation of -# an artificial intelligence, machine learning or language model training -# dataset, including but not limited to any use that contributes to the -# training or development of such a model or algorithm. -# -# - The above copyright notice and this permission notice shall be included in -# all copies or substantial portions of the Software. -# -# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE -# SOFTWARE. - -import os -import time -import shutil -import subprocess -import tempfile -import RNS - -CONVERSION_TIMEOUT = 8 - -# WebP encoding backends, in preference order. All supported -# encoder families handle the common still formats (PNG, JPEG, -# TIFF, BMP, GIF, WebP). -# -# Environment overrides: -# RNGIT_MEDIA_BACKEND force a specific backend - -BACKENDS = ( ("magick", ["magick", "-", "webp:-"]), - ("convert", ["convert", "-", "webp:-"]), - ("gm", ["gm", "convert", "-", "webp:-"]), - ("ffmpeg", ["ffmpeg", "-y", "-loglevel", "error", "-i", "-", "-f", "webp", "pipe:1"]), - ("avconv", ["avconv", "-y", "-loglevel", "error", "-i", "-", "-f", "webp", "pipe:1"]) ) - -_ENV_BACKEND = os.environ.get("RNGIT_MEDIA_BACKEND") -_winner = None -_no_backend_logged = False - -def available_backends(): - out = [] - for name, argv in BACKENDS: out.append((name, shutil.which(argv[0]) is not None)) - return out - -def _selected_backend(): - global _winner - if _ENV_BACKEND: - for name, argv in BACKENDS: - if name == _ENV_BACKEND and shutil.which(argv[0]) is not None: - return (name, argv) - return None - - order = list(BACKENDS) - if _winner is not None: order.sort(key=lambda backend: backend[0] != _winner) - - for name, argv in order: - if shutil.which(argv[0]) is not None: - _winner = name - return (name, argv) - - return None - -def _terminate(proc): - try: proc.kill() - except Exception: pass - try: proc.wait() - except Exception: pass - -def _stderr_tail(proc, limit=1024): - try: - data = proc.stderr.read(limit) - return data.decode("utf-8", "replace").strip() - except Exception: return "" - -def _webp_info(data): - if len(data) < 30 or data[:4] != b"RIFF" or data[8:12] != b"WEBP": return None - fourcc = data[12:16] - if fourcc == b"VP8X": - width = int.from_bytes(data[24:27], "little") + 1 - height = int.from_bytes(data[27:30], "little") + 1 - elif fourcc == b"VP8 ": - width = int.from_bytes(data[26:28], "little") & 0x3FFF - height = int.from_bytes(data[28:30], "little") & 0x3FFF - elif fourcc == b"VP8L": - bits = int.from_bytes(data[21:25], "little") - width = (bits & 0x3FFF) + 1 - height = ((bits >> 14) & 0x3FFF) + 1 - else: return None - if width > 0 and height > 0: return (width, height) - return None - -def _valid_webp(path): - try: - with open(path, "rb") as fh: return _webp_info(fh.read(30)) is not None - except Exception: return False - -def _unlink_output(path): - try: os.unlink(path) - except Exception: pass - -def _configured_backend(quality=None, max_dimension=None): - global _no_backend_logged - backend = _selected_backend() - if backend is None: - if not _no_backend_logged: - _no_backend_logged = True - RNS.log("No WebP encoding backend available for media conversion. You can Install ImageMagick or ffmpeg to enable image conversion.", RNS.LOG_WARNING) - return None - - backend_name, encoder_argv = backend - _no_backend_logged = False - - quality_arg = None - dimension_arg = None - if quality is not None: - try: quality_arg = max(1, min(100, int(quality))) - except (ValueError, TypeError): pass - if max_dimension is not None: - try: dimension_arg = int(max_dimension) - except (ValueError, TypeError): pass - if dimension_arg is not None and dimension_arg < 1: dimension_arg = None - - encoder_argv = list(encoder_argv) - if backend_name in ("magick", "convert", "gm"): - options = [] - if quality_arg is not None: options += ["-quality", str(quality_arg)] - if dimension_arg is not None: options += ["-resize", f"{dimension_arg}x{dimension_arg}>"] - encoder_argv = encoder_argv[:-1] + options + encoder_argv[-1:] - elif backend_name in ("ffmpeg", "avconv"): - options = [] - if quality_arg is not None: options += ["-quality", str(quality_arg)] - if dimension_arg is not None: options += ["-vf", f"scale='min(iw,{dimension_arg})':'min(ih,{dimension_arg})':force_original_aspect_ratio=decrease"] - try: format_index = encoder_argv.index("-f") - except ValueError: format_index = len(encoder_argv) - encoder_argv = encoder_argv[:format_index] + options + encoder_argv[format_index:] - - return backend_name, encoder_argv - -def _await(backend_name, encoder_proc, input_proc=None, timeout=None): - if timeout is None: timeout = CONVERSION_TIMEOUT - - deadline = time.time() + timeout - try: - encoder_proc.wait(timeout=max(0.0, deadline - time.time())) - if input_proc is not None: input_proc.wait(timeout=max(0.0, deadline - time.time())) - except subprocess.TimeoutExpired: - _terminate(input_proc) - _terminate(encoder_proc) - RNS.log(f"Media conversion via {backend_name} timed out after {timeout} seconds", RNS.LOG_WARNING) - return False - - if encoder_proc.returncode != 0: - detail = "" - encoder_tail = _stderr_tail(encoder_proc) - input_tail = _stderr_tail(input_proc) if input_proc is not None else "" - if encoder_tail: detail += f" Encoder: {encoder_tail}" - if input_tail: detail += f" Input: {input_tail}" - RNS.log(f"Media conversion via {backend_name} failed.{detail}", RNS.LOG_WARNING) - return False - - return True - -def convert_to_webp(input_argv, output_path, cwd=None, timeout=None, quality=None, max_dimension=None): - configured = _configured_backend(quality=quality, max_dimension=max_dimension) - if configured is None: return False - - backend_name, encoder_argv = configured - - try: - with open(output_path, "wb") as output_fh: - input_proc = subprocess.Popen(input_argv, cwd=cwd, stdout=subprocess.PIPE, stderr=subprocess.PIPE) - encoder_proc = subprocess.Popen(encoder_argv, stdin=input_proc.stdout, stdout=output_fh, stderr=subprocess.PIPE) - - # The parent must not retain a copy of the input pipe's write - # end, or the input process would never see EOF. - input_proc.stdout.close() - if not _await(backend_name, encoder_proc, input_proc=input_proc, timeout=timeout): return False - - if not _valid_webp(output_path): - RNS.log(f"Media conversion via {backend_name} produced invalid WebP output", RNS.LOG_WARNING) - return False - - RNS.log(f"Media converted to WebP with {backend_name}", RNS.LOG_DEBUG) - return True - - except Exception as e: - RNS.log(f"Error during media conversion: {e}", RNS.LOG_WARNING) - return False - -def convert_file_to_webp(source_path, quality=85, max_dimension=None, timeout=None): - configured = _configured_backend(quality=quality, max_dimension=max_dimension) - if configured is None: return False - backend_name, encoder_argv = configured - - tmp_path = None - success = False - try: - if not os.path.isfile(source_path): - RNS.log(f"Cannot convert media: source file does not exist: {source_path}", RNS.LOG_WARNING) - return False - - fd, tmp_path = tempfile.mkstemp(prefix="rns_media_", suffix=".webp") - os.close(fd) - - with open(source_path, "rb") as input_fh, open(tmp_path, "wb") as output_fh: - encoder_proc = subprocess.Popen(encoder_argv, stdin=input_fh, stdout=output_fh, stderr=subprocess.PIPE) - if not _await(backend_name, encoder_proc, timeout=timeout): return False - - if not _valid_webp(tmp_path): - RNS.log(f"Invalid media conversion output from {backend_name}", RNS.LOG_WARNING) - return False - - success = True - RNS.log(f"Media converted to WebP with {backend_name}", RNS.LOG_DEBUG) - return tmp_path - - except Exception as e: - RNS.log(f"Error during media conversion: {e}", RNS.LOG_WARNING) - return False - - finally: - if not success and tmp_path is not None: _unlink_output(tmp_path) diff --git a/RNS/Utilities/rngit/pages.py b/RNS/Utilities/rngit/pages.py index 86523feb..faad08e9 100644 --- a/RNS/Utilities/rngit/pages.py +++ b/RNS/Utilities/rngit/pages.py @@ -32,14 +32,13 @@ import os import time import threading import subprocess -import tempfile import urllib.parse import RNS import struct import base64 from collections import deque from datetime import datetime -from RNS.Utilities.rngit import APP_NAME, media +from RNS.Utilities.rngit import APP_NAME from RNS.Utilities.rngit.util import MarkdownToMicron, san_sha from RNS.Utilities.rngit.highlight import SyntaxHighlighter from RNS.vendor.configobj import ConfigObj @@ -51,7 +50,6 @@ from RNS.Utilities.rngit.commitsigs import unarmor_ssh_signature, parse_ssh_sign class NomadNetworkNode(): APP_NAME = "nomadnetwork" JOBS_INTERVAL = 5 - LINK_CLEAN_INTERVAL = 60 PATH_INDEX = "/page/index.mu" PATH_GROUP = "/page/group.mu" @@ -66,12 +64,10 @@ class NomadNetworkNode(): PATH_RELEASE = "/page/release.mu" PATH_WORK = "/page/work.mu" PATH_WORK_DOC = "/page/work_doc.mu" - PATH_MEDIA = "/media" FILE_ARTIFACT = "/file/artifact" FILE_DOWNLOAD = "/file/download" FILE_WORKDOC = "/file/workdoc" - DEFAULT_LINK_COST = 18.0 BLOB_SIZE_LIMIT = 256 * 1024 TREE_ENTRIES_PER_PAGE = 1000 COMMITS_PER_PAGE = 100 @@ -124,10 +120,8 @@ class NomadNetworkNode(): # want to use tabs, three spaces is all you get. TAB_WIDTH = " " - CONVERTABLE_EXTS = [".md"] - RENDERABLE_EXTS = [".md", ".mu"] - RENDER_DEFAULT = [".md", ".mu"] - IMAGE_EXTS = [".webp", ".png", ".jpg", ".jpeg", ".gif", ".tiff", ".tif", ".bmp"] + RENDERABLE_EXTS = [".md", ".mu"] + RENDER_DEFAULT = [".md", ".mu"] def __init__(self, owner=None): if not owner: raise TypeError(f"Invalid owner {owner} for {self}") @@ -139,8 +133,6 @@ class NomadNetworkNode(): self.node_name = owner.node_name self.announce_interval = owner.announce_interval self.last_announce = 0 - self.stamp_value = None - self.link_cost = self.DEFAULT_LINK_COST self.null_ident = RNS.Identity.from_bytes(bytes(64)) self.templates = {} @@ -158,16 +150,12 @@ class NomadNetworkNode(): self.templates["stats"] = DEFAULT_STATS_TEMPLATE self.templates["work"] = DEFAULT_WORK_TEMPLATE self.templates["work_doc"] = DEFAULT_WORK_DOC_TEMPLATE - self.templates["no_ident"] = DEFAULT_NO_IDENT_TEMPLATE self.templatesdir = self.owner.configdir+"/templates" self.use_nerdfonts = self.USE_NERDFONTS - self.media_conversion = True self.highlight_syntax = True self.highlighter = SyntaxHighlighter() self.mdc = MarkdownToMicron(max_width=self.MAX_RENDER_WIDTH, syntax_highlighter=self.highlighter) self.thanks_deque = deque(maxlen=256) - self.active_links = {} - self.last_link_clean = 0 if not os.path.isdir(self.templatesdir): try: os.makedirs(self.templatesdir) @@ -176,16 +164,8 @@ class NomadNetworkNode(): if "pages" in self.owner.config: if "unicode_icons" in self.owner.config["pages"]: if self.owner.config["pages"].as_bool("unicode_icons"): self.use_nerdfonts = False - if "media_conversion" in self.owner.config["pages"]: - self.media_conversion = self.owner.config["pages"].as_bool("media_conversion") - if "link_cost" in self.owner.config["pages"]: - self.link_cost = RNS.Stamps.quantize_cost(self.owner.config["pages"].as_float("link_cost")) - if "stamp_value" in self.owner.config["pages"]: - self.stamp_value = RNS.Stamps.quantize_cost(self.owner.config["pages"].as_float("stamp_value")) self.destination = RNS.Destination(self.identity, RNS.Destination.IN, RNS.Destination.SINGLE, self.APP_NAME, "node") - if self.stamp_value: self.destination.set_value(self.stamp_value) - self.destination.set_link_cost(self.link_cost) self.destination.set_link_established_callback(self.remote_connected) self.destination.set_default_app_data(self.get_announce_app_data) self.register_request_handlers() @@ -230,10 +210,6 @@ class NomadNetworkNode(): try: if self.announce_interval and time.time() > self.last_announce + self.announce_interval: self.announce() - if time.time() > self.last_link_clean + self.LINK_CLEAN_INTERVAL: - self.clean_links() - self.last_link_clean = time.time() - except Exception as e: RNS.log(f"Error while running periodic jobs: {e}", RNS.LOG_ERROR) def get_announce_app_data(self): return self.node_name.encode("utf-8") @@ -270,7 +246,6 @@ class NomadNetworkNode(): self.destination.register_request_handler(self.PATH_RELEASE, response_generator=self.serve_release_page, allow=RNS.Destination.ALLOW_ALL) self.destination.register_request_handler(self.PATH_WORK, response_generator=self.serve_work_page, allow=RNS.Destination.ALLOW_ALL) self.destination.register_request_handler(self.PATH_WORK_DOC, response_generator=self.serve_work_doc_page, allow=RNS.Destination.ALLOW_ALL) - self.destination.register_request_handler(self.PATH_MEDIA, response_generator=self.serve_media, allow=RNS.Destination.ALLOW_ALL, auto_compress=False) self.destination.register_request_handler(self.FILE_ARTIFACT, response_generator=self.serve_artifact, allow=RNS.Destination.ALLOW_ALL) self.destination.register_request_handler(self.FILE_DOWNLOAD, response_generator=self.serve_download, allow=RNS.Destination.ALLOW_ALL) self.destination.register_request_handler(self.FILE_WORKDOC, response_generator=self.serve_wd_download, allow=RNS.Destination.ALLOW_ALL) @@ -397,10 +372,6 @@ class NomadNetworkNode(): self.owner.view_succeeded(None, None, remote_identity) page_content = "".join(content_parts) nav_content = "".join(nav_parts) - - if not remote_identity and self.null_ident.hash in self.owner.blocked_identities: - return self.render_template("", template="no_ident", nav_content=nav_content, st=st) - return self.render_template(page_content, nav_content=nav_content, template="front", st=st) def serve_group_page(self, path, data, request_id, link_id, remote_identity, requested_at): @@ -421,9 +392,6 @@ class NomadNetworkNode(): nav_parts.append(breadcrumb + "\n") nav_content = "".join(nav_parts) - if not remote_identity and self.null_ident.hash in self.owner.blocked_identities: - return self.render_template("", template="no_ident", nav_content=nav_content, st=st) - accessible_repos = self.get_accessible_repositories(remote_identity, group_name) if not group_name or group_name not in self.owner.groups or not accessible_repos: @@ -473,9 +441,6 @@ class NomadNetworkNode(): repo = self.get_accessible_repository(remote_identity, group_name, repo_name) - if not remote_identity and self.null_ident.hash in self.owner.blocked_identities: - return self.render_template("", template="no_ident", nav_content="".join(nav_parts), st=st) - if not repo: content = self.m_heading("Not Found", 1) + "\nThe requested repository was not found.\n" return self.render_template(content, nav_content="".join(nav_parts), st=st) @@ -589,9 +554,6 @@ class NomadNetworkNode(): except (ValueError, TypeError): page_num = 0 - if not remote_identity and self.null_ident.hash in self.owner.blocked_identities: - return self.render_template("", template="no_ident", st=st) - repo = self.get_accessible_repository(remote_identity, group_name, repo_name) if not repo: content = self.m_heading("Not Found", 1) + "\n\nThe requested repository does not exist or you do not have access to it.\n" @@ -729,9 +691,6 @@ class NomadNetworkNode(): render = True if render else False raw = True if raw else False - if not remote_identity and self.null_ident.hash in self.owner.blocked_identities: - return self.render_template("", template="no_ident", st=st) - repo = self.get_accessible_repository(remote_identity, group_name, repo_name) if not repo: content = self.m_heading("Not Found", 1) + "\n\nThe requested repository does not exist or you do not have access to it.\n" @@ -753,7 +712,6 @@ class NomadNetworkNode(): file_path = file_path.removeprefix("./").replace("/./", "/") file_ext = os.path.splitext(file_path)[1].lower() renderable = file_ext in self.RENDERABLE_EXTS - convertable = file_ext in self.CONVERTABLE_EXTS if not renderable: raw = True; render = False else: if raw: render = False @@ -780,16 +738,14 @@ class NomadNetworkNode(): nav_parts.append(">>\n" + breadcrumb + "\n") sep = self.icon("sep") - dl_link = self.m_link("Download", self.FILE_DOWNLOAD, g=group_name, r=repo_name, ref=ref, path=file_path) + dl_link = self.m_link("Download", self.FILE_DOWNLOAD, g=group_name, r=repo_name, ref=ref, path=file_path) if not renderable: nav_parts.append(f"\nDisplaying Raw {sep} {dl_link}\n") else: rnd_link = self.m_link("View rendered", self.PATH_BLOB, g=group_name, r=repo_name, ref=ref, path=file_path, render="y") raw_link = self.m_link("View raw", self.PATH_BLOB, g=group_name, r=repo_name, ref=ref, path=file_path, raw="y") - mu_link = self.m_link("as micron", self.FILE_DOWNLOAD, g=group_name, r=repo_name, ref=ref, path=file_path, fmt="mu") if render: render_controls = f"Displaying Rendered {sep} {raw_link}" else: render_controls = f"Displaying Raw {sep} {rnd_link}" - if convertable: nav_parts.append(f"\n{render_controls} {sep} {dl_link} {self.CLR_DIM}{mu_link}`f\n") - else: nav_parts.append(f"\n{render_controls} {sep} {dl_link}\n") + nav_parts.append(f"\n{render_controls} {sep} {dl_link}\n") # Get blob info blob_info = self.get_blob_info(repo_path, resolved_ref, file_path) @@ -815,9 +771,8 @@ class NomadNetworkNode(): content_parts.append(f"`*{self.m_escape(symlink_target or 'unknown')}`*\n") elif is_binary: - if file_ext in self.IMAGE_EXTS: - content_parts.append(f"`(Image file`w=n`a=c`:/media/{group_name}/{repo_name}/{ref}/{urllib.parse.quote_plus(file_path)})\n") - else: content_parts.append("This file appears to be binary and cannot be displayed as text.\n") + content_parts.append("This file appears to be binary and cannot be displayed as text.\n") + # TODO: Implement raw file downloads elif size > self.BLOB_SIZE_LIMIT: content_parts.append(f"This file is {RNS.prettysize(size)}, which exceeds the display limit of {RNS.prettysize(self.BLOB_SIZE_LIMIT)}.\n") @@ -868,9 +823,6 @@ class NomadNetworkNode(): except (ValueError, TypeError): page_num = 0 - if not remote_identity and self.null_ident.hash in self.owner.blocked_identities: - return self.render_template("", template="no_ident", st=st) - repo = self.get_accessible_repository(remote_identity, group_name, repo_name) if not repo: content = self.m_heading("Not Found", 1) + "\n\nThe requested repository does not exist or you do not have access to it.\n" @@ -950,9 +902,6 @@ class NomadNetworkNode(): content = self.m_heading("Error", 2) + "\nInvalid request\n" return self.render_template(content, st=st) - if not remote_identity and self.null_ident.hash in self.owner.blocked_identities: - return self.render_template("", template="no_ident", st=st) - repo = self.get_accessible_repository(remote_identity, group_name, repo_name) if not repo: content = self.m_heading("Error", 2) + "\nThe requested repository was not found.\n" @@ -1108,9 +1057,6 @@ class NomadNetworkNode(): nav_parts.append(">>\n" + breadcrumb + "\n") nav_content = "".join(nav_parts) - if not remote_identity and self.null_ident.hash in self.owner.blocked_identities: - return self.render_template("", template="no_ident", st=st) - if not group_name or not repo_name: content = self.m_heading("Error", 2) + "\nInvalid request\n" return self.render_template(content, st=st) @@ -1209,9 +1155,6 @@ class NomadNetworkNode(): if not group_name or not repo_name: content = self.m_heading("Error", 2) + "\nInvalid request\n" return self.render_template(content, st=st) - - if not remote_identity and self.null_ident.hash in self.owner.blocked_identities: - return self.render_template("", template="no_ident", st=st) content_parts = [] nav_parts = [] @@ -1313,9 +1256,6 @@ class NomadNetworkNode(): content = self.m_heading("Error", 2) + "\nInvalid request\n" return self.render_template(content, st=st) - if not remote_identity and self.null_ident.hash in self.owner.blocked_identities: - return self.render_template("", template="no_ident", st=st) - repo = self.get_accessible_repository(remote_identity, group_name, repo_name) if not repo: content = self.m_heading("Error", 2) + "\nThe requested repository was not found.\n" @@ -1380,9 +1320,6 @@ class NomadNetworkNode(): content = self.m_heading("Error", 2) + "\nInvalid request\n" return self.render_template(content, st=st) - if not remote_identity and self.null_ident.hash in self.owner.blocked_identities: - return self.render_template("", template="no_ident", st=st) - repo = self.get_accessible_repository(remote_identity, group_name, repo_name) if not repo: content = self.m_heading("Error", 2) + "\nThe requested repository was not found.\n" @@ -1485,17 +1422,11 @@ class NomadNetworkNode(): content = self.m_heading("Error", 2) + "\nInvalid request\n" return self.render_template(content, st=st) - if not remote_identity and self.null_ident.hash in self.owner.blocked_identities: - return self.render_template("", template="no_ident", st=st) - repo = self.get_accessible_repository(remote_identity, group_name, repo_name) if not repo: content = self.m_heading("Error", 2) + "\nThe requested repository was not found.\n" return self.render_template(content, st=st) - work_path = f"{repo['path']}.work" - scopes_to_show = ["active", "completed", "proposed"] if scope == "all" else [scope] - content_parts = [] nav_parts = [] @@ -1510,46 +1441,17 @@ class NomadNetworkNode(): cmplt_s = "`_" if scope == "completed" else "" prpsd_s = "`_" if scope == "proposed" else "" all_s = "`_" if scope == "all" else "" - - # Count work documents - scope_counts = {"active": 0, "completed": 0, "proposed": 0} - for s in ["active", "completed", "proposed"]: - try: - folder_path = os.path.join(work_path, s) - if os.path.isdir(folder_path): - for entry in os.listdir(folder_path): - try: - doc_dir = os.path.join(folder_path, entry) - if not os.path.isdir(doc_dir): continue - - doc_id = int(entry) - read_access = self.resolve_doc_permission(remote_identity, group_name, repo_name, doc_id, self.owner.PERM_READ) - if not read_access: continue - - root_path = os.path.join(doc_dir, "root") - if not os.path.isfile(root_path): continue - scope_counts[s] += 1 - except Exception as e: RNS.trace_exception(e) - except Exception as e: RNS.trace_exception(e) - - force_counts = True - adc = scope_counts['active'] - cdc = scope_counts['completed'] - pdc = scope_counts['proposed'] - tdc = adc+cdc+pdc - adc_str = f" ({adc})" if force_counts or (not scope == "active" and adc) else "" - cdc_str = f" ({cdc})" if force_counts or (not scope == "completed" and cdc) else "" - pdc_str = f" ({pdc})" if force_counts or (not scope == "proposed" and pdc) else "" - tdc_str = f" ({tdc})" if force_counts or (not scope == "all" and tdc) else "" - filter_links = [] - filter_links.append(active_s+self.m_link("Active", self.PATH_WORK, g=group_name, r=repo_name, scope="active")+active_s+adc_str) - filter_links.append(cmplt_s+self.m_link("Completed", self.PATH_WORK, g=group_name, r=repo_name, scope="completed")+cmplt_s+cdc_str) - filter_links.append(prpsd_s+self.m_link("Proposed", self.PATH_WORK, g=group_name, r=repo_name, scope="proposed")+prpsd_s+pdc_str) - filter_links.append(all_s+self.m_link("All", self.PATH_WORK, g=group_name, r=repo_name, scope="all")+all_s+tdc_str) + filter_links.append(active_s+self.m_link("Active", self.PATH_WORK, g=group_name, r=repo_name, scope="active")+active_s) + filter_links.append(cmplt_s+self.m_link("Completed", self.PATH_WORK, g=group_name, r=repo_name, scope="completed")+cmplt_s) + filter_links.append(prpsd_s+self.m_link("Proposed", self.PATH_WORK, g=group_name, r=repo_name, scope="proposed")+prpsd_s) + filter_links.append(all_s+self.m_link("All", self.PATH_WORK, g=group_name, r=repo_name, scope="all")+all_s) content_parts.append(f" {sep} ".join(filter_links) + "\n\n") # Load work documents + work_path = f"{repo['path']}.work" + scopes_to_show = ["active", "completed", "proposed"] if scope == "all" else [scope] + for s in scopes_to_show: folder_path = os.path.join(work_path, s) @@ -1581,11 +1483,11 @@ class NomadNetworkNode(): docs.sort(key=lambda x: max(x["created"], x["edited"]), reverse=True) if not docs: - content_parts.append(self.m_heading(f"{s.capitalize()}", 2)+f"\n`*No {s} work documents`*\n") + content_parts.append(self.m_heading(f"{s.capitalize()} ({len(docs)})", 2)+f"\n`*No {s} work documents`*\n") content_parts.append("\n") else: - content_parts.append(self.m_heading(f"{s.capitalize()}", 2)) + content_parts.append(self.m_heading(f"{s.capitalize()} ({len(docs)})", 2)) content_parts.append("\n") for doc in docs: @@ -1620,9 +1522,6 @@ class NomadNetworkNode(): content = self.m_heading("Error", 2) + "\nInvalid request\n" return self.render_template(content, st=st) - if not remote_identity and self.null_ident.hash in self.owner.blocked_identities: - return self.render_template("", template="no_ident", st=st) - try: doc_id = int(doc_id) except: content = self.m_heading("Error", 2) + "\nInvalid document ID\n" @@ -1772,7 +1671,7 @@ class NomadNetworkNode(): repo = self.get_accessible_repository(remote_identity, group_name, repo_name) if not repo: - RNS.log(f"Repository not found or no access for artifact request {group_name}/{repo_name}/{tag}/{artifact}", RNS.LOG_DEBUG) + RNS.log(f"Repository not found or no access for artifact request {group_name}/{repo_name}/{tag}/{artifact}", RNS.LOG_WARNING) return None releases_path = f"{repo['path']}.releases" @@ -1816,69 +1715,6 @@ class NomadNetworkNode(): self.owner.release_download_succeeded(group_name, repo_name, remote_identity) return [open(artifact_path, "rb"), {"name": artifact.encode("utf-8")}] - def serve_media(self, path, data, request_id, link_id, remote_identity, requested_at): - st = time.time() - RNS.log(f"Media request from {remote_identity}", RNS.LOG_DEBUG) - - if not data or not type(data) == dict: data = {} - if not "key" in data: - RNS.log(f"Missing request key in media request", RNS.LOG_DEBUG) - return False - - media_path = data.get("path", None) - if not media_path: - RNS.log(f"Missing path in media request", RNS.LOG_DEBUG) - return False - - comps = media_path.removeprefix("/media").lstrip("/").split("/") - if len(comps) < 4: - RNS.log(f"Insufficient path components in media request", RNS.LOG_DEBUG) - return False - - group_name = comps[0] - repo_name = comps[1] - ref = comps[2] - file_path = "/".join(comps[3:]) - file_path = urllib.parse.unquote_plus(file_path) - file_name = os.path.basename(file_path) - - repo = self.get_accessible_repository(remote_identity, group_name, repo_name) - if not repo: - RNS.log(f"Repository not found or no access for media request {group_name}/{repo_name}/{ref}/{file_path}", RNS.LOG_DEBUG) - return False - - repo_path = repo["path"] - - resolved_ref = self.resolve_ref(repo_path, ref) - if not resolved_ref: - RNS.log(f"Ref not found for media request {group_name}/{repo_name}/{ref}/{file_path}", RNS.LOG_WARNING) - return False - - if not file_path: - RNS.log(f"No file path for media request {group_name}/{repo_name}/{ref}/{file_path}", RNS.LOG_WARNING) - return False - - blob_info = self.get_blob_info(repo_path, resolved_ref, file_path) - if blob_info is None: - RNS.log(f"File not found at ref for media request {group_name}/{repo_name}/{ref}/{file_path}", RNS.LOG_WARNING) - return False - - else: - stream = None - response_name = file_name - file_ext = os.path.splitext(file_path)[1].lower() - if self.media_conversion and file_ext in self.IMAGE_EXTS and file_ext != ".webp": - converted = self.get_webp_stream(repo_path, resolved_ref, file_path, link_id) - if converted: stream, response_name = converted - - if not stream: stream = self.get_blob_stream(repo_path, resolved_ref, file_path) - if stream: return [stream, {"name": response_name.encode("utf-8")}] - else: - RNS.log(f"Could not resolve blob stream for media request {group_name}/{repo_name}/{ref}/{file_path}", RNS.LOG_WARNING) - return None - - return None - def serve_download(self, path, data, request_id, link_id, remote_identity, requested_at): st = time.time() RNS.log(f"File download request from {remote_identity}", RNS.LOG_DEBUG) @@ -1887,19 +1723,13 @@ class NomadNetworkNode(): group_name = data.get("var_g", "") if data else "" repo_name = data.get("var_r", "") if data else "" ref = data.get("var_ref", "HEAD") if data else "HEAD" - file_fmt = data.get("var_fmt", "") if data else "" file_path = data.get("var_path", "") if data else "" file_path = urllib.parse.unquote_plus(file_path) file_name = os.path.basename(file_path) - file_ext = os.path.splitext(file_path)[1].lower() - convertable = file_ext in self.CONVERTABLE_EXTS - if file_fmt and not convertable: - RNS.log(f"Download conversion request for non-convertable file", RNS.LOG_DEBUG) - return None repo = self.get_accessible_repository(remote_identity, group_name, repo_name) if not repo: - RNS.log(f"Repository not found or no access for download request {group_name}/{repo_name}/{ref}/{file_path}", RNS.LOG_DEBUG) + RNS.log(f"Repository not found or no access for download request {group_name}/{repo_name}/{ref}/{file_path}", RNS.LOG_WARNING) return None repo_path = repo["path"] @@ -1922,47 +1752,7 @@ class NomadNetworkNode(): stream = self.get_blob_stream(repo_path, resolved_ref, file_path) if stream is not None: self.owner.download_succeeded(group_name, repo_name, remote_identity) - if not file_fmt: return [stream, {"name": file_name.encode("utf-8")}] - elif file_fmt == "mu": - link = self.active_links.get(link_id) - if not link: - RNS.log(f"Could not resolve link for file conversion of {file_path}", RNS.LOG_WARNING) - return None - - if not hasattr(link, "temporary_directories"): link.temporary_directories = [] - tmpdir = tempfile.TemporaryDirectory() - link.temporary_directories.append(tmpdir) - - stem = os.path.splitext(os.path.basename(file_path))[0] - response_name = stem + ".mu" - - try: - path_components = file_path.strip("/").split("/") - path = "/".join(path_components[:-1])+"/" if len(path_components) > 1 else "" - url_scope = f":/page/blob.mu`g={group_name}|r={repo_name}|ref={ref}|path={path}" - mdc = MarkdownToMicron(max_width=self.MAX_RENDER_WIDTH, syntax_highlighter=self.highlighter, url_scope=url_scope) - mu = mdc.format_block(stream.read().decode("utf-8")).rstrip().encode("utf-8") - - if not mu: - if tmpdir in link.temporary_directories: link.temporary_directories.remove(tmpdir) - tmpdir.cleanup() - return None - - fd, spool_path = tempfile.mkstemp(prefix=stem+".", suffix=".mu", dir=tmpdir.name) - os.close(fd) - with open(spool_path, "wb") as f: f.write(mu) - - spool = open(spool_path, "rb") - return [spool, {"name": f"{os.path.splitext(file_name)[0]}.mu".encode("utf-8")}] - - except Exception as e: - RNS.log(f"Error during file conversion of {file_path} for {link}: {e}", RNS.LOG_WARNING) - if tmpdir in link.temporary_directories: link.temporary_directories.remove(tmpdir) - try: tmpdir.cleanup() - except Exception: pass - return None - - else: return None + return [stream, {"name": file_name.encode("utf-8")}] else: RNS.log(f"Could not resolve blob stream for download request {group_name}/{repo_name}/{ref}/{file_path}", RNS.LOG_WARNING) @@ -1993,7 +1783,7 @@ class NomadNetworkNode(): repo = self.get_accessible_repository(remote_identity, group_name, repo_name) if not repo: - RNS.log(f"Repository not found or no access for workdoc download request {group_name[:128]}/{repo_name[:128]}/{doc_id}", RNS.LOG_DEBUG) + RNS.log(f"Repository not found or no access for workdoc download request {group_name[:128]}/{repo_name[:128]}/{doc_id}", RNS.LOG_WARNING) return None doc_access = self.resolve_doc_permission(remote_identity, group_name, repo_name, doc_id, self.owner.PERM_READ) @@ -2294,40 +2084,6 @@ class NomadNetworkNode(): return None - def get_webp_stream(self, repo_path, ref, file_path, link_id): - file_path = file_path.strip("/") - link = self.active_links.get(link_id) - if not link: - RNS.log(f"Could not resolve link for media conversion of {file_path}", RNS.LOG_WARNING) - return None - - if not hasattr(link, "temporary_directories"): link.temporary_directories = [] - tmpdir = tempfile.TemporaryDirectory() - link.temporary_directories.append(tmpdir) - - stem = os.path.splitext(os.path.basename(file_path))[0] - response_name = stem + ".webp" - - try: - fd, spool_path = tempfile.mkstemp(prefix=stem+".", suffix=".webp", dir=tmpdir.name) - os.close(fd) - - converted = media.convert_to_webp(["git", "show", f"{ref}:{file_path}"], spool_path, cwd=repo_path) - if not converted: - if tmpdir in link.temporary_directories: link.temporary_directories.remove(tmpdir) - tmpdir.cleanup() - return None - - spool = open(spool_path, "rb") - return spool, response_name - - except Exception as e: - RNS.log(f"Error during media conversion of {file_path} for {link}: {e}", RNS.LOG_WARNING) - if tmpdir in link.temporary_directories: link.temporary_directories.remove(tmpdir) - try: tmpdir.cleanup() - except Exception: pass - return None - def get_refs_info(self, repo_path, default_branch=None): refs = {"heads": [], "tags": []} @@ -2939,38 +2695,11 @@ class NomadNetworkNode(): def remote_connected(self, link): RNS.log(f"Peer connected to {self.destination}", RNS.LOG_DEBUG) - self.active_links[link.link_id] = link link.set_remote_identified_callback(self.remote_identified) link.set_link_closed_callback(self.remote_disconnected) def remote_disconnected(self, link): RNS.log(f"Peer disconnected from {self.destination}", RNS.LOG_DEBUG) - if link.link_id in self.active_links: self.active_links.pop(link.link_id) - self.cleanup_link_temporary_resources(link) - - def clean_links(self): - stale_links = [] - for link_id, link in self.active_links.items(): - if not link.status == RNS.Link.ACTIVE: stale_links.append(link_id) - - cleaned_links = 0 - for link_id in stale_links: - link = self.active_links.pop(link_id, None) - if link: - self.cleanup_link_temporary_resources(link) - cleaned_links += 1 - - if cleaned_links > 0: RNS.log(f"Cleaned {cleaned_links} stale link{'s' if cleaned_links != 1 else ''}", RNS.LOG_DEBUG) - - def cleanup_link_temporary_resources(self, link): - if hasattr(link, "temporary_directories"): - for tmpdir in link.temporary_directories: - try: - tmpdir.cleanup() - RNS.log(f"Cleaned up {tmpdir.name}", RNS.LOG_DEBUG) - except Exception as e: RNS.log(f"Error while cleaning temporary directory: {e}", RNS.LOG_ERROR) - - link.temporary_directories = [] def remote_identified(self, link, identity): RNS.log(f"Peer identified as {link.get_remote_identity()} on {link}", RNS.LOG_DEBUG) @@ -3066,8 +2795,5 @@ DEFAULT_WORK_TEMPLATE = """{PAGE_CONTENT}""" DEFAULT_WORK_DOC_TEMPLATE = """{PAGE_CONTENT}""" -# Error state templates -DEFAULT_NO_IDENT_TEMPLATE = """>>No Identity\n\nThis page requires identification, and none was received.\n""" - # Fallback template FALLBACK_TEMPLATE = """{PAGE_CONTENT}""" \ No newline at end of file diff --git a/RNS/Utilities/rngit/server.py b/RNS/Utilities/rngit/server.py index 9d1a3250..273f56b7 100644 --- a/RNS/Utilities/rngit/server.py +++ b/RNS/Utilities/rngit/server.py @@ -57,15 +57,14 @@ def program_setup(configdir, rnsconfigdir=None, verbosity=0, quietness=0, servic targetverbosity = verbosity-quietness if service: - targetlogdest = RNS.LOG_FILE + targetlogdest = RNS.LOG_FILE targetverbosity = None else: - targetlogdest = RNS.LOG_STDOUT + targetlogdest = RNS.LOG_STDOUT if print_identity: git_node = ReticulumGitNode(configdir=configdir, print_identity=True) - reticulum = RNS.Reticulum(configdir=rnsconfigdir, verbosity=targetverbosity, logdest=targetlogdest) - reticulum.wants_destination_type(f"{APP_NAME}.repositories") + reticulum = RNS.Reticulum(configdir=rnsconfigdir, verbosity=targetverbosity, logdest=targetlogdest) if not task: RNS.log("Starting Reticulum Git Node...", RNS.LOG_NOTICE) @@ -1977,8 +1976,6 @@ class ReticulumGitNode(): CLONE_PROTOS = ["rns", "http", "https", "ssh"] - DEFAULT_LINK_COST = 18.0 - def __init__(self, configdir=None, verbosity=None, print_identity=False): self.identity = None self.userdir = os.path.expanduser("~") @@ -1991,8 +1988,6 @@ class ReticulumGitNode(): self.blocked_identities = {} self.last_announce = 0 self.announce_interval = 0 - self.stamp_value = None - self.link_cost = self.DEFAULT_LINK_COST self.stats_enabled = False self.stats_job_interval = 180 self.last_stats_job = time.time() @@ -2004,7 +1999,6 @@ class ReticulumGitNode(): self.active_links_lock = Lock() self.stats_lock = Lock() self.sync_lock = Lock() - self.perms_lock = Lock() self.stats_ignored = {} self.stats_push_ignored = {} self.node_name = "Anonymous Git Node" @@ -2022,7 +2016,7 @@ class ReticulumGitNode(): if os.path.isdir("/etc/rngit") and os.path.isfile("/etc/rngit/config"): self.configdir = "/etc/rngit" elif os.path.isdir(self.userdir+"/.config/rngit") and os.path.isfile(self.userdir+"/.config/rngit/config"): - self.configdir = self.userdir+"/.config/rngit" + self.configdir = self.userdir+"/.rngit/reticulum" else: self.configdir = self.userdir+"/.rngit" @@ -2063,8 +2057,6 @@ class ReticulumGitNode(): exit(0) self.destination = RNS.Destination(self.identity, RNS.Destination.IN, RNS.Destination.SINGLE, APP_NAME, "repositories") - if self.stamp_value: self.destination.set_value(self.stamp_value) - self.destination.set_link_cost(self.link_cost) self.destination.set_link_established_callback(self.remote_connected) self.register_request_handlers() RNS.log(f"Reticulum Git Node listening on {RNS.prettyhexrep(self.destination.hash)}", RNS.LOG_NOTICE) @@ -2211,8 +2203,6 @@ class ReticulumGitNode(): section = self.config["rngit"] if "node_name" in section: self.node_name = section["node_name"] if "announce_interval" in section: self.announce_interval = section.as_int("announce_interval")*60 - if "stamp_value" in section: self.stamp_value = RNS.Stamps.quantize_cost(section.as_float("stamp_value")) - if "link_cost" in section: self.link_cost = RNS.Stamps.quantize_cost(section.as_float("link_cost")) if "mirror_interval" in section: self.mirror_interval = max(section.as_int("mirror_interval")*60*60, 0) if "record_stats" in section: self.stats_enabled = section.as_bool("record_stats") if "stats_ignore_identities" in section: @@ -2517,22 +2507,6 @@ class ReticulumGitNode(): return permissions - def load_allowed_permissions(self, allowed_path): - allowed_input = "" - dynamic_perms = False - if os.path.isfile(allowed_path): - if os.access(allowed_path, os.X_OK): - allowed_result = subprocess.run([allowed_path], stdout=subprocess.PIPE) - allowed_input = allowed_result.stdout.decode("utf-8") - dynamic_perms = True - - else: - fh = open(allowed_path, "rb") - allowed_input = fh.read().decode("utf-8") - fh.close() - - return self.permissions_from_allowed_input(allowed_input), dynamic_perms - def load_repository_group(self, group_name, group_path): if not group_name in self.groups: self.groups[group_name] = { "path": group_path, "name": group_name, "repositories": {}, "dynamic_perms": False, "read": [], "write": [], "create": [], "stats": [], "release": [], @@ -2558,8 +2532,8 @@ class ReticulumGitNode(): RNS.log(f"Attempt to set group permissions for non-existing group {group_name}, aborting", RNS.LOG_WARNING) return - new_permissions = {} - for perm in self.ALL_PERMS: new_permissions[perm] = [] + # Clear permissions before update + for perm in self.ALL_PERMS: self.groups[group_name][perm] = [] # Apply permissions from allowed file if present group_path = self.groups[group_name]["path"] @@ -2567,14 +2541,22 @@ class ReticulumGitNode(): if os.path.isfile(allowed_path): RNS.log(f"Applying group permissions for {group_name} from {allowed_path}", RNS.LOG_DEBUG) try: - group_permissions, dynamic_perms = self.load_allowed_permissions(allowed_path) - for perm in self.ALL_PERMS: new_permissions[perm] = group_permissions[perm] - self.groups[group_name]["dynamic_perms"] = dynamic_perms + allowed_input = "" + if os.access(allowed_path, os.X_OK): + allowed_result = subprocess.run([allowed_path], stdout=subprocess.PIPE) + allowed_input = allowed_result.stdout.decode("utf-8") + self.groups[group_name]["dynamic_perms"] = True + + else: + fh = open(allowed_path, "rb") + allowed_input = fh.read().decode("utf-8") + fh.close() + + group_permissions = self.permissions_from_allowed_input(allowed_input) + for perm in group_permissions: self.groups[group_name][perm] = group_permissions[perm] except Exception as e: RNS.log(f"Could not load group permissions from {allowed_path}: {e}", RNS.LOG_ERROR) - else: self.groups[group_name]["dynamic_perms"] = False - # Apply permissions from config file if present if "access" in self.config: section = self.config["access"] @@ -2598,33 +2580,14 @@ class ReticulumGitNode(): if perm == self.PERM_PROPOSE: propose = True if perm == self.PERM_ADMIN: admin = True - if read and not target in new_permissions["read"]: new_permissions["read"].append(target) - if write and not target in new_permissions["write"]: new_permissions["write"].append(target) - if create and not target in new_permissions["create"]: new_permissions["create"].append(target) - if stats and not target in new_permissions["stats"]: new_permissions["stats"].append(target) - if release and not target in new_permissions["release"]: new_permissions["release"].append(target) - if interact and not target in new_permissions["interact"]: new_permissions["interact"].append(target) - if propose and not target in new_permissions["propose"]: new_permissions["propose"].append(target) - if admin and not target in new_permissions["admin"]: new_permissions["admin"].append(target) - - for perm in self.ALL_PERMS: self.groups[group_name][perm] = new_permissions[perm] - - def update_repository_permissions(self, group_name, repository_name): - if not group_name in self.groups: - RNS.log(f"Attempt to update permissions for non-existing group {group_name}, aborting", RNS.LOG_WARNING) - return - - if not repository_name in self.groups[group_name]["repositories"]: - RNS.log(f"Attempt to update permissions for non-existing repository {group_name}/{repository_name}, aborting", RNS.LOG_WARNING) - return - - repo = self.groups[group_name]["repositories"][repository_name] - allowed_path = repo["path"]+".allowed" - - try: - repo_permissions, dynamic_perms = self.load_allowed_permissions(allowed_path) - for perm in self.ALL_PERMS: repo[perm] = repo_permissions[perm] if perm in repo_permissions else [] - except Exception as e: RNS.log(f"Could not update repository permissions for {group_name}/{repository_name} from {allowed_path}: {e}", RNS.LOG_ERROR) + if read and not target in self.groups[group_name]["read"]: self.groups[group_name]["read"].append(target) + if write and not target in self.groups[group_name]["write"]: self.groups[group_name]["write"].append(target) + if create and not target in self.groups[group_name]["create"]: self.groups[group_name]["create"].append(target) + if stats and not target in self.groups[group_name]["stats"]: self.groups[group_name]["stats"].append(target) + if release and not target in self.groups[group_name]["release"]: self.groups[group_name]["release"].append(target) + if interact and not target in self.groups[group_name]["interact"]: self.groups[group_name]["interact"].append(target) + if propose and not target in self.groups[group_name]["propose"]: self.groups[group_name]["propose"].append(target) + if admin and not target in self.groups[group_name]["admin"]: self.groups[group_name]["admin"].append(target) def load_repository(self, group, path): if not group or not path: return False @@ -2638,15 +2601,27 @@ class ReticulumGitNode(): RNS.log(f"You can change it to a bare repository using \"git config --bool core.bare true\".", RNS.LOG_WARNING) else: - repository_name = os.path.basename(path) - allowed_path = f"{path}.allowed" - repo_permissions, dynamic_perms = self.load_allowed_permissions(allowed_path) + repository_name = os.path.basename(path) + allowed_path = f"{path}.allowed" + allowed_input = "" + dynamic_perms = False + if os.path.isfile(allowed_path): + if os.access(allowed_path, os.X_OK): + allowed_result = subprocess.run([allowed_path], stdout=subprocess.PIPE) + allowed_input = allowed_result.stdout.decode("utf-8") + dynamic_perms = True + + else: + fh = open(allowed_path, "rb") + allowed_input = fh.read().decode("utf-8") + fh.close() fork = self.__is_fork(path) mirror = self.__is_mirror(path) + p = self.permissions_from_allowed_input(allowed_input) group["repositories"][repository_name] = { "name": repository_name, "group": group_name, "path": path, "fork": fork, "mirror": mirror } - for perm in self.ALL_PERMS: group["repositories"][repository_name][perm] = repo_permissions[perm] if perm in repo_permissions else [] + for perm in self.ALL_PERMS: group["repositories"][repository_name][perm] = p[perm] if perm in p else [] return True @@ -4256,7 +4231,6 @@ class ReticulumGitNode(): return self.RES_REMOTE_FAIL.to_bytes(1, "big") + b"Remote error" def _work_complete(self, work_path, data, remote_identity): - group_name, repository_name = self.parse_request_repository_path(data[self.IDX_REPOSITORY]) doc_id = data.get("doc_id") if doc_id is None: return self.RES_INVALID_REQ.to_bytes(1, "big") + b"No document ID specified" @@ -4272,9 +4246,7 @@ class ReticulumGitNode(): doc = self._work_load_document(root_path) if not doc: return self.RES_REMOTE_FAIL.to_bytes(1, "big") + b"Error loading document" - is_author = doc.get("meta", {}).get("author") == remote_identity.hash - admin_access = self.resolve_doc_permission(remote_identity, group_name, repository_name, doc_id, self.PERM_ADMIN) - if not is_author and not admin_access: return self.RES_DISALLOWED.to_bytes(1, "big") + b"Not allowed" + if doc.get("meta", {}).get("author") != remote_identity.hash: return self.RES_DISALLOWED.to_bytes(1, "big") + b"No access, not author" try: completed_dir = os.path.join(completed_base, str(doc_id)) @@ -4288,35 +4260,26 @@ class ReticulumGitNode(): return self.RES_REMOTE_FAIL.to_bytes(1, "big") + b"Remote error" def _work_activate(self, work_path, data, remote_identity): - group_name, repository_name = self.parse_request_repository_path(data[self.IDX_REPOSITORY]) doc_id = data.get("doc_id") if doc_id is None: return self.RES_INVALID_REQ.to_bytes(1, "big") + b"No document ID specified" try: doc_id = int(doc_id) except: return self.RES_INVALID_REQ.to_bytes(1, "big") + b"Invalid document ID" + completed_dir = os.path.join(work_path, "completed", str(doc_id)) active_base = os.path.join(work_path, "active") - doc_dir = None - for scope in ["completed", "proposed"]: - d = os.path.join(work_path, scope, str(doc_id)) - if os.path.isdir(d): - doc_dir = d - break - - if not doc_dir: return self.RES_NOT_FOUND.to_bytes(1, "big") + b"Document not found" + if not os.path.isdir(completed_dir): return self.RES_NOT_FOUND.to_bytes(1, "big") + b"Document not found" - root_path = os.path.join(doc_dir, "root") + root_path = os.path.join(completed_dir, "root") doc = self._work_load_document(root_path) if not doc: return self.RES_REMOTE_FAIL.to_bytes(1, "big") + b"Error loading document" - is_author = doc.get("meta", {}).get("author") == remote_identity.hash - admin_access = self.resolve_doc_permission(remote_identity, group_name, repository_name, doc_id, self.PERM_ADMIN) - if not is_author and not admin_access: return self.RES_DISALLOWED.to_bytes(1, "big") + b"Not allowed" + if doc.get("meta", {}).get("author") != remote_identity.hash: return self.RES_DISALLOWED.to_bytes(1, "big") + b"No access, not author" try: active_dir = os.path.join(active_base, str(doc_id)) - shutil.move(doc_dir, active_dir) + shutil.move(completed_dir, active_dir) RNS.log(f"Activated work document {doc_id} by {RNS.prettyhexrep(remote_identity.hash)}", RNS.LOG_VERBOSE) return b"\x00" + mp.packb({"id": doc_id, "scope": "active"}) @@ -4542,17 +4505,10 @@ class ReticulumGitNode(): try: group_path = self.groups[group_name]["path"] allowed_path = group_path + ".allowed" - - if os.access(allowed_path, os.X_OK): return self.RES_DISALLOWED.to_bytes(1, "big") + b"Executable permission resolvers can only be modified node-side" - tmp_path = allowed_path + ".tmp" with open(tmp_path, "w", encoding="utf-8") as f: f.write(content) os.rename(tmp_path, allowed_path) - with self.perms_lock: - try: self.update_group_permissions(group_name) - except Exception as e: RNS.log(f"Error while refreshing permissions for group {group_name}: {e}", RNS.LOG_ERROR) - RNS.log(f"Permissions for group {group_name} updated by {RNS.prettyhexrep(remote_identity.hash)}", RNS.LOG_VERBOSE) return b"\x00" @@ -4624,17 +4580,10 @@ class ReticulumGitNode(): try: repo_path = self.groups[group_name]["repositories"][repository_name]["path"] allowed_path = repo_path + ".allowed" - - if os.access(allowed_path, os.X_OK): return self.RES_DISALLOWED.to_bytes(1, "big") + b"Executable permission resolvers can only be modified node-side" - tmp_path = allowed_path + ".tmp" with open(tmp_path, "w", encoding="utf-8") as f: f.write(content) os.rename(tmp_path, allowed_path) - with self.perms_lock: - try: self.update_repository_permissions(group_name, repository_name) - except Exception as e: RNS.log(f"Error while refreshing permissions for repository {group_name}/{repository_name}: {e}", RNS.LOG_ERROR) - RNS.log(f"Permissions for repository {group_name}/{repository_name} updated by {RNS.prettyhexrep(remote_identity.hash)}", RNS.LOG_VERBOSE) return b"\x00" @@ -4934,16 +4883,6 @@ announce_interval = 360 # node_name = Anonymous Git Node -# You can configure the required link stamp cost for -# connecting to the repository node. - -# link_cost = 18.0 - -# The target stamp value for the repositories destination -# can also be configured. - -# stamp_value = 25.0 - # You can enable collecting view, fetch and push statistics # which can be displayed on the stats pages of repositories. # Remember to set the "s" (stats) permission appropriately @@ -4958,11 +4897,6 @@ announce_interval = 360 # blocked_identities = d31aeea49873006f13b3415520666a4e -# To make it easier to handle scrapers, crawlers, slopware -# and other annoyances, you can block unidentified peers by -# adding the null_ident hash to to blocked identities. - -# blocked_identities = d7db22f63b453c23bb0688dde565b7c1 [repositories] @@ -5062,36 +4996,14 @@ internal = rw:9710b86ba12c42d1d8f30f74fe509286 # serve_nomadnet = no -# You can configure the required link stamp cost for -# connecting to the page node. - -# link_cost = 18.0 - -# The target stamp value for the node destination can -# also be configured. - -# stamp_value = 25.0 - -# It is possible to disable Nerd Font icons and instead +# It is possible to disable Nerd Font icons and instead # use simpler (but more compatible) unicode icons. # unicode_icons = yes -# You can configure whether the page server should try -# to convert media files to WebP on the fly, for serving -# to nomadnet clients. Enabled by default, but will -# require an available encoding backend installed on -# your system. Supported backends utilities are "magick", -# "convert", "gm", "ffmpeg" and "avconv". If any one is -# installed, rngit will auto-detect and use it, but you -# can force a specific backend with the environment -# variable RNGIT_MEDIA_BACKEND. - -# media_conversion = yes - [logging] -# Valid log levels are 0 through 8: +# Valid log levels are 0 through 7: # 0: Log only critical information # 1: Log errors and lower log levels # 2: Log warnings and lower log levels @@ -5099,8 +5011,7 @@ internal = rw:9710b86ba12c42d1d8f30f74fe509286 # 4: Log info and lower (this is the default) # 5: Verbose logging # 6: Debug logging -# 7: Pathing logging -# 8: Extreme logging +# 7: Extreme logging loglevel = 4 diff --git a/RNS/Utilities/rnid.py b/RNS/Utilities/rnid.py index 18bfecf5..3731fd8e 100644 --- a/RNS/Utilities/rnid.py +++ b/RNS/Utilities/rnid.py @@ -2,7 +2,7 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal diff --git a/RNS/Utilities/rnir.py b/RNS/Utilities/rnir.py index 57e761d0..2d1002fb 100644 --- a/RNS/Utilities/rnir.py +++ b/RNS/Utilities/rnir.py @@ -2,7 +2,7 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal diff --git a/RNS/Utilities/rnodeconf.py b/RNS/Utilities/rnodeconf.py index 0ff83487..c799a38f 100755 --- a/RNS/Utilities/rnodeconf.py +++ b/RNS/Utilities/rnodeconf.py @@ -2,7 +2,7 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal diff --git a/RNS/Utilities/rnpath.py b/RNS/Utilities/rnpath.py index 87e01bf2..3f65a691 100644 --- a/RNS/Utilities/rnpath.py +++ b/RNS/Utilities/rnpath.py @@ -2,7 +2,7 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -101,13 +101,11 @@ def parse_hash(input_str): def program_setup(configdir, table, rates, drop, destination_hexhash, verbosity, timeout, drop_queues, drop_via, max_hops, remote=None, management_identity=None, remote_timeout=RNS.Transport.PATH_REQUEST_TIMEOUT, - blackholed=False, blackhole=False, unblackhole=False, blackhole_duration=None, blackhole_reason=None, remote_blackhole_list=False, remote_blackhole_list_filter=None, - active=False, usage=False, vias=False, expinfo=False, min_value=None, no_output=False, analyze=False, capture=None, json=False): + blackholed=False, blackhole=False, unblackhole=False, blackhole_duration=None, blackhole_reason=None, + remote_blackhole_list=False, remote_blackhole_list_filter=None, no_output=False, json=False): global remote_link, reticulum reticulum = RNS.Reticulum(configdir = configdir, loglevel = 3+verbosity) - reticulum.wants_destination_type("rnstransport.remote.management") - reticulum.wants_destination_type("rnstransport.info.blackhole") if remote: try: dest_len = (RNS.Reticulum.TRUNCATED_HASHLENGTH//8)*2 @@ -242,10 +240,6 @@ def program_setup(configdir, table, rates, drop, destination_hexhash, verbosity, print(f"Could not unblackhole identity: {e}") exit(20) - elif analyze: - analyze_tables(path_table=reticulum.get_path_table(), rate_table=reticulum.get_rate_table(), - link_distribution=reticulum.get_link_distribution(), capture=capture) - elif table: destination_hash = None if destination_hexhash != None: @@ -287,35 +281,13 @@ def program_setup(configdir, table, rates, drop, destination_hexhash, verbosity, exit() else: - now = time.time() - if usage: - try: table = sorted(table, key=lambda e: e["used"], reverse=True) - except Exception as e: pass - - now = time.time() for path in table: if destination_hash == None or destination_hash == path["hash"]: displayed += 1 - if min_value: - if not path["value"]: continue - if path["value"] < min_value: continue - - if path["state"] == RNS.Transport.STATE_RESPONSIVE: state_str = " (R)" - elif path["state"] == RNS.Transport.STATE_UNRESPONSIVE: state_str = " (u)" - elif path["state"] == RNS.Transport.STATE_UNKNOWN: state_str = " (?)" - else: state_str = " (?)" - exp_str = RNS.timestamp_str(path["expires"]) if path["hops"] == 1: m_str = " " else: m_str = "s" - if not "used" in path: u_str = ", no usage info" - else: - if active and not path["used"]: continue - if usage: u_str = f", last used {RNS.prettytime(now-path['used'])} ago" if path["used"] else ", never used" - else: u_str = "" - via_str = f" via {RNS.prettyhexrep(path['via'])}" if vias else "" - exp_str = f" expires in {RNS.prettytime(path['expires']-now, compact=True)}" if expinfo else "" - print(f"{RNS.prettyhexrep(path['hash'])} {path['hops']:>3}h{state_str}{via_str} on {path['interface']}{exp_str} (dv:{RNS.prettycost(path['value'])}/lc:{RNS.prettycost(path['lr_cost'])}){u_str}") + print(RNS.prettyhexrep(path["hash"])+" is "+str(path["hops"])+" hop"+m_str+" away via "+RNS.prettyhexrep(path["via"])+" on "+path["interface"]+" expires "+RNS.timestamp_str(path["expires"])) if destination_hash != None and displayed == 0: print("No path known") @@ -512,12 +484,7 @@ def main(): parser.add_argument("--config", action="store", default=None, help="path to alternative Reticulum config directory", type=str) parser.add_argument("--version", action="version", version="rnpath {version}".format(version=__version__)) parser.add_argument("-t", "--table", action="store_true", help="show all known paths", default=False) - parser.add_argument("-a", "--active", action="store_true", help="show in-use paths only", default=False) - parser.add_argument("-u", "--usage", action="store_true", help="show path usage time", default=False) - parser.add_argument("-V", "--vias", action="store_true", help="show via transport IDs", default=False) - parser.add_argument("-E", "--expiry", action="store_true", help="show path expiry times", default=False) parser.add_argument("-m", "--max", action="store", metavar="hops", type=int, help="maximum hops to filter path table by", default=None) - parser.add_argument("-M", "--min-value", action="store", metavar="value", type=float, help="minimum value to filter path table by", default=None) parser.add_argument("-r", "--rates", action="store_true", help="show announce rate info", default=False) parser.add_argument("-d", "--drop", action="store_true", help="remove the path to a destination", default=False) parser.add_argument("-D", "--drop-announces", action="store_true", help="drop all queued announces", default=False) @@ -529,12 +496,10 @@ def main(): parser.add_argument("-b", "--blackholed", action="store_true", help="list blackholed identities", default=False) parser.add_argument("-B", "--blackhole", action="store_true", help="blackhole identity", default=False) parser.add_argument("-U", "--unblackhole", action="store_true", help="unblackhole identity", default=False) - parser.add_argument( "--duration", action="store", metavar="hours", type=float, help="duration of blackhole enforcement in hours", default=None) - parser.add_argument( "--reason", action="store", metavar="reason", type=str, help="reason for blackholing identity", default=None) + parser.add_argument( "--duration", action="store", type=float, help="duration of blackhole enforcement in hours", default=None) + parser.add_argument( "--reason", action="store", type=str, help="reason for blackholing identity", default=None) parser.add_argument("-p", "--blackholed-list", action="store_true", help="view published blackhole list for remote transport instance", default=False) parser.add_argument("-j", "--json", action="store_true", help="output in JSON format", default=False) - parser.add_argument("-A", "--analyze", action="store_true", help="Analyze tables", default=False) - parser.add_argument("--capture", action="store", metavar="path", type=str, help="path to capture file for analyze mode", default=None) parser.add_argument("destination", nargs="?", default=None, help="hexadecimal hash of the destination", type=str) parser.add_argument("list_filter", nargs="?", default=None, help="filter for remote blackhole list view", type=str) parser.add_argument('-v', '--verbose', action='count', default=0) @@ -544,17 +509,16 @@ def main(): if args.config: configarg = args.config else: configarg = None - if not args.drop_announces and not args.table and not args.rates and not args.destination and not args.drop_via and not args.blackholed and not args.analyze: + if not args.drop_announces and not args.table and not args.rates and not args.destination and not args.drop_via and not args.blackholed: print("") parser.print_help() print("") else: - program_setup(configdir=configarg, table=args.table, rates=args.rates, drop=args.drop, destination_hexhash=args.destination, - verbosity=args.verbose, timeout=args.w, drop_queues=args.drop_announces, drop_via=args.drop_via, max_hops=args.max, min_value=args.min_value, + program_setup(configdir = configarg, table = args.table, rates = args.rates, drop = args.drop, destination_hexhash = args.destination, + verbosity = args.verbose, timeout = args.w, drop_queues = args.drop_announces, drop_via = args.drop_via, max_hops = args.max, remote=args.R, management_identity=args.i, remote_timeout=args.W, blackholed=args.blackholed, blackhole=args.blackhole, unblackhole=args.unblackhole, blackhole_duration=args.duration, blackhole_reason=args.reason, remote_blackhole_list=args.blackholed_list, - remote_blackhole_list_filter=args.list_filter, usage=args.usage, vias=args.vias, active=args.active, expinfo=args.expiry, - analyze=args.analyze, capture=args.capture, json=args.json) + remote_blackhole_list_filter=args.list_filter, json=args.json) sys.exit(0) @@ -562,94 +526,6 @@ def main(): print("") exit() -def analyze_tables(path_table=None, rate_table=None, link_distribution=None, capture=None): - print("Not yet implemented") - exit() - - # if not path_table: - # print("No path table to analyze") - # exit() - - # else: - # print(f"Analyzing tables...") - - # # TODO: If a `capture` path is specified, we save and (if existing) load from - # # this file, so that `rnpath --analyze` can be run at intervals, and continuously - # # collect data, instead of only providing an at-the-moment snapshot view. - - # # Locally initialize announce cache to be able to - # # fetch full announce packet data - # if RNS.Transport.owner.is_connected_to_shared_instance: RNS.Transport.init_announce_cache() - # tm = RNS.Transport.destination_type_map - # total = len(path_table) - # destinations = {} - # unresolvable = 0 - # unknown_types = set() - # known_types = set() - # unknown_type_dsts = 0 - # known_type_dsts = 0 - # for path in path_table: - # dst_hash = path["hash"] - # dst_hops = path["hops"] - # last_used = path["used"] - # name_hash = None - # kd_entry = RNS.Identity.known_destinations.get(dst_hash, None) - - # # New destinations may have arrived after our initial known - # # destinations snapshot, which is fine, we just count the few - # # that miss here for now. - # if not kd_entry: unresolvable += 1 - - # # Enrich data with information from cached announces - # else: - # dst_value = kd_entry[6] - # dst_lr_cost = kd_entry[7] - # announce_hash = kd_entry[1] - # announce_packet = RNS.Transport.get_cached_packet(announce_hash, packet_type="announce") - # if not announce_packet: unresolvable += 1; continue - - # try: announce_packet.unpack() - # except: unresolvable +=1; continue - - # keysize = RNS.Identity.KEYSIZE//8 - # name_hash_len = RNS.Identity.NAME_HASH_LENGTH//8 - # name_hash = announce_packet.data[keysize:keysize+name_hash_len] - # app_data = kd_entry[3] or RNS.Identity.recall_app_data(dst_hash, _no_use=True) - # app_data_len = len(app_data) if app_data else None # No len counting if no app data - - # if name_hash in tm: known_type_dsts += 1; known_types.add(name_hash) - # else: unknown_type_dsts += 1; unknown_types.add(name_hash) - - # # TODO: Create actual data structure for use in analysis - # entry = {} - - # destinations[dst_hash] = entry - - # if rate_table: - # # TODO: Incorporate and enrich with data from rate table - # pass - - # if link_distribution: - # # TODO: Incorporate and enrich with link distribution data - # pass - - # # TODO: Actually analyze tables - # pass - - # # TODO: Actually print a comprehensive, beautifully formatted - # # overview, charts and data. This is a stub. - # print(f"Known types : {len(known_types)}") - # print(f"Unknown types : {len(unknown_types)}") - # print(f"Total types : {len(known_types)+len(unknown_types)}") - # print(f"Known type dests : {known_type_dsts}") - # print(f"Unknown type dests : {unknown_type_dsts}") - # print(f"Total type dests : {known_type_dsts+unknown_type_dsts}") - - # # TODO: Ensure we get the terminal width if possible, and fall back to - # # a sensible default if not, so everything is rendered beautifully. - - # exit() - def pretty_date(time=False): from datetime import datetime now = datetime.now() diff --git a/RNS/Utilities/rnpkg.py b/RNS/Utilities/rnpkg.py index ecdab3f4..15e54ceb 100644 --- a/RNS/Utilities/rnpkg.py +++ b/RNS/Utilities/rnpkg.py @@ -2,7 +2,7 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal diff --git a/RNS/Utilities/rnprobe.py b/RNS/Utilities/rnprobe.py index f2188082..40603805 100644 --- a/RNS/Utilities/rnprobe.py +++ b/RNS/Utilities/rnprobe.py @@ -2,7 +2,7 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal diff --git a/RNS/Utilities/rnsd.py b/RNS/Utilities/rnsd.py index 0a746470..515fffba 100755 --- a/RNS/Utilities/rnsd.py +++ b/RNS/Utilities/rnsd.py @@ -2,7 +2,7 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -122,7 +122,6 @@ share_instance = yes instance_name = default - # Some platforms don't support domain sockets, and if that # is the case, you can isolate different instances by # specifying a unique set of ports for each: @@ -216,14 +215,6 @@ instance_name = default # required_discovery_value = 14 -# You can disable allowing interfaces to be attached, de- -# tached or reloaded via rnstatus, for example if running -# on a shared system where users with normal RPC access -# should not be allowed to control interface states. - -# enable_interface_management = no - - # You can configure Reticulum to panic and forcibly close # if an unrecoverable interface error occurs, such as the # hardware device for an interface disappearing. This is @@ -290,12 +281,6 @@ instance_name = default # blackhole_update_interval = 60 -# You can enable a hop limiter, that will drop all packets -# exceeding the specified maximum hop count. - -# hop_limiter = 16 - - # When not running as a transport node, it is possible to # force the use of the same, static transport identity # for every instance start. Defaults to using a new identity @@ -303,75 +288,6 @@ instance_name = default # static_transport_identity = no -[stamps] -# This section configures stamping behaviour and defaults. -# In most cases, you do not need to change this, but on -# constrained systems especially, tuning these parameters -# can be very beneficial - -# During the 1.6.x phased transition to network stamp usage, -# it is possible to enable early opt-in on stamp generation -# and enforcement. RNS 1.6.0 includes all the required stamp -# generation and verification functionality, and actively -# validates stamps, while leaving generation, emission and -# enforcement disabled by default for destinations and PRs. -# Link requests will be stamped already from 1.6.0 if a cost -# has been announced by the destination. Version 1.6.1 will -# enable generation and emission by default, and version -# 1.6.2 will finally activate enforcement. Any of these -# options can be enabled early by configuration: - -# stamp_destinations = yes -# stamp_prs = yes -# enforce_stamps = yes - - -# The default required stamp cost for an announce, and its -# destination to be considered valid. This applies both to -# announces received directly, and transported by this node, -# if transport is enabled. Any announced destination not -# meeting the cost will be ignored. - -# destination_cost = 23.5 - - -# The default value this instance will target when generating -# new destination stamps. An application may set a higher -# target, but applications requesting a lower value than the -# default will always generate at least the default value. -# Destination stamps are cached and reused, so a one-time -# high-value generation is usually a good idea. - -# destination_value = 25.0 - - -# The default required path request stamp cost. Path requests -# that do not meet the requirement are ignored. - -# pr_cost = 15.8 - - -# The default target value of path request stamps generated -# by this instance. - -# pr_value = 15.8 - - -# The default link request stamp cost to use, if one has not -# been announced by the destination the link is established -# to, or if it is unknown. In practice, all destinations will -# include their required link cost in each announce, and this -# option is rarely necessary. - -# lr_cost = 12.5 - - -# The maximum amount of time to spend attempting to generate -# a link request and path request stamps, in seconds. - -# lr_stamp_timeout = 15 -# pr_stamp_timeout = 15 - [logging] # Valid log levels are 0 through 8: diff --git a/RNS/Utilities/rnsh/initiator.py b/RNS/Utilities/rnsh/initiator.py index 16c7f8eb..25cccfef 100644 --- a/RNS/Utilities/rnsh/initiator.py +++ b/RNS/Utilities/rnsh/initiator.py @@ -153,8 +153,6 @@ async def _initiate_link(configdir, rnsconfigdir, identitypath=None, logfile=Non RNS.logfile = logfile _reticulum = RNS.Reticulum(configdir=rnsconfigdir, loglevel=targetloglevel, logdest=RNS.LOG_FILE) - _reticulum.wants_destination_type(f"{rnsh.APP_NAME}") - if _identity is None: _identity = rnsh.prepare_identity(identity_path=identitypath, service_name=None, configdir=configdir) @@ -169,13 +167,14 @@ async def _initiate_link(configdir, rnsconfigdir, identitypath=None, logfile=Non listener_identity = RNS.Identity.recall(destination_hash) _destination = RNS.Destination(listener_identity, RNS.Destination.OUT, RNS.Destination.SINGLE, rnsh.APP_NAME) - RNS.log(f"Establishing link with {RNS.prettyhexrep(destination_hash)}", RNS.LOG_INFO) if _link is None or _link.status == RNS.Link.PENDING: + RNS.log("No link", RNS.LOG_DEBUG) _link = RNS.Link(_destination) _link.did_identify = False _link.set_link_closed_callback(_client_link_closed) + RNS.log(f"Establishing link with {RNS.prettyhexrep(destination_hash)}", RNS.LOG_INFO) if not await _spin(until=lambda: _link.status == RNS.Link.ACTIVE, msg=f"Establishing link with {RNS.prettyhexrep(destination_hash)}", timeout=timeout, quiet=quietness > 0): raise RemoteExecutionError("Could not establish link with " + RNS.prettyhexrep(destination_hash)) diff --git a/RNS/Utilities/rnstatus.py b/RNS/Utilities/rnstatus.py index 61390d33..04754dfa 100644 --- a/RNS/Utilities/rnstatus.py +++ b/RNS/Utilities/rnstatus.py @@ -2,7 +2,7 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -159,8 +159,7 @@ def get_remote_status(destination_hash, include_lstats, include_profiling, ident def program_setup(configdir, dispall=False, verbosity=0, name_filter=None, json=False, astats=False, pstats=False, lstats=False, sorting=None, sort_reverse=False, remote=None, management_identity=None, must_exit=True, rns_instance=None, traffic_totals=False, discovered_interfaces=False, config_entries=False, burst_filter=False, blocked_ips=False, - queue_stats=False, pps=False, profiling=False, remote_timeout=RNS.Transport.PATH_REQUEST_TIMEOUT, - attach=None, detach=None, reload=None, show_stale=False, show_unknown=False, fstats=False, tstats=False): + queue_stats=False, pps=False, profiling=False, remote_timeout=RNS.Transport.PATH_REQUEST_TIMEOUT): if remote: require_shared = False else: require_shared = True @@ -171,44 +170,12 @@ def program_setup(configdir, dispall=False, verbosity=0, name_filter=None, json= must_exit = False else: reticulum = RNS.Reticulum(configdir=configdir, loglevel=3+verbosity, require_shared_instance=require_shared) - reticulum.wants_destination_type("rnstransport.remote.management") except Exception as e: print("No shared RNS instance available to get status from") if must_exit: exit(1) else: return - if attach: - result = reticulum.attach_interface(attach) - if result == True: print(f"Interface {attach} was attached") - elif result == False: print(f"Could not attach interface {attach}") - elif result == None: print(f"The interface {attach} does not exist") - else: print(f"Unknown error while attaching interface {attach}") - - if result == True: exit(0) - else: exit(1) - - if detach: - result = reticulum.detach_interface(detach) - if result == True: print(f"Interface {detach} was detached") - elif result == False: print(f"Could not detach interface {detach}") - elif result == None: print(f"The interface {detach} does not exist") - else: print(f"Unknown error while detaching interface {detach}") - - if result == True: exit(0) - else: exit(1) - - if reload: - result = reticulum.reload_interface(reload) - if result == True: print(f"Interface {reload} was reloaded") - elif result == False: print(f"Could not reload interface {reload}") - elif result == None: print(f"The interface {reload} does not exist") - else: print(f"Unknown error while reloading interface {reload}") - - if result == True: exit(0) - else: exit(1) - - link_count = None active_link_count = None stats = None @@ -244,17 +211,12 @@ def program_setup(configdir, dispall=False, verbosity=0, name_filter=None, json= name = i["name"] if_type = i["type"] status = i["status"] - has_impl_info = "impl_name" in i and "version" in i and i["impl_name"] and i["version"] - impl_str = f"{i['impl_name']} {i['version']}" if has_impl_info else "Unknown" if status == "available": status_display = "Available" elif status == "unknown": status_display = "Unknown" elif status == "stale": status_display = "Stale" else: status_display = status - if status == "stale" and not show_stale: continue - if not has_impl_info and not show_unknown: continue - now = time.time() dago = now-i["discovered"] hago = now-i["last_heard"] @@ -262,14 +224,6 @@ def program_setup(configdir, dispall=False, verbosity=0, name_filter=None, json= last_heard_display = f"{RNS.prettytime(hago, compact=True)} ago" transport_str = "Enabled" if i["transport"] else "Disabled" - has_cost_info = "dst_cost" in i and "pr_cost" in i - dst_cost = None; pr_cost = None - if not has_cost_info: cost_str = "Unknown" - else: - dst_cost = i["dst_cost"] - pr_cost = i["pr_cost"] - cost_str = f"Dst {RNS.prettycost(dst_cost)}, PR {RNS.prettycost(pr_cost)}" - if i["latitude"] is not None and i["longitude"] is not None: lat = round(i["latitude"], 4) lon = round(i["longitude"], 4) @@ -293,11 +247,8 @@ def program_setup(configdir, dispall=False, verbosity=0, name_filter=None, json= print(f"Name : {name}") print(f"Type : {if_type}") - print(f"Stack : {impl_str}") print(f"Status : {status_display}") print(f"Transport : {transport_str}") - print(f"Stamp Value : {RNS.prettycost(i['value'])}") - print(f"Costs : {cost_str}") if has_cost_info else None print(f"Distance : {i['hops']} hop{'' if i['hops'] == 1 else 's'}") print(f"Discovered : {discovered_display}") print(f"Last Heard : {last_heard_display}") @@ -311,6 +262,8 @@ def program_setup(configdir, dispall=False, verbosity=0, name_filter=None, json= if "reachable_on" in i: print(f"Address : {i['reachable_on']}") if "port" in i: print(f"Port : {i['port']}") + print(f"Stamp Value : {i['value']}") + print(f"\nConfiguration Entry:") config_lines = i["config_entry"].split('\n') for line in config_lines: print(f" {line}") @@ -318,15 +271,12 @@ def program_setup(configdir, dispall=False, verbosity=0, name_filter=None, json= except Exception as e: pass else: - print(f"{'Name':<25} {'Type':<10} {'Status':<10} {'Last Heard':<12} {'Value':<7} {'Running':<16} {'Location':<15}") - print("-" * 110) + print(f"{'Name':<25} {'Type':<12} {'Status':<12} {'Last Heard':<12} {'Value':<8} {'Location':<15}") + print("-" * 89) for i in filtered_ifs: try: name = i["name"][:24] + "…" if len(i["name"]) > 24 else i["name"] - has_impl_info = "impl_name" in i and "version" in i and i["impl_name"] and i["version"] - impl_str = f"{i['impl_name']} {i['version']}" if has_impl_info else "Unknown" - if len(impl_str) > 16: impl_str = impl_str[:15]+"…" if_type = i["type"].replace("Interface", "") @@ -335,9 +285,6 @@ def program_setup(configdir, dispall=False, verbosity=0, name_filter=None, json= elif status == "unknown": status_display = "? Unknown" elif status == "stale": status_display = "× Stale" else: status_display = status - - if status == "stale" and not show_stale: continue - if not has_impl_info and not show_unknown: continue now = time.time() last_heard = i["last_heard"] @@ -354,7 +301,7 @@ def program_setup(configdir, dispall=False, verbosity=0, name_filter=None, json= days = int(diff / 86400) last_heard_display = f"{days}d ago" - value = RNS.prettycost(i["value"]) + value = str(i["value"]) if i["latitude"] is not None and i["longitude"] is not None: lat = round(i["latitude"], 4) @@ -362,7 +309,7 @@ def program_setup(configdir, dispall=False, verbosity=0, name_filter=None, json= location = f"{lat}, {lon}" else: location = "N/A" - print(f"{name:<25} {if_type:<10} {status_display:<12} {last_heard_display:<12} {value:<7} {impl_str:<16} {location:<15}") + print(f"{name:<25} {if_type:<12} {status_display:<12} {last_heard_display:<12} {value:<8} {location:<15}") except Exception as e: pass @@ -432,19 +379,14 @@ def program_setup(configdir, dispall=False, verbosity=0, name_filter=None, json= if sorting == "rate" or sorting == "bitrate": interfaces.sort(key=lambda i: i["bitrate"], reverse=not sort_reverse) if sorting == "rx": interfaces.sort(key=lambda i: i["rxb"], reverse=not sort_reverse) if sorting == "tx": interfaces.sort(key=lambda i: i["txb"], reverse=not sort_reverse) - if sorting == "frx": interfaces.sort(key=lambda i: i["frxb"], reverse=not sort_reverse) - if sorting == "ftx": interfaces.sort(key=lambda i: i["ftxb"], reverse=not sort_reverse) if sorting == "rxs": interfaces.sort(key=lambda i: i["rxs"], reverse=not sort_reverse) if sorting == "txs": interfaces.sort(key=lambda i: i["txs"], reverse=not sort_reverse) - if sorting == "frxs": interfaces.sort(key=lambda i: i["frxs"], reverse=not sort_reverse) - if sorting == "ftxs": interfaces.sort(key=lambda i: i["ftxs"], reverse=not sort_reverse) if sorting == "traffic": interfaces.sort(key=lambda i: i["rxb"]+i["txb"], reverse=not sort_reverse) if sorting == "anns" or sorting == "announces": interfaces.sort(key=lambda i: i["incoming_announce_frequency"]+i["outgoing_announce_frequency"], reverse=not sort_reverse) if sorting == "arx": interfaces.sort(key=lambda i: i["incoming_announce_frequency"], reverse=not sort_reverse) if sorting == "atx": interfaces.sort(key=lambda i: i["outgoing_announce_frequency"], reverse=not sort_reverse) if sorting == "arxc": interfaces.sort(key=lambda i: i["arxc"], reverse=not sort_reverse) if sorting == "atxc": interfaces.sort(key=lambda i: i["atxc"], reverse=not sort_reverse) - if sorting == "afrxc": interfaces.sort(key=lambda i: i["afrxc"], reverse=not sort_reverse) if sorting == "prx": interfaces.sort(key=lambda i: i["incoming_pr_frequency"], reverse=not sort_reverse) if sorting == "ptx": interfaces.sort(key=lambda i: i["outgoing_pr_frequency"], reverse=not sort_reverse) if sorting == "prxc": interfaces.sort(key=lambda i: i["prxc"], reverse=not sort_reverse) @@ -556,21 +498,6 @@ def program_setup(configdir, dispall=False, verbosity=0, name_filter=None, json= if "bitrate" in ifstat and ifstat["bitrate"] != None: print(f" Rate : {speed_str(ifstat['bitrate'])}, MTU {ifstat['mtu']}") - if tstats and not clients: - print(f" Tunnel ID : {RNS.hexrep(ifstat['tunnel_id'], delimit=False) if ifstat['tunnel_id'] else 'None'}") - - if tstats and ifstat["tunnel_id"]: - print(f" Rem.Tr.ID : {RNS.prettyhexrep(ifstat['remote_transport_id']) if ifstat['remote_transport_id'] else 'Unknown'}") - - trns_str = ", transport enabled" if ifstat['rem_is_tn'] else ", no transport" - impl_str = f"{ifstat['rem_impl']}" if ifstat['rem_impl'] else "Unknown implementation" - vers_str = f" {'.'.join([str(v) for v in ifstat['rem_vers']])}{trns_str}" if ifstat['rem_vers'] else ", unknown version" - print(f" Rem.Vers. : {impl_str}{vers_str}") - - dst_cost_str = f"Dst {RNS.prettycost(ifstat['rem_dst_cost'])}" if ifstat["rem_dst_cost"] != None else "Dst ?" - pr_cost_str = f"PR {RNS.prettycost(ifstat['rem_pr_cost'])}" if ifstat["rem_pr_cost"] != None else "PR ?" - print(f" Rem.Csts. : {dst_cost_str}, {pr_cost_str}") - if "noise_floor" in ifstat: if not "interference" in ifstat: nstr = "" else: @@ -758,8 +685,7 @@ def program_setup(configdir, dispall=False, verbosity=0, name_filter=None, json= if asr: if ifstat["arxc"] and ifstat["atxc"]: - f_str = f", {ifstat['afrxc']} filtered" if ifstat["afrxc"] else "" - print(f" Announces : {ifstat['arxc']}↓ {ifstat['atxc']}↑ total{f_str}") + print(f" Announces : {ifstat['arxc']}↓ {ifstat['atxc']}↑ total") print(f" {oaf} {pc_str}") else: print(f" Announces : {oaf} {pc_str}") @@ -778,14 +704,6 @@ def program_setup(configdir, dispall=False, verbosity=0, name_filter=None, json= print(f" Traffic : {txstat}\n {rxstat}") - if fstats: - frxstat = "↓"+RNS.prettysize(ifstat["frxb"]) - ftxstat = "↑"+RNS.prettysize(ifstat["ftxb"]) - if "frxs" in ifstat and "ftxs" in ifstat: - frxstat += " "+RNS.prettyspeed(ifstat["frxs"]) - ftxstat += " "+RNS.prettyspeed(ifstat["ftxs"]) - print(f" Filtered : {ftxstat}\n {frxstat}") - lstr = "" if link_count != None and lstats: ms = "y" if link_count == 1 else "ies" @@ -826,41 +744,6 @@ def program_setup(configdir, dispall=False, verbosity=0, name_filter=None, json= print(f"\n Totals : {txstat}\n {rxstat}") - if fstats: - frxstat = "↓"+RNS.prettysize(stats["frxb"]) - ftxstat = "↑"+RNS.prettysize(stats["ftxb"]) - - strdiff = len(frxstat)-len(ftxstat) - if strdiff > 0: ftxstat += " "*strdiff - elif strdiff < 0: frxstat += " "*-strdiff - - if "frxs" in stats and "ftxs" in stats: - frxstat += " "+RNS.prettyspeed(stats["frxs"]) - ftxstat += " "+RNS.prettyspeed(stats["ftxs"]) - print(f"\n Filtered : {ftxstat}\n {frxstat}") - - if lstats: - if "lrxb" in stats and "ltxb" in stats and "lrxs" in stats and "ltxs" in stats: - lrxb_str = "↓"+RNS.prettysize(stats["lrxb"]) - ltxb_str = "↑"+RNS.prettysize(stats["ltxb"]) - strdiff = len(lrxb_str)-len(ltxb_str) - if strdiff > 0: ltxb_str += " "*strdiff - elif strdiff < 0: lrxb_str += " "*-strdiff - - parxs = stats["prxs"]+stats["arxs"] - patxs = stats["ptxs"]+stats["atxs"] - drxpct = 100.0-min(100.0, (parxs / stats["rxs"])*100.0) if stats["rxs"] else 100.0 - dtxpct = 100.0-min(100.0, (patxs / stats["txs"])*100.0) if stats["txs"] else 100.0 - drxs = stats["rxs"]*(drxpct/100.0) - dtxs = stats["txs"]*(dtxpct/100.0) - - lrxspct = min(100.0, (stats["lrxs"] / drxs)*100.0) if drxs and stats["lrxs"] else 0.0 - ltxspct = min(100.0, (stats["ltxs"] / dtxs)*100.0) if dtxs and stats["ltxs"] else 0.0 - - lrxstat = lrxb_str+" "+RNS.prettyspeed(stats["lrxs"])+f", {int(lrxspct)}% of data flow" - ltxstat = ltxb_str+" "+RNS.prettyspeed(stats["ltxs"])+f", {int(ltxspct)}% of data flow" - print(f"\n Links : {ltxstat}\n {lrxstat}") - if pstats: if "prxb" in stats and "ptxb" in stats and "prxs" in stats and "ptxs" in stats: prxb_str = "↓"+RNS.prettysize(stats["prxb"]) @@ -949,23 +832,17 @@ def main(must_exit=True, rns_instance=None): parser.add_argument("--config", action="store", default=None, help="path to alternative Reticulum config directory", type=str) parser.add_argument("--version", action="version", version="rnstatus {version}".format(version=__version__)) - parser.add_argument("--attach", action="store", metavar="name", help="Attach interface by name", default=None, type=str) - parser.add_argument("--detach", action="store", metavar="name", help="Detach interface by name", default=None, type=str) - parser.add_argument("--reload", action="store", metavar="name", help="Reload interface by name", default=None, type=str) - parser.add_argument("-a", "--all", action="store_true", help="show all interfaces", default=False) parser.add_argument("-A", "--announce-stats", action="store_true", help="show announce stats", default=False) parser.add_argument("-P", "--pr-stats", action="store_true", help="show path request stats", default=False) - parser.add_argument("-F", "--filter-stats", action="store_true", help="show filtered traffic stats", default=False) parser.add_argument("-l", "--link-stats", action="store_true", help="show link stats", default=False) parser.add_argument("-B", "--burst", action="store_true", help="only show interfaces with active bursts", default=False) parser.add_argument("-b", "--blocked-ips", action="store_true", help="show blocked IPs per interface", default=False) parser.add_argument("-t", "--totals", action="store_true", help="display traffic totals", default=False) - parser.add_argument("-T", "--tunnels", action="store_true", help="display tunnel information", default=False) parser.add_argument("-p", "--pps", action="store_true", help="display packets per second in totals", default=False) parser.add_argument("-q", "--queues", action="store_true", help="display queue stats", default=False) parser.add_argument("-z", "--profiling", action="store_true", help="display live profiling results", default=False) - parser.add_argument("-s", "--sort", action="store", help="sort interfaces by [rate, traffic, rx, tx, rxs, txs, frx, ftx, anns, arx, atx, arxc, atxc, afrxc, held, prx, ptx, prxc, ptxc, pvs, ivs, flt, txdrp, txdrb, txbuf]", default=None, type=str) + parser.add_argument("-s", "--sort", action="store", help="sort interfaces by [rate, traffic, rx, tx, rxs, txs, anns, arx, atx, arxc, atxc, held, prx, ptx, prxc, ptxc, pvs, ivs, flt, txdrp, txdrb, txbuf]", default=None, type=str) parser.add_argument("-r", "--reverse", action="store_true", help="reverse sorting", default=False) parser.add_argument("-j", "--json", action="store_true", help="output in JSON format", default=False) parser.add_argument("-R", action="store", metavar="hash", help="transport identity hash of remote instance to get status from", default=None, type=str) @@ -973,8 +850,6 @@ def main(must_exit=True, rns_instance=None): parser.add_argument("-w", action="store", metavar="seconds", type=float, help="timeout before giving up on remote queries", default=RNS.Transport.PATH_REQUEST_TIMEOUT) parser.add_argument("-d", "--discovered", action="store_true", help="list discovered interfaces", default=False) parser.add_argument("-D", action="store_true", help="show details and config entries for discovered interfaces", default=False) - parser.add_argument("--show-stale", action="store_true", help="show stale discovery entries", default=False) - parser.add_argument("--show-unknown", action="store_true", help="show discovery entries without version info", default=False) parser.add_argument("-m", "--monitor", action="store_true", help="continuously monitor status", default=False) parser.add_argument("-I", "--monitor-interval", action="store", metavar="seconds", type=float, help="refresh interval for monitor mode (default: 1)", default=1.0) parser.add_argument('-v', '--verbose', action='count', default=0) @@ -989,9 +864,7 @@ def main(must_exit=True, rns_instance=None): if args.R: require_shared = False else: require_shared = True - try: - reticulum = RNS.Reticulum(configdir=configarg, loglevel=3+args.verbose, require_shared_instance=require_shared) - reticulum.wants_destination_type("rnstransport.remote.management") + try: reticulum = RNS.Reticulum(configdir=configarg, loglevel=3+args.verbose, require_shared_instance=require_shared) except Exception as e: print("No shared RNS instance available to get status from") exit(1) @@ -1007,8 +880,7 @@ def main(must_exit=True, rns_instance=None): astats=args.announce_stats, pstats=args.pr_stats, lstats=args.link_stats, sorting=args.sort, sort_reverse=args.reverse, remote=args.R, management_identity=args.i, remote_timeout=args.w, must_exit=False, rns_instance=reticulum, traffic_totals=args.totals, discovered_interfaces=args.discovered, config_entries=args.D, burst_filter=args.burst, - blocked_ips=args.blocked_ips, queue_stats=args.queues, pps=args.pps, profiling=args.profiling, - show_stale=args.show_stale, show_unknown=args.show_unknown, fstats=args.filter_stats, tstats=args.tunnels) + blocked_ips=args.blocked_ips, queue_stats=args.queues, pps=args.pps, profiling=args.profiling) finally: sys.stdout = old_stdout @@ -1026,9 +898,7 @@ def main(must_exit=True, rns_instance=None): astats=args.announce_stats, pstats=args.pr_stats, lstats=args.link_stats, sorting=args.sort, sort_reverse=args.reverse, remote=args.R, management_identity=args.i, remote_timeout=args.w, must_exit=must_exit, rns_instance=rns_instance, traffic_totals=args.totals, discovered_interfaces=args.discovered, config_entries=args.D, burst_filter=args.burst, - blocked_ips=args.blocked_ips, queue_stats=args.queues, pps=args.pps, profiling=args.profiling, - attach=args.attach, detach=args.detach, reload=args.reload, show_stale=args.show_stale, tstats=args.tunnels, - show_unknown=args.show_unknown, fstats=args.filter_stats) + blocked_ips=args.blocked_ips, queue_stats=args.queues, pps=args.pps, profiling=args.profiling) except KeyboardInterrupt: print("") diff --git a/RNS/Utilities/rnx.py b/RNS/Utilities/rnx.py index 3d694ce9..4bfcf83b 100644 --- a/RNS/Utilities/rnx.py +++ b/RNS/Utilities/rnx.py @@ -2,7 +2,7 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -342,8 +342,6 @@ def execute(configdir, identitypath = None, verbosity = 0, quietness = 0, detail targetloglevel = 3+verbosity-quietness reticulum = RNS.Reticulum(configdir=configdir, loglevel=targetloglevel) - reticulum.wants_destination_type(f"{APP_NAME}.execute") - if identity == None: prepare_identity(identitypath) diff --git a/RNS/__init__.py b/RNS/__init__.py index 6c04f641..81f9b75d 100755 --- a/RNS/__init__.py +++ b/RNS/__init__.py @@ -1,6 +1,6 @@ # Reticulum License # -# Copyright (c) 2016-2026 Mark Qvist +# Copyright (c) 2016-2025 Mark Qvist # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal @@ -41,7 +41,6 @@ import bisect from ._version import __version__ from collections import deque from functools import partial, wraps -from RNS.Stamps import quantize_cost py_modules = glob.glob(os.path.dirname(__file__)+"/*.py") pyc_modules = glob.glob(os.path.dirname(__file__)+"/*.pyc") @@ -87,7 +86,7 @@ instance_random.seed(os.urandom(10)) _always_override_destination = False -logging_lock = threading.RLock() +logging_lock = threading.Lock() def loglevelname(level): if (level == LOG_CRITICAL): return "[Critical]" @@ -180,19 +179,6 @@ def prettyhexrep(data): hexrep = "<"+delimiter.join("{:02x}".format(c) for c in data)+">" return hexrep -__namehash_resolver = None -def prettynamehash(name_hash): - global __namehash_resolver - if not __namehash_resolver: - import RNS.Transport - __namehash_resolver = RNS.Transport.destination_type_name - return f"<{__namehash_resolver(name_hash)}>" - -def prettycost(value): - if value == None: return "n" - elif not type(value) in (float, int): return "n" - else: return f"{quantize_cost(value):.3f}" - def prettyspeed(num, suffix="b"): return prettysize(num/8, suffix=suffix)+"ps" diff --git a/RNS/_version.py b/RNS/_version.py index f49459c7..0f228f25 100644 --- a/RNS/_version.py +++ b/RNS/_version.py @@ -1 +1 @@ -__version__ = "1.6.1" +__version__ = "1.5.1" diff --git a/Roadmap.md b/Roadmap.md new file mode 100644 index 00000000..5689e309 --- /dev/null +++ b/Roadmap.md @@ -0,0 +1,94 @@ +# Reticulum Development Roadmap +This document outlines the currently established development roadmap for Reticulum. + +1. [Currently Active Work Areas](#currently-active-work-areas) +2. [Primary Efforts](#primary-efforts) + - [Comprehensibility](#comprehensibility) + - [Universality](#universality) + - [Functionality](#functionality) + - [Usability & Utility](#usability--utility) + - [Interfaceability](#interfaceability) +3. [Auxillary Efforts](#auxillary-efforts) +4. [Release History](#release-history) + +## Currently Active Work Areas +For each release cycle of Reticulum, improvements and additions from the five [Primary Efforts](#primary-efforts) are selected as active work areas, and can be expected to be included in the upcoming releases within that cycle. While not entirely set in stone for each release cycle, they serve as a pointer of what to expect in the near future. + +## Primary Efforts +The development path for Reticulum is currently laid out in five distinct areas: *Comprehensibility*, *Universality*, *Functionality*, *Usability & Utility* and *Interfaceability*. Conceptualising the development of Reticulum into these areas serves to advance the implementation and work towards the Foundational Goals & Values of Reticulum. + +### Comprehensibility +These efforts are aimed at improving the ease of which Reticulum is understood, and lowering the barrier to entry for people who wish to start building systems on Reticulum. + +- Improving [the manual](https://markqvist.github.io/Reticulum/manual/) with tutorials specifically for beginners +- Updating the documentation to reflect recent changes and improvements + - Update descriptions of protocol mechanics + - Update announce description + - Add in-depth explanation of the IFAC system + - Software + - Update software descriptions and screenshots + - Communications hardware section + - Add information about RNode external displays. + - Possibly add other relevant types here as well. + - Setup *Best Practices For...* / *Installation Examples* section. + - Home or office (example) + - Vehicles (example) + - No-grid/solar/remote sites (example) + +### Universality +These efforts seek to broaden the universality of the Reticulum software and hardware ecosystem by continously diversifying platform support, and by improving the overall availability and ease of deployment of the Reticulum stack. + +- Create a standalone RNS Daemon app for Android +- A lightweight and portable C implementation for microcontrollers, µRNS +- A portable, high-performance Reticulum implementation in C/C++, see [#21](https://github.com/markqvist/Reticulum/discussions/21) +- Bindings for other programming languages + +### Functionality +These efforts aim to expand and improve the core functionality and reliability of Reticulum. + +- Add interface hot-plug and live up/down control to running instances +- Add automatic retries to all use cases of the `Request` API +- Network-wide path balancing +- Distributed Destination Naming System +- Globally routable multicast +- Destination proxying +- [Metric-based path selection and multiple paths](https://github.com/markqvist/Reticulum/discussions/86) + +### Usability & Utility +These efforts seek to make Reticulum easier to use and operate, and to expand the utility of the stack on deployed systems. + +- Easy way to share interface configurations, see [#19](https://github.com/markqvist/Reticulum/discussions/19) +- Transit traffic display in `rnstatus` +- `rnsconfig` utility + +### Interfaceability +These efforts aim to expand the types of physical and virtual interfaces that Reticulum can natively use to transport data. + +- Plain ESP32 devices (ESP-Now, WiFi, Bluetooth, etc.) +- More LoRa transceivers +- AT-compatible modems +- Filesystem interface +- Direct SDR Support +- Optical mediums +- IR Transceivers +- AWDL / OWL +- HF Modems +- GNU Radio +- CAN-bus +- Raw SPI +- Raw i²c +- MQTT +- XBee +- Tor + +## Auxillary Efforts +The Reticulum ecosystem is enriched by several other software and hardware projects, and the support and improvement of these, in symbiosis with the core Reticulum project helps expand the reach and utility of Reticulum itself. + +This section lists, in no particular order, various important efforts that would be beneficial to the goals of Reticulum. + +- The [RNode](https://unsigned.io/rnode/) project + - [x] Create a WebUSB-based bootstrapping utility, and integrate this directly into the [RNode Bootstrap Console](#), both on-device, and on an Internet-reachable copy. This will make it much easier to create new RNodes for average users. + +## Release History + +Please see the [Changelog](./Changelog.md) for a complete release history and changelog of Reticulum. \ No newline at end of file diff --git a/SECURITY.md b/SECURITY.md deleted file mode 100644 index dae1b7f3..00000000 --- a/SECURITY.md +++ /dev/null @@ -1,5 +0,0 @@ -# Reporting Security Issues - -It goes without saying: If you have discovered a security issue in Reticulum or any related project, please report it responsibly to the maintainer over LXMF at `<8dd57a738226809646089335a6b03695>`. If you wish to remain anonymous, please create a disposable identity to send from, and notify us of any such wishes. - -If you are not able to use LXMF, you can send an email to the address currently posted on the maintainer's profile on this site. diff --git a/This Is Not a Teahouse.md b/This Is Not a Teahouse.md index d56a00b6..754769be 100644 --- a/This Is Not a Teahouse.md +++ b/This Is Not a Teahouse.md @@ -2,7 +2,7 @@ Recently, and mostly from people who I've never seen before, the opinions about - The decision to no longer mirror release notes on GitHub. - Some people feeling there were too many "barriers to entry" to joining RNS development. -- The project not really being "[open source](https://reticulum.network/manual/brandolinis.html#open-source-means-open-source)" because random strangers couldn't just "contribute". +- The project not really being "open source" because random strangers couldn't just "contribute". Joakim posted some very relevant observations about how Reticulum operates, along with the following quote: @@ -10,7 +10,7 @@ Joakim posted some very relevant observations about how Reticulum operates, alon That E. F. Schumacher quote perfectly illustrates the ontological schism that makes it so tiresome to deal with stuff like this. -There is, in this day and age, between different people, widely different base conceptual integrations of what "open source" means. For many people, "open source" has become synonymous **not** with skilled people working together in a coordinated and careful way on complex engineering challenges, but a sort of growth- and attention-focused "free-for-all" *behavioral* codex that must be followed above all else; a *social* modus operandi of fake inclusivity where everyone "should have their voice heard", and adherence to that specific *process* is weighed much higher than the final results. +There is, in this day and age, between different people, widely different base conceptual integrations of what "open source" means. For many people, "open source" has become synonymous **not** with skilled people working together in a coordinated and careful way on complex engineering challenges, but a sort of growth- and attention-focused "free-for-all" *behavioral* codex that must be followed above all else; a *social* modus operandi of fake inclusivity where everyone "should have their voice heard", and adherence to that specific process is weighed much higher than the final results. I do not subscribe to, and consequently do not operate the Reticulum project under *any* versions of that idea. @@ -28,7 +28,7 @@ I do not subscribe to, and consequently do not operate the Reticulum project und Can you imagine how much time that wasted? Can you imagine what we could have accomplished with that time instead? -The only thing that this creates is *noise* and confusion. Clogging up the mental and physical workspaces, of people who are actually investing time and effort on the project, with stuff like that is objectively just taking time that could have been used on development, and replacing it with *nothing*. +The only thing that this creates is *noise* and confusion. Clogging up the mental and physical workspaces, of people who are actually investing time and effort on the project with stuff like that is objectively just taking time that could have been used on development, and replacing it with *nothing*. I was receiving *actual* bug reports, pull requests, proper technical investigations and patches via methods outside GitHub and "public" internet-based channels *way* before GitHub interaction and similar was closed down. That was were almost *all* of the real contributions were coming from, anyway. Apparently, and not unsurprisingly, the people who has invested the time and effort to understand Reticulum also prefer to collaborate in this way. Since leaving the GitHub madhouse behind, the signal-to-noise ratio has **significantly** increased. @@ -46,7 +46,7 @@ When this pattern repeats, over and over, the only sensible, measured and constr So, now it's your turn. Go look at the diffs for the last six months. What does it look like I have been doing? -But I will be damned straight with you all, and say that part of that solution is **absolutely** to erect barriers to entry. You can fucking bet your arse on that. I don't want opinionated man-babies running around in my living-room at 3am. I don't want to clean up the floor after a wannabe "dev-ops star" with LLMs and a peripheral case of influencitis has puked all over the office. +But I will be damned straight with you all, and say that part of that solution is **absolutely** to erect barriers to entry. You can fucking bet your arse on that. I don't want opinionated man-babies running around in my living-room at 3am. I don't want to clean up the floor after a wannabe "dev-ops stars" with LLMs and a peripheral case of influencitis has puked all over the office. - If you want to join the fun of changing core networking code that thousands of people rely on for communication daily, you better know what the fuck you're doing. diff --git a/docs/history/2026_09_18_Yes_I_am_Angry.md b/docs/history/2026_09_18_Yes_I_am_Angry.md deleted file mode 100644 index ae962d09..00000000 --- a/docs/history/2026_09_18_Yes_I_am_Angry.md +++ /dev/null @@ -1,341 +0,0 @@ -# Yes, I am Angry - -Polite, but deeply malicious bullshit is a much worse evil than the coarse variant, so you will have to excuse my bluntness here. - -Unfortunately, the only way to respond, as a normal, healthy human being, to something so astronomically tasteless and disgraceful as this, is not in kind, but in honest outrage, modulated to some degree with sarcasm and humor (the dark variant, yes). - -Because *this* shit, this *is* outrageous. - -The man that produced the "article" in question here is either so disposessed of intelligence that his head is teetering on the brink of collapsing into a singularity, or he is deeply malicious. - -If any rational explanation can produce an alternative, I am all ears. - -**To the footsoldiers of the "cause" the article represents** - -Let's get this show on. Let's see the barrage of new smear pieces you can prompt forth from the fuel I provide you here. It'll fit straight into your theater production, so: Be my fucking guest, and dig your own hole of delusion, mistrust and ridicule even deeper than it already is. I can then hurl it right back at you, and we can all have a crap-fight till the end of days. *Or* we could take responsibility and ownership for our words and actions, and actually build something together. Ball's in your court. - -**To anyone else** - -Consider this a paranthetical, sarcastic (and for me, cathartic) aside in the whole of the corpus of writings I have published, and weigh it in the context of the rest of those 200,000 words or so, together with the frustration and exhaustion that inevitably entails from dealing with this same fabricated campaign and its regurgitated nonsense for *years* on end, while trying to do constructive and helpful work; and not expecting anything else than basic decency in return. - -I am no angel, not perfect, flawed in many ways, but I certainly ain't afraid to show that I am a real human being, with the capacity for anger, and that in this case, the anger is fed by the most bitter form of disappointment and sadness in what people will stoop to for influence and attention. - -[This is the article in question](https://gaggl.com/blogs/2026-09-05-enclosure-by-good-intentions/) - -[This is the polite, measured analysis of the *generalized* phenomenon, all 18,000 words of it](https://reticulum.network/manual/brandolinis.html) - -And here is a very short, but central point from that analysis: - -> In whole, this is the description of three fronts of the same operation: -> -> * The license attack and other urgency-engineered narratives are the *cover*: They supply -> the ideological justification and battering ram for treating the reference as illegitimate, -> and needing replacement. -> * The ports are the *inventory*: they supply the “replacement” material that the narrative -> claims the ecosystem needs. -> * The takeover narrative is the *objective function*: the repeated, persistent, escalating claim that -> the reference should be replaced, and that the speakers themself are the natural heirs. - ---- - -*This*, right here, is the real, human and honest response. And the only sane one there could ever be, lest madness be allowed to descend wholly. - -While this is *written* as a response to you, Leo Gaggl, you absolute degenerate piece of fecal matter, it is really a response to the phenomenon *as a whole*. - -I chose your article because it is such a complete and rich example of the madness. What I attack here is *conduct*. - -Leo, according to his own evident preference, is the actor on the theatre stage, and I will treat him as such, in the play that follows. - ---- - -> So when Mark Qvist, the person behind the [Reticulum](https://gaggl.com/blogs/2026-02-25-lpwan-meshes-reticulum-deep-dive/) mesh networking stack - -Color me surprised, the link to "Reticulum" doesn't even point to the repo, but to *another* one of your sloporated "articles". - -Don't wanna accidentially lead users to anywhere they could discover the truth about things now, would we? Like commit histories, the *actual* Reticulum community, that kind of stuff. Nah, nah... - -> ... replaced its MIT licence with a custom one built to keep the project out of corporate AI training sets and out of weapons systems - -Which happened 18 months ago. *Fuuuunny* timing bringing it up again now, right where it's [mighty fucking convenient](https://reticulum.network/manual/brandolinis.html#a-persistent-but-fragile-triad) for your slop-coding license-violating friends, don't you think? - -Interesting you don't bring up *any* of the extensive argumentation made against the same old points you recycle here, but act as they simply never existed. Or maybe you just chose to completely ignore them in the service of your God-given mission? - -> Reticulum is now marked non-free by Debian - -Which is [excellent](https://reticulum.network/manual/brandolinis.html#the-distribution-argument), since debian users will not have to use old, and potentially outdated versions of a package that updates *fast* everytime it is required. - -And "now"? Weasel wording. - -> kept out of the main F-Droid repository - -RNS? In the F-Droid repository? How would that even work? People install the base stack as an *app* and run it... how? Are we going to bundle a command line or `systemd` with that? Do you have any idea about how software actually works? - -If people want to do that, open Termux and type `pip install rns`. Done. Has been possible and documented since the dawn of the project. - -All actual *apps* that use Reticulum are distributed as APKs, ready to install and download, distribute offline, fetch from their websites, over Reticulum itself, or whatever platform they prefer. Commercially or for free. That's the point. - -> It cannot be combined with GPL-licensed code - -[Cry me a river](https://reticulum.network/manual/brandolinis.html#on-freedom). Not my fault that people choose to use viral licenses that absolutely must subsume everything and their aunt under their own restrictive terms. - -> It is not eligible for most open-source grant funding. - -Exactly, and I specifically rejected that, several times, to keep the license right and avoid political takeover. That's 50.000€ I said no to, right there, while I barely had enough to make it three months into the future. Because I value integrity and *real* sustainability a lot higher. - -Do *you* have anything to show for it, in that regard? Who's footing your pay-check? A varied community of people from all walks of life who use the things you created? No? Didn't think so. I wonder who, then. - -> And the clause that triggered all of this is very likely unenforceable. - -"Very likely" is very likely a lot of handwaving, Leo. It's certainly not an argument. [This is](https://reticulum.network/manual/brandolinis.html#what-the-reticulum-license-is). - -> As one Debian developer put it in the project’s own discussion thread, people who build harmful systems are not going to be stopped by a term they were always going to ignore. - -It turns out [that most do](https://reticulum.network/manual/brandolinis.html#the-prediction-and-what-happened), because of a thing called "the law". - -Or are you proposing we live in a state of complete and utter anarchy already? Or maybe that your cult is simply above the law? - -> The moment you add a “not for harm” or “not for AI” condition, you have left open source behind - -Strike up the organ, start the hymns. - -> The Open Source Definition rules out licences that discriminate against people or groups, or against fields of endeavour - -[Erratum](https://reticulum.network/manual/brandolinis.html#open-source-means-open-source): *Your* "open source" religion, not "The Open Source Definition" (Capitals Of Authority, bravo). - -Yes, let's not discriminate against people, **BY FUCKING MURDERING THEM WITH DRONES**. Time for a party Leo! - -Beauuuutiful way to hide [the true nonsense](https://reticulum.network/manual/brandolinis.html#what-the-argument-is-actually-doing) of the "fields of endeavour" by slyly insinuating *I* am being discriminatory. - -Side-note: The overall patronizing, better-than-thy and fakely knowledgable tone is almost hilarious, if it wasn't so malicious. - -> The tool was already on the shelf - -Oh for Christ's sake, this one [again](https://reticulum.network/manual/brandolinis.html#recycled-wine-fermenting)... - -> Kaonic tactical mesh radios are sold for military command and control, drone and autonomous-systems networking, and operation in “austere, contested environments”, and which has since been selected for NATO’s DIANA defence-innovation accelerator. It is MIT-licensed, it is an independent implementation of a protocol that is itself public domain, and its repository predates Qvist’s harm clause by nine months. - -Those fuckers came to me and presented themselves as wanting to create a rust port for the good of the ecosystem, the world and the community. That was a blatant lie and front for their actual goal of acquiring my goodwill and expertise so they could quickly create a shallow clone, hardfork it with their own sloppy "Post-Quantum" crypto, and get big money from the military. They deliberately lied and manipulated to extract from a whole community and someone they believed to be a naive, vulnerable developer. - -Why do you think a non-harm clause is needed? Their implementation is still not *working*, by the way, and has provided **nothing** to the community or world at large. - -I cut ties with those bastards when I found out what their end-game was, but not until I had spent every ounce of energy I had slowing them down as much as humanly possible, while *I was still working on the actual Reticulum implementation and providing updates to users, managing a community, and living on next to nothing in a camper*. - -Holy fuck I hate people like you Leo, you willfully ignorant, destructive, spoiled piece of shit. - -> His fix trades a door nobody has worked out how to close for the loss of every distribution channel - -Every distribution channel that [we never used, and never needed](https://reticulum.network/manual/brandolinis.html#the-distribution-argument)? I haven't seen PyPi acting up about our apparently infuriating conduct yet. - -Moot point, even if they do, since we can distribute over Reticulum just fine. With full cryptographic authentication, and no centralized infrastructure or PKI required. Also, no governance required. *That's* resilience. - -> and every downstream collaborator who needs a known-good licence. - -We are definitely not short of downstream collaborators currently, so no thanks, you don't have much to sell me there. - -> You pay the full price in distribution and collaboration - -The quality of collaboration has gone up *significantly* since that decision. Most of the wannabes stay away and sob in their Stallman handkerchiefs, while we keep working, dilligently as always. Great success. - -(Sorry Stallman, I love you) - -Reticulum is available everywhere. It is one of the leanest, most dependency free software packages there is, and it ships an entire networking stack, a plethora of management utilities, a device flashing utility, a full GitHub replacement running over Reticulum, remote shell utilities, and supports a whole ecosystem of application-layer protocols and user-facing applications, including messaging (LXMF), voice (LXST), chat (RRC), content hosting and browsing (nomadnet), and many others. - -*In a cross-platform, portable wheel of 537 kilobytes* that installs or embeds on every platform known to man. Drop it on a floppy, baby. - -The delusions run so deep here I cannot even begin to fathom it. - -> and you get an AI-training restriction a determined actor routes around in an afternoon. - -In reality, of the 10 sampled language models (both proprietary and open-weights) that were tested for traces of Reticulum source material, *all* stopped training on the Reticulum source after the license change. - -Turns out, *it worked*, Leo. - -Did *you* check? No you didn't, handwaving and inventions again. - -> A written answer to “what happens when the maintainer walks away”, because for Reticulum that stopped being hypothetical in December 2025. - -Did you check the [commit logs](https://github.com/markqvist/Reticulum/commits/) you dimwit? No, you just randomly rolled around in the personal puddle of phantasmogoria you constructed from wishful thinking. - -Have you seen what I have produced in those ten months? I'd wager it's a lot more than you, you lazy fuck, not even doing the most basic fact-checking of your smear-job propaganda pieces. - -Try that on for a "written answer". - -> There is now a Reticulum_CE, a “community edition” fork that exists mainly to carry a redistributable licence. - -What psychosis are you getting these from? [Reticulum_CE](https://github.com/Reticulum-Community/Reticulum_CE) is published under the Reticulum License. Did you read their repo? No, you did not: - -*"This is a community maintained fork of the Reticulum Network Stack and is intended as a public forum for discussion and issue reporting, as well as a repository to collect community enhancements to RNS."* - -> There is RetiNet, an AGPL fork of the Python stack. - -Which has been [defunct and abandoned for 8 months](https://codeberg.org/SkyGuy/RetiNet). Are you not equipped with visual perception or basic literacy? - -> There are side-loaded F-Droid repositories so people can install the apps at all. - -What nonsense is this? You are literally so horny to paint a picture of a dead system that you have to assume people cannot think for two seconds straight? - -There has never been a point in time where people could not install Reticulum-based apps on Android. These have always, intentionally, been distributed as *re-distributable* APK files so people could share them offline. Sideband can host and share it's own APK. This is the point, Archimedes. - -The F-droid repository was made as service to users by a volunteer in the *real* Reticulum community (not your abhorrent confabulation of what it is) who *has never once objected to the license and project directions*, and who just wanted to help make things easier! - -Don't use them as ammunition in your perverse fantasies! - -> Every one of those is real maintenance work, done by volunteers, spent entirely on the problem of being allowed to share the software. - -A copy of my repo, then pasting my (Reticulum Licensed) work into four files, then abandoning the project is not "real maintenance work". - -What I have been doing, for over a decade, is real maintenance work. - -> four independent teams have rebuilt Reticulum from scratch in Rust. - -Those [have not "rebuild"](https://reticulum.network/manual/brandolinis.html#copyright-the-two-legal-layers) anything ["from scratch"](https://reticulum.network/manual/brandolinis.html#the-clean-room-delusion). - -They are feeding the source code of RNS directly into an LLM, running automated software loops, and copying it, blatantly, bit for bit, without any modicum of creative input, work or understanding. - -Such a connoisseur of the commons you are. - -> The people rebuilding the project to keep it alive - -The project is already alive, and has been for a decade. You are lying so hard that it's fucking raining. - -Those people, are in their own words, "Killing Reticulum" (quote, Lew Palm, "author" of "Leviculum"), so they can appropriate it for their own profit and control. - -> The two that put enclosure resistance first, Leviculum and the rsReticulum stack behind Ratspeak, both chose AGPLv3. - -And all of those are [void and null](https://reticulum.network/manual/brandolinis.html#void-grants-legal-foundations-of-machine-generated-code), because what they *really* chose is **copyright violation**, and complete disrespect ([as is now becoming tradition](https://reticulum.network/manual/brandolinis.html#licensing-analysis)) for open source development practices, attribution and basic decency. - -*(**Important Note From The Future, added November 2026**: When the maintainer of Ratspeak discovered he had made made a mistake in the licensing, he promptly contacted me, and corrected everything within a few hours. As of this update, all the Ratspeak implementations and derivatives are correctly distributed under the Reticulum License.)* - -> Underneath the licence choice sits a harder problem, and it is the one this site keeps coming back to: a system can be decentralised in its architecture and completely centralised in who decides things. - -Oooooh... Tension. Drama. Tell me more, let's have the juicy details, huh? Outrage incoming, I can feel it! Ramp up your audience like a good boy, Leo! - -The only thing that keeps coming back here is nonsense. - -The decisions follow those responsible, over years, and the actual work. Not cry-babies like you. Get used to it. - -> Relicensing a codebase other people contributed to, under MIT terms, with a single unilateral commit, is itself a small act of enclosure. - -I am responsible for over 98% of commits in that repository. Not a single one of the other contributors disagreed to the license decision. - -But your ideology runs so deep now, *that we cannot ourselves decide how we license our own software*? Yes, let's consider for a moment **who the fucking dictator is here**... - -It's *almost* like you've decided you already personally own Reticulum. - -> The pattern shows up off the codebase too. In late August 2026, after a badly-behaved crawler hammered his NomadNet git node with tens of thousands of requests - -Ah yes, so I got personally mad because it hit *my* node, and had a tantrum? - -The scraper was hitting *every node across the entire fucking intermesh*, from a high-bandwidth VPS, with no throttling, no regards for people's radio links, airtime concerns, metered connections or limited compute resources. - -For what reason? To gouge tens of **millions** of requests to a broken piece of shit software that an idiot deployed and left running without oversight, trying to infintely download **everything that everyone had ever put on their nodes several times over** on a recursive loop. - -Who made that stop? I did, because I [contacted](https://github.com/roogle-dev/reticulum-phantom/issues/4) the idiot and talked him out of it. - -Let's hear more of your brilliant ideas about how to "protect the commons" you fucking ape. - -> Qvist removed the volunteer moderator of the Reticulum subreddit, deleted roughly three years of posts, and closed it with a notice that ended “Well done, vibecoders. You ruined it for everyone.” - -The moderator was not moderating anything, and hadn't been for months. The precise original agreement with him for allowing him moderator rights was exactly the arrangement, that if the space was not moderated, it would be closed, and that I would maintain the final decision on that. - -This is now being spun into yet another [bottle of piss](https://reticulum.network/manual/brandolinis.html#recycled-wine-fermenting) by the dipshits like you. Well done, moron. - -> Around the same window the project’s Matrix room shut down and the GitHub issue tracker was hidden. - -Does time not exist in your alternate universe? The events you allude to are separated by month or years, and the rationales were clearly stated. You deliberately ignored all of that. - -Further, I did not manage or administrate the Matrix room. It was a community room, run by volunteers, flooded with spam and bad-faith actors. I had *zero* admin rights on it. The moderators of the room made that decision themselves, long after I had left - *to focus on actual work*. - -The development was *never* centered on the GitHub issue tracker, it ran over Reticulum long before the preposterous madhouse of GitHub was left behind for good, as it continues to do today, as is documented and stated several places (including the front-page of the repository you refuse to link to). - -Signal to noise ratio has gone up *significantly* because of that. The community is *more* alive, and more productive. - -You are literally making things up as you go. - -> One community member’s summary: for a supposedly decentralised network, the founder holds and uses a lot of centralised levers. - -Yes, let's just [invent](https://reticulum.network/manual/brandolinis.html#the-movement-of-a-dozen) another concerned "community member". Who? Some random nutjob on reddit? - -A random stranger of your choosing is not a "community member" that gets to decide how a highly complex engineering project is run. But damn man, you wish it worked that way. You wish it badly. - -> None of this is meant as a pile-on. - -Oh, *thanks*, you're SO *considerate* and full of empathy Leo! - -> The Reticulum Licence is presented as a shield for the commons - -**Because that is what it actually is.** - -How about trying to actually *prove* otherwise, with *a coherent argument*, instead of getting an LLM to spin a load of high-strung nonsense to further your deranged religion? - -> If your users are European public bodies - -Oh, those poor administrative organizations! Do you think I dedicated my life to empowering European Public Bodies, or actual people? - -> Then spend the effort you saved on the part that is actually hard: governance that survives the founder losing interest. - -[Ze Governance](https://reticulum.network/manual/brandolinis.html#a-history-of-what-works), again, I see. - -Maybe when you've worked 12 hours a day on a project for ten years, which is persistently flooded with this kind of profound idiocy, and kept going, can you begin to consider expounding your finer points on "losing interest". - -> The commons is not protected by a clause forbidding bad uses. - -It sure as hell ain't protected by pretending the world is made of candy-floss either, like you seem to prefer. - -> It is protected by how many people can fork it, ship it, and keep it running without asking anyone’s permission. - -Oh isn't that convenient now? How many can do that today? 99.999999% of the worlds population. What's the equation if we change to your beloved AGPL again, you moron? - -> Reticulum’s licence made that number smaller. - -[Mathematical failure](https://reticulum.network/manual/brandolinis.html#on-freedom). - -> The intention was to guard the commons. The effect was to fence off a piece of it. - -On the intent, [correct](https://reticulum.network/manual/brandolinis.html#what-the-reticulum-license-is). - -On the effect, no: The effect apparently was to induce the uncomfortable feeling of grinding against your own inconsistent dogmas in dishonest, propagandistic nutjobs like you, because *you* now feel *fenced out*. - -There's an important difference there. - -The self-referential circle-jerk you've got going on here is *exactly* the definition of a fence; one made of hysteria and propaganda with the ulterior motive of usurping power away from a community of thousands of people, and putting it, squarely, into your own, trembling, wanting and lazy little hands. - -> Reticulum is also not a toy. People run it over LoRa and packet radio for emergency and off-grid communication, so “someone degrades the network” is a safety question, not an inconvenience. - -**Bingo**, Leo. - -Which is why you need a *real* [responsible, accountable and competent person](https://reticulum.network/manual/brandolinis.html#a-history-of-what-works), with a decade-long track-record to run the project, not a bunch of kids with a fixation on Claude, and their sugardaddies like you. - -> Here is the part that frustrates me. - -Yes, you must *surely* be frustrated Leo, how very frustrating this must be for you and your ChatGPT subscription to have to go through all of this. - -Tell me about frustration once you have actually done something that required more than pillow-fucking your own sense of grandiosity. - -All your github repos are minor personal projects with up to... count them... coooount them... five stars. No users. You must surely know a lot about software development, distribution, and these commons you are protecting so heroically. - -I can see you have a lot of skin in the game here, and a lot of work and experience on your back to bolster your authority. - -Fuck off, you fraud. - -> Every few years a piece of infrastructure I care about gets a new licence - -You don't care one fucking bit about infrastructure Leo. *You don't even know what it is*, least of all what it takes to create it. - -I do. Because I did it. - -Go home, you're drunk. - -Thanks for the material, though. You've provided a textbook example of the incessant bullshit, appropriation, deliberate enclosure and intentionally weaponized manipulation that [this project is up against](https://reticulum.network/manual/brandolinis.html#intent-consequence). - -*In ideology and war, self-justification wears the same coat, and feeds the same destruction, perpetually.* - -Yours truly, - -Mark Qvist - -September 18th, 2026 - ---- - -That it is, I am no longer angry. Back to work. \ No newline at end of file diff --git a/docs/history/2026_09_21_Void_Grants.md b/docs/history/2026_09_21_Void_Grants.md deleted file mode 100644 index 90bbe21a..00000000 --- a/docs/history/2026_09_21_Void_Grants.md +++ /dev/null @@ -1,253 +0,0 @@ -## Void Grants: Legal Foundations of Machine-Generated Code -*From the [Brandolini's Reference](https://reticulum.network/manual/brandolinis.html) chapter of the Reticulum Manual.* - -A grant of rights is only as real as the rights behind it. A license conveys what its issuer holds, and nothing more. A derivative may be distributed only under whatever license covers what it took. And over a work that a machine originated, no human holds anything at all. - -Each of these statements is a matter of settled statute and case law, and this document sets out the authorities. The conclusions they support are: - -1. A software implementation generated from a licensed work by a machine, published under its operator's claimed copyright and license, **conveys rights the operator never possessed**. -2. **Its grant is void**. The projects, products, and promises built upon such grants stand on nothing. A field of void grants is a minefield for everyone who crosses it. - -This document is a general examination of copyright law as it applies to machine-generated code. It is not legal advice. - -### I. The Foundational Statute: Translation Is Copying - -The starting point is the statutory definition of the class of works at issue. Title 17, United States Code, section 101 provides the definition of a derivative work: - -> A "derivative work" is a work based upon one or more preexisting works, such as a *translation*, musical arrangement, dramatization, fictionalization, motion picture version, sound recording, art reproduction, abridgment, condensation, or *any other form in which a work may be recast, transformed, or adapted*. - -Section 101 further provides that *"the terms 'including' and 'such as' are illustrative and not limitative"*. As such, the list is a list of *examples*, and the very first example is translation. The definition also reaches, in its own words, *"any other form in which a work may be recast, transformed, or adapted"*. - -The exclusive right at issue is defined in section 106: - -> Subject to sections 107 through 122, the owner of copyright under this title has the exclusive rights to do and to authorize any of the following: -> (1) to reproduce the copyrighted work in copies or phonorecords; -> (2) to prepare derivative works based upon the copyrighted work; -> (3) to distribute copies or phonorecords of the copyrighted work to the public by sale or other transfer of ownership, or by rental, lease, or lending; - -Violation of any of these rights is infringement. 17 U.S.C. § 501(a). - -Taken together, the provisions yield a construction that is difficult to improve upon and impossible to escape: - -1. **A port is a translation.** A work that takes a program written in one language and from it produces a program written in another language, implementing the same behavior, is a translation of the original - whatever mechanism performed it, and however the surface presentation differs. -2. **A translation is a derivative work.** Section 101 says so, explicitly. -3. **Preparing a derivative work is the copyright owner's exclusive right.** Section 106(2) says so explicitly. A derivative work prepared without authorization, or outside the scope of any authorization, infringes that right. - -The common objection - "the code is in a different language, so it is completely different" - is not a legal argument; it is the definition of what the statute already classifies. - -Translation *is the paradigm* of derivative authorship, not an exception to it. If translating a work without permission was a defense, the derivative-work right would be meaningless; every infringing adaptation would simply need to be "different enough" to count as a translation of its source. - -Nor does the identity of the translator change the analysis. The statute asks whether the work is "based upon" a preexisting work. It does not ask who or what performed the translation. A machine that ingests a licensed work and reproduces a translated transformation of it has performed mechanical translation; the output is a derivative of the ingested work, and the law governing derivative works applies to it exactly as it applies to a translation made by hand. - -### II. Ideas Are Free, Expressions Protected - -The second foundation is the distinction between what a work *is* - its ideas, its processes, its systems - and the *expression* in which those ideas are embodied. The distinction is codified in section 102(b): - -> In no case does copyright protection for an original work of authorship extend to any idea, procedure, process, system, method of operation, concept, principle, or discovery, regardless of the form in which it is described, explained, illustrated, or embodied in such work. - -The principle is older than the statute, and its application to software is settled. An author may own the particular code in which a method is expressed; the method itself, the process, the algorithm, belongs to no one - because *"the sine qua non of copyright is originality"* (*Feist Publications, Inc. v. Rural Telephone Service Co.*, 499 U.S. 340, 345. 1991). And ideas are not original to anyone in particular, *Baker v. Selden*, 101 U.S. 99 (1879), established the line: Copyright in a book describing a system does not prevent others from practicing the system. - -Applied to a communications protocol, the structure is clean: - ---- - -**An implementation of a public-domain protocol, honestly reasoned and written by humans, is welcome and unencumbered, and owes nothing to any license. An implementation generated from a licensed implementation is a derivative of licensed work, subject to its conditions and to the ordinary copyright of its source.** - ---- - -The public-domain status of the protocol's ideas changes nothing about the copyright in an implementation's expression. A person who copies an implementation - by machine or by hand - cannot defend the copying by pointing to the protocol, because the protocol covers the ideas, not the symbols in which someone expressed them. - -A further misconception can be dismissed here; the recently popularized "clean-room" claim about the absence of copying. A [clean-room](https://reticulum.network/manual/brandolinis.html#the-clean-room-delusion) is a not a magic label achievable by LLM, but a specific, institutionalized procedure for proving to a court that copying did not occur: Physically separated teams, written functional specifications, attestable non-exposure, and no access to the original by the implementers (*Altai*, 982 F.2d at 709–11). - -*"I created a clean-room implementation by feeding the original source code into a machine"* attempts to *claim* the certified, legally established procedure for proving the absence of copying by describing, in the same breath, a process **composed entirely of copying**. The word is deployed because the procedure it names is what the claimant would *need to have happened*. - -### III. Machine Output Has No Author - -The third foundation is the human authorship requirement. It is settled at both levels of the federal courts and in the Copyright Office's administering practice. - -In *Thaler v. Perlmutter*, the district court held that *"copyright law protects only works of human creation,"* and that *"human authorship is a bedrock requirement of copyright"* (687 F. Supp. 3d 140, 146, D.D.C. 2023). On appeal, the United States Court of Appeals for the District of Columbia Circuit affirmed, holding that the Copyright Act *"requires all eligible works to be authored in the first instance by a human being"* (No. 23-5233, D.C. Cir. Mar. 18, 2025). - -The requirement traces to the ordinary meaning of the statutory term. In *Burrow-Giles Lithographic Co. v. Sarony*, the Supreme Court defined an "author" as *"he to whom anything owes its origin; originator; maker; one who completes a work of science or literature"* (111 U.S. 53, 57–58, 1884), and more recently described the author as *"the person who translates an idea into a fixed, tangible expression entitled to copyright protection"* (*Community for Creative Non-Violence v. Reid*, 490 U.S. 730, 737, 1989). - ---- - -**A machine does not owe expression its origin; it reproduces it. No court has recognized copyright in material created by non-humans, and the courts that have addressed the question have rejected it. If you create by machine generation, you do not own the output.** - ---- - -The Copyright Office's registration guidance applies the requirement to generative systems in terms that are directly on point. The Office asks: - -> whether the "work" is basically one of human authorship, with the computer [or other device] merely being an assisting instrument, or whether the traditional elements of authorship in the work (literary, artistic, or musical expression or elements of selection, arrangement, etc.) were actually conceived and executed not by man but by a machine. - -- *Copyright Registration Guidance: Works Containing Material Generated by Artificial Intelligence*, 88 Fed. Reg. 16190, 16192 (Mar. 16, 2023) - -And it states the consequence: *"If a work's traditional elements of authorship were produced by a machine, the work lacks human authorship and the Office will not register it"* (*Id.*). - -On the role of prompts, the Office is equally explicit: when a system receives a prompt and produces a work in response, *"these prompts function more like instructions to a commissioned artist - they identify what the prompter wishes to have depicted, but the machine determines how those instructions are implemented in its output"* (*Id.*). - -The agency applied this standard and excluded machine-originated material from registration in the leading administrative case. In *Zarya of the Dawn* (Cancellation Decision, Feb. 21, 2023, Registration No. VAu001480196), the Office cancelled registration of images generated by the Midjourney service, holding that *"it was Midjourney-not [the author]-that originated the 'traditional elements of authorship' in the images"*, while preserving protection for the human-authored text and the human selection and arrangement of the work. - -The Copyright Office's 2025 report on AI copyrightability reaches the same conclusion: - -> Based on the functioning of current generally available technology, prompts do not alone provide sufficient control. - -- U.S. Copyright Office, *Copyright and Artificial Intelligence, Part 2: Copyrightability*, at iii (Jan. 29, 2025) - -The report's analysis is explicit: *"The Office concludes that, given current generally available technology, prompts alone do not provide sufficient human control to make users of an AI system the authors of the output. Prompts essentially function as instructions that convey unprotectible ideas"* (*Id.* at 18). - -Its guiding distinction is stated plainly: *"The use of AI tools to assist rather than stand in for human creativity does not affect the availability of copyright protection for the output"* while *"Copyright does not extend to purely AI-generated material, or material where there is insufficient human control over the expressive elements"* (*Id.* at iii). - -The boundary is therefore not "AI or no AI". It is *assistance or substitution*: Whether a human exercised sufficient creative control over the expressive elements and can answer for them, or whether the machine originated them and the human merely supplied instructions and a signature. That is a question of fact in each case, determined from the record of how the work was made. - -Two facts follow, and stated together, they form the base legal reality: - -1. **A work whose expressive elements were originated by a machine contains no valid new copyright: It has no human author. To the extent that the same work reproduces a preexisting copyrighted work without explicit license, it is at the same time an unauthorized derivative. It is unowned for anything new it contains, and unlicensed for everything taken.** -2. **Its operator therefore holds no copyright in it and no grant over it - and a person who holds neither copyright nor grant can convey neither.** - -The first fact makes the work **unownable** by its operator. The second makes it infringing against its source. Neither replaces the other: - -- The absence of copyright in machine output does not make the output free for anyone to take; it makes it unowned. -- This is a different thing entirely, especially when what it contains is someone else's expression. - -### IV. License Conditions Bound the Grant - -The fourth foundation governs what a license *is*. A copyright owner may grant permission to use the work on conditions. The conditions define the scope of the permission. Use outside the scope is use that was never authorized. - -In *Jacobsen v. Katzer*, 535 F.3d 1373 (Fed. Cir. 2008), the Federal Circuit held that the conditions of an open-source license are *conditions of the copyright license itself*, not mere contractual promises, and that a licensee operating outside them is an infringer: - -> Copyright holders who engage in open source licensing have the right to control the modification and distribution of copyrighted material. - -> The choice to exact consideration in the form of compliance with the open source requirements of disclosure and explanation of changes, rather than as a dollar-denominated fee, is entitled to no less legal recognition. - -> It is outside the scope of the [license] to modify and distribute the copyrighted materials without copyright notices and a tracking of modifications from the original computer files. - -- *Id.* at 1381–82 - -The doctrinal mechanism is settled: *"A copyright owner who grants a nonexclusive license to use his copyrighted material waives his right to sue the licensee for copyright infringement"* within the scope of the license. If, however *"the licensee acts outside the scope, the licensor can bring an action for copyright infringement"*: An act outside the granted scope **is infringement** (*Sun Microsystems, Inc. v. Microsoft Corp.*, 188 F.3d 1115, 1121, 9th Cir. 1999; *Graham v. James*, 144 F.3d 229, 236, 2d Cir. 1998; *S.O.S., Inc. v. Payday, Inc.*, 886 F.2d 1081, 1087, 9th Cir. 1989). - -Whether a given license term is a condition of the grant or a mere covenant is determined from the license's own language; conditions that limit what may be copied, modified, and distributed - the attribution terms, the notice terms, the modification-tracking terms, the field-of-use terms - are the boundaries of the copyright grant (*MDY Industries, LLC v. Blizzard Entertainment, Inc.*, 629 F.3d 928, 940, 9th Cir. 2010). - -Three consequences follow for the analysis at hand. They are not hypothetical. - -**First, the conditions are measured at the moment of copying** - -A work is licensed under whatever conditions applied when the reproduction, adaptation, and distribution occurred. There is **no** period in which copying a licensed work is "free" because the copy was made by a machine; the machine is the *licensee's tool*, and the licensee is bound by the conditions regardless. A derivative generated without satisfying the conditions - without the attribution, without authorization for the manner of use - was never within the scope of the license, from the first instant of its existence. - -**Second, breach does not restore rights that never attached** - -The district court in *Artifex Software, Inc. v. Hancom, Inc.*, No. 16-cv-06982-JSC (N.D. Cal. Sept. 12, 2017), analyzing the GPL's termination provisions, observed that *"the language of the GPL suggests that [the licensee's] obligations persisted beyond termination of its rights to propagate software using Ghostscript,"* because the source-code obligation recurs each time a covered work is conveyed. The same structure operates a fortiori where a derivative was produced *outside* the license entirely: No grant ever attached, and no subsequent event creates one. - -**Third, the settled conditions are the enforceable core** - -The attribution and notice conditions rest on the settled doctrine above. Novel conditions (restrictions on field of use, restrictions on how the work may be consumed) are enforceable as conditions of the grant when clearly drafted, but their enforcement history is thinner. The argument that a derivative is unlicensed does *not* depend on the novel conditions being vindicated; it needs **only** the settled ones, and the ordinary law of derivative works, to stand. - -### V. The Void Grant - -The preceding sections assemble into a single structure. Let us apply it to an example situation: - -- A project presented as an independent implementation of a protocol; "ground-up", "from scratch" or "clean-room" work. -- The actual history shows continuous, machine-mediated ingestion of a licensed reference implementation. -- The output is generated at a scale no human could produce or review, with the provenance of the process obscured. - -**Step One: The derivative** - -The project's output is a translation of the licensed implementation: A derivative work, produced by a copy process. 17 U.S.C. §§ 101, 106(2). Preparing it without authorization infringed from the first moment of its existence. *Id.* § 501(a). - -**Step Two: The license** - -The derivative was produced outside the conditions of the license; without the notices, without the attribution. The license never attached (*Jacobsen*, 535 F.3d at 1381–82). - -**Step Three: Authorship** - -The expression was originated by a machine. No human can account for its creative decisions, and no human authored it. It contains no valid new copyright (*Thaler*, 687 F. Supp. 3d at 146; No. 23-5233, D.C. Cir. 2025; 88 Fed. Reg. at 16192). - -**Consequence: Void Grant** - -The statute supplies the consequence. Section 103(a) provides: - -> The subject matter of copyright as specified by section 102 includes compilations and derivative works, but protection for a work employing preexisting material in which copyright subsists does not extend to any part of the work in which such material has been used unlawfully. - -And section 103(b) provides that copyright in a derivative work *"extends only to the material contributed by the author of such work."* The legislative history states the point without ambiguity: *"An unauthorized translation of a novel could not be copyrighted at all"* (H.R. Rep. No. 94-1476, at 57, 1976). - -In our example, the operator of the derivative's copy process decides to assert copyright over the output, and licenses it to the world under terms of the operator's choosing, for example the Apache License. - -But the operator holds no copyright in machine-originated content (section III) and no license over the source from which it was derived (sections I and IV). - -For the derived material, the operator's copyright claim **is an assertion of a right that never existed**. The material was used unlawfully, and section 103(a) withholds protection from *every* part of the work in which it appears. For the machine-originated remainder, the operator holds no copyright either, for lack of any human author. - -The operator's license to the world is a promise the operator had no power to make. Every person who receives the work believing they received a valid grant has received **a void grant**, and stands, as a matter of settled law, in the position of a downstream user of an unauthorized derivative, whatever they were told at the time. - -This is a cascading consequence, and it is why the pattern is a hazard. No combination of self-granted licenses - "MIT," "Apache," "public domain," anything at all - can transfer rights the operator never held. Every downstream project, product, or deployment built on the derivative is built on unlicensed reproduction of a third party's work, whether or not it knew, whether or not it was told, and whether or not the marketing was plausible. - -The longer the derivative circulates unexamined, the more it becomes embedded, forked, vendored, depended upon, and the more expensive its correction becomes for everyone who trusted it. A field of superficially real projects, repositories, and licenses that **in reality confer nothing on anyone who relies on them is a minefield**, in the most precise sense the law allows: The rights they purport to grant *were never possessed*. - -The law defines what may be asserted, not what will be. The copyright owner may choose whether and how to assert these rights, and at what point in time. The exposure exists regardless, and for *every* downstream that trusted the void grant. This is the scope of the hazard that the conduct exemplified here produces. - -### VI. Fair Use Does Not Rescue This Pattern - -Every defendant raises fair use. It is an essential and important limitation in the service of free speech, accountability, criticism, education and other important domains. Therefore, it must be considered, and in the case exemplified here, it fails. - -Fair use is a limitation on the exclusive rights, evaluated case by case under four factors: The purpose and character of the use; the nature of the copyrighted work; the amount and substantiality of the portion used; and the effect of the use on the potential market for or value of the work (17 U.S.C. § 107). - -On the first factor, the governing standard is *Andy Warhol Foundation for the Visual Arts, Inc. v. Goldsmith*, 598 U.S. 508 (2023), in which the Supreme Court held that: - -> In sum, the first fair use factor considers whether the use of a copyrighted work has a further purpose or different character, which is a matter of degree, and the degree of difference must be balanced against the commercial nature of the use - -The question is whether the use serves a further purpose, not whether the surface changed. A derivative that exists to serve as the same thing as the original, marketed to the people who would otherwise use the original, has not acquired a further purpose by being translated; the surface changed, the function did not, and the use is commercial. - -The remaining factors resolve the same way. Source code is expressive creative work, not bare fact. The pattern under examination copies the whole; a complete implementation, ingested and translated in its entirety. And the market effect is the decisive factor, because it is engineered: A derivative marketed as a drop-in replacement for the work it was copied from is not a complement to the original's market, it is a substitute for it. The Supreme Court has long held that use of a work to satisfy the market demand for the original is the paradigm of an *unfair* use (*Harper & Row, Publishers, Inc. v. Nation Enterprises*, 471 U.S. 539, 566–67, 1985). - -The one case that is always raised in response, *Google LLC v. Oracle America, Inc.*, 593 U.S. 1 (2021), holds less than it is believed to. The Court there assumed *"for argument's sake, that the material was copyrightable"* and held *"that the copying here at issue nonetheless constituted a fair use"* (*Id.* at 11). - -The material in question was a thin slice of *declaring code*, which the Court found sits, *"if copyrightable at all, further than are most computer programs (such as the implementing code) from the core of copyright"* (*id.*), in a use that built a new platform for a new environment, with the copier **having written the vast majority of its own code**. By comparison: A wholesale translation of an entire implementation, marketed as a substitute for it, is **not** that case; it is the other end of every factor. - -The valuable zones of fair use remain, and they are important. **Commentary and criticism**, quoting from a work to review, discuss or criticize it. **Teaching and scholarship**, explaining concepts and quoting excerpts, is its traditional beneficiary. - -### Conclusion - -The law is neither obscure nor new. The conclusion it yields can now be stated: - -- A machine translation of a protected implementation **is a derivative work**, and an unauthorized derivative **is an infringement**, whatever language it speaks and whatever machinery produced it. -- A work whose expression a machine originated has no human author, no valid new copyright, and without valid copyright **no license can be granted on it**. -- § 103 withholds protection from every part of a derivative in which protected material was used unlawfully. A license is a grant with conditions, and a derivative made outside the conditions **never received a grant**. -- A person who holds no copyright and no grant **can convey neither**, and *every* downstream consumer who received from them received a **void grant**. - -This is a *catastrophic* failure state for all who want to create things good and useful: The projects that inherit only void grants and liability believing they have inherited foundations, the users who depend on code that no one on earth can answer for, the honest builders whose work is buried under a field of plausible-looking impostors. - -### Sources and Authorities - -Statutory references are to Title 17, United States Code. Case citations are to the official or generally cited reporters. Online links are for reference only. Section numbers refer to the sections of this document in which each authority is principally relied upon. - -**Statutes** - -- [17 U.S.C. § 101 (definitions: "derivative work," "including," "publication") - I, II](https://www.law.cornell.edu/uscode/text/17/101) -- [17 U.S.C. § 102(b) (idea/expression) - II](https://www.law.cornell.edu/uscode/text/17/102) -- [17 U.S.C. § 103(a)–(b) (derivative works employing unlawfully used preexisting material) - V](https://www.law.cornell.edu/uscode/text/17/103) -- [17 U.S.C. § 106(1)–(3) (exclusive rights: reproduction, derivative works, distribution) - I](https://www.law.cornell.edu/uscode/text/17/106) -- [17 U.S.C. § 107 (fair use) - VI](https://www.law.cornell.edu/uscode/text/17/107) -- [17 U.S.C. § 501(a) (infringement) - I, V](https://www.law.cornell.edu/uscode/text/17/501) - -**Judicial decisions** - -- [*Jacobsen v. Katzer*, 535 F.3d 1373 (Fed. Cir. 2008) - IV, V](https://www.casemine.com/judgement/us/5914b290add7b04934760a54) -- [*Sun Microsystems, Inc. v. Microsoft Corp.*, 188 F.3d 1115 (9th Cir. 1999) - IV](https://law.justia.com/cases/federal/appellate-courts/F3/188/1115/629501/) -- [*Graham v. James*, 144 F.3d 229 (2d Cir. 1998) - IV](https://caselaw.findlaw.com/court/us-2nd-circuit/1011522.html) -- [*S.O.S., Inc. v. Payday, Inc.*, 886 F.2d 1081 (9th Cir. 1989) - IV](https://law.justia.com/cases/federal/appellate-courts/F2/886/1081/19091/) -- [*MDY Industries, LLC v. Blizzard Entertainment, Inc.*, 629 F.3d 928 (9th Cir. 2010) - IV](https://law.justia.com/cases/federal/appellate-courts/ca9/09-15932/09-15932-2011-02-25.html) -- [*Artifex Software, Inc. v. Hancom, Inc.*, No. 16-cv-06982-JSC (N.D. Cal. Sept. 12, 2017) (settled; dismissed with prejudice Jan. 2018) - IV](https://storage.courtlistener.com/recap/gov.uscourts.cand.305835/gov.uscourts.cand.305835.54.0_1.pdf) -- [*Thaler v. Perlmutter*, 687 F. Supp. 3d 140 (D.D.C. 2023), aff'd, No. 23-5233 (D.C. Cir. Mar. 18, 2025) - III, V](https://www.bitlaw.com/source/cases/copyright/Thaler-Perlmutter-Dct.html) -- [*Burrow-Giles Lithographic Co. v. Sarony*, 111 U.S. 53 (1884) - III](https://supreme.justia.com/cases/federal/us/111/53/) -- [*Community for Creative Non-Violence v. Reid*, 490 U.S. 730 (1989) - III](https://supreme.justia.com/cases/federal/us/490/730/) -- [*Feist Publications, Inc. v. Rural Telephone Service Co.*, 499 U.S. 340 (1991) - II](https://supreme.justia.com/cases/federal/us/499/340/) -- [*Baker v. Selden*, 101 U.S. 99 (1879) - II](https://supreme.justia.com/cases/federal/us/101/99/) -- [*Computer Associates International, Inc. v. Altai, Inc.*, 982 F.2d 693 (2d Cir. 1992) - II](https://law.justia.com/cases/federal/appellate-courts/F2/982/693/137252/) -- [*Andy Warhol Foundation for the Visual Arts, Inc. v. Goldsmith*, 598 U.S. 508 (2023) - VI](https://www.supremecourt.gov/opinions/22pdf/21-869_87ad.pdf) -- [*Google LLC v. Oracle America, Inc.*, 593 U.S. 1 (2021) - VI](https://supreme.justia.com/cases/federal/us/593/18-956/) -- [*Harper & Row, Publishers, Inc. v. Nation Enterprises*, 471 U.S. 539 (1985) - VI](https://supreme.justia.com/cases/federal/us/471/539/) - -**Administrative and policy authorities** - -- [*Copyright Registration Guidance: Works Containing Material Generated by Artificial Intelligence*, 88 Fed. Reg. 16190 (Mar. 16, 2023) - III](https://www.federalregister.gov/documents/2023/03/16/2023-05321/copyright-registration-guidance-works-containing-material-generated-by-artificial-intelligence) -- [*Zarya of the Dawn*, U.S. Copyright Office (Cancellation Decision, Feb. 21, 2023), Registration No. VAu001480196 - III](https://www.copyright.gov/docs/zarya-of-the-dawn.pdf) -- [U.S. Copyright Office, *Copyright and Artificial Intelligence, Part 2: Copyrightability* (Jan. 29, 2025) - III](https://www.copyright.gov/ai/Copyright-and-Artificial-Intelligence-Part-2-Copyrightability-Report.pdf) -- [H.R. Rep. No. 94-1476 (1976) - V](https://law.resource.org/pub/us/works/aba/ibr/H.Rep.94-1476.pdf) diff --git a/docs/manual/.buildinfo b/docs/manual/.buildinfo index 31cbfc71..0a93c42c 100644 --- a/docs/manual/.buildinfo +++ b/docs/manual/.buildinfo @@ -1,4 +1,4 @@ # Sphinx build info version 1 # This file records the configuration used when building these files. When it is not found, a full rebuild will be done. -config: 6795d8fd07f6250f1b0bffe6d5069dbb +config: c647a5f163ca6db1b075e5978b13a8fb tags: 645f666f9bcd5a90fca523b33c5a78b7 diff --git a/docs/manual/_images/columba.webp b/docs/manual/_images/columba.webp deleted file mode 100644 index 07ea65ed..00000000 Binary files a/docs/manual/_images/columba.webp and /dev/null differ diff --git a/docs/manual/_images/meshchatx.webp b/docs/manual/_images/meshchatx.webp index 94edb72a..24fd7ba0 100644 Binary files a/docs/manual/_images/meshchatx.webp and b/docs/manual/_images/meshchatx.webp differ diff --git a/docs/manual/_images/modem73.webp b/docs/manual/_images/modem73.webp deleted file mode 100644 index 5adadc76..00000000 Binary files a/docs/manual/_images/modem73.webp and /dev/null differ diff --git a/docs/manual/_images/nomadnet_3.png b/docs/manual/_images/nomadnet_3.png new file mode 100644 index 00000000..4a8c0def Binary files /dev/null and b/docs/manual/_images/nomadnet_3.png differ diff --git a/docs/manual/_images/nomadnet_6.webp b/docs/manual/_images/nomadnet_6.webp deleted file mode 100644 index 3f973658..00000000 Binary files a/docs/manual/_images/nomadnet_6.webp and /dev/null differ diff --git a/docs/manual/_images/partyline.webp b/docs/manual/_images/partyline.webp deleted file mode 100644 index ac7d96c1..00000000 Binary files a/docs/manual/_images/partyline.webp and /dev/null differ diff --git a/docs/manual/_images/rbrowser.webp b/docs/manual/_images/rbrowser.webp new file mode 100644 index 00000000..e717d2b4 Binary files /dev/null and b/docs/manual/_images/rbrowser.webp differ diff --git a/docs/manual/_images/ren_browser.webp b/docs/manual/_images/ren_browser.webp deleted file mode 100644 index 6a6223ec..00000000 Binary files a/docs/manual/_images/ren_browser.webp and /dev/null differ diff --git a/docs/manual/_images/rentui.webp b/docs/manual/_images/rentui.webp deleted file mode 100644 index 0c40fad6..00000000 Binary files a/docs/manual/_images/rentui.webp and /dev/null differ diff --git a/docs/manual/_images/reticulated.webp b/docs/manual/_images/reticulated.webp deleted file mode 100644 index ebd2a67e..00000000 Binary files a/docs/manual/_images/reticulated.webp and /dev/null differ diff --git a/docs/manual/_images/retipedia.webp b/docs/manual/_images/retipedia.webp deleted file mode 100644 index 8ffe1a0f..00000000 Binary files a/docs/manual/_images/retipedia.webp and /dev/null differ diff --git a/docs/manual/_images/rngit.webp b/docs/manual/_images/rngit.webp deleted file mode 100644 index 5e1f54e4..00000000 Binary files a/docs/manual/_images/rngit.webp and /dev/null differ diff --git a/docs/manual/_images/rrc.webp b/docs/manual/_images/rrc.webp deleted file mode 100644 index 56889713..00000000 Binary files a/docs/manual/_images/rrc.webp and /dev/null differ diff --git a/docs/manual/_sources/brandolinis.rst.txt b/docs/manual/_sources/brandolinis.rst.txt deleted file mode 100644 index 334dc662..00000000 --- a/docs/manual/_sources/brandolinis.rst.txt +++ /dev/null @@ -1,1625 +0,0 @@ -.. _brandolinis-main: - -Brandolini's Reference -====================== - - | *A little learning is a dang’rous thing;* - | *Drink deep, or taste not the Pierian spring.* - | *There shallow draughts intoxicate the brain,* - | *And drinking largely sobers us again.* - | - | - Alexander Pope, 1711 - -This chapter serves as a helpful reference for developers, users and community members living in an Age of Bullshit Manufacture equivalent to the Cambrian Explosion. - -As we are surely only at the on-ramp of this trajectory, the chapter will continue to evolve, expand and be updated based on community feedback as events occur. - -.. _brandolinis-what-the-license-is: - -What The Reticulum License Is ------------------------------ - -*To understand the legal reality relating to this section, see* :ref:`Void Grants`. - -The :ref:`Reticulum License` is the license under which RNS, the Reticulum reference implementation, has been published since **April 15, 2025**\ , in versioning effective from **0.9.4** and every release since. In practical terms, it covers all of "modern Reticulum": The current wire format, the cryptographic machinery as it exists today (including the AES-256-based link encryption, ratchets, et cetera), and all protocol additions that distinguish the modern implementation from the earliest pre-1.0.0 beta formats. If an implementation speaks today's Reticulum protocol, it is, in all relevant respects, built on Reticulum-licensed work. - -The license is a permissive license. It grants the full range of rights to use, copy, modify, merge, publish, distribute, sublicense, and sell the software, free of charge; subject to three conditions, which are reproduced here verbatim: - -.. - - * - The Software shall not be used in any kind of system which includes amongst its - functions the ability to purposefully do harm to human beings. - - * - The Software shall not be used, directly or indirectly, in the creation of an artificial - intelligence, machine learning or language model training dataset, including but not - limited to any use that contributes to the training or development of such a model or - algorithm. - - * - The above copyright notice and this permission notice shall be included in all copies or - substantial portions of the Software. - -.. _brandolinis-why-the-license-exists: - -Why This License Exists -^^^^^^^^^^^^^^^^^^^^^^^ - -Reticulum was not moved to a custom license casually or quickly. It was licensed under the MIT license for the greater part of its existence, and that served well for a long time. The change came when it became clear that no existing license expressed what the project needed, and that the two most commonly proposed alternatives would either say the wrong thing or say nothing useful at all. Three factors had primary influence on the situation: - -**The harm problem** - -Reticulum is a tool that was built, deliberately and at great cost, to empower people; to make communication something you own rather than something you are temporarily granted. It has also been, at various times, exactly what certain kinds of organisations would like to use to control people. This is the duality of any powerful tool. A permissive license could not, and cannot, say anything about that; MIT is silent on the question of whether the software may be used to build systems designed to harm human beings. The Reticulum License is not silent. It does not pretend that a license can stop an individual madman; it does assert, however, plainly and in enforceable terms, that corporations and organisations integrated into the legal system cannot consume this software for harm and then claim they never knew. The line is drawn by the creators of the tool, not by an external authority, and it is drawn deliberately. This is covered in more depth in the discussion of the ethics of the tool in the *Zen of Reticulum*. - -**The appropriation problem** - -The second factor was the machine-learning appropriation of the open-source commons. By 2025 that was no longer hypothetical: The commons was already being systematically ingested by corporate training pipelines, and the code, words, and creativity of the people who built it were being converted into synthetic systems designed to replace them. The license responds to this with an explicit condition: The software shall not be used in the creation of an AI, machine-learning, or language-model training dataset, nor in any use that contributes to the training or development of such a model or algorithm. - -It is important to understand what this condition does and does not do, which matters for what follows in this chapter. **The AI-training condition is not the legal basis for protecting the code from machine copying**. That protection *already exists*\ , in the oldest and most well-tested form of copyright law, and it applies regardless of any license (see :ref:`Copyright & The Two Legal Layers`). - -The AI-training condition addresses something *additional*\ : the appropriation of the code *into the models themselves*\ ; the ingestion of human-made work as raw material for a synthetic replacement, and the use of that ingestion to fabricate "prior work" minefields, patent-troll material, and a wall of slop meant to bury and devalue the actual ecosystem. That danger was foreseeable; the licensing decision was made with full awareness of it. The events of 2026 have since demonstrated, in public and in detail, that the concern was not theoretical. - -**The sustainability problem** - -Reticulum has been developed and maintained for over a decade by a single person, supported by a small group of contributors and network-building users, without corporate backing, without VC funding, through several serious attempts at commercialization and takeover from both the corporate and the ideological side. The license is part of what makes that sustainable, and possible at all. - -It ensures that the specific, painstaking labor of the reference implementation cannot be hijacked to undermine the intent of the project, while leaving the protocol itself, the mathematical rules of how Reticulum works, dedicated to the public domain, where it belongs to humanity and can never be owned. Anyone can implement the protocol, provided they themselves invest the *actual* work and effort. What the license protects is the work, and the intent embodied in it. - -.. _brandolinis-on-freedom: - -On Freedom -^^^^^^^^^^ - -The most persistent mischaracterisation of the Reticulum License is that it is "more restrictive" than the licenses it replaced or than the GPL family. This is backwards, and I'll state the comparison plainly, because the confusion is the foundation of a great deal of deliberately manufactured controversy examined later in this chapter. - -The GPL and AGPL are constructed around a single, self-referential axiom: that "free" is *defined by the terms of the license itself*\ , and that any use falling outside those terms is not free. In practice, this means the GPL restricts the freedom of **everyone** - you may not write, distribute, link, or (in some cases) even communicate with GPL-covered software without the entire arrangement being pulled under the same terms, which the licensor then controls. The restriction applies to 100% of users, including the ones building purely constructive things. - -The Reticulum License restricts the freedom of almost nobody. Its restrictions apply only to: - -* Those who wish to use the software in systems that purposefully harm human beings, and -* Those who wish to ingest the software into AI training pipelines. - -That is a restriction on a vanishingly small fraction of would-be users - the 0.0000001% - and it is a restriction they can characterise however they like, forever. The bickering is itself a signal that the licensing decision hit exactly the right target. - -Everyone else retains the full breadth of use, modification, distribution, and sale, with none of the viral encumbrance of copyleft. - -Both licenses contain moral axioms. The difference is that the Reticulum License states its axioms out loud: - -* *Intentionally restricting the way that millions of people use and build upon a foundational - communications technology* - **The mechanism of copyleft** -* *Intentionally restricting a small number of organisations from using the technology to - violently harm human beings* - **The mechanism of the Reticulum License** - -Which of these is more free? The answer is not a matter of committee approval. It is a matter of what the word "free" means to the people *whose freedom is at stake*. The question of whether "open source" requires the blessing of a particular licensing orthodoxy is examined in :ref:`Open Source Means Open Source`. - -.. _brandolinis-prediction: - -The Prediction, And What Happened -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -When the license change was made and publicly discussed in 2025, the following was said, in public, about the machine-learning threat: - -.. - - A generative system could be trained on the Reticulum codebase, and for extremely low cost - be set to work spewing out millions of source repositories for all kinds of ridiculous - "Reticulum-based programs". This is already happening. You can find several examples of this - on GitHub already. … the point of this kind of trolling is to establish as wide a base for - "prior work" as possible. By doing that, a patent troll or IP abuser can create an immense - minefield for real developers. - - -This was written when the phenomenon was just beginning. It was not a guess; it was a description of a mechanism already in motion, in the specific context of Reticulum, by people who had already begun to appear around the project. - -Less than a year and a half later, the prediction has now been demonstrated, in public, exhaustively and to the letter. There are now roughly a dozen machine-generated "Reticulum implementations" of the same shape: fluent, marketing-heavy, some without attribution, and - in several cases - actively harmful to the network. The :ref:`Prns case` is an example documented in this chapter. The pattern that produced it (and the people, mechanisms, and the recycling of falsehoods behind the *wider* phenomenon) is examined in :ref:`A Movement Of A Dozen`. - -The license was written, in part, so that when this happened, the community would not be defenceless. - -.. _brandolinis-means-for-other-implementations: - -What This Means For Other Implementations -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -Two simple things must be kept separate: - -#. - **The protocol is public domain.** The mathematical rules of Reticulum - addresses, - signatures, routing, the wire format as an idea - belong to humanity. A *genuine* clean-room - implementation of the protocol, written by human beings who reasoned it out themselves, is - free and welcome, and owes nothing to the Reticulum License. Nothing in this chapter is an - argument against implementing the protocol. On the contrary: More good implementations, - honestly made, are good for the network. - -#. - **The implementation is licensed.** Copying the reference implementation - by machine or - by silk-screen press - and modifying and redistributing the result, is - exercising rights granted by the license, and is therefore subject to its conditions: The attribution - notice, the harm condition, the AI-training condition. A copy that does not follow those - conditions is **not** licensed, and it is not "open source in spirit"; it is an unauthorized - derivative work, and therefore a copyright violation. - -The distinction is the same one the license itself makes, and it must be held firmly: An implementation that *speaks* Reticulum is exercising the public domain protocol, **if** it was truly created independently. An implementation that was *generated from* RNS, reproduced by a copy process, is a derivative of licensed work. - -.. _brandolinis-copyright-and-layers: - -Copyright & The Two Legal Layers -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -The exact legal structure is frequently muddied in public discussion; and in several cases deliberately. - -**Layer A - Copyright (license-independent)** - -Copyright does not depend on any license. A primarily machine-generated copy of a copyrighted work - a copy not accompanied by demonstrable, substantial, new human creative input - is a derivative work over which the copier holds no copyright whatsoever, and the reproduction of which, without the original author's permission, is an infringement of the original author's copyright. This is standard, well-tested law, and it applies with equal force under the MIT license, the GPL, or any other license, because it is not about the license at all; it is about who created what. A process that copies the reference implementation into a machine, produces a transformed derivative, and then claims "Copyright, [name of the process operator]" - with no human able to account for the creative decisions in the result - **is not** asserting a valid copyright over the result. They are openly asserting the absence of one, and reproducing someone else's work without authorisation. This is probably the cleanest cut copyright violation one could imagine. - -**Layer B - License Conditions (Reticulum License specific)** - -Where a copy *is* a licensed derivative, the conditions of the Reticulum License apply: The copyright notice and permission notice must be included in all copies and substantial portions; the harm condition must be honoured; the AI-training condition must be honoured. A derivative that follows none of these is unlicensed *a second way over*. - -The two layers are often intentionally confused in public discussion - the AI-training condition is waved around as if the entire question of machine copying rested on it, when in fact machine copying of copyrighted work is a copyright violation that would exist even under the most permissive license ever written. The purpose of keeping the layers separate is not rhetorical flourish; it is that Layer A is old, settled law, and does not rely on any novel legal theory, while Layer B is specific to this license. Both matter. Neither is a substitute for the other. - -Layer B is the required mechanism for closing the loophole where the work is *first* ingested during model training into the weights of a model itself, which would make any resulting violations almost impossible to detect and enforce. - -.. _brandolinis-cleanroom-delusion: - -The "Clean-Room" Delusion -^^^^^^^^^^^^^^^^^^^^^^^^^ - -I regularly receive mail or LXMF messages from people who proudly and happily proclaim that they have created a "clean-room" implementation of one of the software systems I maintain; RNS, Sideband, LXMF or others. The declaration is delivered with the flat certainty of someone who believes they have found the legal lock-pick that settles everything at once: Their production is independent, uncontaminated, and therefore free of any obligation to the work they copied, its license, or its author. The proclamation usually concludes with a request for blessing, or at least acknowledgment. The proclamation is, usually, also generated by an LLM. - -This is a delusion, and I'll cut through it surgically. The word they here invoke as magic is attempting to do a great deal of work it was never able to bear. - -**What a clean room actually was** - -The legal "clean room" is not folklore, incantation, witchcraft or a claim a person gets to make about their own output. It is a very specific, institutionalized procedure that grew out of the hardware and software litigations of the 1980s, and it existed for exactly one purpose: **Convincingly proving the absence of copying in a court of law**. - -The canonical case was Phoenix Technologies and its 1984 reimplementation of the IBM PC BIOS. IBM's BIOS was copyrighted, which meant that the entire PC-compatible industry depended on being able to show that a compatible BIOS had been written independently, and not from IBM's code. Phoenix's answer was a physical and procedural firewall: - -* One team, the "dirty room", read the original code and produced written *functional specifications*\ : descriptions of what the BIOS did, not how IBM's code did it. -* A second team, the "clean room", consisted of engineers who had *never seen the original code at all*\ , and they wrote the new BIOS from those specifications alone. - -This obsessively documented, legally attested separation was not a preference or a willy-nilly show for a kindergarten; it was the entire legal point, and it had to be *solid*. If even one clean-room engineer had *glanced* at IBM's code, the clone would have been contaminated, and the defense would shatter. - -The other landmark case was *Computer Associates v. Altai* (1992), in which Altai had copied CA's scheduler code into its own product, and (upon being caught) hired outside counsel to run a genuine clean-room procedure: A programmer with no exposure to the original was brought in to rewrite the infringing modules from functional specifications prepared by the team that had seen the code. The court credited the good-faith effort precisely because it was done, as the carefully documented record showed, to the letter of the procedure. - -Bear in mind what this procedure entailed in practice, because this is the part the modern claimants never seem to have even *heard* of: Physical separation of teams, legal counsel managing the process, signed and notarised declarations of non-exposure, controlled specification documents that described *behaviour* and never *code*, months of work, and testing against the specification - not against the original, which the implementers were forbidden to consult. - -The people on the clean-room side of the wall did not just *claim* they had not read the code. Their non-exposure was institutionally guaranteed, obsessively documented, and legally attestable through every fart and sneeze of the process, because the entire point was that a court - hostile, adversarial, and entitled to discovery - would believe it. - -*That* is the process. "Clean-room implementation" is the name of a *certified procedure for proving independent authorship*. It is not a mood, a marketing label, or a property a person gets to declare about their own work. - -**The moronic inversion** - -Now consider what is actually being described when someone says: *"I created a clean-room implementation of Reticulum by feeding the source code into a machine."* - -That sentence is the opposite of a clean room. Feeding a copyrighted work into a machine so that it reproduces and transforms the work is **the definition of copying**\ , and a clean room is the one procedure whose entire purpose is the demonstrated *absence* of copying. This process cannot demonstrate the absence of copying, because the process is *composed of* copying. The cleanest possible room has been replaced by the dirtiest possible room, and the dirt has been installed as the base feature. What these claimants have actually performed is a photocopy with extra steps, and the extra steps, far from cleaning anything, are simply steps that forge a certificate they believe the output has earned. - -**Why the word is deployed** - -The word "clean-room" is deployed because it sounds like what the speaker wishes were true. It carries the accumulated legal prestige of the 1980s and 1990s - the BIOS clones, the Altai credit - and it sounds like a certificate already issued: *Independent, original, unencumbered*\ , the work of a person who owes nothing. The claimants want that halo without the procedure: No law firm, no physical separation, no written specifications, no signed declarations, no months of process - just a laptop, a loop, and the word "clean-room" typed into a README. The word must do the work of the process it replaces, and the delusional replacement is the entire point. - -**The irony runs deep** - -The Reticulum protocol is public domain. Any human being can implement it - from the mathematics, from the documentation, from their own reasoning - and owe nothing whatsoever to the license, to the reference implementation, or to me. - -An honestly written implementation needs no incantations, no legal theater, and no special vocabulary; it simply *is* what it claims. It's plain for everyone to see. **It's also plain for everyone to see when you're faking it**. The people who reach for the word "clean-room" are, without exception, the people who need it to create a fantasy - and the people who need that are precisely the people who cannot have it. If what you wrote were genuinely independent work on the public-domain protocol, you would not need to call it anything. The word is not a seal of independence. In this context it is a confession of copying, filed by the copier, in the confident belief that it says the opposite. - -.. _brandolinis-opensource: - -Open Source Means Open Source ------------------------------ - -An objection regarding the "open source status" of RNS appears occasionally in variations, but always reduces to the same syllogism: - - -#. "Open source" means *licensed under one of the licenses approved by the Open Source - Initiative (or, in other variants, compatible with GPL orthodoxy)*. -#. The Reticulum License is not on that list. -#. Therefore Reticulum is not open source, and anything built on it is illegitimate. - -The entire argument rests on the first premise, and the first premise is false. - -Open source is not a certification conferred by a committee. It is a description of a fact: The source code is available, and the rights to use, copy, modify, merge, publish, distribute, sublicense, and sell it are granted to everyone, free of charge. - -The Reticulum License does all of those things. It is, in every substantive respect that concerns the person who wants to use, study, modify, or build upon the software, **an open license**. What it adds - and what disqualifies it in the eyes of the orthodoxy - is two conditions on *who may do what with the original work*\ , not on what the *user* is allowed to do with it. - -The definition being wielded against Reticulum is not even a young one. It is, in essence, the Debian Free Software Guidelines written in 1997, adopted by the OSI in 1998, and treated ever since by certain people as if it had descended from a mountain on tablets. It is an approach that is close to three decades old. Being old is not itself a flaw - but being old is also not a proof of correctness, and the suggestion that the meaning of a word like "open" was settled for all time by a committee in the 1990s, and may never be revisited, is not a position rooted in reason. It is rooted in institutional inertia dressed as principle, maintained by those whose ideologies it serves. - -.. _brandolinis-what-the-argument-is-doing: - -What The Argument Is Actually Doing -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -I would like to go into some detail about the rhetorical mechanism, because it is roughly the same mechanism that powers the rest of the campaign described later in this chapter. - -The orthodoxy's argument is self-referential: *"open source means what we say it means, because we are the ones who define it."* When the Reticulum License is measured against that definition and found wanting, the conclusion is presented as a property of Reticulum - when in fact it is *a property of the definition*. The definition is treated as neutral and authoritative - as some base fact of raw cosmology - and the license is treated as deviant. But the definition is no more neutral than the license is. It encodes a moral position, and that moral position is exactly the one that this project declines to take. - -Consider what the orthodoxy's definition requires, in the case at hand. The OSI-based definition contains, in its ancestry, the Debian Free Software Guideline of "No discrimination against fields of endeavor": The software must not restrict who may use it or for what purpose. Taken to its logical end, this means that open source, properly "certified", must be equally available to those who build hospitals and those who build weapons, those who connect people and those who control them, those who create and those who ingest and replace. - -The orthodoxy presents this as neutrality. It is not neutrality; it is a moral position - one that says, in effect, that *harming human beings is a field of endeavor like any other, and software must not discriminate against it*. - -The Reticulum License takes a different position, and it has the honesty to state it in the license text: this software is for life, not for death; it is for people, not for the systems that would replace them. That is not a restriction on openness, nor on freedom. It is a restriction on *who may consume the work*\ , and it is a restriction the orthodoxy's definition cannot express - which is why the orthodoxy must always attack the license as "not open source" rather than engage with what it actually does. - -.. _brandolinis-who-is-restricted: - -Who Is Restricted By Which License? -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -The arithmetic is simple, so let's do it out loud, because the orthodoxy's framing inverts it every time. - -The GPL family imposes its conditions on **everyone**\ : You may not distribute, link, or - in the AGPL case - even *communicate with* GPL-covered software without your own work being pulled under the same terms. "Free" in this system is defined (self-referentially) *by the license's own terms*\ ; everything outside those terms is, by definition, unfree. The restriction applies to 100% of users. It applies to the hospital, the mesh community, the school, and the hobbyist with the same force it applies to anyone else. That is not freedom for everyone; it is a *specific moral architecture applied to everyone*\ , presented *as if it were the absence of one*. - -The Reticulum License imposes its conditions on a fraction of would-be users so small as to be practically unmeasurable: - -* Those whose intended use is to build systems that purposefully harm human beings, and -* Those whose intended use is to ingest the work into AI training pipelines. - -That is the entire list. Everyone else - the overwhelming majority, the community, the developers, the users, the downstream projects - receives the full, unrestricted rights to use, copy, modify, merge, publish, distribute, sublicense, and sell the software, with none of the viral encumbrance of copyleft. - -So when the claim is made that the Reticulum License "is more restrictive" than the GPL, the claim is not merely wrong; it is the exact inverse of the truth. The GPL restricts the freedom of everyone, in the name of a specific ideology. - -The Reticulum License restricts the freedom of the harm-doer and the appropriator, and leaves everyone else free. The two approaches do not differ in whether they contain moral axioms - **all licenses do**. They differ in whether the axioms are stated openly, and in *whose* freedom they restrict. - -.. _brandolinis-consequences-not-open: - -The Consequences Of The "Not Open Source" Claim -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -This would be a footnote debate if the mischaracterisation had no practical consequences. It has very large ones, and therefore this section exists. - -The claim that "Reticulum is not open source" is the foundation of the takeover narrative it so often accompanies. The sequence is always the same: - -* First, declare the reference implementation illegitimate ("not really open source", "owned by one man", "not a real community project") -* Second, conclude that it is therefore acceptable - even necessary - to replace it. -* Third, present the replacement, which is (conveniently) often the speaker's own machine-generated clone, as the legitimate heir. - -This is not speculation about motives; it is the documented structure of the campaign examined in :ref:`A Movement Of A Dozen`. - -The "not open source" claim is the legal-ideological battering ram of that campaign. It is recycled, in article after article, in forum after forum, because it works on people who assume that a committee's definition is the same thing as the truth. - -It is also worth stating the other obvious fact: None of these critics have ever shown that the Reticulum License restricts *them*. They do not build weapons. They are not training models on the codebase. They are free, in every practical sense, to use Reticulum exactly as they would under MIT or GPL. Their objection is not to a restriction on themselves; it is to the *mere existence* of a license that states a moral position they disagree with, or which they can use as leverage for a different goal entirely, and to the institutional fact that it does so outside *their* system of approval and control. The complaint is not that the license makes them unfree. The complaint is that the license is *free of them*. - -.. _brandolinis-distribution-argument: - -The Distribution Argument -^^^^^^^^^^^^^^^^^^^^^^^^^ - -A recurring companion claim is that RNS is not properly "distributed", usually deployed as "it's not packaged as a .deb" or "it's not on package manager X", with the implication that it is somehow unavailable or inaccessible, or hard to install on a given system. - -This is simply false, and it has been false for years. The reference implementation is available on practically every platform and architecture with a single command (\ ``pip install rns``\ ). It is packaged in the Arch User Repository, in NixOS, and in a range of other distribution channels, community-maintained and official. It can be installed, updated, and kept current *over Reticulum itself* - the network transports its own software updates. It is used on more than a hundred thousand devices worldwide, is embedded in over a hundred other packages and applications, and carries terabytes of traffic every day. - -The claim that Reticulum needs a ``.deb`` to be "really distributed" mistakes the mechanism for the goal. The goal is that people can obtain and update the software easily, everywhere, **on their own terms**, and distribute it themselves, both offline, online and over Reticulum with full cryptographic verification of the install packages, without any central infrastructure. - -That goal is met to an excellence that few software packages can speak of, and met in a way that does not pin the project's release cadence to the review cycles of distribution maintainers, which is an achievement, not a bug. - -A project like RNS that updates continuously, sometimes daily, and has a track-record of shipping security updates mere hours after issues are discovered, would be crippled by packaging that makes every change wait months for approval. The distribution complaint is a strawman generated for the occasion. It has been answered, in public, many times; it is repeated anyway, because the people repeating it are not counting on facts - they are counting on the reader never having heard the answer. - -.. _brandolinis-on-institutions: - -On The Institutions, In Fairness -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -None of the above is hostility toward the Open Source Initiative or the Free Software Foundation as institutions, nor toward the individuals who have dedicated decades of work to them. Their contribution to the world of software is **enormous**\ , and this document does not dispute it. What is disputed is a specific claim of authority: That "open source" is a term whose meaning is reserved to a committee's approval, and that a license which does not submit itself to that approval is therefore not open. - -That claim of authority is not in Reticulum's interest, and it is not in the interest of the people the movement claims to serve. The current legal and technological landscape - the machine-appropriation of the commons, the weaponisation of "prior work" generation, the erosion of human agency by synthetic systems - was not anticipated by the DFSG of 1997, and the institutions have not, as of this writing, produced *any* meaningful answer to it. The choice, as it was put at the time of the license change, is whether developers should sit back and wait for a solution from a committee that "may or may not ever materialize, before the entire foundation we stand on has been eaten away". - -**Reticulum's answer was to act**. If we had waited, it would have been too late. - -If an OSI-approved license existed that expressed the same constraints - and did not impose the far more severe restrictions of copyleft - the project would have used it. None such exists. That is not Reticulum's failure. It is the measure of what the definition is missing. - -.. _brandolinis-what-open-means: - -What "Open" Means Positively -^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -For anyone who wants the positive statement rather than the rebuttal, Open Source, in this project's understanding, means: - -* The source code is available, to everyone, without charge -* Everyone may use, copy, modify, merge, publish, distribute, sublicense, and sell the - software -* No one is discriminated against as a person - developer, user, community, or project -* The protocol itself is dedicated to the public domain, where no one can own it -* And the single, plainly stated condition of the license is that the work shall not be - consumed to harm human beings, or ingested to replace the humans who made it - -If that is not "open" by a definition written in the 1990s, then the definition is the thing -that has failed - not the software, and not the people who use it. - -**Open source means open source**. It was true before the committees existed to certify it, and it will remain true after they are gone. - -.. _brandolinis-assistance-versus-substitution: - -Assistance Versus Machine-Substitution --------------------------------------- - -.. _brandolinis-false-dichotomy: - -False Dichotomy -^^^^^^^^^^^^^^^ - -The public discussion around machine learning and software development has been derailed, by the loudest voices on both sides, into a farcical fight between "AI enthusiasts" and "AI haters". - -.. - - **Both positions are absolute caricatures.** - - **The fight is beside the point in the ways that matters most.** - -It is not an accident, but a very conscious choice that the initial analysis of the Prns case examined herein, and this very chapter, were themself produced with the assistance of a machine-learning based generative system. - -Specifically, it was generated using ``lc`` managing a ``Q8_K_XL`` quant of ``DeepSeek v4 Flash`` running in the ``llama.cpp`` inference engine. The main context base used to stabilize, ground and inform the generative environment consisted of approximately 100,000 tokens of text material that I personally thought out and wrote (by hand), then archived and organized, over the last eight years. - -If you know my writing, and have a hard time discerning where this chapter is me directly, typing manually, and where it is the machine output, it is because of two things: Almost every line in this chapter was either directly edited by my hands on the keyboard or typed by me, and the text corpus that informed the process *is* genuinely me - my thoughts, written by me, over a period of years. - -The chapter was produced this way *deliberately and openly*, under a software framework I designed and wrote, with the human directing the inquiry points, flow of investigation, structure of the outputs, contents of every section, making the editorial decisions, reviewing the conclusions, painstakingly adjusting every line, and taking responsibility for the final claims presented, with the goal of reaching a higher level of synthesis and symbolic density than I could have achieved without that assistance. - -The tool was *used as tool*, both to structure and produce a complex chapter, and to inspect a repository so preposterous in size, commit velocity and nonsensical wording that it barred any purely human inquiry. - -As such, the position is hereby, by personal example and demonstration, stated clearly: - -* **Technological assistance is not the problem** -* **It was never the problem** -* **It is the opposite of the problem** - -The problems are *substitution* and *usurpation*\ : The perverse process in which the machine becomes the author of choices, and the human becomes the facade of software, while expecting "reciprocity" or recognition for deeds they never performed. - -.. _brandolinis-the-line: - -The Line -^^^^^^^^ - -The exact distinction can be reduced neither to how many lines of code a machine produced, nor who pressed the keys. The final distinction has to rest on **who, or what, the real agent of the work is**. - - -* **Assistance** is when the human retains the full seat of agency: The human decides what to build, judges - what is correct, rejects what is wrong, understands what is shipped, and can answer for every single line of it. - The machine writes, suggests, drafts, accelerates *meaningfully* and within reason - but every choice that survives into the - final work is a choice the human made *consciously*\ , and understood - or grew to understand - the consequences of. -* **Substitution** is when the machine *becomes* the agency: the machine decides what to build, - decides what is correct, iterates on its own errors, generates at a scale and speed no single - human can follow - and the human's role is reduced to providing the name, the account, the - signature, and the marketing launch. - -.. - - The Line can be stated as a single test, and this is the same test that has always separated authorship from couriership: **Can the person whose name is on the work answer for it fully?** Not "can they describe what it does" - can they account for why it is the way it is, line by line and decision by decision, and the history of how it came to be that way, under questioning, without machine assistance, including by people who know more than they do? - -If they cannot, they did not author the work. They wore it, or in more severe cases, they stole it. And a courier who claims authorship is not a writer; they are a fraud. - -.. _brandolinis-what-assistance-looks-like: - -What assistance looks like -^^^^^^^^^^^^^^^^^^^^^^^^^^ - -Assisted work is recognisable, and recognisability is itself part of its value. It has the following observable properties: - -#. **The human can explain it.** Under examination, the author can say why this choice was - made, what was rejected, and what they verified. The ability to explain is not a luxury; - it is the very demonstration of authorship. On a large project with many contributors this is partial in - practice - no one can explain every line of a large codebase - but the *full capacity* must - exist between the authors and the *habit* must be visible. -#. **The human can, and does, reject machine output.** An author who has never rejected the machine's output is not - an author, but an open drain. Rejection is not a stylistic flourish; it is the - mechanism by which any work attains Quality. A record of decisions, including reversals and rejections, - is a sign of agency. A record without rejection is a record of assent-by-default. -#. **The human's judgment is directional.** The work contains the human's actual choices; - things the machine would not have decided on its own, which the human can defend on their - merits. This directionality has many names in engineering: Design, architecture, taste, - judgment. Where it is absent, the work has the uniform, self-consistent texture of - something that was never doubted, and doubt is exactly what anything important requires. -#. **Provenance is not concealed.** Disclosure of how the work was made is not a legal - requirement in every jurisdiction; it is not even always a practical requirement. But it - is a *statement* that matters. A project that discloses its process - - including its use of machines - is telling the truth about the relationship between the - human and the work, and that is a property users *are* entitled to know. Concealment of - provenance is not a stylistic choice; it is deception, made by someone who knows what the - record would otherwise show. -#. **The human stands behind the failures.** When assisted work fails, the human can say: Yes, I - chose this, under these assumptions, here is why, here is what I got wrong, here is the fix. - That sentence is the entire contract between an author and the people who depend on their work. - A human who cannot say it - because the choices were never theirs - *has nothing to offer anyone*\ , and - is by definition entirely replaceable; anyone else could have pressed the same button. - -.. _brandolinis-what-substitution-looks-like: - -What substitution looks like -^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -Substitution is equally recognisable, once the pattern is known: - -#. **Scope that no human could have authored.** Output that - structurally cannot have been the product of human authorship, review, and judgment, for - example when the volume exceeds any reasonable human capacity within the span of the project's life. - When the review capacity and the output volume are incommensurable, the output was not - reviewed. It was generated, then forgotten, and the record was signed blindly. -#. **Uniform generation.** The work carries no trace of a human's changing mind. No style - drift, no contested decisions, no "we tried X and it was wrong, so we did Y". That is, *no - signs of actual development, growth and learning*. Instead, endless, self-referential - refactoring, renamed abstractions, and the same fluent register in every commit, - every document, every reply. A human's history shows the wear of judgment. - Pure generation shows the superficial polish of its absence. -#. **Discovery by recursive regeneration.** When errors are found, they are found by the machine's own - subsequent runs, not by human scrutiny - and the findings are recorded as planned - "reviews" and "alignments" rather than as the corrections they are. This is the tell: A - machine editing its own previous output, while the edit is recorded as if it were a - scheduled milestone. That's not review. That's a continuous generation loop revising itself, - with the attempt of an illusion-preserving voice-over. -#. **Laundered provenance.** Theatrical concealment machinery: Commit hooks that refuse - attribution of machine generation, contribution policies that declare machine output - "yours", processes that scrub personal traces from the history, fake identities in the - contributor list. All of these have one function: To make the record say what the "author" - *wished* had happened, rather than what happened. A project that builds such machinery is - not making a record of its work; it is using automated software to manufacture one. -#. **Authorship by assignment.** The human's name is on the work, but the human cannot - answer for it - because the human did not choose any of it, and knows it. The name is not a - signature of authorship; it is a *fraudulent claim of ownership* over something the claimant did not - make and cannot explain. In every field that has ever dealt with such claims - art, - literature, invention, journalism - *this has a name*. That **forgery** is now cheap in software - makes it no more forgivable. - -.. _brandolinis-infrastructure-matters: - -Infrastructure Matters -^^^^^^^^^^^^^^^^^^^^^^ - -For a hobby project, the distinction between assistance and substitution is a personal matter. For infrastructure - code that other people's communications, safety, and freedom run on - it is a matter of life and safety, and any statement about this must be entirely unapologetic. - -Infrastructure has one property that distinguishes it from almost all other software: While most of the people who depend on it cannot verify it themselves, **it must be verifiable, auditable and open to human inspection**\ , and be engineered in such a way that this is as frictionless and straight-forward as possible. - -The reference implementation of Reticulum was designed this way, and continues to make that goal a primary one. While it *is* a complex piece of software, with an intricate array of interlocking and moving parts, the core parts of RNS, the entire Reticulum protocol implementation, the transport logic, the cryptographic primitive interfaces, **is less than 15,000 lines of code**. That line count even includes the rather extensive comments, incredibly detailed logging facilities and other choices that makes the code easy to read and understand for humans, and easy to operate, verify and debug. It took real dedication, and *a lot* of hard work to achieve that. - -Exactly because not *everyone* can do this, it is a fundamental necessity for infrastructure software that it is designed and authored so that *as many as possible can*\ , and that the *chain of accountability* - who made it, who reviewed it, who answers for it - is held intact at every link. That chain is not decoration. It is the entire mechanism by which normal users decide to trust a system they cannot fully verify. The transparent foundations and the chain combined *is* the verification for most users. - -Substitution breaks the chain both at the foundations, and at its load-bearing link: The human at the top can no longer answer, because they were never the maker. Unfortunately, the chain does not always fail visibly; often it fails silently, at the exact moment a question goes deep, or when routing fails subtly at a critical moment. - -For the user, the result is not a project with a normal and humanly flawed author - it is a project *with no author at all*\ ; a signature with no substance behind it, a name that cannot be held to account, and a body of work that nobody on earth can (or wants to) explain, defend, or fix in a crisis. - -.. _brandolinis-the-fluency-trap: - -The Fluency Trap -^^^^^^^^^^^^^^^^ - -It is worth understanding, briefly, why substitution is so attractive and so dangerous at once. Machine-generated output is fluent. It is confident, well-structured, and terminologically *self-consistent*. At the surface, and from the perspective of someone outside a given craft, it is indistinguishable from the output of a knowledgeable human. Fluency of this kind can be a useful property: It makes assisted work fast. But fluency is *not* understanding. It is the *minimal conformal surface* of understanding. - -The danger is that the surface is exclusively where the substituter invests; for the simple reason that the surface is where most of the desired audience looks, and what yields attention to the project. - -A human who can tell the difference uses the tool well. A human who cannot is being deceived through means they cannot detect from inside, namely through their own inability to account for the limits imposed by what they do not know. - -This is why the most important quality for anyone working with systems like Reticulum is not speed, and not vocabulary, but the oldest engineering virtue there is: The honest, uncomfortable, terrorizing knowledge of **what you do not know**. The substitute *never* has it. The substitute's operator, *if* they ever had it, loses it precisely the moment they accept the fantasy of the substitution process. - -The tool is not the hazard, plain old human nature is. The tool is a mirror, and mirrors - as has been observed for rather longer than software has existed - show the truth only to those willing and yearning to see their own shortcomings. - -.. _brandolinis-disclosed-assistance: - -Disclosed Assistance Or Laundered Generation -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -The contrast at the centre of this entire discussion can be made clearer with two examples, both of which are publicly accessible, both produced in the same year, by people using the same class of tools. - -The first is this chapter. It was produced with machine assistance, openly: the structure was directed by the human, the material was assembled with the tool's help, every conclusion, every line, every slight nuance of meaning and semantics was examined, edited, and accepted or rejected by the human, and the process described publicly - including the precise characteristics of the technological assistance framework used. The human can answer for every claim in these documents, because the human made the decisions the claims rest on. - -The second is the project examined in :ref:`the Prns case`. It was produced by a machine, at a volume no human could review, and the authorship record was engineered to erase the machine's role: A commit hook that refuses attribution of machine generation, a contribution policy declaring machine output the human's own, a fictitious contributor identity, 637,000 lines of unreviewed code. The human cannot answer for the code, because the choices were never made by a human - only the conformal surface of the presentation was. - -The same tool class. The same technology. Two diametrically opposed relationships to truth and responsibility. **The difference is not the tool**. The difference is the presence or absence of the human as the agent of the work - and the honesty or concealment with which that relationship is recorded. - -Assistance leaves the human as the agent and the commons as the source from which the human works and can grow. Substitution removes the human from the loop and converts the commons into fuel for the thing that seeks to replace them, or usurp their work for the profit of the few, human atrophying in the process. - -.. _brandolinis-license-in-context: - -The License In This Context -^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -The Reticulum License, examined in :ref:`What The Reticulum License Is`, draws the same line, at the level of the law. Its AI condition does not forbid the use of machine-learning technology to *assist* development - no reading of the license could support that, and no one associated with this project has ever claimed so. What the condition forbids is the *appropriation of the work into the machine itself*\ : The ingestion of the commons as raw material for synthetic replacement, and the concealed fabrication of "prior work" that would bury the real thing. - -As also noted in :ref:`Copyright & The Two Legal Layers`, plain old copyright law already protects against the case where a process copies the reference implementation into a machine, produces a transformed derivative, and then claims "Copyright, [name of the process operator]", with no human able to account for the creative decisions in the result. That is simple, petty theft, as it always has been. - -.. _brandolinis-general-principle: - -The General Principle -^^^^^^^^^^^^^^^^^^^^^ - -In these regards, the position of this project can be codensed to something relatively concise: - -* Machine assistance in human learning, development, and creation is accepted and useful. - It is not a shameful secret; but it *is* a tool that needs knowledge, training, understanding, - and great care to use. It should not make anything easier or more fun, it should make the - results better, more carefully considered, and arrive at *higher levels of synthesis*\ , not - produce endless streams of code churn. -* The line is crossed when the human stops being the agent of the work. When *any* output is - accepted that the human cannot explain, produced at a scale the human cannot review, or filed under a record - where the human has arranged to conceal the fact. -* The line is crossed, when a human claims authorship of work they cannot - answer for or has usurped. Credit follows the ability to answer. It has always worked that way, and - machines do not change the rule - they only make it cheaper and more tempting to break. -* The people who depend on infrastructure have the right to know which side of the line - the code they run was made on. That knowledge is the only verification most of - them will ever be able to perform. - -Use assistance, by all means, *and learn*\ , but don't substitute. And never sign what you cannot answer for. - -Somewhere, within the general shape of the conceptual framework outlined in this section, or realistically, a more refined variant of it, I do believe there is the *potential* of the *beginning* of a constructive outcome to the immense challenge we are faced with as a species in regards to these problems. - -At the same time, I reserve my right to revert that position to Butlerian Jihad without prior notice. We are on a knife's edge, and you know it just as well as I do. - -.. _brandolinis-void-grants: - -Void Grants: Legal Foundations of Machine-Generated Code --------------------------------------------------------- - -A grant of rights is only as real as the rights behind it. A license conveys what its issuer holds, and nothing more. A derivative may be distributed only under whatever license covers what it took. And over a work that a machine originated, no human holds anything at all. - -Each of these statements is a matter of settled statute and case law, and this section sets out the authorities. The conclusions they support are: - -#. A software implementation generated from a licensed work by a machine, published under its operator's claimed copyright and license, **conveys rights the operator never possessed**. -#. **Its grant is void**. The projects, products, and promises built upon such grants stand on nothing. A field of void grants is a minefield for everyone who crosses it. - -This section is a general examination of copyright law as it applies to machine-generated code. It is not legal advice. - -I. The Foundational Statute: Translation Is Copying -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -The starting point is the statutory definition of the class of works at issue. Title 17, United States Code, section 101 provides the definition of a derivative work: - -.. - - A "derivative work" is a work based upon one or more preexisting works, such as a *translation*\ , musical arrangement, dramatization, fictionalization, motion picture version, sound recording, art reproduction, abridgment, condensation, or *any other form in which a work may be recast, transformed, or adapted*. - - -Section 101 further provides that *"the terms 'including' and 'such as' are illustrative and not limitative"*. As such, the list is a list of *examples*\ , and the very first example is translation. The definition also reaches, in its own words, *"any other form in which a work may be recast, transformed, or adapted"*. - -The exclusive right at issue is defined in section 106: - -.. - - Subject to sections 107 through 122, the owner of copyright under this title has the exclusive rights to do and to authorize any of the following: - (1) to reproduce the copyrighted work in copies or phonorecords; - (2) to prepare derivative works based upon the copyrighted work; - (3) to distribute copies or phonorecords of the copyrighted work to the public by sale or other transfer of ownership, or by rental, lease, or lending; - - -Violation of any of these rights is infringement. 17 U.S.C. § 501(a). - -Taken together, the provisions yield a construction that is difficult to improve upon and impossible to escape: - -#. **A port is a translation.** A work that takes a program written in one language and from it produces a program written in another language, implementing the same behavior, is a translation of the original - whatever mechanism performed it, and however the surface presentation differs. -#. **A translation is a derivative work.** Section 101 says so, explicitly. -#. **Preparing a derivative work is the copyright owner's exclusive right.** Section 106(2) says so explicitly. A derivative work prepared without authorization, or outside the scope of any authorization, infringes that right. - -The common objection - "the code is in a different language, so it is completely different" - is not a legal argument; it is the definition of what the statute already classifies. - -Translation *is the paradigm* of derivative authorship, not an exception to it. If translating a work without permission was a defense, the derivative-work right would be meaningless; every infringing adaptation would simply need to be "different enough" to count as a translation of its source. - -Nor does the identity of the translator change the analysis. The statute asks whether the work is "based upon" a preexisting work. It does not ask who or what performed the translation. A machine that ingests a licensed work and reproduces a translated transformation of it has performed mechanical translation; the output is a derivative of the ingested work, and the law governing derivative works applies to it exactly as it applies to a translation made by hand. - -II. Ideas Are Free, Expressions Protected -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -The second foundation is the distinction between what a work *is* - its ideas, its processes, its systems - and the *expression* in which those ideas are embodied. The distinction is codified in section 102(b): - -.. - - In no case does copyright protection for an original work of authorship extend to any idea, procedure, process, system, method of operation, concept, principle, or discovery, regardless of the form in which it is described, explained, illustrated, or embodied in such work. - - -The principle is older than the statute, and its application to software is settled. An author may own the particular code in which a method is expressed; the method itself, the process, the algorithm, belongs to no one - because *"the sine qua non of copyright is originality"* (\ *Feist Publications, Inc. v. Rural Telephone Service Co.*\ , 499 U.S. 340, 345. 1991). And ideas are not original to anyone in particular, *Baker v. Selden*\ , 101 U.S. 99 (1879), established the line: Copyright in a book describing a system does not prevent others from practicing the system. - -Applied to a communications protocol, the structure is clean: - ----- - -**An implementation of a public-domain protocol, honestly reasoned and written by humans, is welcome and unencumbered, and owes nothing to any license. An implementation generated from a licensed implementation is a derivative of licensed work, subject to its conditions and to the ordinary copyright of its source.** - ----- - -The public-domain status of the protocol's ideas changes nothing about the copyright in an implementation's expression. A person who copies an implementation - by machine or by hand - cannot defend the copying by pointing to the protocol, because the protocol covers the ideas, not the symbols in which someone expressed them. - -A further misconception can be dismissed here; the recently popularized "clean-room" claim about the absence of copying. A :ref:`clean-room` is a not a magic label achievable by LLM, but a specific, institutionalized procedure for proving to a court that copying did not occur: Physically separated teams, written functional specifications, attestable non-exposure, and no access to the original by the implementers (\ *Altai*\ , 982 F.2d at 709–11). - -*"I created a clean-room implementation by feeding the original source code into a machine"* attempts to *claim* the certified, legally established procedure for proving the absence of copying by describing, in the same breath, a process **composed entirely of copying**. The word is deployed because the procedure it names is what the claimant would *need to have happened*. - -III. Machine Output Has No Author -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -The third foundation is the human authorship requirement. It is settled at both levels of the federal courts and in the Copyright Office's administering practice. - -In *Thaler v. Perlmutter*\ , the district court held that *"copyright law protects only works of human creation,"* and that *"human authorship is a bedrock requirement of copyright"* (687 F. Supp. 3d 140, 146, D.D.C. 2023). On appeal, the United States Court of Appeals for the District of Columbia Circuit affirmed, holding that the Copyright Act *"requires all eligible works to be authored in the first instance by a human being"* (No. 23-5233, D.C. Cir. Mar. 18, 2025). - -The requirement traces to the ordinary meaning of the statutory term. In *Burrow-Giles Lithographic Co. v. Sarony*\ , the Supreme Court defined an "author" as *"he to whom anything owes its origin; originator; maker; one who completes a work of science or literature"* (111 U.S. 53, 57–58, 1884), and more recently described the author as *"the person who translates an idea into a fixed, tangible expression entitled to copyright protection"* (\ *Community for Creative Non-Violence v. Reid*\ , 490 U.S. 730, 737, 1989). - ----- - -**A machine does not owe expression its origin; it reproduces it. No court has recognized copyright in material created by non-humans, and the courts that have addressed the question have rejected it. If you create by machine generation, you do not own the output.** - ----- - -The Copyright Office's registration guidance applies the requirement to generative systems in terms that are directly on point. The Office asks: - -.. - - whether the "work" is basically one of human authorship, with the computer [or other device] merely being an assisting instrument, or whether the traditional elements of authorship in the work (literary, artistic, or musical expression or elements of selection, arrangement, etc.) were actually conceived and executed not by man but by a machine. - - - -* *Copyright Registration Guidance: Works Containing Material Generated by Artificial Intelligence*\ , 88 Fed. Reg. 16190, 16192 (Mar. 16, 2023) - -And it states the consequence: *"If a work's traditional elements of authorship were produced by a machine, the work lacks human authorship and the Office will not register it"* (\ *Id.*\ ). - -On the role of prompts, the Office is equally explicit: when a system receives a prompt and produces a work in response, *"these prompts function more like instructions to a commissioned artist - they identify what the prompter wishes to have depicted, but the machine determines how those instructions are implemented in its output"* (\ *Id.*\ ). - -The agency applied this standard and excluded machine-originated material from registration in the leading administrative case. In *Zarya of the Dawn* (Cancellation Decision, Feb. 21, 2023, Registration No. VAu001480196), the Office cancelled registration of images generated by the Midjourney service, holding that *"it was Midjourney-not [the author]-that originated the 'traditional elements of authorship' in the images"*\ , while preserving protection for the human-authored text and the human selection and arrangement of the work. - -The Copyright Office's 2025 report on AI copyrightability reaches the same conclusion: - -.. - - Based on the functioning of current generally available technology, prompts do not alone provide sufficient control. - - - -* U.S. Copyright Office, *Copyright and Artificial Intelligence, Part 2: Copyrightability*\ , at iii (Jan. 29, 2025) - -The report's analysis is explicit: *"The Office concludes that, given current generally available technology, prompts alone do not provide sufficient human control to make users of an AI system the authors of the output. Prompts essentially function as instructions that convey unprotectible ideas"* (\ *Id.* at 18). - -Its guiding distinction is stated plainly: *"The use of AI tools to assist rather than stand in for human creativity does not affect the availability of copyright protection for the output"* while *"Copyright does not extend to purely AI-generated material, or material where there is insufficient human control over the expressive elements"* (\ *Id.* at iii). - -The boundary is therefore not "AI or no AI". It is *assistance or substitution*\ : Whether a human exercised sufficient creative control over the expressive elements and can answer for them, or whether the machine originated them and the human merely supplied instructions and a signature. That is a question of fact in each case, determined from the record of how the work was made. - -Two facts follow, and stated together, they form the base legal reality: - - -#. **A work whose expressive elements were originated by a machine contains no valid new copyright: It has no human author. To the extent that the same work reproduces a preexisting copyrighted work without explicit license, it is at the same time an unauthorized derivative. It is unowned for anything new it contains, and unlicensed for everything taken.** -#. **Its operator therefore holds no copyright in it and no grant over it - and a person who holds neither copyright nor grant can convey neither.** - -The first fact makes the work **unownable** by its operator. The second makes it infringing against its source. Neither replaces the other: - - -* The absence of copyright in machine output does not make the output free for anyone to take; it makes it unowned. -* This is a different thing entirely, especially when what it contains is someone else's expression. - -IV. License Conditions Bound the Grant -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -The fourth foundation governs what a license *is*. A copyright owner may grant permission to use the work on conditions. The conditions define the scope of the permission. Use outside the scope is use that was never authorized. - -In *Jacobsen v. Katzer*\ , 535 F.3d 1373 (Fed. Cir. 2008), the Federal Circuit held that the conditions of an open-source license are *conditions of the copyright license itself*\ , not mere contractual promises, and that a licensee operating outside them is an infringer: - -.. - - Copyright holders who engage in open source licensing have the right to control the modification and distribution of copyrighted material. - - The choice to exact consideration in the form of compliance with the open source requirements of disclosure and explanation of changes, rather than as a dollar-denominated fee, is entitled to no less legal recognition. - - It is outside the scope of the [license] to modify and distribute the copyrighted materials without copyright notices and a tracking of modifications from the original computer files. - - - -* *Id.* at 1381–82 - -The doctrinal mechanism is settled: *"A copyright owner who grants a nonexclusive license to use his copyrighted material waives his right to sue the licensee for copyright infringement"* within the scope of the license. If, however *"the licensee acts outside the scope, the licensor can bring an action for copyright infringement"*\ : An act outside the granted scope **is infringement** (\ *Sun Microsystems, Inc. v. Microsoft Corp.*\ , 188 F.3d 1115, 1121, 9th Cir. 1999; *Graham v. James*\ , 144 F.3d 229, 236, 2d Cir. 1998; *S.O.S., Inc. v. Payday, Inc.*\ , 886 F.2d 1081, 1087, 9th Cir. 1989). - -Whether a given license term is a condition of the grant or a mere covenant is determined from the license's own language; conditions that limit what may be copied, modified, and distributed - the attribution terms, the notice terms, the modification-tracking terms, the field-of-use terms - are the boundaries of the copyright grant (\ *MDY Industries, LLC v. Blizzard Entertainment, Inc.*\ , 629 F.3d 928, 940, 9th Cir. 2010). - -Three consequences follow for the analysis at hand. They are not hypothetical. - -**First, the conditions are measured at the moment of copying** - -A work is licensed under whatever conditions applied when the reproduction, adaptation, and distribution occurred. There is **no** period in which copying a licensed work is "free" because the copy was made by a machine; the machine is the *licensee's tool*\ , and the licensee is bound by the conditions regardless. A derivative generated without satisfying the conditions - without the attribution, without authorization for the manner of use - was never within the scope of the license, from the first instant of its existence. - -**Second, breach does not restore rights that never attached** - -The district court in *Artifex Software, Inc. v. Hancom, Inc.*\ , No. 16-cv-06982-JSC (N.D. Cal. Sept. 12, 2017), analyzing the GPL's termination provisions, observed that *"the language of the GPL suggests that [the licensee's] obligations persisted beyond termination of its rights to propagate software using Ghostscript,"* because the source-code obligation recurs each time a covered work is conveyed. The same structure operates a fortiori where a derivative was produced *outside* the license entirely: No grant ever attached, and no subsequent event creates one. - -**Third, the settled conditions are the enforceable core** - -The attribution and notice conditions rest on the settled doctrine above. Novel conditions (restrictions on field of use, restrictions on how the work may be consumed) are enforceable as conditions of the grant when clearly drafted, but their enforcement history is thinner. The argument that a derivative is unlicensed does *not* depend on the novel conditions being vindicated; it needs **only** the settled ones, and the ordinary law of derivative works, to stand. - -V. The Void Grant -^^^^^^^^^^^^^^^^^ - -The preceding sections assemble into a single structure. Let us apply it to an example situation: - - -* A project presented as an independent implementation of a protocol; "ground-up", "from scratch" or "clean-room" work. -* The actual history shows continuous, machine-mediated ingestion of a licensed reference implementation. -* The output is generated at a scale no human could produce or review, with the provenance of the process obscured. - -**Step One: The derivative** - -The project's output is a translation of the licensed implementation: A derivative work, produced by a copy process. 17 U.S.C. §§ 101, 106(2). Preparing it without authorization infringed from the first moment of its existence. *Id.* § 501(a). - -**Step Two: The license** - -The derivative was produced outside the conditions of the license; without the notices, without the attribution. The license never attached (\ *Jacobsen*\ , 535 F.3d at 1381–82). - -**Step Three: Authorship** - -The expression was originated by a machine. No human can account for its creative decisions, and no human authored it. It contains no valid new copyright (\ *Thaler*\ , 687 F. Supp. 3d at 146; No. 23-5233, D.C. Cir. 2025; 88 Fed. Reg. at 16192). - -**Consequence: Void Grant** - -The statute supplies the consequence. Section 103(a) provides: - -.. - - The subject matter of copyright as specified by section 102 includes compilations and derivative works, but protection for a work employing preexisting material in which copyright subsists does not extend to any part of the work in which such material has been used unlawfully. - - -And section 103(b) provides that copyright in a derivative work *"extends only to the material contributed by the author of such work."* The legislative history states the point without ambiguity: *"An unauthorized translation of a novel could not be copyrighted at all"* (H.R. Rep. No. 94-1476, at 57, 1976). - -In our example, the operator of the derivative's copy process decides to assert copyright over the output, and licenses it to the world under terms of the operator's choosing, for example the Apache License. - -But the operator holds no copyright in machine-originated content (section III) and no license over the source from which it was derived (sections I and IV). - -For the derived material, the operator's copyright claim **is an assertion of a right that never existed**. The material was used unlawfully, and section 103(a) withholds protection from *every* part of the work in which it appears. For the machine-originated remainder, the operator holds no copyright either, for lack of any human author. - -The operator's license to the world is a promise the operator had no power to make. Every person who receives the work believing they received a valid grant has received **a void grant**\ , and stands, as a matter of settled law, in the position of a downstream user of an unauthorized derivative, whatever they were told at the time. - -This is a cascading consequence, and it is why the pattern is a hazard. No combination of self-granted licenses - "MIT," "Apache," "public domain," anything at all - can transfer rights the operator never held. Every downstream project, product, or deployment built on the derivative is built on unlicensed reproduction of a third party's work, whether or not it knew, whether or not it was told, and whether or not the marketing was plausible. - -The longer the derivative circulates unexamined, the more it becomes embedded, forked, vendored, depended upon, and the more expensive its correction becomes for everyone who trusted it. A field of superficially real projects, repositories, and licenses that **in reality confer nothing on anyone who relies on them is a minefield**\ , in the most precise sense the law allows: The rights they purport to grant *were never possessed*. - -The law defines what may be asserted, not what will be. The copyright owner may choose whether and how to assert these rights, and at what point in time. The exposure exists regardless, and for *every* downstream that trusted the void grant. This is the scope of the hazard that the conduct exemplified here produces. - -VI. Fair Use Does Not Rescue This Pattern -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -Every defendant raises fair use. It is an essential and important limitation in the service of free speech, accountability, criticism, education and other important domains. Therefore, it must be considered, and in the case exemplified here, it fails. - -Fair use is a limitation on the exclusive rights, evaluated case by case under four factors: The purpose and character of the use; the nature of the copyrighted work; the amount and substantiality of the portion used; and the effect of the use on the potential market for or value of the work (17 U.S.C. § 107). - -On the first factor, the governing standard is *Andy Warhol Foundation for the Visual Arts, Inc. v. Goldsmith*\ , 598 U.S. 508 (2023), in which the Supreme Court held that: - -.. - - In sum, the first fair use factor considers whether the use of a copyrighted work has a further purpose or different character, which is a matter of degree, and the degree of difference must be balanced against the commercial nature of the use - - -The question is whether the use serves a further purpose, not whether the surface changed. A derivative that exists to serve as the same thing as the original, marketed to the people who would otherwise use the original, has not acquired a further purpose by being translated; the surface changed, the function did not, and the use is commercial. - -The remaining factors resolve the same way. Source code is expressive creative work, not bare fact. The pattern under examination copies the whole; a complete implementation, ingested and translated in its entirety. And the market effect is the decisive factor, because it is engineered: A derivative marketed as a drop-in replacement for the work it was copied from is not a complement to the original's market, it is a substitute for it. The Supreme Court has long held that use of a work to satisfy the market demand for the original is the paradigm of an *unfair* use (\ *Harper & Row, Publishers, Inc. v. Nation Enterprises*\ , 471 U.S. 539, 566–67, 1985). - -The one case that is always raised in response, *Google LLC v. Oracle America, Inc.*\ , 593 U.S. 1 (2021), holds less than it is believed to. The Court there assumed *"for argument's sake, that the material was copyrightable"* and held *"that the copying here at issue nonetheless constituted a fair use"* (\ *Id.* at 11). - -The material in question was a thin slice of *declaring code*\ , which the Court found sits, *"if copyrightable at all, further than are most computer programs (such as the implementing code) from the core of copyright"* (\ *id.*\ ), in a use that built a new platform for a new environment, with the copier **having written the vast majority of its own code**. By comparison: A wholesale translation of an entire implementation, marketed as a substitute for it, is **not** that case; it is the other end of every factor. - -The valuable zones of fair use remain, and they are important. **Commentary and criticism**\ , quoting from a work to review, discuss or criticize it. **Teaching and scholarship**\ , explaining concepts and quoting excerpts, is its traditional beneficiary. - -Conclusion -^^^^^^^^^^ - -The law is neither obscure nor new. The conclusion it yields can now be stated: - - -* A machine translation of a protected implementation **is a derivative work**, and an unauthorized derivative **is an infringement**, whatever language it speaks and whatever machinery produced it. -* A work whose expression a machine originated has no human author, no valid new copyright, and without valid copyright **no license can be granted on it**. -* § 103 withholds protection from every part of a derivative in which protected material was used unlawfully. A license is a grant with conditions, and a derivative made outside the conditions **never received a grant**. -* A person who holds no copyright and no grant **can convey neither**, and *every* downstream consumer who received from them received a **void grant**. - -This is a *catastrophic* failure state for all who want to create things good and useful: The projects that inherit only void grants and liability believing they have inherited foundations, the users who depend on code that no one on earth can answer for, the honest builders whose work is buried under a field of plausible-looking impostors. - -Sources and Authorities -^^^^^^^^^^^^^^^^^^^^^^^ - -Statutory references are to Title 17, United States Code. Case citations are to the official or generally cited reporters. Online links are for reference only. Section numbers refer to the sections in which each authority is principally relied upon. - -**Statutes** - - -* `17 U.S.C. § 101 (definitions: "derivative work," "including," "publication") - I, II `_ -* `17 U.S.C. § 102(b) (idea/expression) - II `_ -* `17 U.S.C. § 103(a)–(b) (derivative works employing unlawfully used preexisting material) - V `_ -* `17 U.S.C. § 106(1)–(3) (exclusive rights: reproduction, derivative works, distribution) - I `_ -* `17 U.S.C. § 107 (fair use) - VI `_ -* `17 U.S.C. § 501(a) (infringement) - I, V `_ - -**Judicial decisions** - - -* `\ *Jacobsen v. Katzer*\ , 535 F.3d 1373 (Fed. Cir. 2008) - IV, V `_ -* `\ *Sun Microsystems, Inc. v. Microsoft Corp.*\ , 188 F.3d 1115 (9th Cir. 1999) - IV `_ -* `\ *Graham v. James*\ , 144 F.3d 229 (2d Cir. 1998) - IV `_ -* `\ *S.O.S., Inc. v. Payday, Inc.*\ , 886 F.2d 1081 (9th Cir. 1989) - IV `_ -* `\ *MDY Industries, LLC v. Blizzard Entertainment, Inc.*\ , 629 F.3d 928 (9th Cir. 2010) - IV `_ -* `\ *Artifex Software, Inc. v. Hancom, Inc.*\ , No. 16-cv-06982-JSC (N.D. Cal. Sept. 12, 2017) (settled; dismissed with prejudice Jan. 2018) - IV `_ -* `\ *Thaler v. Perlmutter*\ , 687 F. Supp. 3d 140 (D.D.C. 2023), aff'd, No. 23-5233 (D.C. Cir. Mar. 18, 2025) - III, V `_ -* `\ *Burrow-Giles Lithographic Co. v. Sarony*\ , 111 U.S. 53 (1884) - III `_ -* `\ *Community for Creative Non-Violence v. Reid*\ , 490 U.S. 730 (1989) - III `_ -* `\ *Feist Publications, Inc. v. Rural Telephone Service Co.*\ , 499 U.S. 340 (1991) - II `_ -* `\ *Baker v. Selden*\ , 101 U.S. 99 (1879) - II `_ -* `\ *Computer Associates International, Inc. v. Altai, Inc.*\ , 982 F.2d 693 (2d Cir. 1992) - II `_ -* `\ *Andy Warhol Foundation for the Visual Arts, Inc. v. Goldsmith*\ , 598 U.S. 508 (2023) - VI `_ -* `\ *Google LLC v. Oracle America, Inc.*\ , 593 U.S. 1 (2021) - VI `_ -* `\ *Harper & Row, Publishers, Inc. v. Nation Enterprises*\ , 471 U.S. 539 (1985) - VI `_ - -**Administrative and policy authorities** - - -* `\ *Copyright Registration Guidance: Works Containing Material Generated by Artificial Intelligence*\ , 88 Fed. Reg. 16190 (Mar. 16, 2023) - III `_ -* `\ *Zarya of the Dawn*\ , U.S. Copyright Office (Cancellation Decision, Feb. 21, 2023), Registration No. VAu001480196 - III `_ -* `U.S. Copyright Office, *Copyright and Artificial Intelligence, Part 2: Copyrightability* (Jan. 29, 2025) - III `_ -* `H.R. Rep. No. 94-1476 (1976) - V `_ - -.. _brandolinis-evaluating: - -Evaluating a Reticulum Implementation -------------------------------------- - -.. _brandolinis-intention-of-guide: - -The Intention Of This Guide -^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -Very few user of network infrastructure can verify the software they run. This is true of the reference implementation as well, and it is precisely why it was engineered the way it was: the entire Reticulum protocol implementation - the transport logic, the cryptographic interfaces, the routing - is less than 15,000 lines of code, including its extensive comments and detailed logging. The reference is *designed* to be readable by a human in a reasonable sitting. That is a deliberate decision, and it is the standard against which every other implementation should be measured: An implementation that asks for trust while being structurally unreadable is asking for the absurd. - -Because most users cannot verify the code directly, the evaluation of the *project* is the evaluation of the software. The framework below exists so that this evaluation can be performed in minutes, by anyone, without expertise - and so that each new "implementation" does not require the kind of full investigation that would otherwise be if not impossible, prohibitevly expensive. - -.. _brandolinis-two-questions: - -Two Questions That Resolve Most Cases -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -Other considerations in this guide is further corroboration. These two questions allow you to decide the case quickly in most instances, and they should be asked first. - -**Question 1: Does this speak the protocol, or was it just generated from the reference?** - -The copyright and license realities, described in :ref:`What The Reticulum License Is`, is the legal foundation of this distinction. The protocol is public domain: A *genuine* :ref:`clean-room` implementation, reasoned out and written by humans, is free and welcome, and owes nothing to any license. But an implementation that was *directly generated from* the reference - reproduced by a copy process, whether manually or through a machine or software - is a derivative of the licensed work, and is subject to both the license's conditions, and to the ordinary copyright law examined in :ref:`Copyright & The Two Legal Layers`. A primarily machine-generated copy without substantial human creative input is not merely unlicensed; it is a copyright violation that would exist under any license at all. - -**Ask**: Does the project say where its protocol knowledge came from? Does it credit the reference implementation, or claim "ground-up" status while its own history shows continuous ingestion of the reference's source? Does its license carry the original copyright notice? The answers tell you, within minutes, which of two very different kinds of project you are dealing with. - -**Question 2: Who, or what, is the agent of the work?** - -This distinction, established in :ref:`Assistance Versus Machine Substitution`, is the trust foundation of everything else. Is there a human who decided what to build, judged what was correct, rejected what was wrong, understands what was shipped - and can answer for it, line by line and decision by decision, *without machine assistance*\ ? Or is the machine the agent, with the human's role reduced to the name, the account, and the signature? - -.. - - This test has a sharper form: **would the project be meaningfully different if someone else had pressed the button?** If the answer is no - if any person could have been the signature and nothing would change - then the "author" is not the agent of the work. They are its facade, and the project is, in the most literal sense, worthless and unowned. - -A project with no owner is a project no one can answer for, and infrastructure with no one to answer for it has no place carrying other people's traffic. - -.. _brandolinis-other-signals: - -Other Signals To Look For -^^^^^^^^^^^^^^^^^^^^^^^^^ - -Once the first two questions are answered, the following signals determine the verdict. None is alone decisive; together they form a pattern that is difficult to fake in the directions that matter. - -.. _brandolinis-provenance: - -Provenance and attribution -~~~~~~~~~~~~~~~~~~~~~~~~~~ - -* **Credit to the reference.** Does the project name Reticulum's reference implementation - in its README, its website, its licenses, and the code? Does it present itself as a port - or as a "ground-up" origin story? Absence of credit, in a field where every implementation - owes its existence to the reference, is not an oversight; it is a decision. -* **License compliance.** For a derivative, the license conditions apply: the copyright - notice and permission notice in all copies and substantial portions, the harm condition, - the AI-training condition. A project whose license file claims a fresh copyright in the - operator's name, over work that was generated from the reference, has failed the minimum - bar of honesty before any code is read. -* **Disclosed provenance.** Is the use of machine assistance stated openly, or does the - project maintain machinery to conceal it - commit hooks that refuse attribution of - generation, contribution policies that declare machine output the human's own, scrubbers - for personal traces, fictitious contributor identities? The first is the mark of a human - using a tool. The second is the mark of a record being manufactured. -* **The author's history.** Is there a prior record - projects, contributions, a body of - work that a person can look at and reasonably assess? A sudden, fully-formed "decade of experience" - appearing from nowhere, attached to a project of unprecedented scope, is a story that - contradicts itself. - -.. _brandolinis-agency: - -Agency and answerability -~~~~~~~~~~~~~~~~~~~~~~~~ - -* **Who answers the questions?** When technical questions are asked, does a human answer - with substance - going deeper, explaining trade-offs, admitting uncertainty - or do - answers deflect to process ("the CI verifies it", "the proofs prove it", "the audit - covered it")? Are the answers themself machine generated? Deflection to process is - the substitute's answer pattern: It names the machinery instead of the reasoning. -* **Velocity commensurate with authorship.** Is the output volume compatible with human - authorship, review, and judgment? An implementation ten (or 42!) times the size of the reference, - produced in a fraction of the time by a single person, is not evidence of brilliance; it - is evidence of unchecked generation. Churn is part of the same signal: A project that - deletes half of everything it adds is not building; it is looping. -* **Signs of development, growth and learning.** Do reversals exist? Contested decisions? - "We tried X and it was wrong, so we did Y"? Humans change their minds, admit mistakes, and - leave the wear of judgment in their history. Pure generation shows "the polish of its - absence": uniform register, endless renaming, and errors discovered by the generator's own - later runs, recorded as if they were planned milestones. -* **Standing behind failures.** When something is wrong, does the human say "I chose this, - here is what I got wrong, here is the fix"? Or do corrections arrive as process language, - with nobody accepting that a decision was even made? A project whose history contains no - first-person acceptance of error contains no author. - -.. _brandolinis-engineering: - -Engineering reality -~~~~~~~~~~~~~~~~~~~ - -* **Honest benchmarks, or none.** If performance is claimed, is the baseline real - stock, - current, interpreted RNS, on the modern interface, at equal policy, with methodology - published in advance and reproducible by anyone? -* **Interop with reality.** Is compatibility verified against the *current* reference - implementation - on real hardware, including the radio and serial interfaces this - protocol family lives on - in both directions, over long transfers, uptimes and edge cases? -* **The readability standard.** Can a competent human read the core of this implementation - in a reasonable sitting, the way the 15,000-line reference can be read? Was human - readability a stated design goal, or an afterthought? A project that cannot be inspected - is a project asking for trust it has not earned and will never attend to. -* **Nonstandard inventions.** Does the project "improve" on the protocol with its own - modes - new channel behaviour on shared spectrum, new rendezvous mechanisms, new crypto, - "post-quantum" replacements, "turbo" variants? Inventions that change behaviour on a - shared network are not features; they are forks of the airwaves, imposed on every other - node that shares the medium. A project that invents on top of a protocol it has not yet - correctly implemented is not advanced; it is dangerous to its neighbours. -* **The public record.** The commit history is public. Read it. - -.. _brandolinis-network-citizenship: - -Network citizenship -~~~~~~~~~~~~~~~~~~~ - -* **Honest presence.** Does the project identify itself honestly on the network, or does - it masquerade as something it is not? -* **Coexistence.** Does it respect the shared medium and network conventions? A node that - is a bad neighbour on the spectrum is a hazard regardless of how well its code works in isolation. -* **Community participation.** Does the author participate in the community as a member - - answering questions, contributing, learning - or only appear to advertise? The second is - not participation; it is exploiting the community as a broadcasting target. - -.. _brandolinis-signals: - -Monetary and influence signals -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -* **Money under the claim.** Donations, funding, or commercial offers premised on claims - like "89× faster" or "formally proven" convert false marketing into a different category - of problem. When money changes hands on the strength of fabricated measurements, the - stakes are no longer theoretical. -* **Tokens and "investment" vehicles.** Any implementation that surrounds itself with a - crypto token, a "coin", or an investment pitch should be treated as what it is: A project - whose primary purpose is to earn the controller a profit, not open networking. -* **Marketing-first ordering.** A polished website on day three, a twelve-language marketing - presence, a "benchmarks" page and a "get started" funnel existing before the protocol works - is a massive red flag. Real builders ship, then talk. The inverse order is the signature of - a project whose goal is attention. - -.. _brandolinis-conformal-surface: - -The Conformal Surface -^^^^^^^^^^^^^^^^^^^^^ - -One warning before the synthesis. When you evaluate any project, assume - as a working hypothesis - that its surface is an investment. The marketing, the design, the badge collection, the "proof records", the fluent and confident prose: This is exactly where substitution invests, for the simple reason that it is where the audience looks first. Fluency is the *minimal conformal surface* of understanding, and the surface is not evidence of anything except that the author *wanted to look convincing*. If you find yourself impressed by the surface before you have asked Question 1 and Question 2, you are doing the evaluation in the order the substitute operator hoped you would. - -.. _brandolinis-possible-verdicts: - -Possible Verdicts -^^^^^^^^^^^^^^^^^ - -The framework proposed here can yield three different verdicts: - -#. - **Meets the standard.** A named human who can answer for the work and demonstrably does; - provenance disclosed; attribution given; honest benchmarks; interop - demonstrated against current, real RNS on real media; readable code; a maintenance - history that shows growth and learning. This standard is not high. It is what the - reference implementation has met, in public, for over a decade, and it is what any - project that wants other people's traffic should be willing to meet in turn. - -#. - **Experimental, but honest.** A project that clearly labels itself as in-progress and - experimental ("do not use this yet", in plain words, as the first thing a user sees) - discloses its provenance, credits the reference, and is being developed in the open by - humans who answer questions. Such projects should be encouraged. They are how the - ecosystem grows, new ideas are tested, and the framework above is designed to make an - honest experimental project *easy* to recognize, not hard. - -#. - **Does not meet the standard.** Unanswerable authorship, concealed provenance, fabricated - measurements, invented protocol behaviour, absent interop, marketing ahead of substance. - Such projects should be treated as unproven regardless of their surface, and as hazards - if they invite users onto shared networks. The community owes them exactly the - skepticism they have earned, and not a moment of engagement beyond that; the network's - time is better spent elsewhere. - -.. _brandolinis-standards-reasonable: - -These Standards Are Reasonable -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -I'll close this guide by stating what these standards are *not*\ : They are neither a demand for perfection, nor a ban on machine assistance. Assistance is useful, when it is used to arrive at *higher levels of synthesis* than unaided work. It is not a requirement that an implementation be a clone of the reference; neither is it a requirement that it invents everything from scratch or aspires to be a :ref:`"clean-room"` implementation. Good implementations of the protocol are very welcome, *however they come*, but working on one requires *serious* work, considerable skill, and **deep competence**. - -The reference implementation has met this standard for years, and its users know what that looks like. - -.. _brandolinis-movement-of-a-dozen: - -The Movement Of A Dozen ------------------------ - -.. _brandolinis-presentation-elongated: - -Presentation, Elongated -^^^^^^^^^^^^^^^^^^^^^^^ - -Whenever Reticulum defends itself, its license, or its community - or simply continues to exist - a familiar chorus appears. The register is always similar: *concern*. Concern about the direction of the project. Concern about its license. Concern about its governance. Concern about its "bullying" of "good-faith contributors". Concern about the future of the ecosystem at the hands of a single maintainer. The chorus speaks in the plural, presents itself as a body of independent voices, and insists, with some frequency, that it is... *not alone*. - -The implicit claim under examination in this section is that there exists a *movement* of concerned individuals, spread across the ecosystem, all worried about Reticulum, and therefore (for some reason) deserving of a place at the table of decisions. - -A resolution of this claim requires one step: Count them. - -.. _brandolinis-headcount: - -Headcount -^^^^^^^^^ - -This "movement" does have a headcount. It is not in the hundreds, and it is not in the dozens. It is a small number of people who appear, in various combinations and under various names, in the following roles: - -* Creators of the machine-generated "Reticulum implementations" examined in this chapter. -* Creators of articles praising those implementations and lamenting the state of the - reference, its moral shortcomings, its unavailability or lack of something it already has. -* Commenters "defending" the implementations when they are evaluated reasonably and critically, - most often by attempting simply to derail the discussion. -* Critics of the Reticulum License on "open source" grounds. -* "Concerned community members" objecting to the maintainer's conduct. -* Campaigners on online platforms; and -* In some cases, a single individual performing *several* of these roles at once, under - different names, in the same week. - -The overlap is well documented at this point, across time and different platforms. The same phrasing, the same arguments, the same links, the same reactive reflexes, the same handful of accounts appearing in the same threads at the same moments. When the sockpuppets are unmasked (and they frequently unmask themselves) the cast does not grow, but rapidly shrinks. - -This is the most interesting single fact about the "movement": **It isn't one. It is a synthetic cast**, held together mostly by LLM-glue, reddit handles and hysteria. A cast is not a constituency. It performs; it does not represent. The difference matters quite a bit, because a great deal of this "movement's" imagined power comes from the assumption that the *plural form* is actual evidence of plurality. If that sentence seemed opaque, notice how many times a statement or article uses "we" instead of "I", and it will be less so. - -.. _brandolinis-recycled-wine: - -Recycled Wine, Fermenting -^^^^^^^^^^^^^^^^^^^^^^^^^ - -The cast is not only small, it is also, by any evidentiary standard, *forgetful*. Every major claim this "movement" advances has been advanced before, answered in public, with evidence, and often years ago - and is then advanced again, unchanged and completely ignoring any rationale or evidence presented previously (to the same people), as if the answer had never been written. - -* **The license argument.** Reticulum is "not really open source" because its license is not - approved by a particular orthodoxy. This is answered (now in a new and updated version, for the - fifth time) in full in :ref:`Open Source Means Open Source`. It was also - answered in public, at length, at the time of the license change - including the - arithmetic of who is actually restricted by which license. It is repeated *ad infinitum* anyway. - Quite a conversation starter, apparently. -* **The distribution argument.** Reticulum is "not properly distributed" because it is not - packaged as a ``.deb`` or on some favoured catalogue. Reality: It is available on practically every - platform with a single command, packaged by the community in a wide range of channels, and - capable of updating itself over its own network. The argument has been answered; it is repeated. -* **The "stepped back" narrative.** When the primary mirror of the project moved away from - a public internet platform, it was spun as the founder leaving for good, or now taking on dictatorial - powers, or abandoning his creation, or any variation or nonsensical combination thereof. - Those spins always center around justifying that *a vaccuum now needs to be filled*. - There was no such vaccuum. The narrative is repeated in various forms whenever convenient. -* **The enclosure narrative.** The license is reframed as a "power grab" or an "enclosure" - of the commons - as if a license whose protocol is public domain and whose conditions - restrict only harm and appropriation were a form of enclosure. The `most recent `_ (and mostly incoherent) - expression of this narrative is, once again, fluent, polite, and factually hollow. The - bizarre arguments supporting the "article" include: Defunct and abandoned forks presented - as living, community forks bearing the very Reticulum License mislabeled as AGPL license vehicles - (created by "concerned users"), companion app forks correctly retaining the Creative Commons - licensing used as further evidence of the same and completely abandoned projects propped up - as being "the ecosystem". Another case of LLM generated nonsense that the "author" didn't bother checking. - The intent is clear here, simply produce more *mass* of the bullshit, so it can be further - referenced, regurgitated and linked to. -* **The "bullying" narrative.** Whenever the community declines to treat manufactured - controversies as legitimate, or calmly documents the falsity of claims, or (Lord forbid) - moves a forum post for violating clearly stated forum rules, - the response is the same: The documentation is "bullying", the community is "excluding" people, the - maintainer is "unprofessional". In the most recent example, those accusations were made by someone who, in the - same week, publically called for the Reticulum maintainer's "removal from the equation", forged a moderator's - username, attempted to drag unrelated individuals into the campaign, and presented a new - round of outright falsehoods. Contrary to popular belief, the accusation of incivility - is not the last resort of the wronged; it is the standard reflex of the exposed. - -None of the "arguments" engages the answers given repeatedly, and extensively. That is the point, and the strategy. The arguments are not produced for the purpose of being engaged; they are produced for the purpose of *being repeated* - the same wine, poured into new bottles, on a cycle. Each cycle is short, cheap to produce, and (thanks to freely available fluent text generation) now nearly effortless. The intended audience is not the community, which has heard it all before. The intended audience is the newcomer, who has not. - -.. _brandolinis-the-method: - -The Method of Madness -^^^^^^^^^^^^^^^^^^^^^ - -The method behind the pattern is consistent and simple enough to be described precisely: - -**Bullshit asymmetry** - -Producing a fluent, plausibly-sourced smear is now the work of minutes. Refuting it to the standard this manual demands is the work of days, and the refuted smear is replaced by the next one within the week. This asymmetry isn't just a fine point of the campaign; **it is the campaign**. The goal is exhaustion - the slow conversion of the community's time and attention from building to defending. - -**Weaponized concern** - -The register of the campaign is almost always the register of solicitude: "we are worried about the ecosystem", "we just want what is best for the community", "this is about the future of the project". The concern is directed, without exception, at the things the campaign wants changed, and the change it wants is always the same: **The replacement of the reference's authority with its own**. Concern is the *costume*\ ; capture is the choreography. It is the oldest form of cheap power grab in the book. - -**Event seizure** - -Any event - a license change, a platform move, a forum moderation decision, a subreddit closure, a security notice, even the most banal messages from maintainers or known contributors - are seized, stripped of their actual context, and re-narrated as evidence of the same pre-written story. The subreddit that was closed after its moderator vanished and ceased moderating (according to *prior agreement with said moderator*) becomes "the maintainer shutting down dissent". Moving away from a highly centralized online platform becomes "the founder retreating". The license becomes "the enclosure". The pattern is so reliable that the story could be pre-written by a lightly mechanized quill; only the date changes. The actual real-world context of these events is documented, in public, in each case; the re-narration proceeds regardless. - -**The legitimacy circuit** - -The campaign invests heavily in the places where legitimacy is minted: Conference talks, blog platforms, social threads, and forums - presented as if these appearances constituted some sort of ecosystem-wide groundswell rather than the same dozen people moving through the same circuit. The LLM-generated articles cite the LLM-generated ports; the ports are praised in the articles; the managers of the ports spread the articles, and echo them on the forums and internet platforms; the conference presentations cite the forums. Random bypassers with the need for a cause watch the conference presentations and take on the holy duty of Internet Soldier. The circuit is closed, self-referential, and (to a reader encountering it fresh) convincing. It is also, entirely, **a loop of bullshit**. - -**The prior-work minefield** - -The machine-generated implementations have a consequence beyond attention: They flood the space with fake "prior work". The effect, as the license discussion predicted in the beginning of 2025, is the creation of a minefield of sloppy repositories that can later be matched against any genuine project, and attempt to claim prior art, or even worse: Dissuade actual, honest developers or builders from taking up a real project they might have succeeded with, because they now believe it has already been done. Just as importantly, it also buries real efforts under machine-generated noise. The machine-ports are not failed attempts to contribute. They are (disregarding intentions, but effectively) the campaign's long game, deployed as inventory. - -.. _brandolinis-fragile-triad: - -A Persistent, But Fragile Triad -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -This chapter as a whole has documented three fronts: The legal-ideological attack on the license (:ref:`Open Source Means Open Source`), the substitution and usurpation pattern in machine-generated implementations (:ref:`Assistance Versus Machine Substitution`), and the takeover narratives examined in this section. They are three fronts of the same operation, run by the same cast. - -* The license attack and other urgency-engineered narratives are the *cover*: They supply - the ideological justification for treating the reference as illegitimate, and needing replacement. -* The ports are the *inventory*: they supply the "replacements" that the narrative claims - the ecosystem needs. -* The takeover narrative is the *objective function*: the repeated, persistent, escalating claim that - the reference should be replaced, and that the speakers themself are the natural heirs. - -Each front depends on the others, and all three depend on a single, fragile assumption: That their audience cannot count. Restore the count, and the charade collapses into what it is: - -**A small group of people, obsessively orbiting a technology they did not build, synthetically producing the -appearance of a constituency they do not have, in service of a takeover they cannot justify.** - -.. _brandolinis-pattern-is-not: - -What The Pattern Is Not -^^^^^^^^^^^^^^^^^^^^^^^ - -It is important, to also say what this pattern is *not*, exactly because the campaign depends on being mistaken for such things. - -**It is not criticism** - -The Reticulum community has always had lively, rigorous criticism - of decisions, of priorities, of direction - and it has always engaged that criticism on the merits, and changed course and development priorities many times. The license discussions at the time of the change were extensive, public, and answered in full, including with the critics themselves. Core protocol decisions were always discussed and evaluated in the community. The complex coordination and execution of several protocol upgrades between a loosely organised group of developers, node operators and users have succeeded surprisingly fluidly. All of these are success stories that the "critics" **always** ignore. Real criticism engages the content and accepts evidence. The campaign engages nothing. - -**It is not a community** - -Communities *build things*, maintain them, and have skin in the game; long-term users, operators of nodes, authors of real applications, people whose traffic flows through the network every day. A community has a stake. The "movement" only has an agenda. - -**It is not a debate** - -A debate has parties who evaluate arguments and evidence, and as a function of that, the debate moves forward, perpetually. The campaign's arguments, as shown above, are not designed to survive contact with answers, but to be repeated past them. You cannot debate a loop. You can decline to perform for it, though. - -.. _brandolinis-intent-and-consequence: - -Intent & Consequence -^^^^^^^^^^^^^^^^^^^^ - -While it would provide for interesting speculation, we do not need to know what the individuals in the cast *intend*, and this document will not speculate about their inner lives. People may believe their own narratives entirely, or partly, or not at all; **the pattern is the same in any case**, and the pattern is what matters here, since it is the exact thing that has been so insidiously destructive and resource wasting for the actual Reticulum project and community, ever since Reticulum was more widely discovered, popularized, and became a prime target for all sorts of grift known to man. - -The consequences are very real: - -* **Time**. The community's scarcest resource is the attention of skilled people who actually build - and maintain the network. The campaign converts that attention into reactive defence, on a cycle - with no end. -* **Harm**. Hastily machine-generated implementations, marketed as drop-in replacements and carrying - traffic onto shared networks, mislead users and can damage the network and its neighbours. - We, the actual reticulum community, all rely on these networks every day, and it is my belief - that we need to defend them. The fabricated measurements and laundered authorship examined in this chapter are not - editorial embellishments; they are the mechanism by which real users are induced to run - unverified, and often destructive software. -* **Erosion of the currency of trust**. Every manufactured scandal, every fluently polite smear, every - fabricated "movement" debases the currency of trust and degrades it for **everyone**; - including, most of all, the honest projects that come after. This is deep harm, and - it is the primary reason this chapter exists. - -Whatever the intent - profit, control, attention, or a simple, obsessive inability to stop - the mechanism is the same, and the response should be *calibrated to the mechanism as a whole*, not to the individual person acting as the current avatar for it. - -.. _brandolinis-recognition-and-response: - -Recognition & Response -^^^^^^^^^^^^^^^^^^^^^^ - -For anyone who encounters the pattern fresh, here is a proposal on how to recognise it, and what to do about it. - -**Recognition:** The pattern is recognisable in minutes, once the signs are known: - -* Claims that have been answered before, repeated as if never answered. -* The register of solemn concern applied, without exception, in one direction. -* A severe allergic reaction to answering any questions posed. -* A cast that is small, overlapping, and frequently anonymous, with the *plural form* doing the - work of plurality. -* Sockpuppet theater: The same person or footsoldiers thereof appearing as several "supporters" - (and occasionally slipping up mid-performance). -* Articles, ports, and forum threads that cite and reference each other in a closed loop. -* The immediate, reflexive turn to "bullying", "exclusion" and "toxicity" whenever a claim is refuted. -* A complete absence of engagement with the substance of the answers given, and a complete - absence of stake in the network itself. - -**Response:** A constructive response is one that is proportionate, and does not cost the -community its resources, sanity and dignity: - -* Engage the content once, on its merits (if any), with evidence, in public, and then refer to the - existing records. The answers already exist; they do not need to be re-derived for every new - bottle of piss-sour burgundy served from a man behind the curtains. I will do my best to keep this - chapter up to date with such answers and records, for easy reference, but other great resources - exist. -* Do not become part of the theater performance. The "movement" feeds on engagement in *any* form; - attention is its fuel, and outrage is as good as endorsement for them, if not better. -* Do the headcount. When the audience is reminded that a "movement" is a dozen people - recycling answered falsehoods, its projected power dissipates. The power was never real; - only the audience's own assumption of scale can make the illusion effective. A polished-looking - "ground up" implementation might look like the work of many people, but is most likely - just the result of an LLM looping on a laptop for a couple of months (this is weird, but it is - the reality we now live in). Four different users suddenly singing in unison may look like the - representatives of a broader sentiment, but is most likely the same person hiding behind the same keyboard. -* Then, spend the saved time on the networks: On building real infrastructure, putting up nodes - and antennas, on real development, real maintenance, real coexistence, and on the people - *who actually use Reticulum*. The things that we can only do *together*, as humans. That is - what the fake "movement" cannot do, no matter how fluent and smooth its productions become. - -.. _brandolinis-health-and-coexistence: - -Network Health & Coexistence ----------------------------- - -.. _brandolinis-substance: - -Substance Of The Networks -^^^^^^^^^^^^^^^^^^^^^^^^^ - -Before examining health, we should consider what is being protected. The networks are not a repository. They are not a website, a social presence, or a set of marketing pages. They are a habitat: A living commons of communication, carried by, from a catious estimate, an intermesh now consisting of over a hundred thousand physical devices, embedded in a plethora of applications and packages, transporting terabytes of traffic every single day - real messages, real coordination, real people - across radios, serial lines, phones, laptops, and backbone servers, in cities, places and ways that no other network reaches. - -The protocol belongs to humanity; no one owns it. The network belongs to everyone on it, and its membership is defined by nothing other than participation: A node on a mast, a phone in a pocket, a server routing for its neighbourhood, a developer building on the commons. The network has no gatekeepers because it needs none; it is held together by the same physics and mathematics everywhere, and by a shared expectation of how members behave. That expectation - unwritten, unenforced by any central authority, and just as important as any code - is the subject of this section. The *Zen of Reticulum* calls the software a habitat. A habitat is healthy or unhealthy as a whole, and the health of this one is decided, every day, by the people who live in it. - -.. _brandolinis-property-of-the-whole: - -Health Is A Property Of The Whole -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -A network is not made healthy by the excellence of any single part. It is made healthy by the behaviour of every part on the shared medium, and how they interact. And the shared medium is the point. When your node transmits, it transmits into the same spectrum, the same line, the same time, the same mathematical address space, the same bandwidth that its neighbours depend on. - -The network cannot be certified by any single project's claims. A node that is a bad neighbour, that invents its own channel behaviour on shared spectrum, that announces without discipline, that spawns tens of thousands of links to scrape the network, that floods and retries without mercy, is a hazard to every node that shares its medium, regardless of how well its "creator" imagines its own code to work in isolation. - -On a shared medium, "my software works" is not a complete sentence. The complete sentence is "my software works *and coexists*". A network's health deteriorates with its worst-behaved member, and every member has a responsibility to not be *that* member. There is no final, technical solution for this; the solutions are human. - -.. _brandolinis-history-of-what-works: - -A History Of What Works -^^^^^^^^^^^^^^^^^^^^^^^ - -Let's recall, because it is the ground truth this entire thing rests on, that the coexistence model has *worked* - is working, right now, **at scale**. Reticulum's protocol decisions have been discussed and evaluated in the community, openly, for years. Protocol upgrades have been designed, coordinated, and executed between a loosely organised group of independent developers, node operators, and users - and have succeeded, repeatedly, without any corporate board, without any central command, and without the collapse that the skeptics predict every second week (while screaming for *GOVERNANCE*). The reference implementation has been developed in the open for over a decade, by a maintainer who answers for it, fixes bugs or issues within hours of their discovery, and is set down in code deliberately kept small enough (the entire protocol implementation under 15,000 lines, including its comments) for a human to read, verify, *and challenge*. - -This is the empirical baseline that every narrative examined in :ref:`A Movement Of A Dozen` conveniently ignores, in order to justify: - -* The claim that the project is a one-man dictatorship -* The claim that the community is excluded -* The claim that the networks need saving from their own founders - -The **reality**, documented and reproducible, is that a loose community of humans coordinates complex technical evolution *without* the apparatus the narratives insist is missing. The health of the networks is not a promise for the future; it is a demonstrated property of the past and present, under the leadership and community model that brought it into existence and navigated it through difficult decisions and situations over a decade. **My job is to keep it that way**, and you can be damned certain that I take it seriously. - -.. _brandolinis-role-of-the-individual: - -The Role Of The Individual -^^^^^^^^^^^^^^^^^^^^^^^^^^ - -The networks are built by physical acts and human coordination. You cannot prompt an antenna into existence. No model can string up a dipole, or stand in the rain aligning a radio, or coordinate with a neighbour three valleys away about who covers which repeater frequency, or sit down with a newcomer and explain why their first node didn't announce. These are the acts that make a network *organic* - present in the physical world, resilient because it is *real*, valuable because it is *human*. The machines and technology we use are tools aimed at a well-defined, openly described goal. But the networks themself are composed of intentional human actions, and every node operator is infrastructure for other humans. - -This has a corollary for the individual: You do not need permission, and you do not need to be an expert, to participate. Run a node. Help a neighbour. Ask questions in the community, and answer the questions you can. Build something small at first. The network grows by these acts, and they are the most meaningful ones - the things that can only be done together, as humans, in the physical world. The parasitic "movement" that haunts the peripheries of this ecosystem cannot do any of this. It cannot build a node because it does not exist, in any real connected and human sense; only people can, and people are precisely what a self-recurrent loop lacks. - -.. _brandolinis-place-of-new: - -The Place Of New Implementations -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -The future of the network includes more implementations - and they are welcome. This chapter is not an argument against implementing Reticulum. The protocol is public domain, by design, and the network is made stronger by genuine diversity: More *good* implementations, honestly made, mean more resilience, more experimentation, more people who understand the protocol deeply *because they have built it themselves*. That is the goal: **For people to understand and own the technology they rely on**. Not to spew out 600,000 line rust ports that fills no meaningful gap or purpose. - -What the ecosystem needs, from every implementation, is the ordinary floor that :ref:`Evaluating A Reticulum Implementation` establishes, and that the reference has met for over a decade: A human who made it and answers for it; provenance disclosed; attribution given; benchmarks honest or absent; interop demonstrated against the real network; code a human can read. And it needs the one thing that costs nothing and changes everything: **Honest labeling**. - -An experimental implementation that says, plainly, as the first thing a user sees: "This is in-progress, experimental, do not depend on it yet, but help if you can", that is a gift to the ecosystem. It contributes, it invites participation, and it protects users. - -The opposite, the polished "drop-in replacement", does damage far beyond its own users: It dissuades the honest developers who might have built *the real thing*, because the polished slop persuades them the work is already done. That dissuasion is one of the quietest and most expensive harms in this entire affair, and the antidote is honesty at every project's door. - -.. _brandolinis-expanding-commons: - -Expanding The Commons -^^^^^^^^^^^^^^^^^^^^^ - -Coexistence, reduced to its essentials, is a short formula; the duties of membership in a network no one owns: - -* **Be honest.** Say what you are, what you built, how you built it, and what you used to - build it. Label experimental work as experimental. Credit the work you build on, including - the reference implementation, in the licenses and in the prose. Concealment is not a - defence; it is a very clear diagnosis marker. -* **Be owned.** Have a human who made the work and can answer for it. Use assistance, don't - substitute. Never sign what you cannot answer for. The chain of accountability is the - community's only verification at scale, and every link in it is a *person*, not a facade. -* **Be a good neighbour.** Respect the shared mediums. Do not invent new behaviour in our - shared space and call it progress. The network belongs to its other members as much as - to you. -* **Verify against the network.** Compatibility is a property demonstrated with actual nodes, - on actual media, against the actual current protocol, over a period of *years*, not 48 hours. - And not a claim pinned to an old snapshot over loopback. -* **Participate as a member.** Ask, answer, help, build. *Advertising at* the community is not - the same as being part of it, and it is **not** the first thing you should do. - -None of this is a high bar. It is the bar the reference implementation has met, in public, for over a decade, and the bar the ecosystem has adopted organically itself, successfully, through every protocol upgrade it has ever coordinated, and everything running on Reticulum today, that people actually use. It is not a new requirement; it is the existing, working culture of the networks, now written down so that newcomers can find it and so that those who would exploit us cannot claim they never saw it. - -.. _brandolinis-defence-of-commons: - -Defence Of The Commons -^^^^^^^^^^^^^^^^^^^^^^ - -The networks need defending - not because they are under severe physical attacks (yet), but because attention, talent and resources is being stolen from them, trust is being mined against them, and its newcomers are being harvested by the machinery documented in this chapter. Defence, for a commons, has specific shapes, and it is not what the theater would like it to be. - -* Defence is **documentation**: Records kept public, of what was claimed, what was - answered, and what turned out true. -* Defence is **a headcount**: Calm, unexcited reminders that a "movement" might just be a dozen - people having a tantrum. -* Defence is **honesty in action**: The visible, ordinary practice of the good behaviour - by the people who actually run the networks. -* And defence is **building**: Every node raised, every page of *real* documentation, every - honest implementation, every new user helped into the community with the knowledge to know - what they are doing is more durable than any rebuttal, because it adds to the thing being - defended. - ----- - -**The theatre cannot keep up with a network.** - -**It can only orbit it, while it recycles its own sour piss.** - ----- - -A lot of us rely on these networks every day. They carry our messages, our coordination, our friendships, and in some places, our safety. That is exactly why they are a target: - -They are valuable, free, and very hard to shut down. The response is not to become aggressive. It is to be *more* of what the network already is: Real, open, owned, and shared. - -*Mark* - -.. _brandolinis-prns: - -Addendum A: The Prns Case -------------------------- - -.. _brandolinis-purpose-and-scope: - -Purpose & Scope -^^^^^^^^^^^^^^^ - -This section provides a concrete example, which future evaluations can use as a template. Its purpose is not to be the last word on this particular subject, but to be an example of how the ideas in this chapter can be applied, and to make the next such examination easier. - -The subject of this case study is **Prns**, a project published at the repository ``github.com/KenAKAFrosty/Prns``, presented as a "ground-up implementation of Reticulum, written in Rust", marketed as faster, safer, and more strictly tested than the reference, widely promoted with the claim of "up to 89× the throughput" of the reference implementation, and an "author" actively engaged in the tactics described in :ref:`A Movement Of A Dozen` on online platforms. The record described below is the project's own, and sourced from its GitHub repository, analyzed locally. - -.. _brandolinis-project-in-brief: - -The Project In Brief -^^^^^^^^^^^^^^^^^^^^ - -* **Time span.** 3,374 commits between 2026-05-26 and 2026-09-12: approximately 110 days, - at a mean rate of ~31 commits per day. Monthly: 132 / 1,137 / 1,097 / 805 / 203. -* **Authorship.** 3,252 of 3,374 commits (96.4%) are authored by a single account. A - second identity, "Prns Tests tests@example.test" - a fictitious identity on a reserved - domain - contributed 35 commits, every one of them website and marketing content. -* **Size.** 3,519 tracked files; 1,983 Rust files; 636,226 lines of Rust; approximately - 22.7 MB of Rust source; 69.5 MB of total repository content. -* **Scope claimed.** A daemon ("drop-in replacement" for the reference daemon), embedded - firmware for three microcontroller families (including six ESP32-S3 board variants and - nRF52840), SDKs and bindings for nine languages, a browser-based node and web flasher, a - twelve-language website, a benchmark apparatus with its own publication and "proof" - pipeline, and a validation hub with oracles, fuzzing, mutation testing, and formal-proof - claims. -* **Marketing claims.** "Ground-up implementation of Reticulum"; "up to 89× the - throughput"; "48× smaller peak-memory footprint"; "33× the energy efficiency"; - "Measured, not just claimed"; "Enforced, then audited"; "byte-for-byte wire parity with - the reference implementation"; "works with Sideband, NomadNet, MeshChat, etc."; - "no_std (no alloc required either)". -* **Status at the time of writing.** Version 0.3.7; published version history begins at - 0.3.0. The repository continues to receive commits. - -.. _brandolinis-prns-question-1: - -Question 1: Is this a clean implementation, or was it directly generated from the reference? -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -The first of the two deciding questions from :ref:`Evaluating A Reticulum Implementation` is settled by the project's own record. An actual :ref:`clean-room` implementation, reasoned out and written by humans, would owe nothing to any license. The data available shows clearly that Prns is not that. - -* **The founding state.** The first commit, "Scaffold Personal Reticulum suite", contains - the scaffolding of not one but two ports - ``personal-rns`` and ``personal-lxmf``\ , the latter - being the reference's companion messaging protocol - together with a daemon scaffold and - a 233-line founding document, ``docs/build-ethos.md``. That document declares the project's - goal as a "performance-focused drop-in-replacement for rnsd" and its governing principle - as: "Port the contract, not the implementation." It further states directly to the - machine-loop, that **"You owe the reference fidelity at exactly two boundaries: - The wire... The behavior. ... Between those two boundaries, the model is yours"**. - At this point, the very first commit, effectively the whole of the implementation design - and any relevant decisions are handed over to the LLM. -* **Continuous ingestion from the reference.** 506 commits reference RNS or Reticulum - source behaviour; the word "parity" appears in 49 commit messages. Commits cite the reference - implementation's own source locations (for example ``Transport.py:1367``) when correcting - their own divergences and mistakes. -* **Byte-level fidelity as an explicit goal.** Within 48 hours of the first commit, the - record shows a "crypto adapter - vetted primitives, byte-exact vs RNS 1.3.1", and a wire - implementation matching the reference's packet header layout. The project's own - validation apparatus decodes wire vectors using the reference implementation's own - packet parser, and the interop suite consists of real, stock-RNS peer nodes - that is, - the reference source itself, used as the ground truth against which this LLM output is - checked, and committed as accepted and verified after 48 hours of the project's recorded start. -* **The marketing mismatch.** The same record that documents all of the above describes the - project, publicly, as "a ground-up implementation of Reticulum" - while declining, on its - website, to link to the reference implementation at all: the entire tree mentions the - reference's author in six files, and the website in none. - -Conclusion: the project's own history and commit record establishes that it was generated directly from the reference implementation's source code, not reasoned out from the public-domain protocol. It is a derivative of licensed work within the meaning of :ref:`the Reticulum License` and :ref:`general copyright law`. The "ground-up" claim, which carries its entire legal and marketing posture, is disproven by the project's own history. - -.. _brandolinis-prns-question-2: - -Question 2: Who, or what, is the agent of the work? -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -The second deciding question is answered by the application of :ref:`Assistance Versus Machine Substitution` criteria to the project. - -**Scope that no human could have authored** - -636,226 lines of Rust in 110 days is approximately 5,800 lines per day, every day, including weekends - with 149 commits recorded between midnight and 06:00, and Saturday the single busiest weekday. No human review or decision capacity is commensurable with this volume; the review capacity and the output volume are structurally incommensurable, which is the definition of unauthored scope. - -**Uniform generation** - -The record shows no sign of human development, growth, or learning: No contested decisions, no style drift. Instead: endless renaming (in the first 48 hours: ``State → EngineState → TickInput → TickOutput``\ ), uniform fluent register in every commit, and the exact same, synthetic voice in code, documentation, and website copy. - -**Discovery by regeneration** - -Corrections arrived by the machine's own subsequent runs, recorded as planned milestones. In early July 2026, a series of "core review" commits documented, in the project's own words: - -* announce-ID history "was unbounded per-slot growth" (\ ``54cc8d601``\ ); -* interface announce limiting could "leak a sustained flood" (\ ``9d27af75c``\ ); -* a "phantom-airtime leak" where frames "used to vanish silently" (\ ``4ed75ffdd``\ ); -* Group-packet deduplication "which RNS does not do" - a behaviour the reference never had, - implemented and later removed (\ ``edd8e72be``\ ); -* "both ``unwrap_or(&[])`` arms were unreachable dead defaults" (\ ``74bea355e``\ ); -* a benchmark crate "hasn't compiled since" a prior rename, undetected for weeks because it - was outside the CI's workspace (\ ``86240b027``\ ). - -Earlier still: the record shows a ">1 MiB RNS-to-Prns interop stall" closed three weeks in -(\ ``cc4d524a3``\ ), and a known send-path hang shipped with the note "typed fast-fail a -candidate for later" (\ ``a010e6613``\ ). - -**Laundered provenance** - -The repository contains a committed commit-message hook (\ ``.githooks/commit-msg``\ ) that *blocks* any commit containing attribution for machine generation ("generated with claude/codex/copilot/cursor/gemini", "co-authored-by"), with the explanation "The committer owns the commit". The contributing guide is explicit: "AI tools ... are welcome ... what you submit is *yours*", and describes the contributing population as "both human and automated contributors". The fictitious "Prns Tests" identity completes the picture: A manufactured, unknowable contributor, used for marketing content. - -**Authorship by assignment** - -The human whose name is on the work cannot answer for it, because the choices were never made by a human, and only the general shape and constraints of the outward presentation was. Nothing in the project's history shows an individual explaining a design decision, accepting a mistake in the first person, or going deeper under technical questioning; the record shows process language and marketing instead. Per the earlier mentioned test: any other person could have pressed the same button, and nothing would be different. The project is effectively unowned, and void of value. - -By the criteria of :ref:`Assistance Versus Machine Substitution`, this is substitution. The machine was the agent of the work; the "author" was a facade. - -.. _brandolinis-prns-performance: - -The performance claims -^^^^^^^^^^^^^^^^^^^^^^ - -The project's central marketing claim - "up to 89× the throughput" of the reference - is also its most completely documented failure, because the project published the evidence of its own measurement. The apparatus, the results, and the problems are all on the record. - -**The claim** - -The README states "up to 89× the throughput"; the on-network marketing page repeats "up to 89× the throughput, 48× smaller peak-memory footprint, and 33× the energy efficiency of stock RNS 1.4.2"; the website's front page carries the tagline "Measured, not just claimed". - -**The apparatus** - -The reference is loaded through ``benchmarks/reference/compiled_reference.py``\ , which installs ``pyximport`` and then asserts two things: that ``RNS.compiled == True``\ , and that at least *one* RNS module was loaded from a native extension. The project's own published "proof" records show exactly what those checks captured, on every platform: - -.. code-block:: - - aarch64-apple-darwin: .../RNS.cpython-313-darwin.so, Cython 3.2.8, Python 3.13.13 - x86_64-unknown-linux-gnu: .../RNS.cpython-313-x86_64-linux-gnu.so, gcc 11.4.0 - x86_64-pc-windows-msvc: ~/.prns-oc/lib.win-amd64-cpython-313/RNS.cp313-win_amd64.pyd - -In every case the recorded native module is the **top-level package only** - ``RNS.so``\ , nothing below it. Nothing named ``RNS.Transport``\ , ``RNS.Destination``\ , ``RNS.Packet``\ , ``RNS.Link``\ , or ``RNS.Resource`` ever appears, because *nothing below the top level was ever compiled*. Nobody bothered to check or verify *anything* here. - -The machine output was simply taken for truth, and a full marketing strategy was spun and produced on it. "RNS 1.4.2 (compiled)" - the label used in every table, chart, and marketing page - *is not a mode of RNS that exists*, but the hallucinations of a machine, which the humans created a marketing strategy on. In reality, it is the old ``CRNS`` development shim, whose top-level-only, debug-oriented "compilation" is slower than plain interpreted RNS, and which was *defunct for over a year* before these benchmarks were published. - -**Interface choices** - -The harness writes the reference's configuration itself (\ ``benchmarks/reference/participant_node.py``\ ): ``TCPClientInterface`` for the initiator, ``TCPServerInterface`` for the responder and both relay sides, with ``UDPInterface`` as the abstract wire. The reference was never given its modern ``BackboneInterface`` on any platform, forcing the slowest possible interrfaces. The interface selection is never mentioned in any methodology text. - -**The policy** - -The published default-policy tables record the asymmetry directly: Prns at 500 Mbps / 128 KiB TCP policy against the reference at 10 Mbps / 8 KiB - slyly footnoted as "preserves each implementation's normal TCP policy" (in the case of RNS, a conservative default policy that was selected to prioritize coexistence on slower, shared links, requiring the user to dial it up to full speed if they knew what they were doing). Raw transport "throughput" ratios of 20.65× (Linux) and 38.84× (Windows) are therefore mostly policy, not engine. - -**The cross-host evidence** - -The published results show the same scenario producing wildly different ratios by host, and the variance is entirely in the reference artifact: - -.. list-table:: - :header-rows: 1 - - * - Host - - Prns, single-packet - - "Reference", single-packet - - Ratio - * - macOS (Apple M4) - - 37.4k/s - - 420/s - - 89.09× - * - Linux (i7-1260P) - - 25.3k/s - - 3.5k/s - - 7.19× - * - Windows (Ryzen 5 5600X) - - 30.8k/s - - 3.9k/s - - 8.00× - -Prns is consistent (25–37k/s). The reference artifact collapses to different depths on different hosts, and the single worst collapse - 420 packets per second on macOS - is the cell selected as the global headline. The "89×" is not a measure of Prns; it is a measure of how badly the broken baseline happened to fail on one host. - -For reality calibration: Stock, interpreted RNS 1.5.4 on an ordinary mid-range laptop, single core, sustains roughly 30,000 single-packet deliveries per second (including ephemeral-key decryption), ~175,000–280,000 packets per second in transit relay, and on the order of 10 Gbps at 16 KiB payloads. The project's "compiled" artifact measured 420–3,900 packets per second for its single-packet scenario: An order of magnitude or more *below* stock interpreted RNS. The comparison being marketed was not "Rust vs Python"; **it was "an implementation running under optimal conditions versus a mislabeled, broken shim on a slow legacy interface at a severe policy disadvantage"**. - -**The equalized rows** - -The project's own "1 Gbps policy" rows, in which both sides are explicitly configured identically, publish ratios of roughly 2.4–8.4× across all hosts and scenarios - still against the broken baseline, but nowhere near 89×, and consistent with the ordinary, uncontroversial observation that a native implementation tends to outperform an interpreted one in raw throughput. That point needed no fudging to make, and is banal. - -Interestingly, though, it seems that Prns is really only *marginally* faster than a Python implementation, running in interpreted mode, on a single CPU core. - -**Assessment** - -The front page says "Measured, not just claimed." The record shows the opposite ordering: claimed, and arranged to look measured. No methodology section anywhere states what "compiled" means, that it is a deprecated development shim, that it builds debug targets, or which interface the reference was given; the one statement of the policy asymmetry appears in a footnote of the results tables themselves. If they did not need to fudge it, they would have published the method clearly. - -.. _brandolinis-prns-overall: - -Overall Evaluation -^^^^^^^^^^^^^^^^^^ - -Evaluated against the conditions of :ref:`Evaluating A Reticulum Implementation`: - -* **Provenance and attribution.** Fails: The fake "ground-up" origin story; zero reference links - on the website; a single well-hidden link in the README; a license file reading - ``Copyright (c) 2026 The Prns Authors`` over work directly generated from the licensed reference; - no original copyright or permission notice anywhere. -* **Agency and answerability.** Fails on every criterion of :ref:`Assistance Versus Machine Substitution`: - Unauthored scope, uniform generation, discovery by regeneration, laundered provenance, - authorship by assignment. -* **Engineering.** Fails: The benchmark apparatus above; interop demonstrated only - against a pinned, outdated reference version over loopback while the marketing claims current - parity, interop failures with stock RNS; vendored prebuilt binaries and a republished fork - of an upstream crate (``nrf-softdevice 0.1.0-prns.1``) with no verifiable provenance; - committed WASM bundles. -* **Network behaviour.** Fails: Invented spectrum behaviour and compatibility claims - about third-party applications of the reference ecosystem (Sideband, NomadNet, MeshChat) - that are not established by any evidence. -* **Monetary and influence signals.** The marketing apparatus - website before protocol, - day-three twelve-language marketing, false benchmark headlines, "audited" and "formal proof" - claims - the conformal surface described in :ref:`Evaluating A Reticulum Implementation`: - is where this project invested. - -.. _brandolinis-prns-licensing: - -Licensing Analysis -^^^^^^^^^^^^^^^^^^ - -Applying the two legal layers established in :ref:`Copyright & The Two Legal Layers`: - -**Layer A - copyright infringement (license-independent)** - -The record shows a direct copy roundtrip: the licensed reference implementation fed into a machine, transformed, at a scale and cadence no human could review, with a license file asserting a fresh copyright in the operator's name and no acknowledgment of the work the project was generated from. No substantial, new human creative input is demonstrated anywhere in the record - the founding document explicitly frames the design as an instructed port of the reference's contract. A primarily machine-generated copy of a copyrighted work, not accompanied by demonstrable substantial human creative input, is a derivative work over which the copier holds no copyright, and a reproduction of which without the original author's permission infringes the original author's copyright. This holds under any license, MIT included. The operator's copyright claim over the result is, on this evidence, not merely unsubstantiated; it is the absence of one, directly asserted in the project's own writing. - -**Layer B - license conditions (Reticulum License specific)** - -Modern Reticulum - the current wire format, the AES-256-based link encryption, ratchets, the cryptographic machinery as it exists today - has been published under the Reticulum License since April 15, 2025, effective from release 0.9.4 and every release since. As a derivative of that work, the license's conditions attach: The copyright and permission notice must be included in all copies and substantial portions; the AI-training condition must be honoured; the harm condition must be honoured. The record shows none of the notice requirements met, and a production process that consists of the licensed work being ingested into a machine and regurgitated, at industrial scale and cadence. - -**The cascading consequence** - -Prns is distributed claiming dual MIT/Apache-2.0 licensing. It is, however, a direct derivative of Reticulum-licensed work, and the claimed grant is therefore void. Every downstream project that builds on Prns believing it is MIT/Apache-licensed is building on a grant that does not exist. The users of Prns, and all software developers using it, have in effect, been placed under conditions they were never told about. The "ground-up" claim is not merely false; it is the sole load-bearing element of an entire licensing posture, and it fails spectacularly. - -.. _brandolinis-prns-consequences: - -Consequences -^^^^^^^^^^^^ - -The consequences of this pattern are examined in the following sections: The harm to users and to the network in :ref:`A Movement Of A Dozen`, and the human dimension in :ref:`Network Health & Coexistence`. The contribution of this addendum is narrower and intended as an instructive example: This is what a substitution project looks like, in full, on its own record. It is a reference example for :ref:`Evaluating A Reticulum Implementation`, and it demonstrates, in one case, most of the elements this chapter describes. - -.. _brandolinis-prns-verdict: - -Verdict -^^^^^^^ - -Applying the three verdicts of :ref:`Evaluating A Reticulum Implementation`, this project does not meet the standard. It is not "experimental but honest" - it is not labeled as experimental anywhere; the first thing users saw was a polished marketing presence promising a finished, tested, drop-in replacement. It is a project whose central claims are fabricated (the performance apparatus), whose provenance is laundered (the authorship machinery), whose foundation is misrepresented (the "ground-up" story), whose core semantics were learned late and by regeneration, and whose operator cannot possibly answer for any of it. It is also a blatant copyright violation of the reference implementation. - -The proposed conclusion, for users and for the network: Treat the Prns project as hostile regardless of its polished surface, and as a hazard insofar as it invites users onto shared networks. Nothing in this section is a judgment about the people involved; it is a reading of the results produced, their history and how they came to be, which in the regrettable lack of any human authorship is the only thing that can be expected to be held to account. - -.. _brandolinis-prns-dating: - -Dating -^^^^^^ - -This examination reflects the publicly available material as of September 2026; the repository in question continued to receive commits at the time of writing, so readers should treat citations to commits and files as point-in-time evidence. A `forensics snapshot `_ is publicly available on GitHub. diff --git a/docs/manual/_sources/gettingstartedfast.rst.txt b/docs/manual/_sources/gettingstartedfast.rst.txt index b5c068ef..8fc426fc 100644 --- a/docs/manual/_sources/gettingstartedfast.rst.txt +++ b/docs/manual/_sources/gettingstartedfast.rst.txt @@ -163,11 +163,7 @@ A global, distributed backbone of Reticulum Transport Nodes is being run by volu As a good starting point, you can find interface definitions for connecting your own networks to this backbone on websites such as `directory.rns.recipes `_ and `rmap.world `_. .. tip:: - Don't rely on just a single connection to the distributed backbone for everyday use. It is much better to have several redundant connections configured, and enable the interface discovery options, so your nodes can continously discover peering opportunities as the network evolves. - - But don't overdo it either! Auto-connecting to a hundred different nodes will waste capacity for node operators and not provide any benefit for yourself either. - - Refer to the :ref:`Discovering Interfaces` section to understand the options. + Don't rely on just a single connection to the distributed backbone for everyday use. It is much better to have several redundant connections configured, and enable the interface discovery options, so your nodes can continously discover peering opportunities as the network evolves. Refer to the :ref:`Bootstrapping Connectivity` section to understand the options. diff --git a/docs/manual/_sources/git.rst.txt b/docs/manual/_sources/git.rst.txt index c40fcdfc..6cedd1b0 100644 --- a/docs/manual/_sources/git.rst.txt +++ b/docs/manual/_sources/git.rst.txt @@ -8,16 +8,6 @@ This chapter of the manual serves as the technical reference for the distributed A set of utilities for distributed collaborative software development and publishing are included in RNS. -.. only:: html - - .. image:: screenshots/rngit.webp - :align: center - -.. only:: latex - - .. image:: screenshots/rngit.png - :align: center - The system consists of two parts: The ``rngit`` node that hosts repositories, and the ``git-remote-rns`` helper that enables Git to communicate with rngit nodes. As soon as you have RNS installed on your system, you can transparently use Git with Reticulum-hosted repositories just like any other type of remote. Git over Reticulum uses URLs in the following format: ``rns://DESTINATION_HASH/group/repo``. If you set a branch to track a Reticulum remote as the default upstream, you can simply use ``git`` as you normally would; all commands work transparently and as expected. @@ -143,9 +133,6 @@ To create a new empty repository on a remote node: This creates a bare Git repository at the specified path. You must have ``create`` permission for the target group. When a repository is created, the creator automatically receives ``adm`` (admin) permissions on the repository through an auto-generated ``.allowed`` file. -.. tip:: - If you want to use a different primary branch name than ``master``, you can change it inside the bare git repository directory with ``git symbolic-ref HEAD refs/heads/name_of_other_branch``. - **All Command-Line Options (rngit create)** .. code:: text @@ -621,7 +608,7 @@ To enable the page node, add the following to your ``~/.rngit/config`` file: .. code:: text [pages] - serve_nomadnet = yes + serve_nomadnet = yes When the page node is enabled, ``rngit`` will listen on a Nomad Network node destination in addition to the Git repository destination. You can view the destination hash by running: @@ -634,15 +621,6 @@ When the page node is enabled, ``rngit`` will listen on a Nomad Network node des Repositories Destination : <0d7334d411d00120cbad24edf355fdd2> Nomad Network Destination : <50824b711717f97c2fb1166ceddd5ea9> -You can configure the destination stamp value and required link establishment cost with the following options: - -.. code:: text - - [pages] - serve_nomadnet = yes - stamp_value = 25.0 - link_cost = 18.0 - Accessing Repository Pages -------------------------- @@ -705,7 +683,6 @@ The following template files are supported: - ``commit.mu`` - Individual commit detail page - ``refs.mu`` - Branches and tags listing - ``stats.mu`` - Statistics page -- ``no_ident.mu`` - Displayed to non-identified initiators if blocked Templates can include the following variables: @@ -726,8 +703,8 @@ By default, the page node uses Nerd Font icons. If you prefer simpler icons or y .. code:: text [pages] - serve_nomadnet = yes - unicode_icons = yes + serve_nomadnet = yes + unicode_icons = yes Repository Statistics --------------------- @@ -755,8 +732,6 @@ A complete node configuration might look like this: node_name = My Git Node announce_interval = 360 record_stats = yes - stamp_value = 27.5 - link_cost = 18.5 [repositories] public = /var/git/public @@ -769,8 +744,6 @@ A complete node configuration might look like this: [pages] serve_nomadnet = yes unicode_icons = no - stamp_value = 27.5 - link_cost = 18.7 Verified Releases diff --git a/docs/manual/_sources/index.rst.txt b/docs/manual/_sources/index.rst.txt index 53a25f88..d00efa5c 100644 --- a/docs/manual/_sources/index.rst.txt +++ b/docs/manual/_sources/index.rst.txt @@ -23,7 +23,6 @@ to participate in the development of Reticulum itself. zen software using - protecting understanding hardware interfaces @@ -33,7 +32,6 @@ to participate in the development of Reticulum itself. support examples license - brandolinis .. toctree:: :maxdepth: 2 diff --git a/docs/manual/_sources/interfaces.rst.txt b/docs/manual/_sources/interfaces.rst.txt index feeda507..9a9374a8 100644 --- a/docs/manual/_sources/interfaces.rst.txt +++ b/docs/manual/_sources/interfaces.rst.txt @@ -230,8 +230,6 @@ specify the target Yggdrasil IPv6 address and port, like so: target_host = 201:5d78:af73:5caf:a4de:a79f:3278:71e5 target_port = 4343 -.. _interfaces-fastflap: - Automated Blocking ------------------ Listener instances of ``BackboneInterface`` will automatically block fast-flapping clients, @@ -967,6 +965,13 @@ Reticulum includes a powerful system for publishing your local interfaces to the When an interface is made **discoverable**, your Reticulum instance will periodically broadcast an announce packet containing the connection details and parameters required for other peers to establish a connection. These announces are propagated over the network using the standard Reticulum announce mechanism using the ``rnstransport.discovery.interface`` destination type. +.. note:: + To use the interface discovery functionality, the ``LXMF`` module must be installed in your Python environment. You can install it using pip: + + .. code:: sh + + pip install lxmf + Enabling Discovery ------------------ @@ -1481,11 +1486,11 @@ but all the parameters are exposed for configuration if needed. sub-interfaces when a new client connects. * | The ``ic_burst_freq_new`` option sets the maximum announce ingress - frequency for newly spawned interfaces. Defaults to ``3.0`` + frequency for newly spawned interfaces. Defaults to ``3.5`` announces per second. * | The ``ic_burst_freq`` option sets the maximum announce ingress - frequency for other interfaces. Defaults to ``10.0`` announces + frequency for other interfaces. Defaults to ``12`` announces per second. *If an interface exceeds its burst frequency, incoming announces @@ -1494,21 +1499,21 @@ but all the parameters are exposed for configuration if needed. * | The ``ic_max_held_announces`` option sets the maximum amount of unique announces that will be held in the queue. Any additional - unique announces will be dropped. Defaults to ``64`` announces. + unique announces will be dropped. Defaults to ``256`` announces. * | The ``ic_burst_hold`` option sets how much time (in seconds) must pass after the burst frequency drops below its threshold, for the - announce burst to be considered cleared. Defaults to ``15`` + announce burst to be considered cleared. Defaults to ``60`` seconds. * | The ``ic_burst_penalty`` option sets how much time (in seconds) must pass after the burst is considered cleared, before held announces can - start being released from the queue. Defaults to ``15`` + start being released from the queue. Defaults to ``5*60`` seconds. * | The ``ic_held_release_interval`` option sets how much time (in seconds) must pass between releasing each held announce from the queue. Defaults - to ``5`` seconds. + to ``30`` seconds. All of the above settings can be configured both as instance-wide defaults under the ``[reticulum]`` section of the configuration file, or on a per- diff --git a/docs/manual/_sources/protecting.rst.txt b/docs/manual/_sources/protecting.rst.txt deleted file mode 100644 index 08245dd5..00000000 --- a/docs/manual/_sources/protecting.rst.txt +++ /dev/null @@ -1,405 +0,0 @@ -************************ -Protecting Open Networks -************************ - -.. important:: - Reticulum is currently transitioning towards full, on-network stamp verification and enforcement via a phased transition: - - - The ``1.6.0`` release completely implements the required mechanisms, and will start excercising the verification system in the transport backend. By default, ``1.6.0`` does not enable full stamp generation, emission and enforcement, but all of these options can be early-enabled in the configuration. - - - The ``1.6.1`` release will enable full stamp generation and emission of all types by default, but will leave the *enforcement* a configurable option. - - - The ``1.6.2`` release will complete the transition, activating full stamp enforcement across all the systems. - - The stated version numbers are the *intended* release sequence. If any issues or implementation problems are found during the initial network deployments, the transition points may be pushed later than this plan by interim releases. - -While you can create entirely closed-off and private networks with Reticulum, the protocol itself is open and permissionless. On widely interconnected networks, anyone can create identities and globally reachable destinations without external permission or approval, and establish links anonymously over the network. - -Such capabilities are powerful, and a required characteristic of a truly functional communications fabric, but also raise very large challenges, that have been almost impossible to solve in legacy networking technologies. - -Reticulum approaches this particular problem, like most others, by employing cryptographic principles. This provides a comprehensive, multi-layered repertoire of defense mechanisms, which can be composed and employed in very effective ways. - -In contrast to other networking paradigms, these mechanisms do not have to be bolted on to the application layer in hindsight, but are a core part of the protocol itself, which means that they can be applied universally and effectively: - - All nodes help combat spam and network abuse, according to the rules *set by the actual owners of supplied resources* - not by any bureaucracy or external authority. - - Rules and requirements can be adjusted live, dynamically and directly, and by those that actually operate and run the infrastructure and services. - -The system has been designed so that it becomes very cheap computationally for resource-providing nodes to verify or reject traffic, and very expensive for malicious nodes to abuse the shared resources provided by the network's operators. - - -Cryptographic Stamps -==================== - -All networking primitives that consume shared network resources are gated by *stamps*. A stamp is compact, cryptographic token that proves that a certain amount of computation and energy has been expended in its creation. - -The amount of such computation required for a stamp to be considered valid can be configured individually by the operator of the resource being made available, whether that is network transport, a node providing information for retrieval, a shared voice room, or something else entirely. - -While the core functionality is completely automatic, and handled by Reticulum itself, the primitives are made available at the application layer API as well, so that developers can use them to implement further protections, if required by their usage scenarios. In most cases, however, simply setting the target *values* and required *costs* for the built-in mechanisms will be sufficient. - -The *value* of a stamp is a decimal representation of how difficult a stamp was to create, on a scale from ``0.0`` to ``100.0``. The scale is **exponential**. An increase of one point is equal to *doubling* the average compute time required. Fractional values are supported, such as ``14.125``. - -Internally, the fractional part is quantized to ``256`` different values, giving an approximately ``0.27%`` difficulty increase per step. You can use any decimal number when configuring stamps, such as ``9.3691`` and you do not have to worry about "landing on" the correct step values. Reticulum will automatically handle the quantization, wire-transport representation and value comparisons. - -The term *cost* is used everywhere a stamp value *requirement* is configured or specified. In general, *value* refers to the actual, determined value of a given stamp, *cost* refers to a value requirement. - -Base Primitives ---------------- - -Reticulum provides two types of base stamp primitives: - - * **Detached stamps** can be tied to any external information, and are useful for stamping both static information and for one-time verification purposes. The stamp itself is a detached, short binary sequence, typically 14 to 32 bytes, that can be verified directly against the stamped material. - - They can be configured from relatively easy to compute, even for embbedded systems and microcontrollers, all the way to something that is practically impossible, even with all the compute and memory on the planet. - - * **Embedded stamps** are tied directly to a Reticulum Identity keyset, and embedded within it. The keyset itself *contains* the stamp, and there is no external, detached byte sequence for them. - - Anyone can verify the value of an identity-embedded stamp simply from the public key material of the identity. - -On-Network Types ----------------- - -The base primitives are used to implement scenario-specific network-level primitives that, if configured correctly, make spam and network abuse expensive, but validation and enforcement cheap and efficient. - - * **Destination Stamps** are detached stamps associated with reticulum destinations. They are included in all announces sent by a destination, and by verifying that their value matches a transport node's cost requirement, they can be either accepted for rebroadcast onto the network, or rejected and dropped. - - Destination stamps are *one-time* generations, and are reusable across announces. They limit the number of *new* destinations that can be created, and makes it expensive to spam a network with destinations that do not provide anything meaningful. As such, these stamps will typically target relatively high values, and their cost requirements should be set accordingly. - - A generation time for such stamps in *minutes* rather than seconds can very well be reasonable on large, open-access networks. Due to their detached nature, they can also be pre-generated off-device (and do not require the private key material for generation), so that even low-powered nodes, such as microcontrollers, can use high-value destination stamps, by having them generated and loaded externally as a one-time procedure. - - * **Path Request Stamps** are also detached stamps, but generated *individually* for every path request emitted on the network. These will typically have a much lower cost requirement than destination stamps, but if a node is overwhelmed by path requests, it can be tuned higher. - - The stamp is generated against the individually unique *emission*, so that unstamped or low-value path requests for a destination cannot disrupt the resolution of legitimate ones toward that same destination. - - * **Link Request Stamps** are embedded stamps, carried in the ephemeral link request keyset. They are therefore completely transparent to the network, but can still be verified extremely quickly by any node along the link request path, who can then make a decision on whether or not to transport it. - - Link request cost targets are set by the *endpoint destinations individually*. Every destination that includes a stamp in its announces will also include link request cost signalling. This means that any node that hears an announce from the destination will also know what link request stamp value to target, when establishing links to that destination. - - Furthermore, spam and link request abuse can be filtered before even reaching the destination, if at least one node along the path validates the link request stamp value and cost requirement. - -All of the stamp primitives, functionality and on-wire signalling is *transparent and backwards-compatible* with older versions of Reticulum transport nodes. This means, that even if a node doesn't itself understand stamp functionality, it will still transport all the required information. Stamped announces, path and link requests can cross older, non stamp-aware network segments transparently and unaffected. - -.. _stamps-configuring: - -Configuring Stamps ------------------- - -Reticulum, and its included utilities, provide sane default cost requirements and value targets for the different types of network stamps, but it is entirely up to the operator whether to follow the defaults. All of them are configurable on a per-node, per-application and per-destination basis. - -Instance Configuration -^^^^^^^^^^^^^^^^^^^^^^ - -In reality, different kinds of networks will want to configure different kinds of costs and value targets for their use. For instance-wide defaults and settings, you can configure these in the ``[stamps]`` section of the Reticulum configuration file: - - * | The ``destination_cost`` option sets the default required stamp - cost for announced destinations to be accepted, and have their - announces propagated by this node. Defaults to ``23.5``. - - * | The ``destination_value`` option sets the default stamp value that - this instance will target when generating new destination stamps. - An application can request higher targets for destinations that it - creates, but a requested lower value will always be clamped to the - configured default as a minimum. Defaults to ``25.0``. - - *Destination stamps are one-time generations per destination, so it - is generally a good idea to target a slightly higher value than the - minimum required cost of the networks you want the destination to - be reachable on.* - - * | The ``pr_cost`` option sets the required stamp cost for incoming - path requests. Defaults to ``15.8``. - - * | The ``pr_value`` option sets the target stamp value for path - request stamps generated by this instance. Defaults to ``15.8``. - - * | The ``lr_cost`` option sets the default link request stamp cost, - that destinations created on this instance will require. This - value can be freely overridden by applications that specify their - own link request cost requirements, and is solely used as the - default if no such specification is provided. Defaults to ``12.5``. - - * | The ``lr_stamp_timeout`` and ``pr_stamp_timeout`` options set the - maximum amount of time, in seconds, to spend while attempting to - generate link and path request stamps respectively. If a stamp is - not generated within this timespan, the generation is cancelled, - and the link request or path request fails. Defaults to ``15`` - seconds for both options. - - * | The ``stamp_destinations`` option enables generation and emission - of destination stamps in announces. This is a transitory option. - It will become mandatory and enabled by default in RNS ``1.6.1``. - - * | The ``stamp_prs`` option enables stamping of path requests emitted - by this instance. This is a transitory option. It will become - mandatory and enabled by default in RNS ``1.6.1``. - - * | The ``always_stamp_lrs`` option will stamp *all* outgoing link - requests, even to destinations that have not announced a link - request cost (and will, in that case, use the configured or - default link request cost). This option is mostly useful for - testing and diagnostics. In general use, Reticulum will handle - link request stamping and cost targets automatically. - - * | The ``enforce_stamps`` option allows early activation of stamp - enforcement. When enabled, announces and path requests that do - not meet the configured cost requirements are dropped, and link - requests with insufficient stamps are ignored. This is a transitory - option. It will become mandatory and enabled by default in RNS - ``1.6.2``. - -An example of customised stamp cost and value configuration follows below: - -.. code:: ini - - [stamps] - stamp_destinations = yes - stamp_prs = yes - - destination_cost = 24.8 - destination_value = 26.25 - - pr_cost = 15.8 - pr_value = 16.45 - -Stamp cost requirements can also be configured on a per-interface basis: - -.. code:: ini - - [[Public Gateway]] - type = BackboneInterface - mode = gateway - listen_on = 0.0.0.0 - port = 4242 - - destination_cost = 25.0 - pr_cost = 17.2 - - [[Local RNode]] - type = RNodeInterface - port = /dev/ttyUSB0 - - # Much lower requirements - # for the local network. - destination_cost = 11.2 - pr_cost = 5.0 - -For Developers -^^^^^^^^^^^^^^ - -Applications can dynamically set their own stamp values and required link requests costs at runtime. Whenever the values are adjusted, the destination will have to send an announce for the updated information to become known by the rest of the network. - -If you are setting these values at destination creation time, ensure that they are set *immediately* after the destination is instantiated, as Reticulum may queue internal, instance-local announces for the destination shortly after creation, so that the local shared instance and its clients are aware of the newly created destination. - -.. code:: python - - # Create a new destination - my_destination = RNS.Destination( - my_identity, - RNS.Destination.IN, - RNS.Destination.SINGLE, - "myapp", "service" - ) - - # Configure stamps - my_destination.set_value(30.0) - my_destination.set_link_cost(15.0) - -Dynamically adjusting link request costs is a viable and intended mechanism for mitigating resource abuse, scraping, DoS attempts and other malicious behaviour. An application may implement mechanisms to statically or dynamically raise link request costs under certain conditions. - -.. tip:: - Remember here, though, that announce cadence should be preserved for such situations! If your destination is announcing too often in general, and wants to dynamically adjust link request costs at a critical moment, it may already have exhausted its announce rate limits on upstream nodes. So plan your application's announce cadence thoughtfully! - -It is also possible for application code to directly get the destination value and link request cost for any known destination: - -.. code:: python - - # Get the value of a known destination - RNS.Identity.recall_stamp_value(destination_hash) - - # Get the current link cost requirement - # of a known destination - RNS.Identity.recall_link_cost(destination_hash) - - -An ``Identity`` can be created with an embedded stamp value, by passing the target value at instantiation time: - -.. code:: python - - # Create a new, stamped identity - my_identity = RNS.Identity(value=24.0) - - # Get the value of any known identity - another_identity.get_value() - -As with destination stamps, this is a one-time generation procedure, that happens at Identity creation. Once an identity is created with an embedded stamp, its value *cannot* be upgraded at a later point as with detached stamps. - - -Filtering & QoS -=============== - -In addition to the stamp functionality explored above, Reticulum includes filtering options that allow operators to explicitly deny or allow certain destination *types* across an entire instance. - -After filtering, all packets that are ultimately allowed into the transport engine, are sorted into prioritized QoS queues, which are drained and processed in priority order. - -This provides a powerful system for both filtering, classifying and ensuring latency and service quality for the traffic and application types a node operator wants to provide. - -Instance Configuration ----------------------- - -The filtering subsystem can operate in two modes: - - * | **Ignored Mode** will allow any destination type in the instance, *except* for those that have been explicitly added to the ``ignored_types`` list. This mode is useful for blocking the traffic of specific destination types from being transported across the instance. - - * | **Required Only Mode** will allow *only* the destination types explicitly defined as required, and ignore *all* other types. A base set of required destination types can be defined instance-wide in the ``allowed_types`` list. - - | In addition, any application using the shared instance can temporarily request required destination types for its use. Applications that request required destination types will automatically have them granted, unless they are included in the ``ignored_types`` list. - -The filtering defaults and base settings are configured in the ``[filter]`` section of the configuration file. For example, it is possible to explicitly ignore a series of destination types, while also limiting hop reach to a more local topology. - -.. tip:: - The ``hop_limiter`` in the filter section is an instance-wide setting. You can also use the ``hop_limiter`` option *per-interface* if you want to limit hops on some interfaces only. - -If you do not know the human readable destination type aspects for a destination type you want to ignore, you can also add entries as 10-byte (20 hexadecimal character) hashes using the ```` format. - -.. code:: ini - - [filter] - hop_limiter = 14 - ignored_types = application.that.spams, traffic.heavy.service, - -In some situations, you may want to allow *only* certain destination types. If, for example, you are creating a high-performance transport node intended to handle thousands of simultaneous voice calls at minimal latency, a configuration might look something like: - -.. code:: ini - - [filter] - required_only = yes - allowed_types = lxst.telephony - -The filtering subsystem provided in RNS ``1.6.0`` is functional and useful, but at an early stage, and relatively basic. In the upcoming releases, it will be expanded into a much more comprehensive and flexible system, that will include custom QoS and traffic class tagging, advanced rule definitions and more. - -.. important:: - As the filtering and QoS system is developed and matures, the ``required_only`` mode will become the default operating mode for non-transport instances, since applications can already now dynamically request what destination types they are interested in. - - This ensures that a local, non-transport node (running on resource-limited hardware, for example), does not have to process announces for, and waste CPU and memory on destination types that are completely irrelevant to it. It also greatly reduces power consumption on battery-powered and mobile devices, while they are connected to large and busy networks. - - If you are a developer, see the following section. - -Blocking Transport Nodes ------------------------- - -Misbehaving, spamming and broken transport nodes can be completely blocked using the :ref:`Blackhole system`. First, obtain the Transport Identity hash of a misbehaving transport node, using ``rnstatus``: - -.. code:: txt - - $ rnstatus -FATa "71.29.190.5" - - BackboneInterface[Client on Bern IPv4/71.29.190.5:37062] - Status : Up - Mode : Gateway - Rate : 250.00 Mbps, MTU 65536 - Running : Unknown implementation - Rem.Tr.ID : - Held : 64 announces - Violatns. : 382 protocol - Flt. Hits : 92 - Announces : 147174↓ 11193↑ total, 140554 filtered - 1.2 Hz↑ (↓0% / ↑0% of flow) - 7.8 Hz↓ (t:6h/p:0s/g:1) burst for 4h, 54m and 42.69s - Traffic : ↑4.75 MB 0 bps - ↓1.50 MB 0 bps - Filtered : ↑0 B 0 bps - ↓55.43 MB 380.14 Kbps - -You can then block it by its Transport ID: - -.. code:: txt - - $ rnpath -B a0c289d131c7bfa8d5ddc8b652c0f40d --reason "Broken node" - - Blackholed identity a0c289d131c7bfa8d5ddc8b652c0f40d - -Its connection will be immediately torn down, and further reconnection attempts will be ignored. - -For Developers --------------- - -At some point during the ``1.6.x`` release cycle, RNS will move to using the ``required_only`` mode for *non-transport* instances by default. This means that applications will, in most cases, have to request what types of destinations they are interested in receiving announces from. - -If your application is only using the utility primitives included in RNS, or established protocols such as LXMF or LXST, **there is nothing you have to do**. The protocol primitives *themselves* request their required destination types, and this is the general pattern to follow here: - -- If an application uses a common protocol or primitive, it is the importable primitive, protocol module, or relevant internal functionality that should request destination type requirements, at the point where they are actually needed. -- Higher level application layers should not have to guess at or request destination types, unless it explicitly creates outbound destinations that are not covered by any already-used protocols or primitives. - -If your protocol or application needs to receive announces for a specific destination type, it is very easy to register it. For example, at startup (or when the destination type is actually required), simply run something like: - -.. code:: python - - RNS.Reticulum.get_instance().wants_destination_type("my_app.service") - -You do not *have to* explicitly deregister destination type requirements. Reticulum automatically deregisters when the shared instance connection for the application is torn down, but you may *want* to in certain cases, which follows the same pattern: - -.. code:: python - - RNS.Reticulum.get_instance().unwants_destination_type("my_app.service") - -That's really all there is to it. If you already now want to make you application more CPU, memory and battery efficient, you can tell Reticulum to start serving only required destinations to it with only a few lines of additional code. A full setup of this functionality might look something like: - -.. code:: python - - for destination_type in self.REQUIRED_DESTINATION_TYPES: - RNS.Reticulum.get_instance().wants_destination_type(destination_type) - - RNS.Reticulum.get_instance().required_announces_only(True) - -Your application will now only receive, and have to process, the announces and paths that it actually cares about. - - -Ingress & Burst Control -======================= - -In addition to the economic incentives created by stamps, Reticulum enforces a set of hydraulic limits on how much announce traffic any peer or destination can inject into the network. These mechanisms work automatically, require no operator configuration (but can be tuned, if required), and apply equally to all peers. - -At the most basic level, the ``announce_cap`` mechanism limits the bandwidth any interface will allocate to propagating announces and other network upkeep traffic, and prioritises the local topology. Destinations that rapidly re-announce are down-prioritised in the transmission queue, so attempting to gain reach through announce spam has the exact *opposite* effect. - -On top of this, per-destination announce rate control can be configured on any interface, or as instance-wide defaults. Once configured, announces *received* for any one destination will only be re-broadcast to other interfaces at the configured target rate, no matter how often they are received. The grace option allows occasional rate violations, and a configurable penalty extends the interval between propagated announces for destinations that repeatedly exceed their target. - -The final layer protects against bursts of announces for *newly created* destinations. If an interface receives a large influx of announces for previously unknown destinations in a short amount of time, these are held in a bounded queue, while announces for known and established destinations continue to be processed without interruption. After the burst subsides, and an additional waiting period has passed, held announces are released slowly until the queue is cleared. - -A node that connects to a public interface, announces a large number of bogus destinations, and then disconnects, will therefore never get those destinations into path tables at all. When the interface they arrived on disappears, the held announces are simply dropped and forgotten. - -Ingress control operates at the level of individual sub-interfaces, so one misbehaving client cannot disrupt announce processing for other clients connected to the same listener. Combined with stamps, these mechanisms are complementary: - -Rate limiting bounds the *rate* at which abuse can occur, for everyone, while stamps make the *volume* of abuse from any actor computationally expensive. - -Full configuration details are available in the :ref:`Announce Rate Control` and :ref:`New Destination Rate Limiting` sections. - -.. _protecting-blachole: - -Blackhole Management -==================== - -The *blackhole* system allows any node operator or individual user to block specific identities at the transport layer. - -Once an identity has been blackholed on a node, announces originating from *any* destination associated with that identity are dropped, and the node will refuse to transport traffic, or establish and maintain links, to the blackholed identity's destinations. - -It is important to understand the scope of this mechanism corrrectly. There is fundamentally **no way** to *globally* block or censor any identity or destination in Reticulum networks. A blackhole entry only applies on the network segments that enforce it, which is the exact intention. Operators retain full control over what is allowed on their own segments, while no one can impose restrictions on segments they do not operate. - -Blackholes can be managed directly with the ``rnpath`` utility. Identities can be blocked (optionally with an expiry duration and a human-readable reason), unblocked, and the current local blocklist can be inspected at any time. This is well suited for immediate responses to announce spam, unwanted content or malicious behaviour observed on your own networks. - -For anything larger than a few nodes, manual blocklist maintenance quickly becomes impractical. Reticulum therefore allows an instance to subscribe to blackhole lists published by trusted transport identities, periodically retrieving and merging them into the local list, and conversely to publish its own list to subscribers. - -This makes it possible to federate community-maintained blocklists across large networks, with the important caveat that subscribing to a list is an act of trust in its maintainer. See the :ref:`Blackhole Management` section for full details on local management, automated list sourcing and publishing. - - -Fast-Flap Blocking -================== - -High-performance listener interfaces, such as :ref:`BackboneInterface`, will automatically block *fast-flapping* clients; remote peers that repeatedly connect for a very short amount of time, and then disconnect. - -This behaviour usually stems from attempts to dump announce or path request spam onto the network in short bursts, while rotating connections in an attempt to evade per-interface rate limits, but it can also be caused by broken implementations or automated scanning tools. - -Such bypass attempts generally have very limited effect. Ingress limiters trigger *immediately* once rate limits are exceeded, but the behaviour still causes needless interface rotation and wasted resources on the transport instance. - -With fast-flap blocking enabled, a client that exceeds the allowed flap grace is simply not allocated an actual interface again, for the configured block duration. - -On the ``BackboneInterface`` type, fast-flap blocking is enabled by default, with sensible standard settings. All parameters can be adjusted if necessary. See the :ref:`Automated Blocking` section of the Interfaces chapter. \ No newline at end of file diff --git a/docs/manual/_sources/software.rst.txt b/docs/manual/_sources/software.rst.txt index 66315fea..c7314aa1 100644 --- a/docs/manual/_sources/software.rst.txt +++ b/docs/manual/_sources/software.rst.txt @@ -4,225 +4,146 @@ Programs Using Reticulum ************************ -This chapter provides a non-exhaustive list of notable programs, systems and application-layer protocols that have been built using Reticulum. +This chapter provides a non-exhaustive list of notable programs, systems and application-layer +protocols that have been built using Reticulum. -Many different applications using Reticulum already exist, serving a wide variety of purposes from day-to-day communication and information sharing to systems administration and tackling advanced networking and communications challenges. +These programs will let you get a feel for how Reticulum works. Most of them have been designed +to run well even over slow networks based on LoRa or packet radio, but all can also be used over fast +links, such as local WiFi, wired Ethernet, the Internet, or any combination. -.. tip:: - For ease of discovery while reading this manual over the web or as an e-book, links provided in this chapter primarily point to repositories and pages located on internet servers. In many cases, these are public web mirrors, with the upstream repositories residing on Reticulum nodes. For the latest source, updates and information regarding any project, be sure to check their Nomad Network or ``rngit`` nodes. +As such, it is easy to get started experimenting, without having to set up any radio +transceivers or infrastructure just to try it out. Launching the programs on separate +devices connected to the same WiFi network is enough to get started, and physical +radio interfaces can then be added later. -These programs will let you get a feel for how Reticulum works. Most of them have been designed to run well even over slow networks based on LoRa or packet radio, but all can also be used over fast links, such as local WiFi, wired Ethernet, the Internet, or any combination. +Programs & Utilities +==================== -As such, it is easy to get started experimenting, without having to set up any radio transceivers or infrastructure just to try it out. Launching the programs on separate devices connected to the same WiFi network is enough to get started, and physical radio interfaces can then be added later. +Many different applications using Reticulum already exist, serving a wide variety of purposes +from day-to-day communication and information sharing to systems administration and tackling +advanced networking and communications challenges. -Development of Reticulum-based applications and systems is ongoing, so consider this list a non-exhaustive starting point of *some* of the options available. With a bit of searching, primarily over Reticulum itself, you will find many more interesting things. +Development of Reticulum-based applications and systems is ongoing, so consider this list +a non-exhaustive starting point of *some* of the options available. With a bit of searching, +primarily over Reticulum itself, you will find many more interesting things. -Browsing & Publishing -===================== +Remote Shell +^^^^^^^^^^^^ -In addition to the programs listed in this section, other Nomad Network clients include: +The `rnsh `_ program lets you establish fully interactive +remote shell sessions over Reticulum. It also allows you to pipe any program to or from a +remote system, and is similar to how ``ssh`` works. The ``rnsh`` program is very efficient, and +can facilitate fully interactive shell sessions, even over extremely low-bandwidth links, +such as LoRa or packet radio. -- `MeshChatX `_ -- `Columba `_ +In addition to the default, fully interactive terminal mode, +for extremely limited links, ``rnsh`` offers line-interactive mode, allowing you to interact +with remote systems, even when link throughput is counted in a few hundreds of bits per second. + +.. raw:: latex + + \newpage Nomad Network ^^^^^^^^^^^^^ -The terminal-based program `Nomad Network `_ provides a complete encrypted communications suite built with Reticulum. +The terminal-based program `Nomad Network `_ +provides a complete encrypted communications suite built with Reticulum. It features +encrypted messaging (both direct and delayed-delivery for offline users), file sharing, +and has a built-in text-browser and page server with support for dynamically rendered pages, +user authentication and more. -.. only:: html +.. image:: screenshots/nomadnet_3.png + :target: https://github.com/markqvist/nomadnet - .. image:: screenshots/nomadnet_6.webp - :align: center - :target: https://github.com/markqvist/nomadnet - -.. only:: latex - - .. image:: screenshots/nomadnet_6.png - :align: center - :target: https://github.com/markqvist/nomadnet - -It features encrypted LXMF messaging (both direct and delayed-delivery for offline users), file sharing, and has a built-in text-browser and page server with support for dynamically rendered pages, user authentication and more. It also includes an RRC client and a suite of network utilities. - - -Ren Browser -^^^^^^^^^^^ - -`Ren Browser `_ is a modern, standalone browser for Nomad Network using the `Reticulum-Go `_ implementation. The project is actively being developed, and should be considered alpha level software, but much of the functionality is already working. If you want to help expanding the ecosystem, this is an excellent project to take a look at. - -.. only:: html - - .. image:: screenshots/ren_browser.webp - :align: center - :target: https://github.com/fr33n0w/rBrowser - -.. only:: latex - - .. image:: screenshots/ren_browser.png - :align: center - :target: https://github.com/fr33n0w/rBrowser - -Ren Browser is great example of an application aiming for true, seamless interoperability with the existing software ecosystem. It can operate fully standalone using it's own embedded `Go implementation `_ of Reticulum, or seamlessly utilise a shared RNS instance already running on the system. +`Nomad Network `_ is a user-facing client +for the messaging and information-sharing protocol LXMF. RNS Page Node ^^^^^^^^^^^^^ -`RNS Page Node `_ is a simple way to serve pages and files to any other Nomad Network compatible client. Drop-in replacement for NomadNet nodes that primarily serve pages and files. +`RNS Page Node `_ is a simple way to serve pages and files to any other Nomad Network compatible client. Drop-in replacement for NomadNet nodes that primarily serve pages and files. Retipedia ^^^^^^^^^ -You can host the entirity of Wikipedia, StackExchange or any other ``.zim`` file, to Nomad Network clients using `Retipedia `_. - -.. only:: html - - .. image:: screenshots/retipedia.webp - :align: center - :target: https://github.com/RFnexus/Retipedia - -.. only:: latex - - .. image:: screenshots/retipedia.png - :align: center - :target: https://github.com/RFnexus/Retipedia - - -Git Over Reticulum -^^^^^^^^^^^^^^^^^^ - -The included :ref:`rngit` system provides a fully distributed solution for managing, hosting, collaborating on and interacting with Git repositories over Reticulum. - -.. only:: html - - .. image:: screenshots/rngit.webp - :align: center - -.. only:: latex - - .. image:: screenshots/rngit.png - :align: center +You can host the entirity of Wikipedia (or any ``.zim``) file to other Nomad Network clients using `Retipedia `_. .. raw:: latex \newpage -Messaging & Voice -================= - Sideband ^^^^^^^^ -`Sideband `_ is a technical LXMF and LXST client, for Android, Linux, macOS and Windows. It also serves as a multi-purpose Reticulum utility, with features and functionality targeted at advanced users. +If you would rather use an LXMF client with a graphical user interface, you can take +a look at `Sideband `_, which is available for Android, +Linux, macOS and Windows. Sideband is an advanced LXMF and LXST client, and a multi-purpose Reticulum +utility, with features and functionality targeted at advanced users. .. only:: html .. image:: screenshots/sideband_devices.webp :align: center - :target: https://github.com/markqvist/Sideband + :target: https://unsigned.io/sideband .. only:: latex .. image:: screenshots/sideband_devices.png :align: center - :target: https://github.com/markqvist/Sideband + :target: https://unsigned.io/sideband -Sideband allows you to communicate with other people or LXMF-compatible systems over Reticulum networks using LoRa, Packet Radio, WiFi, I2P, Encrypted QR Paper Messages, or anything else Reticulum supports. +Sideband allows you to communicate with other people or LXMF-compatible +systems over Reticulum networks using LoRa, Packet Radio, WiFi, I2P, Encrypted QR +Paper Messages, or anything else Reticulum supports. -It interoperates with all other LXMF clients, and provides advanced features such as PTT and voice messaging, real-time voice calls, file attachments, private telemetry sharing, and a full plugin system for expandability. +It also interoperates with all other LXMF clients, and provides advanced features such as voice messaging, +real-time voice calls, file attachments, private telemetry sharing, and a full +plugin system for expandability. .. raw:: latex \newpage MeshChatX -^^^^^^^^^ +^^^^^^^^ -`MeshChatX `_ is an all-in-one Reticulum client with messaging, calling, and a NomadNet browser, providing everything you need for Reticulum, LXMF, and LXST in one beautiful and feature-rich application. +A `Reticulum MeshChat fork from the future `_, with the goal of providing everything you need for Reticulum, LXMF, and LXST in one beautiful and feature-rich application. This project is separate from the original `Reticulum MeshChat `_ project, and is not affiliated with the original project, but is a much more up-to-date, comprehensive and well-maintained fork. .. only:: html .. image:: screenshots/meshchatx.webp :align: center - :target: https://meshchatx.com/ + :target: https://git.quad4.io/RNS-Things/MeshChatX .. only:: latex .. image:: screenshots/meshchatx.png :align: center - :target: https://meshchatx.com/ + :target: https://git.quad4.io/RNS-Things/MeshChatX -Features include full LXST support, custom voicemail, phonebook, contact sharing, ringtone support, multi-identity handling, modern UI/UX, offline documentation, expanded tools, page archiving, integrated maps, telemetry and improved application security. +Features include full LXST support, custom voicemail, phonebook, contact sharing, and ringtone support, multi-identity handling, modern UI/UX, offline documentation, expanded tools, page archiving, integrated maps, telemetry and improved application security. -Columba -^^^^^^^ +.. raw:: latex -`Columba `_ is a simple and familiar LXMF messaging app Android, built with a native Android interface and Material Design 3. It also includes LXST voice call functionality, and a mobile Nomad Network page browser. - -.. only:: html - - .. image:: screenshots/columba.webp - :align: center - :target: https://github.com/torlando-tech/columba/ - -.. only:: latex - - .. image:: screenshots/columba.png - :align: center - :target: https://github.com/torlando-tech/columba/ - - -Ren TUI -^^^^^^^ - -`Ren TUI `_ is an early prototype terminal LXMF client for Reticulum built with Odin on librns (Reticulum-Go). It aims for NomadNet-like messaging/browsing without urwid or ncurses. - -.. only:: html - - .. image:: screenshots/rentui.webp - :align: center - :target: https://github.com/Quad4-Software/Ren-TUI - -.. only:: latex - - .. image:: screenshots/rentui.png - :align: center - :target: https://github.com/Quad4-Software/Ren-TUI - -Chat -==== + \newpage Reticulum Relay Chat ^^^^^^^^^^^^^^^^^^^^ `Reticulum Relay Chat `_ is a live chat system built on top of the Reticulum Network Stack. It exists to let people talk to each other in real time over Reticulum without dragging in message databases, synchronization engines, or architectural commitments they did not ask for. -.. only:: html - - .. image:: screenshots/rrc.webp - :align: center - -.. only:: latex - - .. image:: screenshots/rrc.png - :align: center +The `rrcd `_ program provides a functional, reference RRC hub-server daemon implementation. RRC user clients include `rrc-gui `_ and `rrc-web `_. RRC is closer in spirit to IRC than to modern “everything platforms.” You connect, you join a room, you talk, and then you leave. If you were present, you saw the conversation. If you were not, the conversation did not wait for you. This is not an accident. This is the entire design. -The `rrcd `_ program provides a functional, reference RRC hub-server daemon implementation. RRC user clients include: - -- `Nomad Network `_ -- `MeshChatX `_ -- `Eridanus `_ -- `rrc-gui `_ -- `rrc-web `_ - RetiBBS ^^^^^^^ -`RetiBBS `_ is an old-school bulletin board system implementation for Reticulum networks. +`RetiBBS `_ is a bulletin board system implementation for Reticulum networks. .. only:: html @@ -242,14 +163,29 @@ RetiBBS allows users to communicate through message boards in a secure manner. \newpage -Voice & Telephony -================= +RBrowser +^^^^^^^^ -In addition to the programs listed in this section, other LXST voice clients include: +The `rBrowser `_ program is a cross-platform, standalone, web-based browser for exploring NomadNetwork Nodes over Reticulum Network. It automatically discovers NomadNet nodes through network announces and provides a user-friendly interface for browsing distributed content with Micron markup support. -- `Sideband `_ -- `MeshChatX `_ -- `Columba `_ +.. only:: html + + .. image:: screenshots/rbrowser.webp + :align: center + :target: https://github.com/fr33n0w/rBrowser + +.. only:: latex + + .. image:: screenshots/rbrowser.png + :align: center + :target: https://github.com/fr33n0w/rBrowser + +Includes useful features like automatic listening for announce, adding nodes to favorites, browsing and rendering any kind of NomadNet links, downloading files from remote nodes, a unique local NomadNet Search Engine and more. + + +.. raw:: latex + + \newpage Reticulum Network Telephone ^^^^^^^^^^^^^^^^^^^^^^^^^^^ @@ -270,31 +206,14 @@ The ``rnphone`` program, included as part of the `LXST `_ is a group voice application for Reticulum, built on `LXST `_, inspired by `Mumble `_. - -.. only:: html - - .. image:: screenshots/partyline.webp - :align: center - :target: https://github.com/markqvist/LXST - -.. only:: latex - - .. image:: screenshots/partyline.png - :align: center - :target: https://github.com/markqvist/LXST - -It provides both realtime group voice over any Reticulum transport capable of >6 kilobits per second, LXST dial-in support, listen-only music/broadcasting rooms, and many other useful functions. - + \newpage LXST Phone ^^^^^^^^^^ -The `LXST Phone `_ program is a cross-platform desktop application for performing LXST voice calls over Reticulum. It supports various advanced features such as SAS verification, peer blocking, rate limiting, encrypted call history storage and contact management. +The `LXST Phone `_ program is a cross-platform desktop application for performing LXST voice calls over Reticulum. .. only:: html @@ -308,60 +227,28 @@ The `LXST Phone `_ program is a cross-plat :align: center :target: https://github.com/kc1awv/lxst_phone +It supports various advanced features such as SAS verification, peer blocking, rate limiting, encrypted call history storage and contact management. + .. raw:: latex \newpage -System Administration -===================== - -Remote Shell -^^^^^^^^^^^^ - -The included :ref:`rnsh` program lets you establish fully interactive -remote shell sessions over Reticulum. It also allows you to pipe any program to or from a -remote system, and is similar to how ``ssh`` works. The ``rnsh`` program is very efficient, and -can facilitate fully interactive shell sessions, even over extremely low-bandwidth links, -such as LoRa or packet radio. - -In addition to the default, fully interactive terminal mode, for extremely limited links, -``rnsh`` offers line-interactive mode, allowing you to interact with remote systems, even -when link throughput is counted in a few hundreds of bits per second. - -RNS FileSync -^^^^^^^^^^^^ - -The `RNS FileSync `_ program enables automatic file synchronization between devices without requiring central servers, internet connectivity, or cloud services. It works over any network medium supported by Reticulum, including radio, LoRa, WiFi, or the internet, making it ideal for off-grid, privacy-focused, and resilient file sharing. - -.. raw:: latex - - \newpage - -Utilities & Components -====================== - -Modem73 -^^^^^^^ - -`MODEM73 `_ and its companion `Modem73Interface `_ is an open source software modem that works with any HF, VHF, or UHF radio capable of 2400 Hz of bandwidth. All you need is a sound card and audio cable for your radio. - -.. only:: html - - .. image:: screenshots/modem73.webp - :align: center - :target: https://github.com/RFnexus/modem73 - -.. only:: latex - - .. image:: screenshots/modem73.jpg - :align: center - :target: https://github.com/RFnexus/modem73 - LXMFy ^^^^^ -`LXMFy `_ is a comprehensive and advanced bot creation framework for LXMF, that allows building any kind of automation or bot system running over LXMF and Reticulum. `Bot implementations exist `_ for Home Assistant control, LLM integrations, and various other purposes. +`LXMFy `_ is a comprehensive and advanced bot creation framework for LXMF, that allows building any kind of automation or bot system running over LXMF and Reticulum. `Bot implementations exist `_ for Home Assistant control, LLM integrations, and various other purposes. + + +LXMF Interactive Client +^^^^^^^^^^^^^^^^^^^^^^^ + +`LXMF Interactive Client `_ is a feature-rich, terminal-based LXMF messaging client with many advanced features and an extensible plugin architecture. + +RNS FileSync +^^^^^^^^^^^^ + +The `RNS FileSync `_ program enables automatic file synchronization between devices without requiring central servers, internet connectivity, or cloud services. It works over any network medium supported by Reticulum, including radio, LoRa, WiFi, or the internet, making it ideal for off-grid, privacy-focused, and resilient file sharing. Micron Parser JS @@ -369,25 +256,6 @@ Micron Parser JS `Micron Parser JS `_ is the JavaScript-based parser for the Micron markup language, that most web-based Nomad Network browsers use. If you want to make utilities or tools that display Micron pages, this library is essential. -Reticulated -^^^^^^^^^^^ - -`Reticulated `_ is a Reticulum Network simulator that spawns live, interactive Reticulum instances controllable from a node-based Web UI. - -.. only:: html - - .. image:: screenshots/reticulated.webp - :align: center - :target: https://github.com/RFnexus/Reticulated - -.. only:: latex - - .. image:: screenshots/reticulated.jpg - :align: center - :target: https://github.com/RFnexus/Reticulated - -You can create networks of any topology and set bitrate, MTU, and configure path loss and propagation behavior. It provides a top-down view to a live network. You can connect any Reticulum application to the simulated network. It also has built in utilities like a basic LXMF chat function and Resource transfer included. - RNMon ^^^^^ @@ -399,16 +267,6 @@ RNMon \newpage -Device Flashers -=============== - -In addition to the included command-line ``rnodeconf`` flasher, several community-provided RNode device flashers exist: - -- `RNS Moscow `_ -- `Aetherlab `_ - -Several programs, such as `Sideband `_ and `MeshChatX `_ also include built-in device flashers that can be used fully offline. - Protocols ========= @@ -440,8 +298,8 @@ Interface Modules & Connectivity Resources This section provides a list of various community-provided interface modules, guides and resources for creating Reticulum networks over special or challenging mediums. -* `Modem73 `_ is an efficient software modem that can be used with Reticulum -* Custom interface module for running `RNS over HTTP `_ +* Custom interface module for running `RNS over HTTP `_ * Guide for running `Reticulum over ICMP `_ using ``PipeInterface`` * Guide for running `Reticulum over DNS `_ with Iodine -* Guide for running `Reticulum over HF radio `_ \ No newline at end of file +* Guide for running `Reticulum over HF radio `_ +* `Modem73 `_ is a KISS TNC OFDM modem frontend that can be used with Reticulum \ No newline at end of file diff --git a/docs/manual/_sources/support.rst.txt b/docs/manual/_sources/support.rst.txt index 011f1231..39bcf8f3 100644 --- a/docs/manual/_sources/support.rst.txt +++ b/docs/manual/_sources/support.rst.txt @@ -28,6 +28,9 @@ Donations are gratefully accepted via the following channels: Ko-Fi: https://ko-fi.com/markqvist +Are certain features in the development roadmap are important to you or your +organisation? Make them a reality quickly by sponsoring their implementation. + .. raw:: latex \newpage diff --git a/docs/manual/_sources/using.rst.txt b/docs/manual/_sources/using.rst.txt index 81a0faf9..a61c2b30 100644 --- a/docs/manual/_sources/using.rst.txt +++ b/docs/manual/_sources/using.rst.txt @@ -193,14 +193,12 @@ change anything, and you may already be connected to a wider network. If not, you will probably need to add relevant *interfaces* to the configuration, in order to communicate with other systems. -The example above does not document all the available options, only the basics. -To explore all the various configuration options available, you can generate a -much more verbose and complete configuration example by running the command: +You can generate a much more verbose configuration example by running the command: ``rnsd --exampleconfig`` -The output includes examples for most interface types supported by Reticulum, -along with additional options and configuration parameters. +The output includes examples for most interface types supported +by Reticulum, along with additional options and configuration parameters. It is a good idea to read the comments and explanations in the above default config. It will teach you the basic concepts you need to understand to configure your network. @@ -276,7 +274,8 @@ You can easily add ``rnsd`` as an always-on service by :ref:`configuring a servi The rnstatus Utility ==================== -Using the ``rnstatus`` utility, you can view the status of and control configured Reticulum interfaces, similar to the ``ifconfig`` program. +Using the ``rnstatus`` utility, you can view the status of configured Reticulum +interfaces, similar to the ``ifconfig`` program. **Usage Examples** @@ -351,9 +350,6 @@ Filter output to only show some interfaces: -h, --help show this help message and exit --config CONFIG path to alternative Reticulum config directory --version show program's version number and exit - --attach name Attach interface by name - --detach name Detach interface by name - --reload name Reload interface by name -a, --all show all interfaces -A, --announce-stats show announce stats -P, --pr-stats show path request stats @@ -371,8 +367,6 @@ Filter output to only show some interfaces: -w seconds timeout before giving up on remote queries -d, --discovered list discovered interfaces -D show details and config entries for discovered interfaces - --show-stale show stale discovery entries - --show-unknown show discovery entries without version info -m, --monitor continuously monitor status -I, --monitor-interval seconds refresh interval for monitor mode (default: 1) @@ -646,7 +640,7 @@ Or fetch a file from the remote system: $ rncp --fetch ~/path/to/file.tgz 73cbd378bb0286ed11a707c13447bb1e -The default identity file is stored in ``~/.reticulum/storage/identities/rncp``, but you can use +The default identity file is stored in ``~/.reticulum/identities/rncp``, but you can use another one, which will be created if it does not already exist .. code:: text @@ -711,7 +705,7 @@ The rnx Utility The ``rnx`` utility is a basic remote command execution program. It allows you to execute commands on remote systems over Reticulum, and to view returned command output. For a fully interactive remote shell solution, be sure to also take a look -at the :ref:`rnsh` program. +at the `rnsh `_ program. **Usage Examples** @@ -733,7 +727,7 @@ Or enter the interactive mode pseudo-shell: $ rnx 7a55144adf826958a9529a3bcf08b149 -x -The default identity file is stored in ``~/.reticulum/storage/identities/rnx``, but you can use +The default identity file is stored in ``~/.reticulum/identities/rnx``, but you can use another one, which will be created if it does not already exist .. code:: text @@ -777,8 +771,6 @@ another one, which will be created if it does not already exist --version show program's version number and exit -.. _using-rnsh: - The rnsh Utility ================ @@ -952,10 +944,9 @@ When connecting to a remote listener, several options are available: **Identity & Destination** -The default initiator identity file for ``rnsh`` is stored at -``~/.rns/identity`` (default listener identity is in ``~/.rns/identity.default``), -but you can specify a different one with the ``-i`` option, which will be created if -it does not already exist: +The default identity file for ``rnsh`` is stored at +``~/.reticulum/identities/rnsh``, but you can specify a different one with the +``-i`` option, which will be created if it does not already exist: .. code:: text @@ -1147,19 +1138,6 @@ Reticulum includes built-in functionality for discovering connectable interfaces Discovered interfaces can be **auto-connected** by Reticulum, which makes it possible to create setups where an arbitrary interface can act simply as a bootstrap connection, that can be torn down again once more suitable interfaces have been discovered and connected. -.. important:: - While it might be tempting to configure Reticulum to auto-connect dozens of interfaces, this will not provide you with any benefit. It will also waste the limited resources of transport node operators. In almost all situations, using 2-3 auto-connected interfaces will be sufficient. - - **Remember**: A deeper, more branched topology is *much* more efficient than a completely flat fan-out, where everyone connects to everyone! - - For **devices that connect directly** to the distributed backbone, such as phones and other mobile devices, use one or two auto-connects - or a fixed node you that you like, and an auto-connect as redundant backup. - - For a transport **node in your home**, serving all devices within it, 2 or 3 autoconnects will be reasonable. - - For a **fast boundary node** that sits between a large, internal network with hundreds of active destinations, you can consider using five to six auto-connects. The same is a sensible number for general-purpose transport-providing backbone nodes on the public internet. - - In extreme cases, you *can* consider using up to 12 auto-connected interfaces. Almost nobody will need this, but there are edge cases where it could potentially be useful. Do not auto-connect that wide unless you are prepared and capable of processing some serious traffic. - The interface discovery mechanism uses announces sent over Reticulum itself, and supports both publicly readable interfaces and private, encrypted discovery, that can only be decoded by specified *network identities*. It is also possible to specify which network identities should be considered valid sources for discovered interfaces, so that interfaces published by unknown entities are ignored. .. note:: @@ -1252,8 +1230,6 @@ For more fine-grained control over how discovered interfaces are auto-connected, * The ``autoconnect_announces_to_internal`` option allows you to specify that auto-connected interfaces should propagate announces to ``internal`` mode interfaces, even if the auto-connected interface's mode would normally not allow for this. -* The ``autoconnect_unverified_implementations`` option will allow the interface discovery system to auto-connect to *any* announced interface, even those coming from unverified, experimental or potentially broken implementations. Be very careful with this option. - Remote Management ----------------- @@ -1404,7 +1380,7 @@ The blackhole system relies on the trust relationship between the subscriber and As the ecosystem matures, this system is designed to integrate with **Network Identities**. This allows communities to verify that a published blackhole list is actually provided by a specific network or organization with a certain level of reputation and trustworthiness, adding a layer of cryptographic trust to the federation process. This prevents malicious actors from publishing fake lists intended to censor legitimate traffic. -For operators, this creates a scalable model where maintaining a single high-quality blocklist can protect thousands of downstream peers, drastically reducing the administrative overhead. +For operators, this creates a scalable model where maintaining a single high-quality blocklist can protect thousands of downstream peers, drastically reducing the administrative. Improving System Configuration ------------------------------ @@ -1486,7 +1462,6 @@ following content: Restart=always RestartSec=3 User=USERNAMEHERE - Environment=MALLOC_ARENA_MAX=2 ExecStart=rnsd --service [Install] @@ -1528,7 +1503,6 @@ Create a user systemd service files ``~/.config/systemd/user/rnsd.service`` with Type=simple Restart=always RestartSec=3 - Environment=MALLOC_ARENA_MAX=2 ExecStart=RNS_BIN_DIR/rnsd --service [Install] diff --git a/docs/manual/_static/documentation_options.js b/docs/manual/_static/documentation_options.js index 88565d1b..5426053b 100644 --- a/docs/manual/_static/documentation_options.js +++ b/docs/manual/_static/documentation_options.js @@ -1,5 +1,5 @@ const DOCUMENTATION_OPTIONS = { - VERSION: '1.6.1', + VERSION: '1.5.1', LANGUAGE: 'en', COLLAPSE_INDEX: false, BUILDER: 'html', diff --git a/docs/manual/brandolinis.html b/docs/manual/brandolinis.html deleted file mode 100644 index a28cc150..00000000 --- a/docs/manual/brandolinis.html +++ /dev/null @@ -1,1612 +0,0 @@ - - - - - - - - - - Brandolini’s Reference - Reticulum Network Stack 1.6.1 documentation - - - - - - - - - - - - - - - - - - Contents - - - - - - Menu - - - - - - - - Expand - - - - - - Light mode - - - - - - - - - - - - - - Dark mode - - - - - - - Auto light/dark, in light mode - - - - - - - - - - - - - - - Auto light/dark, in dark mode - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -Skip to content - - - -
-
-
- -
- -
-
- -
- -
-
- -
-
-
- - - - - Back to top - -
-
- -
- -
-
-
-

Brandolini’s Reference

-
-
-
A little learning is a dang’rous thing;
-
Drink deep, or taste not the Pierian spring.
-
There shallow draughts intoxicate the brain,
-
And drinking largely sobers us again.
-

-
- Alexander Pope, 1711
-
-
-

This chapter serves as a helpful reference for developers, users and community members living in an Age of Bullshit Manufacture equivalent to the Cambrian Explosion.

-

As we are surely only at the on-ramp of this trajectory, the chapter will continue to evolve, expand and be updated based on community feedback as events occur.

-
-

What The Reticulum License Is

-

To understand the legal reality relating to this section, see Void Grants.

-

The Reticulum License is the license under which RNS, the Reticulum reference implementation, has been published since April 15, 2025, in versioning effective from 0.9.4 and every release since. In practical terms, it covers all of “modern Reticulum”: The current wire format, the cryptographic machinery as it exists today (including the AES-256-based link encryption, ratchets, et cetera), and all protocol additions that distinguish the modern implementation from the earliest pre-1.0.0 beta formats. If an implementation speaks today’s Reticulum protocol, it is, in all relevant respects, built on Reticulum-licensed work.

-

The license is a permissive license. It grants the full range of rights to use, copy, modify, merge, publish, distribute, sublicense, and sell the software, free of charge; subject to three conditions, which are reproduced here verbatim:

-
-
    -
  • The Software shall not be used in any kind of system which includes amongst its -functions the ability to purposefully do harm to human beings.

  • -
  • The Software shall not be used, directly or indirectly, in the creation of an artificial -intelligence, machine learning or language model training dataset, including but not -limited to any use that contributes to the training or development of such a model or -algorithm.

  • -
  • The above copyright notice and this permission notice shall be included in all copies or -substantial portions of the Software.

  • -
-
-
-

Why This License Exists

-

Reticulum was not moved to a custom license casually or quickly. It was licensed under the MIT license for the greater part of its existence, and that served well for a long time. The change came when it became clear that no existing license expressed what the project needed, and that the two most commonly proposed alternatives would either say the wrong thing or say nothing useful at all. Three factors had primary influence on the situation:

-

The harm problem

-

Reticulum is a tool that was built, deliberately and at great cost, to empower people; to make communication something you own rather than something you are temporarily granted. It has also been, at various times, exactly what certain kinds of organisations would like to use to control people. This is the duality of any powerful tool. A permissive license could not, and cannot, say anything about that; MIT is silent on the question of whether the software may be used to build systems designed to harm human beings. The Reticulum License is not silent. It does not pretend that a license can stop an individual madman; it does assert, however, plainly and in enforceable terms, that corporations and organisations integrated into the legal system cannot consume this software for harm and then claim they never knew. The line is drawn by the creators of the tool, not by an external authority, and it is drawn deliberately. This is covered in more depth in the discussion of the ethics of the tool in the Zen of Reticulum.

-

The appropriation problem

-

The second factor was the machine-learning appropriation of the open-source commons. By 2025 that was no longer hypothetical: The commons was already being systematically ingested by corporate training pipelines, and the code, words, and creativity of the people who built it were being converted into synthetic systems designed to replace them. The license responds to this with an explicit condition: The software shall not be used in the creation of an AI, machine-learning, or language-model training dataset, nor in any use that contributes to the training or development of such a model or algorithm.

-

It is important to understand what this condition does and does not do, which matters for what follows in this chapter. The AI-training condition is not the legal basis for protecting the code from machine copying. That protection already exists, in the oldest and most well-tested form of copyright law, and it applies regardless of any license (see Copyright & The Two Legal Layers).

-

The AI-training condition addresses something additional: the appropriation of the code into the models themselves; the ingestion of human-made work as raw material for a synthetic replacement, and the use of that ingestion to fabricate “prior work” minefields, patent-troll material, and a wall of slop meant to bury and devalue the actual ecosystem. That danger was foreseeable; the licensing decision was made with full awareness of it. The events of 2026 have since demonstrated, in public and in detail, that the concern was not theoretical.

-

The sustainability problem

-

Reticulum has been developed and maintained for over a decade by a single person, supported by a small group of contributors and network-building users, without corporate backing, without VC funding, through several serious attempts at commercialization and takeover from both the corporate and the ideological side. The license is part of what makes that sustainable, and possible at all.

-

It ensures that the specific, painstaking labor of the reference implementation cannot be hijacked to undermine the intent of the project, while leaving the protocol itself, the mathematical rules of how Reticulum works, dedicated to the public domain, where it belongs to humanity and can never be owned. Anyone can implement the protocol, provided they themselves invest the actual work and effort. What the license protects is the work, and the intent embodied in it.

-
-
-

On Freedom

-

The most persistent mischaracterisation of the Reticulum License is that it is “more restrictive” than the licenses it replaced or than the GPL family. This is backwards, and I’ll state the comparison plainly, because the confusion is the foundation of a great deal of deliberately manufactured controversy examined later in this chapter.

-

The GPL and AGPL are constructed around a single, self-referential axiom: that “free” is defined by the terms of the license itself, and that any use falling outside those terms is not free. In practice, this means the GPL restricts the freedom of everyone - you may not write, distribute, link, or (in some cases) even communicate with GPL-covered software without the entire arrangement being pulled under the same terms, which the licensor then controls. The restriction applies to 100% of users, including the ones building purely constructive things.

-

The Reticulum License restricts the freedom of almost nobody. Its restrictions apply only to:

-
    -
  • Those who wish to use the software in systems that purposefully harm human beings, and

  • -
  • Those who wish to ingest the software into AI training pipelines.

  • -
-

That is a restriction on a vanishingly small fraction of would-be users - the 0.0000001% - and it is a restriction they can characterise however they like, forever. The bickering is itself a signal that the licensing decision hit exactly the right target.

-

Everyone else retains the full breadth of use, modification, distribution, and sale, with none of the viral encumbrance of copyleft.

-

Both licenses contain moral axioms. The difference is that the Reticulum License states its axioms out loud:

-
    -
  • Intentionally restricting the way that millions of people use and build upon a foundational -communications technology - The mechanism of copyleft

  • -
  • Intentionally restricting a small number of organisations from using the technology to -violently harm human beings - The mechanism of the Reticulum License

  • -
-

Which of these is more free? The answer is not a matter of committee approval. It is a matter of what the word “free” means to the people whose freedom is at stake. The question of whether “open source” requires the blessing of a particular licensing orthodoxy is examined in Open Source Means Open Source.

-
-
-

The Prediction, And What Happened

-

When the license change was made and publicly discussed in 2025, the following was said, in public, about the machine-learning threat:

-
-

A generative system could be trained on the Reticulum codebase, and for extremely low cost -be set to work spewing out millions of source repositories for all kinds of ridiculous -“Reticulum-based programs”. This is already happening. You can find several examples of this -on GitHub already. … the point of this kind of trolling is to establish as wide a base for -“prior work” as possible. By doing that, a patent troll or IP abuser can create an immense -minefield for real developers.

-
-

This was written when the phenomenon was just beginning. It was not a guess; it was a description of a mechanism already in motion, in the specific context of Reticulum, by people who had already begun to appear around the project.

-

Less than a year and a half later, the prediction has now been demonstrated, in public, exhaustively and to the letter. There are now roughly a dozen machine-generated “Reticulum implementations” of the same shape: fluent, marketing-heavy, some without attribution, and - in several cases - actively harmful to the network. The Prns case is an example documented in this chapter. The pattern that produced it (and the people, mechanisms, and the recycling of falsehoods behind the wider phenomenon) is examined in A Movement Of A Dozen.

-

The license was written, in part, so that when this happened, the community would not be defenceless.

-
-
-

What This Means For Other Implementations

-

Two simple things must be kept separate:

-
    -
  1. The protocol is public domain. The mathematical rules of Reticulum - addresses, -signatures, routing, the wire format as an idea - belong to humanity. A genuine clean-room -implementation of the protocol, written by human beings who reasoned it out themselves, is -free and welcome, and owes nothing to the Reticulum License. Nothing in this chapter is an -argument against implementing the protocol. On the contrary: More good implementations, -honestly made, are good for the network.

  2. -
  3. The implementation is licensed. Copying the reference implementation - by machine or -by silk-screen press - and modifying and redistributing the result, is -exercising rights granted by the license, and is therefore subject to its conditions: The attribution -notice, the harm condition, the AI-training condition. A copy that does not follow those -conditions is not licensed, and it is not “open source in spirit”; it is an unauthorized -derivative work, and therefore a copyright violation.

  4. -
-

The distinction is the same one the license itself makes, and it must be held firmly: An implementation that speaks Reticulum is exercising the public domain protocol, if it was truly created independently. An implementation that was generated from RNS, reproduced by a copy process, is a derivative of licensed work.

-
- -
-

The “Clean-Room” Delusion

-

I regularly receive mail or LXMF messages from people who proudly and happily proclaim that they have created a “clean-room” implementation of one of the software systems I maintain; RNS, Sideband, LXMF or others. The declaration is delivered with the flat certainty of someone who believes they have found the legal lock-pick that settles everything at once: Their production is independent, uncontaminated, and therefore free of any obligation to the work they copied, its license, or its author. The proclamation usually concludes with a request for blessing, or at least acknowledgment. The proclamation is, usually, also generated by an LLM.

-

This is a delusion, and I’ll cut through it surgically. The word they here invoke as magic is attempting to do a great deal of work it was never able to bear.

-

What a clean room actually was

-

The legal “clean room” is not folklore, incantation, witchcraft or a claim a person gets to make about their own output. It is a very specific, institutionalized procedure that grew out of the hardware and software litigations of the 1980s, and it existed for exactly one purpose: Convincingly proving the absence of copying in a court of law.

-

The canonical case was Phoenix Technologies and its 1984 reimplementation of the IBM PC BIOS. IBM’s BIOS was copyrighted, which meant that the entire PC-compatible industry depended on being able to show that a compatible BIOS had been written independently, and not from IBM’s code. Phoenix’s answer was a physical and procedural firewall:

-
    -
  • One team, the “dirty room”, read the original code and produced written functional specifications: descriptions of what the BIOS did, not how IBM’s code did it.

  • -
  • A second team, the “clean room”, consisted of engineers who had never seen the original code at all, and they wrote the new BIOS from those specifications alone.

  • -
-

This obsessively documented, legally attested separation was not a preference or a willy-nilly show for a kindergarten; it was the entire legal point, and it had to be solid. If even one clean-room engineer had glanced at IBM’s code, the clone would have been contaminated, and the defense would shatter.

-

The other landmark case was Computer Associates v. Altai (1992), in which Altai had copied CA’s scheduler code into its own product, and (upon being caught) hired outside counsel to run a genuine clean-room procedure: A programmer with no exposure to the original was brought in to rewrite the infringing modules from functional specifications prepared by the team that had seen the code. The court credited the good-faith effort precisely because it was done, as the carefully documented record showed, to the letter of the procedure.

-

Bear in mind what this procedure entailed in practice, because this is the part the modern claimants never seem to have even heard of: Physical separation of teams, legal counsel managing the process, signed and notarised declarations of non-exposure, controlled specification documents that described behaviour and never code, months of work, and testing against the specification - not against the original, which the implementers were forbidden to consult.

-

The people on the clean-room side of the wall did not just claim they had not read the code. Their non-exposure was institutionally guaranteed, obsessively documented, and legally attestable through every fart and sneeze of the process, because the entire point was that a court - hostile, adversarial, and entitled to discovery - would believe it.

-

That is the process. “Clean-room implementation” is the name of a certified procedure for proving independent authorship. It is not a mood, a marketing label, or a property a person gets to declare about their own work.

-

The moronic inversion

-

Now consider what is actually being described when someone says: “I created a clean-room implementation of Reticulum by feeding the source code into a machine.”

-

That sentence is the opposite of a clean room. Feeding a copyrighted work into a machine so that it reproduces and transforms the work is the definition of copying, and a clean room is the one procedure whose entire purpose is the demonstrated absence of copying. This process cannot demonstrate the absence of copying, because the process is composed of copying. The cleanest possible room has been replaced by the dirtiest possible room, and the dirt has been installed as the base feature. What these claimants have actually performed is a photocopy with extra steps, and the extra steps, far from cleaning anything, are simply steps that forge a certificate they believe the output has earned.

-

Why the word is deployed

-

The word “clean-room” is deployed because it sounds like what the speaker wishes were true. It carries the accumulated legal prestige of the 1980s and 1990s - the BIOS clones, the Altai credit - and it sounds like a certificate already issued: Independent, original, unencumbered, the work of a person who owes nothing. The claimants want that halo without the procedure: No law firm, no physical separation, no written specifications, no signed declarations, no months of process - just a laptop, a loop, and the word “clean-room” typed into a README. The word must do the work of the process it replaces, and the delusional replacement is the entire point.

-

The irony runs deep

-

The Reticulum protocol is public domain. Any human being can implement it - from the mathematics, from the documentation, from their own reasoning - and owe nothing whatsoever to the license, to the reference implementation, or to me.

-

An honestly written implementation needs no incantations, no legal theater, and no special vocabulary; it simply is what it claims. It’s plain for everyone to see. It’s also plain for everyone to see when you’re faking it. The people who reach for the word “clean-room” are, without exception, the people who need it to create a fantasy - and the people who need that are precisely the people who cannot have it. If what you wrote were genuinely independent work on the public-domain protocol, you would not need to call it anything. The word is not a seal of independence. In this context it is a confession of copying, filed by the copier, in the confident belief that it says the opposite.

-
-
-
-

Open Source Means Open Source

-

An objection regarding the “open source status” of RNS appears occasionally in variations, but always reduces to the same syllogism:

-
    -
  1. “Open source” means licensed under one of the licenses approved by the Open Source -Initiative (or, in other variants, compatible with GPL orthodoxy).

  2. -
  3. The Reticulum License is not on that list.

  4. -
  5. Therefore Reticulum is not open source, and anything built on it is illegitimate.

  6. -
-

The entire argument rests on the first premise, and the first premise is false.

-

Open source is not a certification conferred by a committee. It is a description of a fact: The source code is available, and the rights to use, copy, modify, merge, publish, distribute, sublicense, and sell it are granted to everyone, free of charge.

-

The Reticulum License does all of those things. It is, in every substantive respect that concerns the person who wants to use, study, modify, or build upon the software, an open license. What it adds - and what disqualifies it in the eyes of the orthodoxy - is two conditions on who may do what with the original work, not on what the user is allowed to do with it.

-

The definition being wielded against Reticulum is not even a young one. It is, in essence, the Debian Free Software Guidelines written in 1997, adopted by the OSI in 1998, and treated ever since by certain people as if it had descended from a mountain on tablets. It is an approach that is close to three decades old. Being old is not itself a flaw - but being old is also not a proof of correctness, and the suggestion that the meaning of a word like “open” was settled for all time by a committee in the 1990s, and may never be revisited, is not a position rooted in reason. It is rooted in institutional inertia dressed as principle, maintained by those whose ideologies it serves.

-
-

What The Argument Is Actually Doing

-

I would like to go into some detail about the rhetorical mechanism, because it is roughly the same mechanism that powers the rest of the campaign described later in this chapter.

-

The orthodoxy’s argument is self-referential: “open source means what we say it means, because we are the ones who define it.” When the Reticulum License is measured against that definition and found wanting, the conclusion is presented as a property of Reticulum - when in fact it is a property of the definition. The definition is treated as neutral and authoritative - as some base fact of raw cosmology - and the license is treated as deviant. But the definition is no more neutral than the license is. It encodes a moral position, and that moral position is exactly the one that this project declines to take.

-

Consider what the orthodoxy’s definition requires, in the case at hand. The OSI-based definition contains, in its ancestry, the Debian Free Software Guideline of “No discrimination against fields of endeavor”: The software must not restrict who may use it or for what purpose. Taken to its logical end, this means that open source, properly “certified”, must be equally available to those who build hospitals and those who build weapons, those who connect people and those who control them, those who create and those who ingest and replace.

-

The orthodoxy presents this as neutrality. It is not neutrality; it is a moral position - one that says, in effect, that harming human beings is a field of endeavor like any other, and software must not discriminate against it.

-

The Reticulum License takes a different position, and it has the honesty to state it in the license text: this software is for life, not for death; it is for people, not for the systems that would replace them. That is not a restriction on openness, nor on freedom. It is a restriction on who may consume the work, and it is a restriction the orthodoxy’s definition cannot express - which is why the orthodoxy must always attack the license as “not open source” rather than engage with what it actually does.

-
-
-

Who Is Restricted By Which License?

-

The arithmetic is simple, so let’s do it out loud, because the orthodoxy’s framing inverts it every time.

-

The GPL family imposes its conditions on everyone: You may not distribute, link, or - in the AGPL case - even communicate with GPL-covered software without your own work being pulled under the same terms. “Free” in this system is defined (self-referentially) by the license’s own terms; everything outside those terms is, by definition, unfree. The restriction applies to 100% of users. It applies to the hospital, the mesh community, the school, and the hobbyist with the same force it applies to anyone else. That is not freedom for everyone; it is a specific moral architecture applied to everyone, presented as if it were the absence of one.

-

The Reticulum License imposes its conditions on a fraction of would-be users so small as to be practically unmeasurable:

-
    -
  • Those whose intended use is to build systems that purposefully harm human beings, and

  • -
  • Those whose intended use is to ingest the work into AI training pipelines.

  • -
-

That is the entire list. Everyone else - the overwhelming majority, the community, the developers, the users, the downstream projects - receives the full, unrestricted rights to use, copy, modify, merge, publish, distribute, sublicense, and sell the software, with none of the viral encumbrance of copyleft.

-

So when the claim is made that the Reticulum License “is more restrictive” than the GPL, the claim is not merely wrong; it is the exact inverse of the truth. The GPL restricts the freedom of everyone, in the name of a specific ideology.

-

The Reticulum License restricts the freedom of the harm-doer and the appropriator, and leaves everyone else free. The two approaches do not differ in whether they contain moral axioms - all licenses do. They differ in whether the axioms are stated openly, and in whose freedom they restrict.

-
-
-

The Consequences Of The “Not Open Source” Claim

-

This would be a footnote debate if the mischaracterisation had no practical consequences. It has very large ones, and therefore this section exists.

-

The claim that “Reticulum is not open source” is the foundation of the takeover narrative it so often accompanies. The sequence is always the same:

-
    -
  • First, declare the reference implementation illegitimate (“not really open source”, “owned by one man”, “not a real community project”)

  • -
  • Second, conclude that it is therefore acceptable - even necessary - to replace it.

  • -
  • Third, present the replacement, which is (conveniently) often the speaker’s own machine-generated clone, as the legitimate heir.

  • -
-

This is not speculation about motives; it is the documented structure of the campaign examined in A Movement Of A Dozen.

-

The “not open source” claim is the legal-ideological battering ram of that campaign. It is recycled, in article after article, in forum after forum, because it works on people who assume that a committee’s definition is the same thing as the truth.

-

It is also worth stating the other obvious fact: None of these critics have ever shown that the Reticulum License restricts them. They do not build weapons. They are not training models on the codebase. They are free, in every practical sense, to use Reticulum exactly as they would under MIT or GPL. Their objection is not to a restriction on themselves; it is to the mere existence of a license that states a moral position they disagree with, or which they can use as leverage for a different goal entirely, and to the institutional fact that it does so outside their system of approval and control. The complaint is not that the license makes them unfree. The complaint is that the license is free of them.

-
-
-

The Distribution Argument

-

A recurring companion claim is that RNS is not properly “distributed”, usually deployed as “it’s not packaged as a .deb” or “it’s not on package manager X”, with the implication that it is somehow unavailable or inaccessible, or hard to install on a given system.

-

This is simply false, and it has been false for years. The reference implementation is available on practically every platform and architecture with a single command (pip install rns). It is packaged in the Arch User Repository, in NixOS, and in a range of other distribution channels, community-maintained and official. It can be installed, updated, and kept current over Reticulum itself - the network transports its own software updates. It is used on more than a hundred thousand devices worldwide, is embedded in over a hundred other packages and applications, and carries terabytes of traffic every day.

-

The claim that Reticulum needs a .deb to be “really distributed” mistakes the mechanism for the goal. The goal is that people can obtain and update the software easily, everywhere, on their own terms, and distribute it themselves, both offline, online and over Reticulum with full cryptographic verification of the install packages, without any central infrastructure.

-

That goal is met to an excellence that few software packages can speak of, and met in a way that does not pin the project’s release cadence to the review cycles of distribution maintainers, which is an achievement, not a bug.

-

A project like RNS that updates continuously, sometimes daily, and has a track-record of shipping security updates mere hours after issues are discovered, would be crippled by packaging that makes every change wait months for approval. The distribution complaint is a strawman generated for the occasion. It has been answered, in public, many times; it is repeated anyway, because the people repeating it are not counting on facts - they are counting on the reader never having heard the answer.

-
-
-

On The Institutions, In Fairness

-

None of the above is hostility toward the Open Source Initiative or the Free Software Foundation as institutions, nor toward the individuals who have dedicated decades of work to them. Their contribution to the world of software is enormous, and this document does not dispute it. What is disputed is a specific claim of authority: That “open source” is a term whose meaning is reserved to a committee’s approval, and that a license which does not submit itself to that approval is therefore not open.

-

That claim of authority is not in Reticulum’s interest, and it is not in the interest of the people the movement claims to serve. The current legal and technological landscape - the machine-appropriation of the commons, the weaponisation of “prior work” generation, the erosion of human agency by synthetic systems - was not anticipated by the DFSG of 1997, and the institutions have not, as of this writing, produced any meaningful answer to it. The choice, as it was put at the time of the license change, is whether developers should sit back and wait for a solution from a committee that “may or may not ever materialize, before the entire foundation we stand on has been eaten away”.

-

Reticulum’s answer was to act. If we had waited, it would have been too late.

-

If an OSI-approved license existed that expressed the same constraints - and did not impose the far more severe restrictions of copyleft - the project would have used it. None such exists. That is not Reticulum’s failure. It is the measure of what the definition is missing.

-
-
-

What “Open” Means Positively

-

For anyone who wants the positive statement rather than the rebuttal, Open Source, in this project’s understanding, means:

-
    -
  • The source code is available, to everyone, without charge

  • -
  • Everyone may use, copy, modify, merge, publish, distribute, sublicense, and sell the -software

  • -
  • No one is discriminated against as a person - developer, user, community, or project

  • -
  • The protocol itself is dedicated to the public domain, where no one can own it

  • -
  • And the single, plainly stated condition of the license is that the work shall not be -consumed to harm human beings, or ingested to replace the humans who made it

  • -
-

If that is not “open” by a definition written in the 1990s, then the definition is the thing -that has failed - not the software, and not the people who use it.

-

Open source means open source. It was true before the committees existed to certify it, and it will remain true after they are gone.

-
-
-
-

Assistance Versus Machine-Substitution

-
-

False Dichotomy

-

The public discussion around machine learning and software development has been derailed, by the loudest voices on both sides, into a farcical fight between “AI enthusiasts” and “AI haters”.

-
-

Both positions are absolute caricatures.

-

The fight is beside the point in the ways that matters most.

-
-

It is not an accident, but a very conscious choice that the initial analysis of the Prns case examined herein, and this very chapter, were themself produced with the assistance of a machine-learning based generative system.

-

Specifically, it was generated using lc managing a Q8_K_XL quant of DeepSeek v4 Flash running in the llama.cpp inference engine. The main context base used to stabilize, ground and inform the generative environment consisted of approximately 100,000 tokens of text material that I personally thought out and wrote (by hand), then archived and organized, over the last eight years.

-

If you know my writing, and have a hard time discerning where this chapter is me directly, typing manually, and where it is the machine output, it is because of two things: Almost every line in this chapter was either directly edited by my hands on the keyboard or typed by me, and the text corpus that informed the process is genuinely me - my thoughts, written by me, over a period of years.

-

The chapter was produced this way deliberately and openly, under a software framework I designed and wrote, with the human directing the inquiry points, flow of investigation, structure of the outputs, contents of every section, making the editorial decisions, reviewing the conclusions, painstakingly adjusting every line, and taking responsibility for the final claims presented, with the goal of reaching a higher level of synthesis and symbolic density than I could have achieved without that assistance.

-

The tool was used as tool, both to structure and produce a complex chapter, and to inspect a repository so preposterous in size, commit velocity and nonsensical wording that it barred any purely human inquiry.

-

As such, the position is hereby, by personal example and demonstration, stated clearly:

-
    -
  • Technological assistance is not the problem

  • -
  • It was never the problem

  • -
  • It is the opposite of the problem

  • -
-

The problems are substitution and usurpation: The perverse process in which the machine becomes the author of choices, and the human becomes the facade of software, while expecting “reciprocity” or recognition for deeds they never performed.

-
-
-

The Line

-

The exact distinction can be reduced neither to how many lines of code a machine produced, nor who pressed the keys. The final distinction has to rest on who, or what, the real agent of the work is.

-
    -
  • Assistance is when the human retains the full seat of agency: The human decides what to build, judges -what is correct, rejects what is wrong, understands what is shipped, and can answer for every single line of it. -The machine writes, suggests, drafts, accelerates meaningfully and within reason - but every choice that survives into the -final work is a choice the human made consciously, and understood - or grew to understand - the consequences of.

  • -
  • Substitution is when the machine becomes the agency: the machine decides what to build, -decides what is correct, iterates on its own errors, generates at a scale and speed no single -human can follow - and the human’s role is reduced to providing the name, the account, the -signature, and the marketing launch.

  • -
-
-

The Line can be stated as a single test, and this is the same test that has always separated authorship from couriership: Can the person whose name is on the work answer for it fully? Not “can they describe what it does” - can they account for why it is the way it is, line by line and decision by decision, and the history of how it came to be that way, under questioning, without machine assistance, including by people who know more than they do?

-
-

If they cannot, they did not author the work. They wore it, or in more severe cases, they stole it. And a courier who claims authorship is not a writer; they are a fraud.

-
-
-

What assistance looks like

-

Assisted work is recognisable, and recognisability is itself part of its value. It has the following observable properties:

-
    -
  1. The human can explain it. Under examination, the author can say why this choice was -made, what was rejected, and what they verified. The ability to explain is not a luxury; -it is the very demonstration of authorship. On a large project with many contributors this is partial in -practice - no one can explain every line of a large codebase - but the full capacity must -exist between the authors and the habit must be visible.

  2. -
  3. The human can, and does, reject machine output. An author who has never rejected the machine’s output is not -an author, but an open drain. Rejection is not a stylistic flourish; it is the -mechanism by which any work attains Quality. A record of decisions, including reversals and rejections, -is a sign of agency. A record without rejection is a record of assent-by-default.

  4. -
  5. The human’s judgment is directional. The work contains the human’s actual choices; -things the machine would not have decided on its own, which the human can defend on their -merits. This directionality has many names in engineering: Design, architecture, taste, -judgment. Where it is absent, the work has the uniform, self-consistent texture of -something that was never doubted, and doubt is exactly what anything important requires.

  6. -
  7. Provenance is not concealed. Disclosure of how the work was made is not a legal -requirement in every jurisdiction; it is not even always a practical requirement. But it -is a statement that matters. A project that discloses its process - -including its use of machines - is telling the truth about the relationship between the -human and the work, and that is a property users are entitled to know. Concealment of -provenance is not a stylistic choice; it is deception, made by someone who knows what the -record would otherwise show.

  8. -
  9. The human stands behind the failures. When assisted work fails, the human can say: Yes, I -chose this, under these assumptions, here is why, here is what I got wrong, here is the fix. -That sentence is the entire contract between an author and the people who depend on their work. -A human who cannot say it - because the choices were never theirs - has nothing to offer anyone, and -is by definition entirely replaceable; anyone else could have pressed the same button.

  10. -
-
-
-

What substitution looks like

-

Substitution is equally recognisable, once the pattern is known:

-
    -
  1. Scope that no human could have authored. Output that -structurally cannot have been the product of human authorship, review, and judgment, for -example when the volume exceeds any reasonable human capacity within the span of the project’s life. -When the review capacity and the output volume are incommensurable, the output was not -reviewed. It was generated, then forgotten, and the record was signed blindly.

  2. -
  3. Uniform generation. The work carries no trace of a human’s changing mind. No style -drift, no contested decisions, no “we tried X and it was wrong, so we did Y”. That is, no -signs of actual development, growth and learning. Instead, endless, self-referential -refactoring, renamed abstractions, and the same fluent register in every commit, -every document, every reply. A human’s history shows the wear of judgment. -Pure generation shows the superficial polish of its absence.

  4. -
  5. Discovery by recursive regeneration. When errors are found, they are found by the machine’s own -subsequent runs, not by human scrutiny - and the findings are recorded as planned -“reviews” and “alignments” rather than as the corrections they are. This is the tell: A -machine editing its own previous output, while the edit is recorded as if it were a -scheduled milestone. That’s not review. That’s a continuous generation loop revising itself, -with the attempt of an illusion-preserving voice-over.

  6. -
  7. Laundered provenance. Theatrical concealment machinery: Commit hooks that refuse -attribution of machine generation, contribution policies that declare machine output -“yours”, processes that scrub personal traces from the history, fake identities in the -contributor list. All of these have one function: To make the record say what the “author” -wished had happened, rather than what happened. A project that builds such machinery is -not making a record of its work; it is using automated software to manufacture one.

  8. -
  9. Authorship by assignment. The human’s name is on the work, but the human cannot -answer for it - because the human did not choose any of it, and knows it. The name is not a -signature of authorship; it is a fraudulent claim of ownership over something the claimant did not -make and cannot explain. In every field that has ever dealt with such claims - art, -literature, invention, journalism - this has a name. That forgery is now cheap in software -makes it no more forgivable.

  10. -
-
-
-

Infrastructure Matters

-

For a hobby project, the distinction between assistance and substitution is a personal matter. For infrastructure - code that other people’s communications, safety, and freedom run on - it is a matter of life and safety, and any statement about this must be entirely unapologetic.

-

Infrastructure has one property that distinguishes it from almost all other software: While most of the people who depend on it cannot verify it themselves, it must be verifiable, auditable and open to human inspection, and be engineered in such a way that this is as frictionless and straight-forward as possible.

-

The reference implementation of Reticulum was designed this way, and continues to make that goal a primary one. While it is a complex piece of software, with an intricate array of interlocking and moving parts, the core parts of RNS, the entire Reticulum protocol implementation, the transport logic, the cryptographic primitive interfaces, is less than 15,000 lines of code. That line count even includes the rather extensive comments, incredibly detailed logging facilities and other choices that makes the code easy to read and understand for humans, and easy to operate, verify and debug. It took real dedication, and a lot of hard work to achieve that.

-

Exactly because not everyone can do this, it is a fundamental necessity for infrastructure software that it is designed and authored so that as many as possible can, and that the chain of accountability - who made it, who reviewed it, who answers for it - is held intact at every link. That chain is not decoration. It is the entire mechanism by which normal users decide to trust a system they cannot fully verify. The transparent foundations and the chain combined is the verification for most users.

-

Substitution breaks the chain both at the foundations, and at its load-bearing link: The human at the top can no longer answer, because they were never the maker. Unfortunately, the chain does not always fail visibly; often it fails silently, at the exact moment a question goes deep, or when routing fails subtly at a critical moment.

-

For the user, the result is not a project with a normal and humanly flawed author - it is a project with no author at all; a signature with no substance behind it, a name that cannot be held to account, and a body of work that nobody on earth can (or wants to) explain, defend, or fix in a crisis.

-
-
-

The Fluency Trap

-

It is worth understanding, briefly, why substitution is so attractive and so dangerous at once. Machine-generated output is fluent. It is confident, well-structured, and terminologically self-consistent. At the surface, and from the perspective of someone outside a given craft, it is indistinguishable from the output of a knowledgeable human. Fluency of this kind can be a useful property: It makes assisted work fast. But fluency is not understanding. It is the minimal conformal surface of understanding.

-

The danger is that the surface is exclusively where the substituter invests; for the simple reason that the surface is where most of the desired audience looks, and what yields attention to the project.

-

A human who can tell the difference uses the tool well. A human who cannot is being deceived through means they cannot detect from inside, namely through their own inability to account for the limits imposed by what they do not know.

-

This is why the most important quality for anyone working with systems like Reticulum is not speed, and not vocabulary, but the oldest engineering virtue there is: The honest, uncomfortable, terrorizing knowledge of what you do not know. The substitute never has it. The substitute’s operator, if they ever had it, loses it precisely the moment they accept the fantasy of the substitution process.

-

The tool is not the hazard, plain old human nature is. The tool is a mirror, and mirrors - as has been observed for rather longer than software has existed - show the truth only to those willing and yearning to see their own shortcomings.

-
-
-

Disclosed Assistance Or Laundered Generation

-

The contrast at the centre of this entire discussion can be made clearer with two examples, both of which are publicly accessible, both produced in the same year, by people using the same class of tools.

-

The first is this chapter. It was produced with machine assistance, openly: the structure was directed by the human, the material was assembled with the tool’s help, every conclusion, every line, every slight nuance of meaning and semantics was examined, edited, and accepted or rejected by the human, and the process described publicly - including the precise characteristics of the technological assistance framework used. The human can answer for every claim in these documents, because the human made the decisions the claims rest on.

-

The second is the project examined in the Prns case. It was produced by a machine, at a volume no human could review, and the authorship record was engineered to erase the machine’s role: A commit hook that refuses attribution of machine generation, a contribution policy declaring machine output the human’s own, a fictitious contributor identity, 637,000 lines of unreviewed code. The human cannot answer for the code, because the choices were never made by a human - only the conformal surface of the presentation was.

-

The same tool class. The same technology. Two diametrically opposed relationships to truth and responsibility. The difference is not the tool. The difference is the presence or absence of the human as the agent of the work - and the honesty or concealment with which that relationship is recorded.

-

Assistance leaves the human as the agent and the commons as the source from which the human works and can grow. Substitution removes the human from the loop and converts the commons into fuel for the thing that seeks to replace them, or usurp their work for the profit of the few, human atrophying in the process.

-
-
-

The License In This Context

-

The Reticulum License, examined in What The Reticulum License Is, draws the same line, at the level of the law. Its AI condition does not forbid the use of machine-learning technology to assist development - no reading of the license could support that, and no one associated with this project has ever claimed so. What the condition forbids is the appropriation of the work into the machine itself: The ingestion of the commons as raw material for synthetic replacement, and the concealed fabrication of “prior work” that would bury the real thing.

-

As also noted in Copyright & The Two Legal Layers, plain old copyright law already protects against the case where a process copies the reference implementation into a machine, produces a transformed derivative, and then claims “Copyright, [name of the process operator]”, with no human able to account for the creative decisions in the result. That is simple, petty theft, as it always has been.

-
-
-

The General Principle

-

In these regards, the position of this project can be codensed to something relatively concise:

-
    -
  • Machine assistance in human learning, development, and creation is accepted and useful. -It is not a shameful secret; but it is a tool that needs knowledge, training, understanding, -and great care to use. It should not make anything easier or more fun, it should make the -results better, more carefully considered, and arrive at higher levels of synthesis, not -produce endless streams of code churn.

  • -
  • The line is crossed when the human stops being the agent of the work. When any output is -accepted that the human cannot explain, produced at a scale the human cannot review, or filed under a record -where the human has arranged to conceal the fact.

  • -
  • The line is crossed, when a human claims authorship of work they cannot -answer for or has usurped. Credit follows the ability to answer. It has always worked that way, and -machines do not change the rule - they only make it cheaper and more tempting to break.

  • -
  • The people who depend on infrastructure have the right to know which side of the line -the code they run was made on. That knowledge is the only verification most of -them will ever be able to perform.

  • -
-

Use assistance, by all means, and learn, but don’t substitute. And never sign what you cannot answer for.

-

Somewhere, within the general shape of the conceptual framework outlined in this section, or realistically, a more refined variant of it, I do believe there is the potential of the beginning of a constructive outcome to the immense challenge we are faced with as a species in regards to these problems.

-

At the same time, I reserve my right to revert that position to Butlerian Jihad without prior notice. We are on a knife’s edge, and you know it just as well as I do.

-
-
- -
-

Evaluating a Reticulum Implementation

-
-

The Intention Of This Guide

-

Very few user of network infrastructure can verify the software they run. This is true of the reference implementation as well, and it is precisely why it was engineered the way it was: the entire Reticulum protocol implementation - the transport logic, the cryptographic interfaces, the routing - is less than 15,000 lines of code, including its extensive comments and detailed logging. The reference is designed to be readable by a human in a reasonable sitting. That is a deliberate decision, and it is the standard against which every other implementation should be measured: An implementation that asks for trust while being structurally unreadable is asking for the absurd.

-

Because most users cannot verify the code directly, the evaluation of the project is the evaluation of the software. The framework below exists so that this evaluation can be performed in minutes, by anyone, without expertise - and so that each new “implementation” does not require the kind of full investigation that would otherwise be if not impossible, prohibitevly expensive.

-
-
-

Two Questions That Resolve Most Cases

-

Other considerations in this guide is further corroboration. These two questions allow you to decide the case quickly in most instances, and they should be asked first.

-

Question 1: Does this speak the protocol, or was it just generated from the reference?

-

The copyright and license realities, described in What The Reticulum License Is, is the legal foundation of this distinction. The protocol is public domain: A genuine clean-room implementation, reasoned out and written by humans, is free and welcome, and owes nothing to any license. But an implementation that was directly generated from the reference - reproduced by a copy process, whether manually or through a machine or software - is a derivative of the licensed work, and is subject to both the license’s conditions, and to the ordinary copyright law examined in Copyright & The Two Legal Layers. A primarily machine-generated copy without substantial human creative input is not merely unlicensed; it is a copyright violation that would exist under any license at all.

-

Ask: Does the project say where its protocol knowledge came from? Does it credit the reference implementation, or claim “ground-up” status while its own history shows continuous ingestion of the reference’s source? Does its license carry the original copyright notice? The answers tell you, within minutes, which of two very different kinds of project you are dealing with.

-

Question 2: Who, or what, is the agent of the work?

-

This distinction, established in Assistance Versus Machine Substitution, is the trust foundation of everything else. Is there a human who decided what to build, judged what was correct, rejected what was wrong, understands what was shipped - and can answer for it, line by line and decision by decision, without machine assistance? Or is the machine the agent, with the human’s role reduced to the name, the account, and the signature?

-
-

This test has a sharper form: would the project be meaningfully different if someone else had pressed the button? If the answer is no - if any person could have been the signature and nothing would change - then the “author” is not the agent of the work. They are its facade, and the project is, in the most literal sense, worthless and unowned.

-
-

A project with no owner is a project no one can answer for, and infrastructure with no one to answer for it has no place carrying other people’s traffic.

-
-
-

Other Signals To Look For

-

Once the first two questions are answered, the following signals determine the verdict. None is alone decisive; together they form a pattern that is difficult to fake in the directions that matter.

-
-

Provenance and attribution

-
    -
  • Credit to the reference. Does the project name Reticulum’s reference implementation -in its README, its website, its licenses, and the code? Does it present itself as a port -or as a “ground-up” origin story? Absence of credit, in a field where every implementation -owes its existence to the reference, is not an oversight; it is a decision.

  • -
  • License compliance. For a derivative, the license conditions apply: the copyright -notice and permission notice in all copies and substantial portions, the harm condition, -the AI-training condition. A project whose license file claims a fresh copyright in the -operator’s name, over work that was generated from the reference, has failed the minimum -bar of honesty before any code is read.

  • -
  • Disclosed provenance. Is the use of machine assistance stated openly, or does the -project maintain machinery to conceal it - commit hooks that refuse attribution of -generation, contribution policies that declare machine output the human’s own, scrubbers -for personal traces, fictitious contributor identities? The first is the mark of a human -using a tool. The second is the mark of a record being manufactured.

  • -
  • The author’s history. Is there a prior record - projects, contributions, a body of -work that a person can look at and reasonably assess? A sudden, fully-formed “decade of experience” -appearing from nowhere, attached to a project of unprecedented scope, is a story that -contradicts itself.

  • -
-
-
-

Agency and answerability

-
    -
  • Who answers the questions? When technical questions are asked, does a human answer -with substance - going deeper, explaining trade-offs, admitting uncertainty - or do -answers deflect to process (“the CI verifies it”, “the proofs prove it”, “the audit -covered it”)? Are the answers themself machine generated? Deflection to process is -the substitute’s answer pattern: It names the machinery instead of the reasoning.

  • -
  • Velocity commensurate with authorship. Is the output volume compatible with human -authorship, review, and judgment? An implementation ten (or 42!) times the size of the reference, -produced in a fraction of the time by a single person, is not evidence of brilliance; it -is evidence of unchecked generation. Churn is part of the same signal: A project that -deletes half of everything it adds is not building; it is looping.

  • -
  • Signs of development, growth and learning. Do reversals exist? Contested decisions? -“We tried X and it was wrong, so we did Y”? Humans change their minds, admit mistakes, and -leave the wear of judgment in their history. Pure generation shows “the polish of its -absence”: uniform register, endless renaming, and errors discovered by the generator’s own -later runs, recorded as if they were planned milestones.

  • -
  • Standing behind failures. When something is wrong, does the human say “I chose this, -here is what I got wrong, here is the fix”? Or do corrections arrive as process language, -with nobody accepting that a decision was even made? A project whose history contains no -first-person acceptance of error contains no author.

  • -
-
-
-

Engineering reality

-
    -
  • Honest benchmarks, or none. If performance is claimed, is the baseline real - stock, -current, interpreted RNS, on the modern interface, at equal policy, with methodology -published in advance and reproducible by anyone?

  • -
  • Interop with reality. Is compatibility verified against the current reference -implementation - on real hardware, including the radio and serial interfaces this -protocol family lives on - in both directions, over long transfers, uptimes and edge cases?

  • -
  • The readability standard. Can a competent human read the core of this implementation -in a reasonable sitting, the way the 15,000-line reference can be read? Was human -readability a stated design goal, or an afterthought? A project that cannot be inspected -is a project asking for trust it has not earned and will never attend to.

  • -
  • Nonstandard inventions. Does the project “improve” on the protocol with its own -modes - new channel behaviour on shared spectrum, new rendezvous mechanisms, new crypto, -“post-quantum” replacements, “turbo” variants? Inventions that change behaviour on a -shared network are not features; they are forks of the airwaves, imposed on every other -node that shares the medium. A project that invents on top of a protocol it has not yet -correctly implemented is not advanced; it is dangerous to its neighbours.

  • -
  • The public record. The commit history is public. Read it.

  • -
-
-
-

Network citizenship

-
    -
  • Honest presence. Does the project identify itself honestly on the network, or does -it masquerade as something it is not?

  • -
  • Coexistence. Does it respect the shared medium and network conventions? A node that -is a bad neighbour on the spectrum is a hazard regardless of how well its code works in isolation.

  • -
  • Community participation. Does the author participate in the community as a member - -answering questions, contributing, learning - or only appear to advertise? The second is -not participation; it is exploiting the community as a broadcasting target.

  • -
-
-
-

Monetary and influence signals

-
    -
  • Money under the claim. Donations, funding, or commercial offers premised on claims -like “89× faster” or “formally proven” convert false marketing into a different category -of problem. When money changes hands on the strength of fabricated measurements, the -stakes are no longer theoretical.

  • -
  • Tokens and “investment” vehicles. Any implementation that surrounds itself with a -crypto token, a “coin”, or an investment pitch should be treated as what it is: A project -whose primary purpose is to earn the controller a profit, not open networking.

  • -
  • Marketing-first ordering. A polished website on day three, a twelve-language marketing -presence, a “benchmarks” page and a “get started” funnel existing before the protocol works -is a massive red flag. Real builders ship, then talk. The inverse order is the signature of -a project whose goal is attention.

  • -
-
-
-
-

The Conformal Surface

-

One warning before the synthesis. When you evaluate any project, assume - as a working hypothesis - that its surface is an investment. The marketing, the design, the badge collection, the “proof records”, the fluent and confident prose: This is exactly where substitution invests, for the simple reason that it is where the audience looks first. Fluency is the minimal conformal surface of understanding, and the surface is not evidence of anything except that the author wanted to look convincing. If you find yourself impressed by the surface before you have asked Question 1 and Question 2, you are doing the evaluation in the order the substitute operator hoped you would.

-
-
-

Possible Verdicts

-

The framework proposed here can yield three different verdicts:

-
    -
  1. Meets the standard. A named human who can answer for the work and demonstrably does; -provenance disclosed; attribution given; honest benchmarks; interop -demonstrated against current, real RNS on real media; readable code; a maintenance -history that shows growth and learning. This standard is not high. It is what the -reference implementation has met, in public, for over a decade, and it is what any -project that wants other people’s traffic should be willing to meet in turn.

  2. -
  3. Experimental, but honest. A project that clearly labels itself as in-progress and -experimental (“do not use this yet”, in plain words, as the first thing a user sees) -discloses its provenance, credits the reference, and is being developed in the open by -humans who answer questions. Such projects should be encouraged. They are how the -ecosystem grows, new ideas are tested, and the framework above is designed to make an -honest experimental project easy to recognize, not hard.

  4. -
  5. Does not meet the standard. Unanswerable authorship, concealed provenance, fabricated -measurements, invented protocol behaviour, absent interop, marketing ahead of substance. -Such projects should be treated as unproven regardless of their surface, and as hazards -if they invite users onto shared networks. The community owes them exactly the -skepticism they have earned, and not a moment of engagement beyond that; the network’s -time is better spent elsewhere.

  6. -
-
-
-

These Standards Are Reasonable

-

I’ll close this guide by stating what these standards are not: They are neither a demand for perfection, nor a ban on machine assistance. Assistance is useful, when it is used to arrive at higher levels of synthesis than unaided work. It is not a requirement that an implementation be a clone of the reference; neither is it a requirement that it invents everything from scratch or aspires to be a “clean-room” implementation. Good implementations of the protocol are very welcome, however they come, but working on one requires serious work, considerable skill, and deep competence.

-

The reference implementation has met this standard for years, and its users know what that looks like.

-
-
-
-

The Movement Of A Dozen

-
-

Presentation, Elongated

-

Whenever Reticulum defends itself, its license, or its community - or simply continues to exist - a familiar chorus appears. The register is always similar: concern. Concern about the direction of the project. Concern about its license. Concern about its governance. Concern about its “bullying” of “good-faith contributors”. Concern about the future of the ecosystem at the hands of a single maintainer. The chorus speaks in the plural, presents itself as a body of independent voices, and insists, with some frequency, that it is… not alone.

-

The implicit claim under examination in this section is that there exists a movement of concerned individuals, spread across the ecosystem, all worried about Reticulum, and therefore (for some reason) deserving of a place at the table of decisions.

-

A resolution of this claim requires one step: Count them.

-
-
-

Headcount

-

This “movement” does have a headcount. It is not in the hundreds, and it is not in the dozens. It is a small number of people who appear, in various combinations and under various names, in the following roles:

-
    -
  • Creators of the machine-generated “Reticulum implementations” examined in this chapter.

  • -
  • Creators of articles praising those implementations and lamenting the state of the -reference, its moral shortcomings, its unavailability or lack of something it already has.

  • -
  • Commenters “defending” the implementations when they are evaluated reasonably and critically, -most often by attempting simply to derail the discussion.

  • -
  • Critics of the Reticulum License on “open source” grounds.

  • -
  • “Concerned community members” objecting to the maintainer’s conduct.

  • -
  • Campaigners on online platforms; and

  • -
  • In some cases, a single individual performing several of these roles at once, under -different names, in the same week.

  • -
-

The overlap is well documented at this point, across time and different platforms. The same phrasing, the same arguments, the same links, the same reactive reflexes, the same handful of accounts appearing in the same threads at the same moments. When the sockpuppets are unmasked (and they frequently unmask themselves) the cast does not grow, but rapidly shrinks.

-

This is the most interesting single fact about the “movement”: It isn’t one. It is a synthetic cast, held together mostly by LLM-glue, reddit handles and hysteria. A cast is not a constituency. It performs; it does not represent. The difference matters quite a bit, because a great deal of this “movement’s” imagined power comes from the assumption that the plural form is actual evidence of plurality. If that sentence seemed opaque, notice how many times a statement or article uses “we” instead of “I”, and it will be less so.

-
-
-

Recycled Wine, Fermenting

-

The cast is not only small, it is also, by any evidentiary standard, forgetful. Every major claim this “movement” advances has been advanced before, answered in public, with evidence, and often years ago - and is then advanced again, unchanged and completely ignoring any rationale or evidence presented previously (to the same people), as if the answer had never been written.

-
    -
  • The license argument. Reticulum is “not really open source” because its license is not -approved by a particular orthodoxy. This is answered (now in a new and updated version, for the -fifth time) in full in Open Source Means Open Source. It was also -answered in public, at length, at the time of the license change - including the -arithmetic of who is actually restricted by which license. It is repeated ad infinitum anyway. -Quite a conversation starter, apparently.

  • -
  • The distribution argument. Reticulum is “not properly distributed” because it is not -packaged as a .deb or on some favoured catalogue. Reality: It is available on practically every -platform with a single command, packaged by the community in a wide range of channels, and -capable of updating itself over its own network. The argument has been answered; it is repeated.

  • -
  • The “stepped back” narrative. When the primary mirror of the project moved away from -a public internet platform, it was spun as the founder leaving for good, or now taking on dictatorial -powers, or abandoning his creation, or any variation or nonsensical combination thereof. -Those spins always center around justifying that a vaccuum now needs to be filled. -There was no such vaccuum. The narrative is repeated in various forms whenever convenient.

  • -
  • The enclosure narrative. The license is reframed as a “power grab” or an “enclosure” -of the commons - as if a license whose protocol is public domain and whose conditions -restrict only harm and appropriation were a form of enclosure. The most recent (and mostly incoherent) -expression of this narrative is, once again, fluent, polite, and factually hollow. The -bizarre arguments supporting the “article” include: Defunct and abandoned forks presented -as living, community forks bearing the very Reticulum License mislabeled as AGPL license vehicles -(created by “concerned users”), companion app forks correctly retaining the Creative Commons -licensing used as further evidence of the same and completely abandoned projects propped up -as being “the ecosystem”. Another case of LLM generated nonsense that the “author” didn’t bother checking. -The intent is clear here, simply produce more mass of the bullshit, so it can be further -referenced, regurgitated and linked to.

  • -
  • The “bullying” narrative. Whenever the community declines to treat manufactured -controversies as legitimate, or calmly documents the falsity of claims, or (Lord forbid) -moves a forum post for violating clearly stated forum rules, -the response is the same: The documentation is “bullying”, the community is “excluding” people, the -maintainer is “unprofessional”. In the most recent example, those accusations were made by someone who, in the -same week, publically called for the Reticulum maintainer’s “removal from the equation”, forged a moderator’s -username, attempted to drag unrelated individuals into the campaign, and presented a new -round of outright falsehoods. Contrary to popular belief, the accusation of incivility -is not the last resort of the wronged; it is the standard reflex of the exposed.

  • -
-

None of the “arguments” engages the answers given repeatedly, and extensively. That is the point, and the strategy. The arguments are not produced for the purpose of being engaged; they are produced for the purpose of being repeated - the same wine, poured into new bottles, on a cycle. Each cycle is short, cheap to produce, and (thanks to freely available fluent text generation) now nearly effortless. The intended audience is not the community, which has heard it all before. The intended audience is the newcomer, who has not.

-
-
-

The Method of Madness

-

The method behind the pattern is consistent and simple enough to be described precisely:

-

Bullshit asymmetry

-

Producing a fluent, plausibly-sourced smear is now the work of minutes. Refuting it to the standard this manual demands is the work of days, and the refuted smear is replaced by the next one within the week. This asymmetry isn’t just a fine point of the campaign; it is the campaign. The goal is exhaustion - the slow conversion of the community’s time and attention from building to defending.

-

Weaponized concern

-

The register of the campaign is almost always the register of solicitude: “we are worried about the ecosystem”, “we just want what is best for the community”, “this is about the future of the project”. The concern is directed, without exception, at the things the campaign wants changed, and the change it wants is always the same: The replacement of the reference’s authority with its own. Concern is the costume; capture is the choreography. It is the oldest form of cheap power grab in the book.

-

Event seizure

-

Any event - a license change, a platform move, a forum moderation decision, a subreddit closure, a security notice, even the most banal messages from maintainers or known contributors - are seized, stripped of their actual context, and re-narrated as evidence of the same pre-written story. The subreddit that was closed after its moderator vanished and ceased moderating (according to prior agreement with said moderator) becomes “the maintainer shutting down dissent”. Moving away from a highly centralized online platform becomes “the founder retreating”. The license becomes “the enclosure”. The pattern is so reliable that the story could be pre-written by a lightly mechanized quill; only the date changes. The actual real-world context of these events is documented, in public, in each case; the re-narration proceeds regardless.

-

The legitimacy circuit

-

The campaign invests heavily in the places where legitimacy is minted: Conference talks, blog platforms, social threads, and forums - presented as if these appearances constituted some sort of ecosystem-wide groundswell rather than the same dozen people moving through the same circuit. The LLM-generated articles cite the LLM-generated ports; the ports are praised in the articles; the managers of the ports spread the articles, and echo them on the forums and internet platforms; the conference presentations cite the forums. Random bypassers with the need for a cause watch the conference presentations and take on the holy duty of Internet Soldier. The circuit is closed, self-referential, and (to a reader encountering it fresh) convincing. It is also, entirely, a loop of bullshit.

-

The prior-work minefield

-

The machine-generated implementations have a consequence beyond attention: They flood the space with fake “prior work”. The effect, as the license discussion predicted in the beginning of 2025, is the creation of a minefield of sloppy repositories that can later be matched against any genuine project, and attempt to claim prior art, or even worse: Dissuade actual, honest developers or builders from taking up a real project they might have succeeded with, because they now believe it has already been done. Just as importantly, it also buries real efforts under machine-generated noise. The machine-ports are not failed attempts to contribute. They are (disregarding intentions, but effectively) the campaign’s long game, deployed as inventory.

-
-
-

A Persistent, But Fragile Triad

-

This chapter as a whole has documented three fronts: The legal-ideological attack on the license (Open Source Means Open Source), the substitution and usurpation pattern in machine-generated implementations (Assistance Versus Machine Substitution), and the takeover narratives examined in this section. They are three fronts of the same operation, run by the same cast.

-
    -
  • The license attack and other urgency-engineered narratives are the cover: They supply -the ideological justification for treating the reference as illegitimate, and needing replacement.

  • -
  • The ports are the inventory: they supply the “replacements” that the narrative claims -the ecosystem needs.

  • -
  • The takeover narrative is the objective function: the repeated, persistent, escalating claim that -the reference should be replaced, and that the speakers themself are the natural heirs.

  • -
-

Each front depends on the others, and all three depend on a single, fragile assumption: That their audience cannot count. Restore the count, and the charade collapses into what it is:

-

A small group of people, obsessively orbiting a technology they did not build, synthetically producing the -appearance of a constituency they do not have, in service of a takeover they cannot justify.

-
-
-

What The Pattern Is Not

-

It is important, to also say what this pattern is not, exactly because the campaign depends on being mistaken for such things.

-

It is not criticism

-

The Reticulum community has always had lively, rigorous criticism - of decisions, of priorities, of direction - and it has always engaged that criticism on the merits, and changed course and development priorities many times. The license discussions at the time of the change were extensive, public, and answered in full, including with the critics themselves. Core protocol decisions were always discussed and evaluated in the community. The complex coordination and execution of several protocol upgrades between a loosely organised group of developers, node operators and users have succeeded surprisingly fluidly. All of these are success stories that the “critics” always ignore. Real criticism engages the content and accepts evidence. The campaign engages nothing.

-

It is not a community

-

Communities build things, maintain them, and have skin in the game; long-term users, operators of nodes, authors of real applications, people whose traffic flows through the network every day. A community has a stake. The “movement” only has an agenda.

-

It is not a debate

-

A debate has parties who evaluate arguments and evidence, and as a function of that, the debate moves forward, perpetually. The campaign’s arguments, as shown above, are not designed to survive contact with answers, but to be repeated past them. You cannot debate a loop. You can decline to perform for it, though.

-
-
-

Intent & Consequence

-

While it would provide for interesting speculation, we do not need to know what the individuals in the cast intend, and this document will not speculate about their inner lives. People may believe their own narratives entirely, or partly, or not at all; the pattern is the same in any case, and the pattern is what matters here, since it is the exact thing that has been so insidiously destructive and resource wasting for the actual Reticulum project and community, ever since Reticulum was more widely discovered, popularized, and became a prime target for all sorts of grift known to man.

-

The consequences are very real:

-
    -
  • Time. The community’s scarcest resource is the attention of skilled people who actually build -and maintain the network. The campaign converts that attention into reactive defence, on a cycle -with no end.

  • -
  • Harm. Hastily machine-generated implementations, marketed as drop-in replacements and carrying -traffic onto shared networks, mislead users and can damage the network and its neighbours. -We, the actual reticulum community, all rely on these networks every day, and it is my belief -that we need to defend them. The fabricated measurements and laundered authorship examined in this chapter are not -editorial embellishments; they are the mechanism by which real users are induced to run -unverified, and often destructive software.

  • -
  • Erosion of the currency of trust. Every manufactured scandal, every fluently polite smear, every -fabricated “movement” debases the currency of trust and degrades it for everyone; -including, most of all, the honest projects that come after. This is deep harm, and -it is the primary reason this chapter exists.

  • -
-

Whatever the intent - profit, control, attention, or a simple, obsessive inability to stop - the mechanism is the same, and the response should be calibrated to the mechanism as a whole, not to the individual person acting as the current avatar for it.

-
-
-

Recognition & Response

-

For anyone who encounters the pattern fresh, here is a proposal on how to recognise it, and what to do about it.

-

Recognition: The pattern is recognisable in minutes, once the signs are known:

-
    -
  • Claims that have been answered before, repeated as if never answered.

  • -
  • The register of solemn concern applied, without exception, in one direction.

  • -
  • A severe allergic reaction to answering any questions posed.

  • -
  • A cast that is small, overlapping, and frequently anonymous, with the plural form doing the -work of plurality.

  • -
  • Sockpuppet theater: The same person or footsoldiers thereof appearing as several “supporters” -(and occasionally slipping up mid-performance).

  • -
  • Articles, ports, and forum threads that cite and reference each other in a closed loop.

  • -
  • The immediate, reflexive turn to “bullying”, “exclusion” and “toxicity” whenever a claim is refuted.

  • -
  • A complete absence of engagement with the substance of the answers given, and a complete -absence of stake in the network itself.

  • -
-

Response: A constructive response is one that is proportionate, and does not cost the -community its resources, sanity and dignity:

-
    -
  • Engage the content once, on its merits (if any), with evidence, in public, and then refer to the -existing records. The answers already exist; they do not need to be re-derived for every new -bottle of piss-sour burgundy served from a man behind the curtains. I will do my best to keep this -chapter up to date with such answers and records, for easy reference, but other great resources -exist.

  • -
  • Do not become part of the theater performance. The “movement” feeds on engagement in any form; -attention is its fuel, and outrage is as good as endorsement for them, if not better.

  • -
  • Do the headcount. When the audience is reminded that a “movement” is a dozen people -recycling answered falsehoods, its projected power dissipates. The power was never real; -only the audience’s own assumption of scale can make the illusion effective. A polished-looking -“ground up” implementation might look like the work of many people, but is most likely -just the result of an LLM looping on a laptop for a couple of months (this is weird, but it is -the reality we now live in). Four different users suddenly singing in unison may look like the -representatives of a broader sentiment, but is most likely the same person hiding behind the same keyboard.

  • -
  • Then, spend the saved time on the networks: On building real infrastructure, putting up nodes -and antennas, on real development, real maintenance, real coexistence, and on the people -who actually use Reticulum. The things that we can only do together, as humans. That is -what the fake “movement” cannot do, no matter how fluent and smooth its productions become.

  • -
-
-
-
-

Network Health & Coexistence

-
-

Substance Of The Networks

-

Before examining health, we should consider what is being protected. The networks are not a repository. They are not a website, a social presence, or a set of marketing pages. They are a habitat: A living commons of communication, carried by, from a catious estimate, an intermesh now consisting of over a hundred thousand physical devices, embedded in a plethora of applications and packages, transporting terabytes of traffic every single day - real messages, real coordination, real people - across radios, serial lines, phones, laptops, and backbone servers, in cities, places and ways that no other network reaches.

-

The protocol belongs to humanity; no one owns it. The network belongs to everyone on it, and its membership is defined by nothing other than participation: A node on a mast, a phone in a pocket, a server routing for its neighbourhood, a developer building on the commons. The network has no gatekeepers because it needs none; it is held together by the same physics and mathematics everywhere, and by a shared expectation of how members behave. That expectation - unwritten, unenforced by any central authority, and just as important as any code - is the subject of this section. The Zen of Reticulum calls the software a habitat. A habitat is healthy or unhealthy as a whole, and the health of this one is decided, every day, by the people who live in it.

-
-
-

Health Is A Property Of The Whole

-

A network is not made healthy by the excellence of any single part. It is made healthy by the behaviour of every part on the shared medium, and how they interact. And the shared medium is the point. When your node transmits, it transmits into the same spectrum, the same line, the same time, the same mathematical address space, the same bandwidth that its neighbours depend on.

-

The network cannot be certified by any single project’s claims. A node that is a bad neighbour, that invents its own channel behaviour on shared spectrum, that announces without discipline, that spawns tens of thousands of links to scrape the network, that floods and retries without mercy, is a hazard to every node that shares its medium, regardless of how well its “creator” imagines its own code to work in isolation.

-

On a shared medium, “my software works” is not a complete sentence. The complete sentence is “my software works and coexists”. A network’s health deteriorates with its worst-behaved member, and every member has a responsibility to not be that member. There is no final, technical solution for this; the solutions are human.

-
-
-

A History Of What Works

-

Let’s recall, because it is the ground truth this entire thing rests on, that the coexistence model has worked - is working, right now, at scale. Reticulum’s protocol decisions have been discussed and evaluated in the community, openly, for years. Protocol upgrades have been designed, coordinated, and executed between a loosely organised group of independent developers, node operators, and users - and have succeeded, repeatedly, without any corporate board, without any central command, and without the collapse that the skeptics predict every second week (while screaming for GOVERNANCE). The reference implementation has been developed in the open for over a decade, by a maintainer who answers for it, fixes bugs or issues within hours of their discovery, and is set down in code deliberately kept small enough (the entire protocol implementation under 15,000 lines, including its comments) for a human to read, verify, and challenge.

-

This is the empirical baseline that every narrative examined in A Movement Of A Dozen conveniently ignores, in order to justify:

-
    -
  • The claim that the project is a one-man dictatorship

  • -
  • The claim that the community is excluded

  • -
  • The claim that the networks need saving from their own founders

  • -
-

The reality, documented and reproducible, is that a loose community of humans coordinates complex technical evolution without the apparatus the narratives insist is missing. The health of the networks is not a promise for the future; it is a demonstrated property of the past and present, under the leadership and community model that brought it into existence and navigated it through difficult decisions and situations over a decade. My job is to keep it that way, and you can be damned certain that I take it seriously.

-
-
-

The Role Of The Individual

-

The networks are built by physical acts and human coordination. You cannot prompt an antenna into existence. No model can string up a dipole, or stand in the rain aligning a radio, or coordinate with a neighbour three valleys away about who covers which repeater frequency, or sit down with a newcomer and explain why their first node didn’t announce. These are the acts that make a network organic - present in the physical world, resilient because it is real, valuable because it is human. The machines and technology we use are tools aimed at a well-defined, openly described goal. But the networks themself are composed of intentional human actions, and every node operator is infrastructure for other humans.

-

This has a corollary for the individual: You do not need permission, and you do not need to be an expert, to participate. Run a node. Help a neighbour. Ask questions in the community, and answer the questions you can. Build something small at first. The network grows by these acts, and they are the most meaningful ones - the things that can only be done together, as humans, in the physical world. The parasitic “movement” that haunts the peripheries of this ecosystem cannot do any of this. It cannot build a node because it does not exist, in any real connected and human sense; only people can, and people are precisely what a self-recurrent loop lacks.

-
-
-

The Place Of New Implementations

-

The future of the network includes more implementations - and they are welcome. This chapter is not an argument against implementing Reticulum. The protocol is public domain, by design, and the network is made stronger by genuine diversity: More good implementations, honestly made, mean more resilience, more experimentation, more people who understand the protocol deeply because they have built it themselves. That is the goal: For people to understand and own the technology they rely on. Not to spew out 600,000 line rust ports that fills no meaningful gap or purpose.

-

What the ecosystem needs, from every implementation, is the ordinary floor that Evaluating A Reticulum Implementation establishes, and that the reference has met for over a decade: A human who made it and answers for it; provenance disclosed; attribution given; benchmarks honest or absent; interop demonstrated against the real network; code a human can read. And it needs the one thing that costs nothing and changes everything: Honest labeling.

-

An experimental implementation that says, plainly, as the first thing a user sees: “This is in-progress, experimental, do not depend on it yet, but help if you can”, that is a gift to the ecosystem. It contributes, it invites participation, and it protects users.

-

The opposite, the polished “drop-in replacement”, does damage far beyond its own users: It dissuades the honest developers who might have built the real thing, because the polished slop persuades them the work is already done. That dissuasion is one of the quietest and most expensive harms in this entire affair, and the antidote is honesty at every project’s door.

-
-
-

Expanding The Commons

-

Coexistence, reduced to its essentials, is a short formula; the duties of membership in a network no one owns:

-
    -
  • Be honest. Say what you are, what you built, how you built it, and what you used to -build it. Label experimental work as experimental. Credit the work you build on, including -the reference implementation, in the licenses and in the prose. Concealment is not a -defence; it is a very clear diagnosis marker.

  • -
  • Be owned. Have a human who made the work and can answer for it. Use assistance, don’t -substitute. Never sign what you cannot answer for. The chain of accountability is the -community’s only verification at scale, and every link in it is a person, not a facade.

  • -
  • Be a good neighbour. Respect the shared mediums. Do not invent new behaviour in our -shared space and call it progress. The network belongs to its other members as much as -to you.

  • -
  • Verify against the network. Compatibility is a property demonstrated with actual nodes, -on actual media, against the actual current protocol, over a period of years, not 48 hours. -And not a claim pinned to an old snapshot over loopback.

  • -
  • Participate as a member. Ask, answer, help, build. Advertising at the community is not -the same as being part of it, and it is not the first thing you should do.

  • -
-

None of this is a high bar. It is the bar the reference implementation has met, in public, for over a decade, and the bar the ecosystem has adopted organically itself, successfully, through every protocol upgrade it has ever coordinated, and everything running on Reticulum today, that people actually use. It is not a new requirement; it is the existing, working culture of the networks, now written down so that newcomers can find it and so that those who would exploit us cannot claim they never saw it.

-
-
-

Defence Of The Commons

-

The networks need defending - not because they are under severe physical attacks (yet), but because attention, talent and resources is being stolen from them, trust is being mined against them, and its newcomers are being harvested by the machinery documented in this chapter. Defence, for a commons, has specific shapes, and it is not what the theater would like it to be.

-
    -
  • Defence is documentation: Records kept public, of what was claimed, what was -answered, and what turned out true.

  • -
  • Defence is a headcount: Calm, unexcited reminders that a “movement” might just be a dozen -people having a tantrum.

  • -
  • Defence is honesty in action: The visible, ordinary practice of the good behaviour -by the people who actually run the networks.

  • -
  • And defence is building: Every node raised, every page of real documentation, every -honest implementation, every new user helped into the community with the knowledge to know -what they are doing is more durable than any rebuttal, because it adds to the thing being -defended.

  • -
-
-

The theatre cannot keep up with a network.

-

It can only orbit it, while it recycles its own sour piss.

-
-

A lot of us rely on these networks every day. They carry our messages, our coordination, our friendships, and in some places, our safety. That is exactly why they are a target:

-

They are valuable, free, and very hard to shut down. The response is not to become aggressive. It is to be more of what the network already is: Real, open, owned, and shared.

-

Mark

-
-
-
-

Addendum A: The Prns Case

-
-

Purpose & Scope

-

This section provides a concrete example, which future evaluations can use as a template. Its purpose is not to be the last word on this particular subject, but to be an example of how the ideas in this chapter can be applied, and to make the next such examination easier.

-

The subject of this case study is Prns, a project published at the repository github.com/KenAKAFrosty/Prns, presented as a “ground-up implementation of Reticulum, written in Rust”, marketed as faster, safer, and more strictly tested than the reference, widely promoted with the claim of “up to 89× the throughput” of the reference implementation, and an “author” actively engaged in the tactics described in A Movement Of A Dozen on online platforms. The record described below is the project’s own, and sourced from its GitHub repository, analyzed locally.

-
-
-

The Project In Brief

-
    -
  • Time span. 3,374 commits between 2026-05-26 and 2026-09-12: approximately 110 days, -at a mean rate of ~31 commits per day. Monthly: 132 / 1,137 / 1,097 / 805 / 203.

  • -
  • Authorship. 3,252 of 3,374 commits (96.4%) are authored by a single account. A -second identity, “Prns Tests tests@example.test” - a fictitious identity on a reserved -domain - contributed 35 commits, every one of them website and marketing content.

  • -
  • Size. 3,519 tracked files; 1,983 Rust files; 636,226 lines of Rust; approximately -22.7 MB of Rust source; 69.5 MB of total repository content.

  • -
  • Scope claimed. A daemon (“drop-in replacement” for the reference daemon), embedded -firmware for three microcontroller families (including six ESP32-S3 board variants and -nRF52840), SDKs and bindings for nine languages, a browser-based node and web flasher, a -twelve-language website, a benchmark apparatus with its own publication and “proof” -pipeline, and a validation hub with oracles, fuzzing, mutation testing, and formal-proof -claims.

  • -
  • Marketing claims. “Ground-up implementation of Reticulum”; “up to 89× the -throughput”; “48× smaller peak-memory footprint”; “33× the energy efficiency”; -“Measured, not just claimed”; “Enforced, then audited”; “byte-for-byte wire parity with -the reference implementation”; “works with Sideband, NomadNet, MeshChat, etc.”; -“no_std (no alloc required either)”.

  • -
  • Status at the time of writing. Version 0.3.7; published version history begins at -0.3.0. The repository continues to receive commits.

  • -
-
-
-

Question 1: Is this a clean implementation, or was it directly generated from the reference?

-

The first of the two deciding questions from Evaluating A Reticulum Implementation is settled by the project’s own record. An actual clean-room implementation, reasoned out and written by humans, would owe nothing to any license. The data available shows clearly that Prns is not that.

-
    -
  • The founding state. The first commit, “Scaffold Personal Reticulum suite”, contains -the scaffolding of not one but two ports - personal-rns and personal-lxmf, the latter -being the reference’s companion messaging protocol - together with a daemon scaffold and -a 233-line founding document, docs/build-ethos.md. That document declares the project’s -goal as a “performance-focused drop-in-replacement for rnsd” and its governing principle -as: “Port the contract, not the implementation.” It further states directly to the -machine-loop, that “You owe the reference fidelity at exactly two boundaries: -The wire… The behavior. … Between those two boundaries, the model is yours”. -At this point, the very first commit, effectively the whole of the implementation design -and any relevant decisions are handed over to the LLM.

  • -
  • Continuous ingestion from the reference. 506 commits reference RNS or Reticulum -source behaviour; the word “parity” appears in 49 commit messages. Commits cite the reference -implementation’s own source locations (for example Transport.py:1367) when correcting -their own divergences and mistakes.

  • -
  • Byte-level fidelity as an explicit goal. Within 48 hours of the first commit, the -record shows a “crypto adapter - vetted primitives, byte-exact vs RNS 1.3.1”, and a wire -implementation matching the reference’s packet header layout. The project’s own -validation apparatus decodes wire vectors using the reference implementation’s own -packet parser, and the interop suite consists of real, stock-RNS peer nodes - that is, -the reference source itself, used as the ground truth against which this LLM output is -checked, and committed as accepted and verified after 48 hours of the project’s recorded start.

  • -
  • The marketing mismatch. The same record that documents all of the above describes the -project, publicly, as “a ground-up implementation of Reticulum” - while declining, on its -website, to link to the reference implementation at all: the entire tree mentions the -reference’s author in six files, and the website in none.

  • -
-

Conclusion: the project’s own history and commit record establishes that it was generated directly from the reference implementation’s source code, not reasoned out from the public-domain protocol. It is a derivative of licensed work within the meaning of the Reticulum License and general copyright law. The “ground-up” claim, which carries its entire legal and marketing posture, is disproven by the project’s own history.

-
-
-

Question 2: Who, or what, is the agent of the work?

-

The second deciding question is answered by the application of Assistance Versus Machine Substitution criteria to the project.

-

Scope that no human could have authored

-

636,226 lines of Rust in 110 days is approximately 5,800 lines per day, every day, including weekends - with 149 commits recorded between midnight and 06:00, and Saturday the single busiest weekday. No human review or decision capacity is commensurable with this volume; the review capacity and the output volume are structurally incommensurable, which is the definition of unauthored scope.

-

Uniform generation

-

The record shows no sign of human development, growth, or learning: No contested decisions, no style drift. Instead: endless renaming (in the first 48 hours: State → EngineState → TickInput → TickOutput), uniform fluent register in every commit, and the exact same, synthetic voice in code, documentation, and website copy.

-

Discovery by regeneration

-

Corrections arrived by the machine’s own subsequent runs, recorded as planned milestones. In early July 2026, a series of “core review” commits documented, in the project’s own words:

-
    -
  • announce-ID history “was unbounded per-slot growth” (54cc8d601);

  • -
  • interface announce limiting could “leak a sustained flood” (9d27af75c);

  • -
  • a “phantom-airtime leak” where frames “used to vanish silently” (4ed75ffdd);

  • -
  • Group-packet deduplication “which RNS does not do” - a behaviour the reference never had, -implemented and later removed (edd8e72be);

  • -
  • “both unwrap_or(&[]) arms were unreachable dead defaults” (74bea355e);

  • -
  • a benchmark crate “hasn’t compiled since” a prior rename, undetected for weeks because it -was outside the CI’s workspace (86240b027).

  • -
-

Earlier still: the record shows a “>1 MiB RNS-to-Prns interop stall” closed three weeks in -(cc4d524a3), and a known send-path hang shipped with the note “typed fast-fail a -candidate for later” (a010e6613).

-

Laundered provenance

-

The repository contains a committed commit-message hook (.githooks/commit-msg) that blocks any commit containing attribution for machine generation (“generated with claude/codex/copilot/cursor/gemini”, “co-authored-by”), with the explanation “The committer owns the commit”. The contributing guide is explicit: “AI tools … are welcome … what you submit is yours”, and describes the contributing population as “both human and automated contributors”. The fictitious “Prns Tests” identity completes the picture: A manufactured, unknowable contributor, used for marketing content.

-

Authorship by assignment

-

The human whose name is on the work cannot answer for it, because the choices were never made by a human, and only the general shape and constraints of the outward presentation was. Nothing in the project’s history shows an individual explaining a design decision, accepting a mistake in the first person, or going deeper under technical questioning; the record shows process language and marketing instead. Per the earlier mentioned test: any other person could have pressed the same button, and nothing would be different. The project is effectively unowned, and void of value.

-

By the criteria of Assistance Versus Machine Substitution, this is substitution. The machine was the agent of the work; the “author” was a facade.

-
-
-

The performance claims

-

The project’s central marketing claim - “up to 89× the throughput” of the reference - is also its most completely documented failure, because the project published the evidence of its own measurement. The apparatus, the results, and the problems are all on the record.

-

The claim

-

The README states “up to 89× the throughput”; the on-network marketing page repeats “up to 89× the throughput, 48× smaller peak-memory footprint, and 33× the energy efficiency of stock RNS 1.4.2”; the website’s front page carries the tagline “Measured, not just claimed”.

-

The apparatus

-

The reference is loaded through benchmarks/reference/compiled_reference.py, which installs pyximport and then asserts two things: that RNS.compiled == True, and that at least one RNS module was loaded from a native extension. The project’s own published “proof” records show exactly what those checks captured, on every platform:

-
aarch64-apple-darwin: .../RNS.cpython-313-darwin.so,  Cython 3.2.8, Python 3.13.13
-x86_64-unknown-linux-gnu: .../RNS.cpython-313-x86_64-linux-gnu.so,  gcc 11.4.0
-x86_64-pc-windows-msvc: ~/.prns-oc/lib.win-amd64-cpython-313/RNS.cp313-win_amd64.pyd
-
-
-

In every case the recorded native module is the top-level package only - RNS.so, nothing below it. Nothing named RNS.Transport, RNS.Destination, RNS.Packet, RNS.Link, or RNS.Resource ever appears, because nothing below the top level was ever compiled. Nobody bothered to check or verify anything here.

-

The machine output was simply taken for truth, and a full marketing strategy was spun and produced on it. “RNS 1.4.2 (compiled)” - the label used in every table, chart, and marketing page - is not a mode of RNS that exists, but the hallucinations of a machine, which the humans created a marketing strategy on. In reality, it is the old CRNS development shim, whose top-level-only, debug-oriented “compilation” is slower than plain interpreted RNS, and which was defunct for over a year before these benchmarks were published.

-

Interface choices

-

The harness writes the reference’s configuration itself (benchmarks/reference/participant_node.py): TCPClientInterface for the initiator, TCPServerInterface for the responder and both relay sides, with UDPInterface as the abstract wire. The reference was never given its modern BackboneInterface on any platform, forcing the slowest possible interrfaces. The interface selection is never mentioned in any methodology text.

-

The policy

-

The published default-policy tables record the asymmetry directly: Prns at 500 Mbps / 128 KiB TCP policy against the reference at 10 Mbps / 8 KiB - slyly footnoted as “preserves each implementation’s normal TCP policy” (in the case of RNS, a conservative default policy that was selected to prioritize coexistence on slower, shared links, requiring the user to dial it up to full speed if they knew what they were doing). Raw transport “throughput” ratios of 20.65× (Linux) and 38.84× (Windows) are therefore mostly policy, not engine.

-

The cross-host evidence

-

The published results show the same scenario producing wildly different ratios by host, and the variance is entirely in the reference artifact:

-
- - - - - - - - - - - - - - - - - - - - - - - - - -

Host

Prns, single-packet

“Reference”, single-packet

Ratio

macOS (Apple M4)

37.4k/s

420/s

89.09×

Linux (i7-1260P)

25.3k/s

3.5k/s

7.19×

Windows (Ryzen 5 5600X)

30.8k/s

3.9k/s

8.00×

-
-

Prns is consistent (25–37k/s). The reference artifact collapses to different depths on different hosts, and the single worst collapse - 420 packets per second on macOS - is the cell selected as the global headline. The “89×” is not a measure of Prns; it is a measure of how badly the broken baseline happened to fail on one host.

-

For reality calibration: Stock, interpreted RNS 1.5.4 on an ordinary mid-range laptop, single core, sustains roughly 30,000 single-packet deliveries per second (including ephemeral-key decryption), ~175,000–280,000 packets per second in transit relay, and on the order of 10 Gbps at 16 KiB payloads. The project’s “compiled” artifact measured 420–3,900 packets per second for its single-packet scenario: An order of magnitude or more below stock interpreted RNS. The comparison being marketed was not “Rust vs Python”; it was “an implementation running under optimal conditions versus a mislabeled, broken shim on a slow legacy interface at a severe policy disadvantage”.

-

The equalized rows

-

The project’s own “1 Gbps policy” rows, in which both sides are explicitly configured identically, publish ratios of roughly 2.4–8.4× across all hosts and scenarios - still against the broken baseline, but nowhere near 89×, and consistent with the ordinary, uncontroversial observation that a native implementation tends to outperform an interpreted one in raw throughput. That point needed no fudging to make, and is banal.

-

Interestingly, though, it seems that Prns is really only marginally faster than a Python implementation, running in interpreted mode, on a single CPU core.

-

Assessment

-

The front page says “Measured, not just claimed.” The record shows the opposite ordering: claimed, and arranged to look measured. No methodology section anywhere states what “compiled” means, that it is a deprecated development shim, that it builds debug targets, or which interface the reference was given; the one statement of the policy asymmetry appears in a footnote of the results tables themselves. If they did not need to fudge it, they would have published the method clearly.

-
-
-

Overall Evaluation

-

Evaluated against the conditions of Evaluating A Reticulum Implementation:

-
    -
  • Provenance and attribution. Fails: The fake “ground-up” origin story; zero reference links -on the website; a single well-hidden link in the README; a license file reading -Copyright (c) 2026 The Prns Authors over work directly generated from the licensed reference; -no original copyright or permission notice anywhere.

  • -
  • Agency and answerability. Fails on every criterion of Assistance Versus Machine Substitution: -Unauthored scope, uniform generation, discovery by regeneration, laundered provenance, -authorship by assignment.

  • -
  • Engineering. Fails: The benchmark apparatus above; interop demonstrated only -against a pinned, outdated reference version over loopback while the marketing claims current -parity, interop failures with stock RNS; vendored prebuilt binaries and a republished fork -of an upstream crate (nrf-softdevice 0.1.0-prns.1) with no verifiable provenance; -committed WASM bundles.

  • -
  • Network behaviour. Fails: Invented spectrum behaviour and compatibility claims -about third-party applications of the reference ecosystem (Sideband, NomadNet, MeshChat) -that are not established by any evidence.

  • -
  • Monetary and influence signals. The marketing apparatus - website before protocol, -day-three twelve-language marketing, false benchmark headlines, “audited” and “formal proof” -claims - the conformal surface described in Evaluating A Reticulum Implementation: -is where this project invested.

  • -
-
-
-

Licensing Analysis

-

Applying the two legal layers established in Copyright & The Two Legal Layers:

-

Layer A - copyright infringement (license-independent)

-

The record shows a direct copy roundtrip: the licensed reference implementation fed into a machine, transformed, at a scale and cadence no human could review, with a license file asserting a fresh copyright in the operator’s name and no acknowledgment of the work the project was generated from. No substantial, new human creative input is demonstrated anywhere in the record - the founding document explicitly frames the design as an instructed port of the reference’s contract. A primarily machine-generated copy of a copyrighted work, not accompanied by demonstrable substantial human creative input, is a derivative work over which the copier holds no copyright, and a reproduction of which without the original author’s permission infringes the original author’s copyright. This holds under any license, MIT included. The operator’s copyright claim over the result is, on this evidence, not merely unsubstantiated; it is the absence of one, directly asserted in the project’s own writing.

-

Layer B - license conditions (Reticulum License specific)

-

Modern Reticulum - the current wire format, the AES-256-based link encryption, ratchets, the cryptographic machinery as it exists today - has been published under the Reticulum License since April 15, 2025, effective from release 0.9.4 and every release since. As a derivative of that work, the license’s conditions attach: The copyright and permission notice must be included in all copies and substantial portions; the AI-training condition must be honoured; the harm condition must be honoured. The record shows none of the notice requirements met, and a production process that consists of the licensed work being ingested into a machine and regurgitated, at industrial scale and cadence.

-

The cascading consequence

-

Prns is distributed claiming dual MIT/Apache-2.0 licensing. It is, however, a direct derivative of Reticulum-licensed work, and the claimed grant is therefore void. Every downstream project that builds on Prns believing it is MIT/Apache-licensed is building on a grant that does not exist. The users of Prns, and all software developers using it, have in effect, been placed under conditions they were never told about. The “ground-up” claim is not merely false; it is the sole load-bearing element of an entire licensing posture, and it fails spectacularly.

-
-
-

Consequences

-

The consequences of this pattern are examined in the following sections: The harm to users and to the network in A Movement Of A Dozen, and the human dimension in Network Health & Coexistence. The contribution of this addendum is narrower and intended as an instructive example: This is what a substitution project looks like, in full, on its own record. It is a reference example for Evaluating A Reticulum Implementation, and it demonstrates, in one case, most of the elements this chapter describes.

-
-
-

Verdict

-

Applying the three verdicts of Evaluating A Reticulum Implementation, this project does not meet the standard. It is not “experimental but honest” - it is not labeled as experimental anywhere; the first thing users saw was a polished marketing presence promising a finished, tested, drop-in replacement. It is a project whose central claims are fabricated (the performance apparatus), whose provenance is laundered (the authorship machinery), whose foundation is misrepresented (the “ground-up” story), whose core semantics were learned late and by regeneration, and whose operator cannot possibly answer for any of it. It is also a blatant copyright violation of the reference implementation.

-

The proposed conclusion, for users and for the network: Treat the Prns project as hostile regardless of its polished surface, and as a hazard insofar as it invites users onto shared networks. Nothing in this section is a judgment about the people involved; it is a reading of the results produced, their history and how they came to be, which in the regrettable lack of any human authorship is the only thing that can be expected to be held to account.

-
-
-

Dating

-

This examination reflects the publicly available material as of September 2026; the repository in question continued to receive commits at the time of writing, so readers should treat citations to commits and files as point-in-time evidence. A forensics snapshot is publicly available on GitHub.

-
-
-
- -
-
- -
- -
-
- - - - - - - \ No newline at end of file diff --git a/docs/manual/distributed.html b/docs/manual/distributed.html index 6e2e4b6d..9013fc72 100644 --- a/docs/manual/distributed.html +++ b/docs/manual/distributed.html @@ -7,7 +7,7 @@ - Distributed Development - Reticulum Network Stack 1.6.1 documentation + Distributed Development - Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
@@ -204,7 +204,7 @@
- Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation
- + diff --git a/docs/manual/examples.html b/docs/manual/examples.html index 181b1970..582a469d 100644 --- a/docs/manual/examples.html +++ b/docs/manual/examples.html @@ -7,7 +7,7 @@ - Code Examples - Reticulum Network Stack 1.6.1 documentation + Code Examples - Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
@@ -204,7 +204,7 @@
- Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -218,7 +218,6 @@
  • Zen of Reticulum
  • Programs Using Reticulum
  • Using Reticulum on Your System
  • -
  • Protecting Open Networks
  • Understanding Reticulum
  • Communications Hardware
  • Configuring Interfaces
  • @@ -228,7 +227,6 @@
  • Support Reticulum
  • Code Examples
  • Reticulum License
  • -
  • Brandolini’s Reference
    • API Reference
    • @@ -1069,9 +1067,6 @@ "linkexample" ) - # We can optionally configure a link request stamp cost - server_destination.set_link_cost(14.2) - # We configure a function that will get called every time # a new client creates a link to this destination. server_destination.set_link_established_callback(client_connected) @@ -3653,7 +3648,7 @@
    - + diff --git a/docs/manual/forhumans.html b/docs/manual/forhumans.html index e4955c11..bafc0839 100644 --- a/docs/manual/forhumans.html +++ b/docs/manual/forhumans.html @@ -7,7 +7,7 @@ - An Explanation of Reticulum for Human Beings - Reticulum Network Stack 1.6.1 documentation + An Explanation of Reticulum for Human Beings - Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
    @@ -204,7 +204,7 @@
    - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -218,7 +218,6 @@
  • Zen of Reticulum
  • Programs Using Reticulum
  • Using Reticulum on Your System
  • -
  • Protecting Open Networks
  • Understanding Reticulum
  • Communications Hardware
  • Configuring Interfaces
  • @@ -228,7 +227,6 @@
  • Support Reticulum
  • Code Examples
  • Reticulum License
  • -
  • Brandolini’s Reference
  • - + diff --git a/docs/manual/genindex.html b/docs/manual/genindex.html index 96e49c40..afba883d 100644 --- a/docs/manual/genindex.html +++ b/docs/manual/genindex.html @@ -5,7 +5,7 @@ - Index - Reticulum Network Stack 1.6.1 documentation + Index - Reticulum Network Stack 1.5.1 documentation @@ -178,7 +178,7 @@
    @@ -202,7 +202,7 @@
    - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -216,7 +216,6 @@
  • Zen of Reticulum
  • Programs Using Reticulum
  • Using Reticulum on Your System
  • -
  • Protecting Open Networks
  • Understanding Reticulum
  • Communications Hardware
  • Configuring Interfaces
  • @@ -226,7 +225,6 @@
  • Support Reticulum
  • Code Examples
  • Reticulum License
  • -
  • Brandolini’s Reference
  • get_transfer_size() (RNS.Resource method) -
  • -
  • get_value() (RNS.Identity method)
  • @@ -686,17 +678,13 @@
  • recall() (RNS.Identity static method)
  • recall_app_data() (RNS.Identity static method) -
  • -
  • recall_link_cost() (RNS.Identity static method) -
  • -
  • recall_stamp_value() (RNS.Identity static method)
  • register_announce_handler() (RNS.Transport static method) +
  • +
  • register_message_type() (RNS.Channel.Channel method)
  • - + diff --git a/docs/manual/gettingstartedfast.html b/docs/manual/gettingstartedfast.html index 11e304a4..204c8596 100644 --- a/docs/manual/gettingstartedfast.html +++ b/docs/manual/gettingstartedfast.html @@ -7,7 +7,7 @@ - Getting Started Fast - Reticulum Network Stack 1.6.1 documentation + Getting Started Fast - Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
    @@ -204,7 +204,7 @@
    - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -218,7 +218,6 @@
  • Zen of Reticulum
  • Programs Using Reticulum
  • Using Reticulum on Your System
  • -
  • Protecting Open Networks
  • Understanding Reticulum
  • Communications Hardware
  • Configuring Interfaces
  • @@ -228,7 +227,6 @@
  • Support Reticulum
  • Code Examples
  • Reticulum License
  • -
  • Brandolini’s Reference
    • API Reference
    • @@ -378,9 +376,7 @@ sudo dnf groupinstalldirectory.rns.recipes and rmap.world.

      Tip

      -

      Don’t rely on just a single connection to the distributed backbone for everyday use. It is much better to have several redundant connections configured, and enable the interface discovery options, so your nodes can continously discover peering opportunities as the network evolves.

      -

      But don’t overdo it either! Auto-connecting to a hundred different nodes will waste capacity for node operators and not provide any benefit for yourself either.

      -

      Refer to the Discovering Interfaces section to understand the options.

      +

      Don’t rely on just a single connection to the distributed backbone for everyday use. It is much better to have several redundant connections configured, and enable the interface discovery options, so your nodes can continously discover peering opportunities as the network evolves. Refer to the Bootstrapping Connectivity section to understand the options.

      @@ -780,7 +776,7 @@ section of this manual.

    - + diff --git a/docs/manual/git.html b/docs/manual/git.html index c760fd9f..3bff4352 100644 --- a/docs/manual/git.html +++ b/docs/manual/git.html @@ -7,7 +7,7 @@ - Git Over Reticulum - Reticulum Network Stack 1.6.1 documentation + Git Over Reticulum - Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
    @@ -204,7 +204,7 @@
    - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -218,7 +218,6 @@
  • Zen of Reticulum
  • Programs Using Reticulum
  • Using Reticulum on Your System
  • -
  • Protecting Open Networks
  • Understanding Reticulum
  • Communications Hardware
  • Configuring Interfaces
  • @@ -228,7 +227,6 @@
  • Support Reticulum
  • Code Examples
  • Reticulum License
  • -
  • Brandolini’s Reference
    • API Reference
    • @@ -268,7 +266,6 @@

      Git Over Reticulum

      This chapter of the manual serves as the technical reference for the distributed software development and project collaboration tools included in RNS. For a conceptual overview, see the Distributed Development chapter.

      A set of utilities for distributed collaborative software development and publishing are included in RNS.

      -_images/rngit.webp

      The system consists of two parts: The rngit node that hosts repositories, and the git-remote-rns helper that enables Git to communicate with rngit nodes. As soon as you have RNS installed on your system, you can transparently use Git with Reticulum-hosted repositories just like any other type of remote. Git over Reticulum uses URLs in the following format: rns://DESTINATION_HASH/group/repo.

      If you set a branch to track a Reticulum remote as the default upstream, you can simply use git as you normally would; all commands work transparently and as expected.

      @@ -359,10 +356,6 @@ Repository public/myrepo created

    This creates a bare Git repository at the specified path. You must have create permission for the target group. When a repository is created, the creator automatically receives adm (admin) permissions on the repository through an auto-generated .allowed file.

    -
    -

    Tip

    -

    If you want to use a different primary branch name than master, you can change it inside the bare git repository directory with git symbolic-ref HEAD refs/heads/name_of_other_branch.

    -

    All Command-Line Options (rngit create)

    usage: rngit create [-h] [--config CONFIG] [--rnsconfig RNSCONFIG]
                         [-i PATH] [-v] [-q] [--version]
    @@ -759,7 +752,7 @@ options:
     

    Enabling the Git Page Node

    To enable the page node, add the following to your ~/.rngit/config file:

    [pages]
    -  serve_nomadnet = yes
    +serve_nomadnet = yes
     

    When the page node is enabled, rngit will listen on a Nomad Network node destination in addition to the Git repository destination. You can view the destination hash by running:

    @@ -771,13 +764,6 @@ Repositories Destination : <0d7334d411d00120cbad24edf355fdd2> Nomad Network Destination : <50824b711717f97c2fb1166ceddd5ea9>
    -

    You can configure the destination stamp value and required link establishment cost with the following options:

    -
    [pages]
    -  serve_nomadnet = yes
    -  stamp_value = 25.0
    -  link_cost = 18.0
    -
    -

    Accessing Repository Pages

    @@ -830,7 +816,6 @@ def hello_world():
  • commit.mu - Individual commit detail page

  • refs.mu - Branches and tags listing

  • stats.mu - Statistics page

  • -
  • no_ident.mu - Displayed to non-identified initiators if blocked

  • Templates can include the following variables:

      @@ -845,8 +830,8 @@ def hello_world():

      Icon Sets

      By default, the page node uses Nerd Font icons. If you prefer simpler icons or your terminal does not support Nerd Fonts, you can enable Unicode icons instead:

      [pages]
      -  serve_nomadnet = yes
      -  unicode_icons = yes
      +serve_nomadnet = yes
      +unicode_icons = yes
       
    @@ -869,8 +854,6 @@ def hello_world(): node_name = My Git Node announce_interval = 360 record_stats = yes - stamp_value = 27.5 - link_cost = 18.5 [repositories] public = /var/git/public @@ -883,8 +866,6 @@ def hello_world(): [pages] serve_nomadnet = yes unicode_icons = no - stamp_value = 27.5 - link_cost = 18.7 @@ -1613,7 +1594,7 @@ done - + diff --git a/docs/manual/hardware.html b/docs/manual/hardware.html index 26afa0b3..72046d69 100644 --- a/docs/manual/hardware.html +++ b/docs/manual/hardware.html @@ -7,7 +7,7 @@ - Communications Hardware - Reticulum Network Stack 1.6.1 documentation + Communications Hardware - Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
    @@ -204,7 +204,7 @@
    - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -218,7 +218,6 @@
  • Zen of Reticulum
  • Programs Using Reticulum
  • Using Reticulum on Your System
  • -
  • Protecting Open Networks
  • Understanding Reticulum
  • Communications Hardware
  • Configuring Interfaces
  • @@ -228,7 +227,6 @@
  • Support Reticulum
  • Code Examples
  • Reticulum License
  • -
  • Brandolini’s Reference
    • API Reference
    • @@ -678,7 +676,7 @@ can be used with Reticulum. This includes virtual software modems such as
    - + diff --git a/docs/manual/index.html b/docs/manual/index.html index 7a8418a2..aa706ad0 100644 --- a/docs/manual/index.html +++ b/docs/manual/index.html @@ -7,7 +7,7 @@ - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
    @@ -204,7 +204,7 @@
    - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -218,7 +218,6 @@
  • Zen of Reticulum
  • Programs Using Reticulum
  • Using Reticulum on Your System
  • -
  • Protecting Open Networks
  • Understanding Reticulum
  • Communications Hardware
  • Configuring Interfaces
  • @@ -228,7 +227,6 @@
  • Support Reticulum
  • Code Examples
  • Reticulum License
  • -
  • Brandolini’s Reference
    • API Reference
    • @@ -374,49 +372,28 @@ to participate in the development of Reticulum itself.

  • Programs Using Reticulum
  • @@ -849,7 +721,7 @@ to participate in the development of Reticulum itself.

    - + diff --git a/docs/manual/interfaces.html b/docs/manual/interfaces.html index b1ca7737..2ff7a1e2 100644 --- a/docs/manual/interfaces.html +++ b/docs/manual/interfaces.html @@ -7,7 +7,7 @@ - Configuring Interfaces - Reticulum Network Stack 1.6.1 documentation + Configuring Interfaces - Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
    @@ -204,7 +204,7 @@
    - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -218,7 +218,6 @@
  • Zen of Reticulum
  • Programs Using Reticulum
  • Using Reticulum on Your System
  • -
  • Protecting Open Networks
  • Understanding Reticulum
  • Communications Hardware
  • Configuring Interfaces
  • @@ -228,7 +227,6 @@
  • Support Reticulum
  • Code Examples
  • Reticulum License
  • -
  • Brandolini’s Reference
    • API Reference
    • @@ -463,7 +461,7 @@ specify the target Yggdrasil IPv6 address and port, like so:

    -

    Automated Blocking

    +

    Automated Blocking

    Listener instances of BackboneInterface will automatically block fast-flapping clients, that repeatedly connect for a short amount of time, and then disconnect. Such behavior usually occurs from clients trying to spam the network with announces or path requests, by connecting, dumping @@ -1128,6 +1126,13 @@ relevant regulation for your location, and to make decisions accordingly.

    Discoverable Interfaces

    Reticulum includes a powerful system for publishing your local interfaces to the wider network, allowing other peers to discover, validate, and automatically connect to them. This feature is particularly useful for creating decentralized networks where peers can dynamically find entrypoints, such as public Internet gateways or local radio access points, without relying on static configuration files or centralized directories.

    When an interface is made discoverable, your Reticulum instance will periodically broadcast an announce packet containing the connection details and parameters required for other peers to establish a connection. These announces are propagated over the network using the standard Reticulum announce mechanism using the rnstransport.discovery.interface destination type.

    +
    +

    Note

    +

    To use the interface discovery functionality, the LXMF module must be installed in your Python environment. You can install it using pip:

    +
    pip install lxmf
    +
    +
    +

    Enabling Discovery

    Interface discovery is enabled on a per-interface basis. To make a specific interface discoverable, you must add the discoverable option to that interface’s configuration block and set it to yes.

    @@ -1651,13 +1656,13 @@ sub-interfaces when a new client connects.
  • The ic_burst_freq_new option sets the maximum announce ingress -frequency for newly spawned interfaces. Defaults to 3.0 +frequency for newly spawned interfaces. Defaults to 3.5 announces per second.
  • The ic_burst_freq option sets the maximum announce ingress -frequency for other interfaces. Defaults to 10.0 announces +frequency for other interfaces. Defaults to 12 announces per second.
    @@ -1669,27 +1674,27 @@ not processed until later.

  • The ic_max_held_announces option sets the maximum amount of unique announces that will be held in the queue. Any additional -unique announces will be dropped. Defaults to 64 announces.
    +unique announces will be dropped. Defaults to 256 announces.
  • The ic_burst_hold option sets how much time (in seconds) must pass after the burst frequency drops below its threshold, for the -announce burst to be considered cleared. Defaults to 15 +announce burst to be considered cleared. Defaults to 60 seconds.
  • The ic_burst_penalty option sets how much time (in seconds) must pass after the burst is considered cleared, before held announces can -start being released from the queue. Defaults to 15 +start being released from the queue. Defaults to 5*60 seconds.
  • The ic_held_release_interval option sets how much time (in seconds) must pass between releasing each held announce from the queue. Defaults -to 5 seconds.
    +to 30 seconds.
  • @@ -1903,7 +1908,7 @@ queue. Defaults to - + diff --git a/docs/manual/license.html b/docs/manual/license.html index c0523399..e6ea525d 100644 --- a/docs/manual/license.html +++ b/docs/manual/license.html @@ -3,11 +3,11 @@ - + - Reticulum License - Reticulum Network Stack 1.6.1 documentation + Reticulum License - Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
    @@ -204,7 +204,7 @@
    - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -218,7 +218,6 @@
  • Zen of Reticulum
  • Programs Using Reticulum
  • Using Reticulum on Your System
  • -
  • Protecting Open Networks
  • Understanding Reticulum
  • Communications Hardware
  • Configuring Interfaces
  • @@ -228,7 +227,6 @@
  • Support Reticulum
  • Code Examples
  • Reticulum License
  • -
  • Brandolini’s Reference
  • + diff --git a/docs/manual/networks.html b/docs/manual/networks.html index caea4704..c4c25754 100644 --- a/docs/manual/networks.html +++ b/docs/manual/networks.html @@ -7,7 +7,7 @@ - Building Networks - Reticulum Network Stack 1.6.1 documentation + Building Networks - Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
    @@ -204,7 +204,7 @@
    - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -218,7 +218,6 @@
  • Zen of Reticulum
  • Programs Using Reticulum
  • Using Reticulum on Your System
  • -
  • Protecting Open Networks
  • Understanding Reticulum
  • Communications Hardware
  • Configuring Interfaces
  • @@ -228,7 +227,6 @@
  • Support Reticulum
  • Code Examples
  • Reticulum License
  • -
  • Brandolini’s Reference
    • API Reference
    • @@ -666,7 +664,7 @@ differently than a mobile device roaming between radio cells.

    - + diff --git a/docs/manual/objects.inv b/docs/manual/objects.inv index ba046ab3..bca1f245 100644 Binary files a/docs/manual/objects.inv and b/docs/manual/objects.inv differ diff --git a/docs/manual/protecting.html b/docs/manual/protecting.html deleted file mode 100644 index 625814ea..00000000 --- a/docs/manual/protecting.html +++ /dev/null @@ -1,720 +0,0 @@ - - - - - - - - - - Protecting Open Networks - Reticulum Network Stack 1.6.1 documentation - - - - - - - - - - - - - - - - - - Contents - - - - - - Menu - - - - - - - - Expand - - - - - - Light mode - - - - - - - - - - - - - - Dark mode - - - - - - - Auto light/dark, in light mode - - - - - - - - - - - - - - - Auto light/dark, in dark mode - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -Skip to content - - - -
    -
    -
    - -
    - -
    -
    - -
    - -
    -
    - -
    -
    -
    - - - - - Back to top - -
    -
    - -
    - -
    -
    -
    -

    Protecting Open Networks

    -
    -

    Important

    -

    Reticulum is currently transitioning towards full, on-network stamp verification and enforcement via a phased transition:

    -
      -
    • The 1.6.0 release completely implements the required mechanisms, and will start excercising the verification system in the transport backend. By default, 1.6.0 does not enable full stamp generation, emission and enforcement, but all of these options can be early-enabled in the configuration.

    • -
    • The 1.6.1 release will enable full stamp generation and emission of all types by default, but will leave the enforcement a configurable option.

    • -
    • The 1.6.2 release will complete the transition, activating full stamp enforcement across all the systems.

    • -
    -

    The stated version numbers are the intended release sequence. If any issues or implementation problems are found during the initial network deployments, the transition points may be pushed later than this plan by interim releases.

    -
    -

    While you can create entirely closed-off and private networks with Reticulum, the protocol itself is open and permissionless. On widely interconnected networks, anyone can create identities and globally reachable destinations without external permission or approval, and establish links anonymously over the network.

    -

    Such capabilities are powerful, and a required characteristic of a truly functional communications fabric, but also raise very large challenges, that have been almost impossible to solve in legacy networking technologies.

    -

    Reticulum approaches this particular problem, like most others, by employing cryptographic principles. This provides a comprehensive, multi-layered repertoire of defense mechanisms, which can be composed and employed in very effective ways.

    -

    In contrast to other networking paradigms, these mechanisms do not have to be bolted on to the application layer in hindsight, but are a core part of the protocol itself, which means that they can be applied universally and effectively:

    -
    -

    All nodes help combat spam and network abuse, according to the rules set by the actual owners of supplied resources - not by any bureaucracy or external authority.

    -

    Rules and requirements can be adjusted live, dynamically and directly, and by those that actually operate and run the infrastructure and services.

    -
    -

    The system has been designed so that it becomes very cheap computationally for resource-providing nodes to verify or reject traffic, and very expensive for malicious nodes to abuse the shared resources provided by the network’s operators.

    -
    -

    Cryptographic Stamps

    -

    All networking primitives that consume shared network resources are gated by stamps. A stamp is compact, cryptographic token that proves that a certain amount of computation and energy has been expended in its creation.

    -

    The amount of such computation required for a stamp to be considered valid can be configured individually by the operator of the resource being made available, whether that is network transport, a node providing information for retrieval, a shared voice room, or something else entirely.

    -

    While the core functionality is completely automatic, and handled by Reticulum itself, the primitives are made available at the application layer API as well, so that developers can use them to implement further protections, if required by their usage scenarios. In most cases, however, simply setting the target values and required costs for the built-in mechanisms will be sufficient.

    -

    The value of a stamp is a decimal representation of how difficult a stamp was to create, on a scale from 0.0 to 100.0. The scale is exponential. An increase of one point is equal to doubling the average compute time required. Fractional values are supported, such as 14.125.

    -

    Internally, the fractional part is quantized to 256 different values, giving an approximately 0.27% difficulty increase per step. You can use any decimal number when configuring stamps, such as 9.3691 and you do not have to worry about “landing on” the correct step values. Reticulum will automatically handle the quantization, wire-transport representation and value comparisons.

    -

    The term cost is used everywhere a stamp value requirement is configured or specified. In general, value refers to the actual, determined value of a given stamp, cost refers to a value requirement.

    -
    -

    Base Primitives

    -

    Reticulum provides two types of base stamp primitives:

    -
    -
      -
    • Detached stamps can be tied to any external information, and are useful for stamping both static information and for one-time verification purposes. The stamp itself is a detached, short binary sequence, typically 14 to 32 bytes, that can be verified directly against the stamped material.

      -

      They can be configured from relatively easy to compute, even for embbedded systems and microcontrollers, all the way to something that is practically impossible, even with all the compute and memory on the planet.

      -
    • -
    • Embedded stamps are tied directly to a Reticulum Identity keyset, and embedded within it. The keyset itself contains the stamp, and there is no external, detached byte sequence for them.

      -

      Anyone can verify the value of an identity-embedded stamp simply from the public key material of the identity.

      -
    • -
    -
    -
    -
    -

    On-Network Types

    -

    The base primitives are used to implement scenario-specific network-level primitives that, if configured correctly, make spam and network abuse expensive, but validation and enforcement cheap and efficient.

    -
    -
      -
    • Destination Stamps are detached stamps associated with reticulum destinations. They are included in all announces sent by a destination, and by verifying that their value matches a transport node’s cost requirement, they can be either accepted for rebroadcast onto the network, or rejected and dropped.

      -

      Destination stamps are one-time generations, and are reusable across announces. They limit the number of new destinations that can be created, and makes it expensive to spam a network with destinations that do not provide anything meaningful. As such, these stamps will typically target relatively high values, and their cost requirements should be set accordingly.

      -

      A generation time for such stamps in minutes rather than seconds can very well be reasonable on large, open-access networks. Due to their detached nature, they can also be pre-generated off-device (and do not require the private key material for generation), so that even low-powered nodes, such as microcontrollers, can use high-value destination stamps, by having them generated and loaded externally as a one-time procedure.

      -
    • -
    • Path Request Stamps are also detached stamps, but generated individually for every path request emitted on the network. These will typically have a much lower cost requirement than destination stamps, but if a node is overwhelmed by path requests, it can be tuned higher.

      -

      The stamp is generated against the individually unique emission, so that unstamped or low-value path requests for a destination cannot disrupt the resolution of legitimate ones toward that same destination.

      -
    • -
    • Link Request Stamps are embedded stamps, carried in the ephemeral link request keyset. They are therefore completely transparent to the network, but can still be verified extremely quickly by any node along the link request path, who can then make a decision on whether or not to transport it.

      -

      Link request cost targets are set by the endpoint destinations individually. Every destination that includes a stamp in its announces will also include link request cost signalling. This means that any node that hears an announce from the destination will also know what link request stamp value to target, when establishing links to that destination.

      -

      Furthermore, spam and link request abuse can be filtered before even reaching the destination, if at least one node along the path validates the link request stamp value and cost requirement.

      -
    • -
    -
    -

    All of the stamp primitives, functionality and on-wire signalling is transparent and backwards-compatible with older versions of Reticulum transport nodes. This means, that even if a node doesn’t itself understand stamp functionality, it will still transport all the required information. Stamped announces, path and link requests can cross older, non stamp-aware network segments transparently and unaffected.

    -
    -
    -

    Configuring Stamps

    -

    Reticulum, and its included utilities, provide sane default cost requirements and value targets for the different types of network stamps, but it is entirely up to the operator whether to follow the defaults. All of them are configurable on a per-node, per-application and per-destination basis.

    -
    -

    Instance Configuration

    -

    In reality, different kinds of networks will want to configure different kinds of costs and value targets for their use. For instance-wide defaults and settings, you can configure these in the [stamps] section of the Reticulum configuration file:

    -
    -
      -
    • -
      The destination_cost option sets the default required stamp -cost for announced destinations to be accepted, and have their -announces propagated by this node. Defaults to 23.5.
      -
      -
    • -
    • -
      The destination_value option sets the default stamp value that -this instance will target when generating new destination stamps. -An application can request higher targets for destinations that it -creates, but a requested lower value will always be clamped to the -configured default as a minimum. Defaults to 25.0.
      -
      -
      -

      Destination stamps are one-time generations per destination, so it -is generally a good idea to target a slightly higher value than the -minimum required cost of the networks you want the destination to -be reachable on.

      -
      -
    • -
    • -
      The pr_cost option sets the required stamp cost for incoming -path requests. Defaults to 15.8.
      -
      -
    • -
    • -
      The pr_value option sets the target stamp value for path -request stamps generated by this instance. Defaults to 15.8.
      -
      -
    • -
    • -
      The lr_cost option sets the default link request stamp cost, -that destinations created on this instance will require. This -value can be freely overridden by applications that specify their -own link request cost requirements, and is solely used as the -default if no such specification is provided. Defaults to 12.5.
      -
      -
    • -
    • -
      The lr_stamp_timeout and pr_stamp_timeout options set the -maximum amount of time, in seconds, to spend while attempting to -generate link and path request stamps respectively. If a stamp is -not generated within this timespan, the generation is cancelled, -and the link request or path request fails. Defaults to 15 -seconds for both options.
      -
      -
    • -
    • -
      The stamp_destinations option enables generation and emission -of destination stamps in announces. This is a transitory option. -It will become mandatory and enabled by default in RNS 1.6.1.
      -
      -
    • -
    • -
      The stamp_prs option enables stamping of path requests emitted -by this instance. This is a transitory option. It will become -mandatory and enabled by default in RNS 1.6.1.
      -
      -
    • -
    • -
      The always_stamp_lrs option will stamp all outgoing link -requests, even to destinations that have not announced a link -request cost (and will, in that case, use the configured or -default link request cost). This option is mostly useful for -testing and diagnostics. In general use, Reticulum will handle -link request stamping and cost targets automatically.
      -
      -
    • -
    • -
      The enforce_stamps option allows early activation of stamp -enforcement. When enabled, announces and path requests that do -not meet the configured cost requirements are dropped, and link -requests with insufficient stamps are ignored. This is a transitory -option. It will become mandatory and enabled by default in RNS -1.6.2.
      -
      -
    • -
    -
    -

    An example of customised stamp cost and value configuration follows below:

    -
    [stamps]
    -  stamp_destinations = yes
    -  stamp_prs = yes
    -
    -  destination_cost = 24.8
    -  destination_value = 26.25
    -
    -  pr_cost = 15.8
    -  pr_value = 16.45
    -
    -
    -

    Stamp cost requirements can also be configured on a per-interface basis:

    -
    [[Public Gateway]]
    -  type = BackboneInterface
    -  mode = gateway
    -  listen_on = 0.0.0.0
    -  port = 4242
    -
    -  destination_cost = 25.0
    -  pr_cost = 17.2
    -
    -[[Local RNode]]
    -  type = RNodeInterface
    -  port = /dev/ttyUSB0
    -
    -  # Much lower requirements
    -  # for the local network.
    -  destination_cost = 11.2
    -  pr_cost = 5.0
    -
    -
    -
    -
    -

    For Developers

    -

    Applications can dynamically set their own stamp values and required link requests costs at runtime. Whenever the values are adjusted, the destination will have to send an announce for the updated information to become known by the rest of the network.

    -

    If you are setting these values at destination creation time, ensure that they are set immediately after the destination is instantiated, as Reticulum may queue internal, instance-local announces for the destination shortly after creation, so that the local shared instance and its clients are aware of the newly created destination.

    -
    # Create a new destination
    -my_destination = RNS.Destination(
    -    my_identity,
    -    RNS.Destination.IN,
    -    RNS.Destination.SINGLE,
    -    "myapp", "service"
    -)
    -
    -# Configure stamps
    -my_destination.set_value(30.0)
    -my_destination.set_link_cost(15.0)
    -
    -
    -

    Dynamically adjusting link request costs is a viable and intended mechanism for mitigating resource abuse, scraping, DoS attempts and other malicious behaviour. An application may implement mechanisms to statically or dynamically raise link request costs under certain conditions.

    -
    -

    Tip

    -

    Remember here, though, that announce cadence should be preserved for such situations! If your destination is announcing too often in general, and wants to dynamically adjust link request costs at a critical moment, it may already have exhausted its announce rate limits on upstream nodes. So plan your application’s announce cadence thoughtfully!

    -
    -

    It is also possible for application code to directly get the destination value and link request cost for any known destination:

    -
    # Get the value of a known destination
    -RNS.Identity.recall_stamp_value(destination_hash)
    -
    -# Get the current link cost requirement
    -# of a known destination
    -RNS.Identity.recall_link_cost(destination_hash)
    -
    -
    -

    An Identity can be created with an embedded stamp value, by passing the target value at instantiation time:

    -
    # Create a new, stamped identity
    -my_identity = RNS.Identity(value=24.0)
    -
    -# Get the value of any known identity
    -another_identity.get_value()
    -
    -
    -

    As with destination stamps, this is a one-time generation procedure, that happens at Identity creation. Once an identity is created with an embedded stamp, its value cannot be upgraded at a later point as with detached stamps.

    -
    -
    -
    -
    -

    Filtering & QoS

    -

    In addition to the stamp functionality explored above, Reticulum includes filtering options that allow operators to explicitly deny or allow certain destination types across an entire instance.

    -

    After filtering, all packets that are ultimately allowed into the transport engine, are sorted into prioritized QoS queues, which are drained and processed in priority order.

    -

    This provides a powerful system for both filtering, classifying and ensuring latency and service quality for the traffic and application types a node operator wants to provide.

    -
    -

    Instance Configuration

    -

    The filtering subsystem can operate in two modes:

    -
    -
      -
    • -
      Ignored Mode will allow any destination type in the instance, except for those that have been explicitly added to the ignored_types list. This mode is useful for blocking the traffic of specific destination types from being transported across the instance.
      -
      -
    • -
    • -
      Required Only Mode will allow only the destination types explicitly defined as required, and ignore all other types. A base set of required destination types can be defined instance-wide in the allowed_types list.
      -
      -
      -
      In addition, any application using the shared instance can temporarily request required destination types for its use. Applications that request required destination types will automatically have them granted, unless they are included in the ignored_types list.
      -
      -
    • -
    -
    -

    The filtering defaults and base settings are configured in the [filter] section of the configuration file. For example, it is possible to explicitly ignore a series of destination types, while also limiting hop reach to a more local topology.

    -
    -

    Tip

    -

    The hop_limiter in the filter section is an instance-wide setting. You can also use the hop_limiter option per-interface if you want to limit hops on some interfaces only.

    -
    -

    If you do not know the human readable destination type aspects for a destination type you want to ignore, you can also add entries as 10-byte (20 hexadecimal character) hashes using the <c4ace368262d845c9dd3> format.

    -
    [filter]
    -  hop_limiter = 14
    -  ignored_types = application.that.spams, traffic.heavy.service, <c4ace368262d845c9dd3>
    -
    -
    -

    In some situations, you may want to allow only certain destination types. If, for example, you are creating a high-performance transport node intended to handle thousands of simultaneous voice calls at minimal latency, a configuration might look something like:

    -
    [filter]
    -  required_only = yes
    -  allowed_types = lxst.telephony
    -
    -
    -

    The filtering subsystem provided in RNS 1.6.0 is functional and useful, but at an early stage, and relatively basic. In the upcoming releases, it will be expanded into a much more comprehensive and flexible system, that will include custom QoS and traffic class tagging, advanced rule definitions and more.

    -
    -

    Important

    -

    As the filtering and QoS system is developed and matures, the required_only mode will become the default operating mode for non-transport instances, since applications can already now dynamically request what destination types they are interested in.

    -

    This ensures that a local, non-transport node (running on resource-limited hardware, for example), does not have to process announces for, and waste CPU and memory on destination types that are completely irrelevant to it. It also greatly reduces power consumption on battery-powered and mobile devices, while they are connected to large and busy networks.

    -

    If you are a developer, see the following section.

    -
    -
    -
    -

    Blocking Transport Nodes

    -

    Misbehaving, spamming and broken transport nodes can be completely blocked using the Blackhole system. First, obtain the Transport Identity hash of a misbehaving transport node, using rnstatus:

    -
    $ rnstatus -FATa "71.29.190.5"
    -
    -BackboneInterface[Client on Bern IPv4/71.29.190.5:37062]
    -   Status    : Up
    -   Mode      : Gateway
    -   Rate      : 250.00 Mbps, MTU 65536
    -   Running   : Unknown implementation
    -   Rem.Tr.ID : <a0c289d131c7bfa8d5ddc8b652c0f40d>
    -   Held      : 64 announces
    -   Violatns. : 382 protocol
    -   Flt. Hits : 92
    -   Announces : 147174↓ 11193↑ total, 140554 filtered
    -               1.2 Hz↑    (↓0% / ↑0% of flow)
    -               7.8 Hz↓    (t:6h/p:0s/g:1) burst for 4h, 54m and 42.69s
    -   Traffic   : ↑4.75 MB    0 bps
    -               ↓1.50 MB    0 bps
    -   Filtered  : ↑0 B  0 bps
    -               ↓55.43 MB  380.14 Kbps
    -
    -
    -

    You can then block it by its Transport ID:

    -
    $ rnpath -B a0c289d131c7bfa8d5ddc8b652c0f40d --reason "Broken node"
    -
    -Blackholed identity a0c289d131c7bfa8d5ddc8b652c0f40d
    -
    -
    -

    Its connection will be immediately torn down, and further reconnection attempts will be ignored.

    -
    -
    -

    For Developers

    -

    At some point during the 1.6.x release cycle, RNS will move to using the required_only mode for non-transport instances by default. This means that applications will, in most cases, have to request what types of destinations they are interested in receiving announces from.

    -

    If your application is only using the utility primitives included in RNS, or established protocols such as LXMF or LXST, there is nothing you have to do. The protocol primitives themselves request their required destination types, and this is the general pattern to follow here:

    -
      -
    • If an application uses a common protocol or primitive, it is the importable primitive, protocol module, or relevant internal functionality that should request destination type requirements, at the point where they are actually needed.

    • -
    • Higher level application layers should not have to guess at or request destination types, unless it explicitly creates outbound destinations that are not covered by any already-used protocols or primitives.

    • -
    -

    If your protocol or application needs to receive announces for a specific destination type, it is very easy to register it. For example, at startup (or when the destination type is actually required), simply run something like:

    -
    RNS.Reticulum.get_instance().wants_destination_type("my_app.service")
    -
    -
    -

    You do not have to explicitly deregister destination type requirements. Reticulum automatically deregisters when the shared instance connection for the application is torn down, but you may want to in certain cases, which follows the same pattern:

    -
    RNS.Reticulum.get_instance().unwants_destination_type("my_app.service")
    -
    -
    -

    That’s really all there is to it. If you already now want to make you application more CPU, memory and battery efficient, you can tell Reticulum to start serving only required destinations to it with only a few lines of additional code. A full setup of this functionality might look something like:

    -
    for destination_type in self.REQUIRED_DESTINATION_TYPES:
    -    RNS.Reticulum.get_instance().wants_destination_type(destination_type)
    -
    -RNS.Reticulum.get_instance().required_announces_only(True)
    -
    -
    -

    Your application will now only receive, and have to process, the announces and paths that it actually cares about.

    -
    -
    -
    -

    Ingress & Burst Control

    -

    In addition to the economic incentives created by stamps, Reticulum enforces a set of hydraulic limits on how much announce traffic any peer or destination can inject into the network. These mechanisms work automatically, require no operator configuration (but can be tuned, if required), and apply equally to all peers.

    -

    At the most basic level, the announce_cap mechanism limits the bandwidth any interface will allocate to propagating announces and other network upkeep traffic, and prioritises the local topology. Destinations that rapidly re-announce are down-prioritised in the transmission queue, so attempting to gain reach through announce spam has the exact opposite effect.

    -

    On top of this, per-destination announce rate control can be configured on any interface, or as instance-wide defaults. Once configured, announces received for any one destination will only be re-broadcast to other interfaces at the configured target rate, no matter how often they are received. The grace option allows occasional rate violations, and a configurable penalty extends the interval between propagated announces for destinations that repeatedly exceed their target.

    -

    The final layer protects against bursts of announces for newly created destinations. If an interface receives a large influx of announces for previously unknown destinations in a short amount of time, these are held in a bounded queue, while announces for known and established destinations continue to be processed without interruption. After the burst subsides, and an additional waiting period has passed, held announces are released slowly until the queue is cleared.

    -

    A node that connects to a public interface, announces a large number of bogus destinations, and then disconnects, will therefore never get those destinations into path tables at all. When the interface they arrived on disappears, the held announces are simply dropped and forgotten.

    -

    Ingress control operates at the level of individual sub-interfaces, so one misbehaving client cannot disrupt announce processing for other clients connected to the same listener. Combined with stamps, these mechanisms are complementary:

    -

    Rate limiting bounds the rate at which abuse can occur, for everyone, while stamps make the volume of abuse from any actor computationally expensive.

    -

    Full configuration details are available in the Announce Rate Control and New Destination Rate Limiting sections.

    -
    -
    -

    Blackhole Management

    -

    The blackhole system allows any node operator or individual user to block specific identities at the transport layer.

    -

    Once an identity has been blackholed on a node, announces originating from any destination associated with that identity are dropped, and the node will refuse to transport traffic, or establish and maintain links, to the blackholed identity’s destinations.

    -

    It is important to understand the scope of this mechanism corrrectly. There is fundamentally no way to globally block or censor any identity or destination in Reticulum networks. A blackhole entry only applies on the network segments that enforce it, which is the exact intention. Operators retain full control over what is allowed on their own segments, while no one can impose restrictions on segments they do not operate.

    -

    Blackholes can be managed directly with the rnpath utility. Identities can be blocked (optionally with an expiry duration and a human-readable reason), unblocked, and the current local blocklist can be inspected at any time. This is well suited for immediate responses to announce spam, unwanted content or malicious behaviour observed on your own networks.

    -

    For anything larger than a few nodes, manual blocklist maintenance quickly becomes impractical. Reticulum therefore allows an instance to subscribe to blackhole lists published by trusted transport identities, periodically retrieving and merging them into the local list, and conversely to publish its own list to subscribers.

    -

    This makes it possible to federate community-maintained blocklists across large networks, with the important caveat that subscribing to a list is an act of trust in its maintainer. See the Blackhole Management section for full details on local management, automated list sourcing and publishing.

    -
    -
    -

    Fast-Flap Blocking

    -

    High-performance listener interfaces, such as BackboneInterface, will automatically block fast-flapping clients; remote peers that repeatedly connect for a very short amount of time, and then disconnect.

    -

    This behaviour usually stems from attempts to dump announce or path request spam onto the network in short bursts, while rotating connections in an attempt to evade per-interface rate limits, but it can also be caused by broken implementations or automated scanning tools.

    -

    Such bypass attempts generally have very limited effect. Ingress limiters trigger immediately once rate limits are exceeded, but the behaviour still causes needless interface rotation and wasted resources on the transport instance.

    -

    With fast-flap blocking enabled, a client that exceeds the allowed flap grace is simply not allocated an actual interface again, for the configured block duration.

    -

    On the BackboneInterface type, fast-flap blocking is enabled by default, with sensible standard settings. All parameters can be adjusted if necessary. See the Automated Blocking section of the Interfaces chapter.

    -
    -
    - -
    -
    - -
    - -
    -
    - - - - - - - \ No newline at end of file diff --git a/docs/manual/reference.html b/docs/manual/reference.html index 6d1c3291..887fde07 100644 --- a/docs/manual/reference.html +++ b/docs/manual/reference.html @@ -3,11 +3,11 @@ - + - API Reference - Reticulum Network Stack 1.6.1 documentation + API Reference - Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
    @@ -204,7 +204,7 @@
    - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation
    + diff --git a/docs/manual/search.html b/docs/manual/search.html index 12cab054..c4eb0cbe 100644 --- a/docs/manual/search.html +++ b/docs/manual/search.html @@ -8,7 +8,7 @@ -Search - Reticulum Network Stack 1.6.1 documentation +Search - Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
    @@ -204,7 +204,7 @@
    - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -218,7 +218,6 @@
  • Zen of Reticulum
  • Programs Using Reticulum
  • Using Reticulum on Your System
  • -
  • Protecting Open Networks
  • Understanding Reticulum
  • Communications Hardware
  • Configuring Interfaces
  • @@ -228,7 +227,6 @@
  • Support Reticulum
  • Code Examples
  • Reticulum License
  • -
  • Brandolini’s Reference
  • - + diff --git a/docs/manual/searchindex.js b/docs/manual/searchindex.js index 0c5eedf7..0fcc876b 100644 --- a/docs/manual/searchindex.js +++ b/docs/manual/searchindex.js @@ -1 +1 @@ -Search.setIndex({"alltitles":{"A Carrier-Grade Fallacy":[[18,"a-carrier-grade-fallacy"]],"A History Of What Works":[[0,"a-history-of-what-works"]],"A Persistent, But Fragile Triad":[[0,"a-persistent-but-fragile-triad"]],"API Reference":[[12,null]],"ARM64":[[4,"arm64"]],"AX.25 KISS Interface":[[8,"ax-25-kiss-interface"]],"Accessing Repository Pages":[[5,"accessing-repository-pages"]],"Addendum A: The Prns Case":[[0,"addendum-a-the-prns-case"]],"Adding Radio Interfaces":[[4,"adding-radio-interfaces"]],"Agency and answerability":[[0,"agency-and-answerability"]],"An Explanation of Reticulum for Human Beings":[[3,null]],"Anchor In The Flow":[[18,"anchor-in-the-flow"]],"Android":[[4,"android"]],"Announce":[[2,"announce"]],"Announce Propagation Rules":[[15,"announce-propagation-rules"]],"Announce Rate Control":[[8,"announce-rate-control"]],"Announcing Presence":[[18,"announcing-presence"]],"Artifact-Centered Workflows":[[1,"artifact-centered-workflows"]],"Assistance Versus Machine-Substitution":[[0,"assistance-versus-machine-substitution"]],"Author Identity Binding":[[5,"author-identity-binding"]],"Auto Interface":[[8,"auto-interface"]],"Automated Blocking":[[8,"automated-blocking"]],"Automated List Sourcing":[[16,"automated-list-sourcing"]],"Automatic Mirror Synchronization":[[5,"automatic-mirror-synchronization"]],"Backbone Interface":[[8,"backbone-interface"]],"Base Primitives":[[11,"base-primitives"]],"Blackhole Management":[[11,"blackhole-management"],[16,"blackhole-management"]],"Blocking Transport Nodes":[[11,"blocking-transport-nodes"]],"Bootstrapping Connectivity":[[4,"bootstrapping-connectivity"]],"Brandolini\u2019s Reference":[[0,null]],"Broadcast":[[2,"broadcast"]],"Browsing & Publishing":[[13,"browsing-publishing"]],"Buffer":[[2,"buffer"]],"Build Personal Infrastructure":[[4,"build-personal-infrastructure"]],"Building Networks":[[10,null]],"Channel":[[2,"channel"]],"Chat":[[13,"chat"]],"Code Examples":[[2,null]],"Columba":[[13,"id8"]],"Combining Hardware Types":[[6,"combining-hardware-types"]],"Command-Line Interaction":[[5,"command-line-interaction"]],"Commit Signing":[[5,"commit-signing"]],"Common Interface Options":[[8,"common-interface-options"]],"Communications Hardware":[[6,null]],"Composable Primitives":[[1,"composable-primitives"]],"Concepts & Overview":[[10,"concepts-overview"]],"Conceptual Overview":[[15,"conceptual-overview"]],"Conclusion":[[0,"conclusion"]],"Configuration":[[5,"configuration"],[5,"id1"]],"Configuration & Data":[[16,"configuration-data"]],"Configuration Example":[[5,"configuration-example"]],"Configuration Methods":[[5,"configuration-methods"]],"Configuring Interfaces":[[8,null]],"Configuring Stamps":[[11,"configuring-stamps"]],"Connect to the Distributed Backbone":[[4,"connect-to-the-distributed-backbone"]],"Connecting Remotes":[[8,"connecting-remotes"]],"Connecting Reticulum Instances Over the Internet":[[4,"connecting-reticulum-instances-over-the-internet"]],"Consequences":[[0,"consequences"]],"Contributing to the Global Ret":[[4,"contributing-to-the-global-ret"]],"Copyright & The Two Legal Layers":[[0,"copyright-the-two-legal-layers"]],"Cost Of A Byte":[[18,"cost-of-a-byte"]],"Creating Empty Repositories":[[5,"creating-empty-repositories"]],"Creating RNodes":[[6,"creating-rnodes"]],"Creating Signed Releases":[[5,"creating-signed-releases"]],"Creating a Network With Reticulum":[[4,"creating-a-network-with-reticulum"]],"Creating and Using Custom Interfaces":[[4,"creating-and-using-custom-interfaces"]],"Creating and Using a Network Identity":[[15,"creating-and-using-a-network-identity"]],"Creator Permissions":[[5,"creator-permissions"]],"Cryptographic Attribution":[[5,"cryptographic-attribution"]],"Cryptographic Primitives":[[15,"cryptographic-primitives"]],"Cryptographic Stamps":[[11,"cryptographic-stamps"]],"Current Status":[[17,"current-status"]],"Current Usage":[[15,"current-usage"]],"Custom Interfaces":[[2,"custom-interfaces"],[8,"custom-interfaces"]],"Customizing Templates":[[5,"customizing-templates"]],"Dating":[[0,"dating"]],"Death To The Address":[[18,"death-to-the-address"]],"Debian Bookworm":[[4,"debian-bookworm"]],"Decentralization Or Uncentralizability?":[[18,"decentralization-or-uncentralizability"]],"Defence Of The Commons":[[0,"defence-of-the-commons"]],"Design Patterns For Post-IP Systems":[[18,"design-patterns-for-post-ip-systems"]],"Destination Naming":[[15,"destination-naming"]],"Destinations":[[15,"destinations"]],"Destinations, Not Addresses":[[10,"destinations-not-addresses"]],"Develop a Program with Reticulum":[[4,"develop-a-program-with-reticulum"]],"Device Flashers":[[13,"device-flashers"]],"Disclosed Assistance Or Laundered Generation":[[0,"disclosed-assistance-or-laundered-generation"]],"Discoverable Interfaces":[[8,"discoverable-interfaces"]],"Discovering Interfaces":[[16,"discovering-interfaces"]],"Discovery Parameters":[[8,"discovery-parameters"]],"Distributed Development":[[1,null]],"Distribution Without Intermediaries":[[1,"distribution-without-intermediaries"]],"Donations":[[14,"donations"]],"Echo":[[2,"echo"]],"Emergent Patterns":[[18,"emergent-patterns"]],"Enabling Discovery":[[8,"enabling-discovery"]],"Enabling the Git Page Node":[[5,"enabling-the-git-page-node"]],"Encryption Is Not A Feature":[[18,"encryption-is-not-a-feature"]],"Engineering reality":[[0,"engineering-reality"]],"Ethernet-based Hardware":[[6,"ethernet-based-hardware"]],"Ethics Of The Tool":[[18,"ethics-of-the-tool"]],"Evaluating a Reticulum Implementation":[[0,"evaluating-a-reticulum-implementation"]],"Example Configuration":[[8,"example-configuration"]],"Expanding The Commons":[[0,"expanding-the-commons"]],"Fabric Of The Independent":[[18,"fabric-of-the-independent"]],"Fallacy Of The Cloud":[[18,"fallacy-of-the-cloud"]],"False Dichotomy":[[0,"false-dichotomy"]],"Fast-Flap Blocking":[[11,"fast-flap-blocking"]],"Filetransfer":[[2,"filetransfer"]],"Filtering & QoS":[[11,"filtering-qos"]],"Finding Your Way":[[4,"finding-your-way"]],"Fixed Serial Port Names":[[16,"fixed-serial-port-names"]],"Flow & Time":[[18,"flow-time"]],"For Developers":[[11,"for-developers"],[11,"id2"]],"Forking Repositories":[[5,"forking-repositories"]],"Formatting & Syntax Highlighting":[[5,"formatting-syntax-highlighting"]],"Future Implications":[[15,"future-implications"]],"Getting Further":[[15,"getting-further"]],"Getting Started Fast":[[4,null]],"Git Configuration Parameters":[[5,"git-configuration-parameters"]],"Git Over Reticulum":[[5,null],[13,"git-over-reticulum"]],"Goals":[[15,"goals"]],"Headcount":[[0,"headcount"]],"Health Is A Property Of The Whole":[[0,"health-is-a-property-of-the-whole"]],"Heltec LoRa32 v2.0":[[6,"heltec-lora32-v2-0"]],"Heltec LoRa32 v3.0":[[6,"heltec-lora32-v3-0"]],"Heltec LoRa32 v4.0":[[6,"heltec-lora32-v4-0"]],"Heltec T114":[[6,"heltec-t114"]],"Heterogeneous Connectivity":[[10,"heterogeneous-connectivity"]],"Hostile Environments":[[18,"hostile-environments"]],"Hosting Public Entrypoints":[[4,"hosting-public-entrypoints"]],"I. The Foundational Statute: Translation Is Copying":[[0,"i-the-foundational-statute-translation-is-copying"]],"I2P Interface":[[8,"i2p-interface"]],"II. Ideas Are Free, Expressions Protected":[[0,"ii-ideas-are-free-expressions-protected"]],"III. Machine Output Has No Author":[[0,"iii-machine-output-has-no-author"]],"IV. License Conditions Bound the Grant":[[0,"iv-license-conditions-bound-the-grant"]],"Identification":[[2,"example-identify"]],"Identities":[[15,"understanding-identities"]],"Identity & Destination Aliases":[[5,"identity-destination-aliases"]],"Identity and Nomadism":[[18,"identity-and-nomadism"]],"Improving System Configuration":[[16,"improving-system-configuration"]],"Included Utility Programs":[[16,"included-utility-programs"]],"Indices and Tables":[[7,"indices-and-tables"]],"Infrastructure Matters":[[0,"infrastructure-matters"]],"Ingress & Burst Control":[[11,"ingress-burst-control"]],"Installation":[[6,"installation"]],"Instance Configuration":[[11,"instance-configuration"],[11,"id1"]],"Intent & Consequence":[[0,"intent-consequence"]],"Interface Access Codes":[[15,"interface-access-codes"]],"Interface Modes":[[8,"interface-modes"],[8,"interfaces-modes"]],"Interface Modules & Connectivity Resources":[[13,"interface-modules-connectivity-resources"]],"Interface Types and Devices":[[17,"interface-types-and-devices"]],"Introduction & Basic Functionality":[[15,"introduction-basic-functionality"]],"Introductory Considerations":[[10,"introductory-considerations"]],"KISS Interface":[[8,"kiss-interface"]],"LXMF":[[13,"lxmf"]],"LXMFy":[[13,"lxmfy"]],"LXST":[[13,"id30"]],"LXST Phone":[[13,"lxst-phone"]],"Liberation From Limits":[[18,"liberation-from-limits"]],"Licensing Analysis":[[0,"licensing-analysis"]],"LilyGO LoRa32 v1.0":[[6,"lilygo-lora32-v1-0"]],"LilyGO LoRa32 v2.0":[[6,"lilygo-lora32-v2-0"]],"LilyGO LoRa32 v2.1":[[6,"lilygo-lora32-v2-1"]],"LilyGO T-Beam":[[6,"lilygo-t-beam"]],"LilyGO T-Beam Supreme":[[6,"lilygo-t-beam-supreme"]],"LilyGO T-Deck":[[6,"lilygo-t-deck"]],"LilyGO T-Echo":[[6,"lilygo-t-echo"]],"LilyGO T3S3":[[6,"lilygo-t3s3"]],"Link":[[2,"link"]],"Link Establishment in Detail":[[15,"link-establishment-in-detail"]],"Listeners":[[8,"listeners"]],"Local Blackhole Management":[[16,"local-blackhole-management"]],"Long Archive":[[1,"long-archive"]],"MacOS":[[4,"macos"]],"Managing Group Permissions":[[5,"managing-group-permissions"]],"Managing Repository Permissions":[[5,"managing-repository-permissions"]],"Managing Work Document Permissions":[[5,"managing-work-document-permissions"]],"Manual Synchronization":[[5,"manual-synchronization"]],"Merits Of Scarcity":[[18,"merits-of-scarcity"]],"MeshChatX":[[13,"id6"]],"Messaging & Voice":[[13,"messaging-voice"]],"Micron Parser JS":[[13,"micron-parser-js"]],"Minimal":[[2,"minimal"]],"Mirroring Repositories":[[5,"mirroring-repositories"]],"Mixing Strategies":[[4,"mixing-strategies"]],"Modem73":[[13,"modem73"]],"Monetary and influence signals":[[0,"monetary-and-influence-signals"]],"Motivation":[[15,"motivation"]],"Naming Is Power":[[18,"naming-is-power"]],"Network Health & Coexistence":[[0,"network-health-coexistence"]],"Network Health & Responsibility":[[4,"network-health-responsibility"]],"Network Identities":[[15,"network-identities"]],"Network citizenship":[[0,"network-citizenship"]],"New Destination Rate Limiting":[[8,"new-destination-rate-limiting"]],"Node Types":[[15,"node-types"]],"Nomad Network":[[13,"nomad-network"]],"Obtaining Verified Releases":[[5,"obtaining-verified-releases"]],"Offline Verification":[[5,"offline-verification"]],"On Freedom":[[0,"on-freedom"]],"On The Institutions, In Fairness":[[0,"on-the-institutions-in-fairness"]],"On-Network Types":[[11,"on-network-types"]],"Open Sky":[[18,"open-sky"]],"Open Source Means Open Source":[[0,"open-source-means-open-source"]],"OpenCom XL":[[6,"opencom-xl"]],"OpenWRT":[[4,"openwrt"]],"Other Signals To Look For":[[0,"other-signals-to-look-for"]],"Overall Evaluation":[[0,"overall-evaluation"]],"Packet Prioritisation":[[15,"packet-prioritisation"]],"Packet Radio Modems":[[6,"packet-radio-modems"]],"Partyline":[[13,"partyline"]],"Path Request Burst Control":[[8,"path-request-burst-control"]],"Permission Configuration Locations":[[5,"permission-configuration-locations"]],"Permission Examples":[[5,"permission-examples"]],"Permission Hierarchy":[[5,"permission-hierarchy"]],"Permission Short Forms":[[5,"permission-short-forms"]],"Permission Types":[[5,"permission-types"]],"Permission Validation":[[5,"permission-validation"]],"Permissions":[[5,"permissions"]],"Personal Infrastructure":[[18,"personal-infrastructure"]],"Physics Of Trust":[[18,"physics-of-trust"]],"Pipe Interface":[[8,"pipe-interface"]],"Platform-Specific Install Notes":[[4,"platform-specific-install-notes"]],"Portable Existence":[[18,"portable-existence"]],"Possible Verdicts":[[0,"possible-verdicts"]],"Prerequisites":[[5,"prerequisites"]],"Presentation, Elongated":[[0,"presentation-elongated"]],"Preserving Human Agency":[[18,"preserving-human-agency"]],"Programs Using Reticulum":[[13,null]],"Proposing Work Documents":[[5,"proposing-work-documents"]],"Protecting Open Networks":[[11,null]],"Protocol Specifics":[[15,"protocol-specifics"]],"Protocols":[[13,"protocols"]],"Protocols Over Platforms":[[1,"protocols-over-platforms"]],"Provenance and attribution":[[0,"provenance-and-attribution"]],"Provide Feedback":[[14,"provide-feedback"]],"Public Domain Protocol":[[18,"public-domain-protocol"]],"Public Key Announcements":[[15,"public-key-announcements"]],"Publishing Blackhole Lists":[[16,"publishing-blackhole-lists"]],"Pure-Python Reticulum":[[4,"pure-python-reticulum"]],"Purpose & Scope":[[0,"purpose-scope"]],"Question 1: Is this a clean implementation, or was it directly generated from the reference?":[[0,"question-1-is-this-a-clean-implementation-or-was-it-directly-generated-from-the-reference"]],"Question 2: Who, or what, is the agent of the work?":[[0,"question-2-who-or-what-is-the-agent-of-the-work"]],"RAK4631-based Boards":[[6,"rak4631-based-boards"]],"RISC-V":[[4,"risc-v"]],"RNMon":[[13,"rnmon"]],"RNS FileSync":[[13,"rns-filesync"]],"RNS Page Node":[[13,"rns-page-node"]],"RNode":[[6,"rnode"]],"RNode LoRa Interface":[[8,"rnode-lora-interface"]],"RNode Multi Interface":[[8,"rnode-multi-interface"]],"RRC":[[13,"rrc"]],"Raspberry Pi":[[4,"raspberry-pi"]],"Reaching the Destination":[[15,"reaching-the-destination"]],"Recognition & Response":[[0,"recognition-response"]],"Recycled Wine, Fermenting":[[0,"recycled-wine-fermenting"]],"Reference Implementation":[[17,"reference-implementation"]],"Reference Setup":[[15,"reference-setup"]],"Release Management":[[5,"release-management"]],"Release Storage & Structure":[[5,"release-storage-structure"]],"Remote Management":[[16,"remote-management"]],"Remote Permission Management":[[5,"remote-permission-management"]],"Remote Shell":[[13,"remote-shell"]],"Ren Browser":[[13,"ren-browser"]],"Ren TUI":[[13,"ren-tui"]],"Repository Creation & Management":[[5,"repository-creation-management"]],"Repository Statistics":[[5,"repository-statistics"]],"Repository Structure":[[5,"repository-structure"]],"Requests & Responses":[[2,"requests-responses"]],"Resolving Dependency & Installation Issues":[[4,"resolving-dependency-installation-issues"]],"Resources":[[15,"resources"]],"Restoration":[[1,"restoration"]],"RetiBBS":[[13,"retibbs"]],"Reticulated":[[13,"reticulated"]],"Reticulum License":[[9,null]],"Reticulum Network Stack Manual":[[7,null]],"Reticulum Network Telephone":[[13,"reticulum-network-telephone"]],"Reticulum Relay Chat":[[13,"reticulum-relay-chat"]],"Reticulum Transport":[[15,"reticulum-transport"]],"Reticulum as a System Service":[[16,"reticulum-as-a-system-service"]],"Retipedia":[[13,"retipedia"]],"Roaming Nodes":[[18,"roaming-nodes"]],"Security Considerations":[[8,"security-considerations"]],"Serial Interface":[[8,"serial-interface"]],"Serial Lines & Devices":[[6,"serial-lines-devices"]],"Serving Pages Over Nomad Network":[[5,"serving-pages-over-nomad-network"]],"Sideband":[[13,"sideband"]],"Signing Commits":[[5,"signing-commits"]],"Sources and Authorities":[[0,"sources-and-authorities"]],"Sovereignty Through Infrastructure":[[1,"sovereignty-through-infrastructure"],[18,"sovereignty-through-infrastructure"]],"Standalone Reticulum Installation":[[4,"standalone-reticulum-installation"]],"Start Of The Road":[[1,"start-of-the-road"]],"State Management":[[5,"state-management"]],"Store & Forward":[[18,"store-forward"]],"Substance Of The Networks":[[0,"substance-of-the-networks"]],"Support Reticulum":[[14,null]],"Supported Boards and Devices":[[6,"supported-boards-and-devices"]],"System Administration":[[13,"system-administration"]],"Systemwide Service":[[16,"systemwide-service"]],"TCP Client Interface":[[8,"tcp-client-interface"]],"TCP Server Interface":[[8,"tcp-server-interface"]],"Table Of Contents":[[7,"table-of-contents"]],"The Ability To Disconnect":[[18,"the-ability-to-disconnect"]],"The Announce Mechanism in Detail":[[15,"the-announce-mechanism-in-detail"]],"The Bandwidth Fallacy":[[18,"the-bandwidth-fallacy"]],"The Conformal Surface":[[0,"the-conformal-surface"]],"The Consequences Of The \u201cNot Open Source\u201d Claim":[[0,"the-consequences-of-the-not-open-source-claim"]],"The Distribution Argument":[[0,"the-distribution-argument"]],"The Fluency Trap":[[0,"the-fluency-trap"]],"The General Principle":[[0,"the-general-principle"]],"The Harm Principle":[[18,"the-harm-principle"]],"The Illusion Of The Center":[[18,"the-illusion-of-the-center"]],"The Intention Of This Guide":[[0,"the-intention-of-this-guide"]],"The Interface Is The Medium":[[18,"the-interface-is-the-medium"]],"The License In This Context":[[0,"the-license-in-this-context"]],"The Line":[[0,"the-line"]],"The Method of Madness":[[0,"the-method-of-madness"]],"The Movement Of A Dozen":[[0,"the-movement-of-a-dozen"]],"The Original Architecture":[[1,"the-original-architecture"]],"The Place Of New Implementations":[[0,"the-place-of-new-implementations"]],"The Platform Interregnum":[[1,"the-platform-interregnum"]],"The Prediction, And What Happened":[[0,"the-prediction-and-what-happened"]],"The Project In Brief":[[0,"the-project-in-brief"]],"The Release Workflow":[[5,"the-release-workflow"]],"The Role Of The Individual":[[0,"the-role-of-the-individual"]],"The Work Is Finished":[[18,"the-work-is-finished"]],"The performance claims":[[0,"the-performance-claims"]],"The rncp Utility":[[16,"the-rncp-utility"]],"The rngit Utility":[[5,"the-rngit-utility"],[16,"the-rngit-utility"]],"The rnid Utility":[[16,"the-rnid-utility"]],"The rnodeconf Utility":[[16,"the-rnodeconf-utility"]],"The rnpath Utility":[[16,"the-rnpath-utility"]],"The rnprobe Utility":[[16,"the-rnprobe-utility"]],"The rnsd Utility":[[16,"the-rnsd-utility"]],"The rnsh Utility":[[16,"the-rnsh-utility"]],"The rnstatus Utility":[[16,"the-rnstatus-utility"]],"The rnx Utility":[[16,"the-rnx-utility"]],"The \u201cClean-Room\u201d Delusion":[[0,"the-clean-room-delusion"]],"These Standards Are Reasonable":[[0,"these-standards-are-reasonable"]],"Transport Nodes and Instances":[[10,"transport-nodes-and-instances"]],"Trustless Networking":[[10,"trustless-networking"]],"Try Using a Reticulum-based Program":[[4,"try-using-a-reticulum-based-program"]],"Tuning Ingress Queues":[[8,"tuning-ingress-queues"]],"Two Questions That Resolve Most Cases":[[0,"two-questions-that-resolve-most-cases"]],"UDP Interface":[[8,"udp-interface"]],"Ubuntu Lunar":[[4,"ubuntu-lunar"]],"Understanding Reticulum":[[15,null]],"Unsigned RNode v2.x":[[6,"unsigned-rnode-v2-x"]],"Usage with Reticulum":[[6,"usage-with-reticulum"]],"Userspace Service":[[16,"userspace-service"]],"Using Reticulum on Your System":[[16,null]],"Using the Included Utilities":[[4,"using-the-included-utilities"]],"Utilities & Components":[[13,"utilities-components"]],"V. The Void Grant":[[0,"v-the-void-grant"]],"VI. Fair Use Does Not Rescue This Pattern":[[0,"vi-fair-use-does-not-rescue-this-pattern"]],"Validating Commit Signatures":[[5,"validating-commit-signatures"]],"Verdict":[[0,"verdict"]],"Verified Releases":[[5,"verified-releases"]],"Voice & Telephony":[[13,"voice-telephony"]],"Void Grants: Legal Foundations of Machine-Generated Code":[[0,"void-grants-legal-foundations-of-machine-generated-code"]],"What The Argument Is Actually Doing":[[0,"what-the-argument-is-actually-doing"]],"What The Pattern Is Not":[[0,"what-the-pattern-is-not"]],"What The Reticulum License Is":[[0,"what-the-reticulum-license-is"]],"What This Means For Other Implementations":[[0,"what-this-means-for-other-implementations"]],"What assistance looks like":[[0,"what-assistance-looks-like"]],"What does Reticulum Offer?":[[17,"what-does-reticulum-offer"]],"What is Reticulum?":[[17,null]],"What substitution looks like":[[0,"what-substitution-looks-like"]],"What \u201cOpen\u201d Means Positively":[[0,"what-open-means-positively"]],"Where can Reticulum be Used?":[[17,"where-can-reticulum-be-used"]],"Who Is Restricted By Which License?":[[0,"who-is-restricted-by-which-license"]],"Why This License Exists":[[0,"why-this-license-exists"]],"WiFi-based Hardware":[[6,"wifi-based-hardware"]],"Windows":[[4,"windows"]],"Wire Format":[[15,"wire-format"]],"Work Document Permissions":[[5,"work-document-permissions"]],"Work Documents":[[5,"work-documents"]],"Working With Work Documents":[[5,"working-with-work-documents"]],"Zen of Reticulum":[[18,null]],"Zero-Trust Architectures":[[18,"zero-trust-architectures"]]},"docnames":["brandolinis","distributed","examples","forhumans","gettingstartedfast","git","hardware","index","interfaces","license","networks","protecting","reference","software","support","understanding","using","whatis","zen"],"envversion":{"sphinx":65,"sphinx.domains.c":3,"sphinx.domains.changeset":1,"sphinx.domains.citation":1,"sphinx.domains.cpp":9,"sphinx.domains.index":1,"sphinx.domains.javascript":3,"sphinx.domains.math":2,"sphinx.domains.python":4,"sphinx.domains.rst":2,"sphinx.domains.std":2},"filenames":["brandolinis.rst","distributed.rst","examples.rst","forhumans.rst","gettingstartedfast.rst","git.rst","hardware.rst","index.rst","interfaces.rst","license.rst","networks.rst","protecting.rst","reference.rst","software.rst","support.rst","understanding.rst","using.rst","whatis.rst","zen.rst"],"indexentries":{"__init__() (rns.rawchannelreader method)":[[12,"RNS.RawChannelReader.__init__",false]],"__init__() (rns.rawchannelwriter method)":[[12,"RNS.RawChannelWriter.__init__",false]],"accepts_links() (rns.destination method)":[[12,"RNS.Destination.accepts_links",false]],"add_message_handler() (rns.channel.channel method)":[[12,"RNS.Channel.Channel.add_message_handler",false]],"add_ready_callback() (rns.rawchannelreader method)":[[12,"RNS.RawChannelReader.add_ready_callback",false]],"advertise() (rns.resource method)":[[12,"RNS.Resource.advertise",false]],"announce() (rns.destination method)":[[12,"RNS.Destination.announce",false]],"announce_cap (rns.reticulum attribute)":[[12,"RNS.Reticulum.ANNOUNCE_CAP",false]],"app_and_aspects_from_name() (rns.destination static method)":[[12,"RNS.Destination.app_and_aspects_from_name",false]],"await_path() (rns.transport static method)":[[12,"RNS.Transport.await_path",false]],"blackhole_identity() (rns.transport static method)":[[12,"RNS.Transport.blackhole_identity",false]],"blackhole_sources() (rns.reticulum static method)":[[12,"RNS.Reticulum.blackhole_sources",false]],"buffer (class in rns)":[[12,"RNS.Buffer",false]],"cancel() (rns.resource method)":[[12,"RNS.Resource.cancel",false]],"channel (class in rns.channel)":[[12,"RNS.Channel.Channel",false]],"clear_default_app_data() (rns.destination method)":[[12,"RNS.Destination.clear_default_app_data",false]],"concluded() (rns.requestreceipt method)":[[12,"RNS.RequestReceipt.concluded",false]],"create_bidirectional_buffer() (rns.buffer static method)":[[12,"RNS.Buffer.create_bidirectional_buffer",false]],"create_keys() (rns.destination method)":[[12,"RNS.Destination.create_keys",false]],"create_reader() (rns.buffer static method)":[[12,"RNS.Buffer.create_reader",false]],"create_writer() (rns.buffer static method)":[[12,"RNS.Buffer.create_writer",false]],"current_ratchet_id() (rns.identity static method)":[[12,"RNS.Identity.current_ratchet_id",false]],"curve (rns.identity attribute)":[[12,"RNS.Identity.CURVE",false]],"curve (rns.link attribute)":[[12,"RNS.Link.CURVE",false]],"decrypt() (rns.destination method)":[[12,"RNS.Destination.decrypt",false]],"decrypt() (rns.identity method)":[[12,"RNS.Identity.decrypt",false]],"default_per_hop_timeout (rns.reticulum attribute)":[[12,"RNS.Reticulum.DEFAULT_PER_HOP_TIMEOUT",false]],"deregister_announce_handler() (rns.transport static method)":[[12,"RNS.Transport.deregister_announce_handler",false]],"deregister_request_handler() (rns.destination method)":[[12,"RNS.Destination.deregister_request_handler",false]],"destination (class in rns)":[[12,"RNS.Destination",false]],"discovered_interfaces() (rns.reticulum static method)":[[12,"RNS.Reticulum.discovered_interfaces",false]],"enable_ratchets() (rns.destination method)":[[12,"RNS.Destination.enable_ratchets",false]],"encrypt() (rns.destination method)":[[12,"RNS.Destination.encrypt",false]],"encrypt() (rns.identity method)":[[12,"RNS.Identity.encrypt",false]],"encrypted_mdu (rns.packet attribute)":[[12,"RNS.Packet.ENCRYPTED_MDU",false]],"enforce_ratchets() (rns.destination method)":[[12,"RNS.Destination.enforce_ratchets",false]],"establishment_timeout_per_hop (rns.link attribute)":[[12,"RNS.Link.ESTABLISHMENT_TIMEOUT_PER_HOP",false]],"expand_name() (rns.destination static method)":[[12,"RNS.Destination.expand_name",false]],"from_bytes() (rns.identity static method)":[[12,"RNS.Identity.from_bytes",false]],"from_file() (rns.identity static method)":[[12,"RNS.Identity.from_file",false]],"full_hash() (rns.identity static method)":[[12,"RNS.Identity.full_hash",false]],"get_age() (rns.link method)":[[12,"RNS.Link.get_age",false]],"get_channel() (rns.link method)":[[12,"RNS.Link.get_channel",false]],"get_data_size() (rns.resource method)":[[12,"RNS.Resource.get_data_size",false]],"get_establishment_rate() (rns.link method)":[[12,"RNS.Link.get_establishment_rate",false]],"get_expected_rate() (rns.link method)":[[12,"RNS.Link.get_expected_rate",false]],"get_first_hop_timeout() (rns.reticulum method)":[[12,"RNS.Reticulum.get_first_hop_timeout",false]],"get_hash() (rns.resource method)":[[12,"RNS.Resource.get_hash",false]],"get_instance() (rns.reticulum static method)":[[12,"RNS.Reticulum.get_instance",false]],"get_instance_pid() (rns.reticulum static method)":[[12,"RNS.Reticulum.get_instance_pid",false]],"get_link_cost() (rns.destination method)":[[12,"RNS.Destination.get_link_cost",false]],"get_lowest_interface_bitrate() (rns.reticulum method)":[[12,"RNS.Reticulum.get_lowest_interface_bitrate",false]],"get_mdu() (rns.link method)":[[12,"RNS.Link.get_mdu",false]],"get_medium_path_timeout() (rns.reticulum method)":[[12,"RNS.Reticulum.get_medium_path_timeout",false]],"get_mode() (rns.link method)":[[12,"RNS.Link.get_mode",false]],"get_mtu() (rns.link method)":[[12,"RNS.Link.get_mtu",false]],"get_parts() (rns.resource method)":[[12,"RNS.Resource.get_parts",false]],"get_private_key() (rns.destination method)":[[12,"RNS.Destination.get_private_key",false]],"get_private_key() (rns.identity method)":[[12,"RNS.Identity.get_private_key",false]],"get_progress() (rns.requestreceipt method)":[[12,"RNS.RequestReceipt.get_progress",false]],"get_progress() (rns.resource method)":[[12,"RNS.Resource.get_progress",false]],"get_public_key() (rns.identity method)":[[12,"RNS.Identity.get_public_key",false]],"get_q() (rns.link method)":[[12,"RNS.Link.get_q",false]],"get_q() (rns.packet method)":[[12,"RNS.Packet.get_q",false]],"get_random_hash() (rns.identity static method)":[[12,"RNS.Identity.get_random_hash",false]],"get_remote_identity() (rns.link method)":[[12,"RNS.Link.get_remote_identity",false]],"get_request_id() (rns.requestreceipt method)":[[12,"RNS.RequestReceipt.get_request_id",false]],"get_response() (rns.requestreceipt method)":[[12,"RNS.RequestReceipt.get_response",false]],"get_response_time() (rns.requestreceipt method)":[[12,"RNS.RequestReceipt.get_response_time",false]],"get_rssi() (rns.link method)":[[12,"RNS.Link.get_rssi",false]],"get_rssi() (rns.packet method)":[[12,"RNS.Packet.get_rssi",false]],"get_rtt() (rns.packetreceipt method)":[[12,"RNS.PacketReceipt.get_rtt",false]],"get_segments() (rns.resource method)":[[12,"RNS.Resource.get_segments",false]],"get_snr() (rns.link method)":[[12,"RNS.Link.get_snr",false]],"get_snr() (rns.packet method)":[[12,"RNS.Packet.get_snr",false]],"get_status() (rns.packetreceipt method)":[[12,"RNS.PacketReceipt.get_status",false]],"get_status() (rns.requestreceipt method)":[[12,"RNS.RequestReceipt.get_status",false]],"get_transfer_size() (rns.resource method)":[[12,"RNS.Resource.get_transfer_size",false]],"get_value() (rns.identity method)":[[12,"RNS.Identity.get_value",false]],"has_path() (rns.transport static method)":[[12,"RNS.Transport.has_path",false]],"hash() (rns.destination static method)":[[12,"RNS.Destination.hash",false]],"hash_from_name_and_identity() (rns.destination static method)":[[12,"RNS.Destination.hash_from_name_and_identity",false]],"hops_to() (rns.transport static method)":[[12,"RNS.Transport.hops_to",false]],"identify() (rns.link method)":[[12,"RNS.Link.identify",false]],"identity (class in rns)":[[12,"RNS.Identity",false]],"inactive_for() (rns.link method)":[[12,"RNS.Link.inactive_for",false]],"interface_discovery_sources() (rns.reticulum static method)":[[12,"RNS.Reticulum.interface_discovery_sources",false]],"is_compressed() (rns.resource method)":[[12,"RNS.Resource.is_compressed",false]],"is_ready_to_send() (rns.channel.channel method)":[[12,"RNS.Channel.Channel.is_ready_to_send",false]],"keepalive (rns.link attribute)":[[12,"RNS.Link.KEEPALIVE",false]],"keepalive_timeout_factor (rns.link attribute)":[[12,"RNS.Link.KEEPALIVE_TIMEOUT_FACTOR",false]],"keysize (rns.identity attribute)":[[12,"RNS.Identity.KEYSIZE",false]],"link (class in rns)":[[12,"RNS.Link",false]],"link_mtu_discovery (rns.reticulum attribute)":[[12,"RNS.Reticulum.LINK_MTU_DISCOVERY",false]],"link_mtu_discovery() (rns.reticulum static method)":[[12,"RNS.Reticulum.link_mtu_discovery",false]],"load_private_key() (rns.destination method)":[[12,"RNS.Destination.load_private_key",false]],"load_private_key() (rns.identity method)":[[12,"RNS.Identity.load_private_key",false]],"load_public_key() (rns.identity method)":[[12,"RNS.Identity.load_public_key",false]],"mdu (rns.channel.channel property)":[[12,"RNS.Channel.Channel.mdu",false]],"messagebase (class in rns)":[[12,"RNS.MessageBase",false]],"minimum_bitrate (rns.reticulum attribute)":[[12,"RNS.Reticulum.MINIMUM_BITRATE",false]],"msgtype (rns.messagebase attribute)":[[12,"RNS.MessageBase.MSGTYPE",false]],"mtu (rns.reticulum attribute)":[[12,"RNS.Reticulum.MTU",false]],"next_hop() (rns.transport static method)":[[12,"RNS.Transport.next_hop",false]],"next_hop_interface() (rns.transport static method)":[[12,"RNS.Transport.next_hop_interface",false]],"no_data_for() (rns.link method)":[[12,"RNS.Link.no_data_for",false]],"no_inbound_for() (rns.link method)":[[12,"RNS.Link.no_inbound_for",false]],"no_outbound_for() (rns.link method)":[[12,"RNS.Link.no_outbound_for",false]],"pack() (rns.messagebase method)":[[12,"RNS.MessageBase.pack",false]],"packet (class in rns)":[[12,"RNS.Packet",false]],"packetreceipt (class in rns)":[[12,"RNS.PacketReceipt",false]],"pathfinder_m (rns.transport attribute)":[[12,"RNS.Transport.PATHFINDER_M",false]],"plain_mdu (rns.packet attribute)":[[12,"RNS.Packet.PLAIN_MDU",false]],"pub_to_file() (rns.identity method)":[[12,"RNS.Identity.pub_to_file",false]],"publish_blackhole_enabled() (rns.reticulum static method)":[[12,"RNS.Reticulum.publish_blackhole_enabled",false]],"ratchet_count (rns.destination attribute)":[[12,"RNS.Destination.RATCHET_COUNT",false]],"ratchet_expiry (rns.identity attribute)":[[12,"RNS.Identity.RATCHET_EXPIRY",false]],"ratchet_interval (rns.destination attribute)":[[12,"RNS.Destination.RATCHET_INTERVAL",false]],"ratchetsize (rns.identity attribute)":[[12,"RNS.Identity.RATCHETSIZE",false]],"rawchannelreader (class in rns)":[[12,"RNS.RawChannelReader",false]],"rawchannelwriter (class in rns)":[[12,"RNS.RawChannelWriter",false]],"recall() (rns.identity static method)":[[12,"RNS.Identity.recall",false]],"recall_app_data() (rns.identity static method)":[[12,"RNS.Identity.recall_app_data",false]],"recall_link_cost() (rns.identity static method)":[[12,"RNS.Identity.recall_link_cost",false]],"recall_stamp_value() (rns.identity static method)":[[12,"RNS.Identity.recall_stamp_value",false]],"register_announce_handler() (rns.transport static method)":[[12,"RNS.Transport.register_announce_handler",false]],"register_message_type() (rns.channel.channel method)":[[12,"RNS.Channel.Channel.register_message_type",false]],"register_request_handler() (rns.destination method)":[[12,"RNS.Destination.register_request_handler",false]],"remote_management_enabled() (rns.reticulum static method)":[[12,"RNS.Reticulum.remote_management_enabled",false]],"remove_message_handler() (rns.channel.channel method)":[[12,"RNS.Channel.Channel.remove_message_handler",false]],"remove_ready_callback() (rns.rawchannelreader method)":[[12,"RNS.RawChannelReader.remove_ready_callback",false]],"request() (rns.link method)":[[12,"RNS.Link.request",false]],"request_path() (rns.transport static method)":[[12,"RNS.Transport.request_path",false]],"requestreceipt (class in rns)":[[12,"RNS.RequestReceipt",false]],"required_discovery_value() (rns.reticulum static method)":[[12,"RNS.Reticulum.required_discovery_value",false]],"resend() (rns.packet method)":[[12,"RNS.Packet.resend",false]],"resource (class in rns)":[[12,"RNS.Resource",false]],"reticulum (class in rns)":[[12,"RNS.Reticulum",false]],"send() (rns.channel.channel method)":[[12,"RNS.Channel.Channel.send",false]],"send() (rns.packet method)":[[12,"RNS.Packet.send",false]],"set_default_app_data() (rns.destination method)":[[12,"RNS.Destination.set_default_app_data",false]],"set_delivery_callback() (rns.packetreceipt method)":[[12,"RNS.PacketReceipt.set_delivery_callback",false]],"set_link_closed_callback() (rns.link method)":[[12,"RNS.Link.set_link_closed_callback",false]],"set_link_cost() (rns.destination method)":[[12,"RNS.Destination.set_link_cost",false]],"set_link_established_callback() (rns.destination method)":[[12,"RNS.Destination.set_link_established_callback",false]],"set_max_request_size() (rns.destination method)":[[12,"RNS.Destination.set_max_request_size",false]],"set_packet_callback() (rns.destination method)":[[12,"RNS.Destination.set_packet_callback",false]],"set_packet_callback() (rns.link method)":[[12,"RNS.Link.set_packet_callback",false]],"set_proof_requested_callback() (rns.destination method)":[[12,"RNS.Destination.set_proof_requested_callback",false]],"set_proof_strategy() (rns.destination method)":[[12,"RNS.Destination.set_proof_strategy",false]],"set_ratchet_interval() (rns.destination method)":[[12,"RNS.Destination.set_ratchet_interval",false]],"set_remote_identified_callback() (rns.link method)":[[12,"RNS.Link.set_remote_identified_callback",false]],"set_resource_callback() (rns.link method)":[[12,"RNS.Link.set_resource_callback",false]],"set_resource_concluded_callback() (rns.link method)":[[12,"RNS.Link.set_resource_concluded_callback",false]],"set_resource_started_callback() (rns.link method)":[[12,"RNS.Link.set_resource_started_callback",false]],"set_resource_strategy() (rns.link method)":[[12,"RNS.Link.set_resource_strategy",false]],"set_retained_ratchets() (rns.destination method)":[[12,"RNS.Destination.set_retained_ratchets",false]],"set_timeout() (rns.packetreceipt method)":[[12,"RNS.PacketReceipt.set_timeout",false]],"set_timeout_callback() (rns.packetreceipt method)":[[12,"RNS.PacketReceipt.set_timeout_callback",false]],"set_value() (rns.destination method)":[[12,"RNS.Destination.set_value",false]],"should_use_implicit_proof() (rns.reticulum static method)":[[12,"RNS.Reticulum.should_use_implicit_proof",false]],"sign() (rns.destination method)":[[12,"RNS.Destination.sign",false]],"sign() (rns.identity method)":[[12,"RNS.Identity.sign",false]],"stale_grace (rns.link attribute)":[[12,"RNS.Link.STALE_GRACE",false]],"stale_time (rns.link attribute)":[[12,"RNS.Link.STALE_TIME",false]],"teardown() (rns.link method)":[[12,"RNS.Link.teardown",false]],"to_file() (rns.identity method)":[[12,"RNS.Identity.to_file",false]],"track_phy_stats() (rns.link method)":[[12,"RNS.Link.track_phy_stats",false]],"transport (class in rns)":[[12,"RNS.Transport",false]],"transport_enabled() (rns.reticulum static method)":[[12,"RNS.Reticulum.transport_enabled",false]],"truncated_hash() (rns.identity static method)":[[12,"RNS.Identity.truncated_hash",false]],"truncated_hashlength (rns.identity attribute)":[[12,"RNS.Identity.TRUNCATED_HASHLENGTH",false]],"unblackhole_identity() (rns.transport static method)":[[12,"RNS.Transport.unblackhole_identity",false]],"unpack() (rns.messagebase method)":[[12,"RNS.MessageBase.unpack",false]],"validate() (rns.identity method)":[[12,"RNS.Identity.validate",false]]},"objects":{"RNS":[[12,0,1,"","Buffer"],[12,0,1,"","Destination"],[12,0,1,"","Identity"],[12,0,1,"","Link"],[12,0,1,"","MessageBase"],[12,0,1,"","Packet"],[12,0,1,"","PacketReceipt"],[12,0,1,"","RawChannelReader"],[12,0,1,"","RawChannelWriter"],[12,0,1,"","RequestReceipt"],[12,0,1,"","Resource"],[12,0,1,"","Reticulum"],[12,0,1,"","Transport"]],"RNS.Buffer":[[12,1,1,"","create_bidirectional_buffer"],[12,1,1,"","create_reader"],[12,1,1,"","create_writer"]],"RNS.Channel":[[12,0,1,"","Channel"]],"RNS.Channel.Channel":[[12,1,1,"","add_message_handler"],[12,1,1,"","is_ready_to_send"],[12,2,1,"","mdu"],[12,1,1,"","register_message_type"],[12,1,1,"","remove_message_handler"],[12,1,1,"","send"]],"RNS.Destination":[[12,3,1,"","RATCHET_COUNT"],[12,3,1,"","RATCHET_INTERVAL"],[12,1,1,"","accepts_links"],[12,1,1,"","announce"],[12,1,1,"","app_and_aspects_from_name"],[12,1,1,"","clear_default_app_data"],[12,1,1,"","create_keys"],[12,1,1,"","decrypt"],[12,1,1,"","deregister_request_handler"],[12,1,1,"","enable_ratchets"],[12,1,1,"","encrypt"],[12,1,1,"","enforce_ratchets"],[12,1,1,"","expand_name"],[12,1,1,"","get_link_cost"],[12,1,1,"","get_private_key"],[12,1,1,"","hash"],[12,1,1,"","hash_from_name_and_identity"],[12,1,1,"","load_private_key"],[12,1,1,"","register_request_handler"],[12,1,1,"","set_default_app_data"],[12,1,1,"","set_link_cost"],[12,1,1,"","set_link_established_callback"],[12,1,1,"","set_max_request_size"],[12,1,1,"","set_packet_callback"],[12,1,1,"","set_proof_requested_callback"],[12,1,1,"","set_proof_strategy"],[12,1,1,"","set_ratchet_interval"],[12,1,1,"","set_retained_ratchets"],[12,1,1,"","set_value"],[12,1,1,"","sign"]],"RNS.Identity":[[12,3,1,"","CURVE"],[12,3,1,"","KEYSIZE"],[12,3,1,"","RATCHETSIZE"],[12,3,1,"","RATCHET_EXPIRY"],[12,3,1,"","TRUNCATED_HASHLENGTH"],[12,1,1,"","current_ratchet_id"],[12,1,1,"","decrypt"],[12,1,1,"","encrypt"],[12,1,1,"","from_bytes"],[12,1,1,"","from_file"],[12,1,1,"","full_hash"],[12,1,1,"","get_private_key"],[12,1,1,"","get_public_key"],[12,1,1,"","get_random_hash"],[12,1,1,"","get_value"],[12,1,1,"","load_private_key"],[12,1,1,"","load_public_key"],[12,1,1,"","pub_to_file"],[12,1,1,"","recall"],[12,1,1,"","recall_app_data"],[12,1,1,"","recall_link_cost"],[12,1,1,"","recall_stamp_value"],[12,1,1,"","sign"],[12,1,1,"","to_file"],[12,1,1,"","truncated_hash"],[12,1,1,"","validate"]],"RNS.Link":[[12,3,1,"","CURVE"],[12,3,1,"","ESTABLISHMENT_TIMEOUT_PER_HOP"],[12,3,1,"","KEEPALIVE"],[12,3,1,"","KEEPALIVE_TIMEOUT_FACTOR"],[12,3,1,"","STALE_GRACE"],[12,3,1,"","STALE_TIME"],[12,1,1,"","get_age"],[12,1,1,"","get_channel"],[12,1,1,"","get_establishment_rate"],[12,1,1,"","get_expected_rate"],[12,1,1,"","get_mdu"],[12,1,1,"","get_mode"],[12,1,1,"","get_mtu"],[12,1,1,"","get_q"],[12,1,1,"","get_remote_identity"],[12,1,1,"","get_rssi"],[12,1,1,"","get_snr"],[12,1,1,"","identify"],[12,1,1,"","inactive_for"],[12,1,1,"","no_data_for"],[12,1,1,"","no_inbound_for"],[12,1,1,"","no_outbound_for"],[12,1,1,"","request"],[12,1,1,"","set_link_closed_callback"],[12,1,1,"","set_packet_callback"],[12,1,1,"","set_remote_identified_callback"],[12,1,1,"","set_resource_callback"],[12,1,1,"","set_resource_concluded_callback"],[12,1,1,"","set_resource_started_callback"],[12,1,1,"","set_resource_strategy"],[12,1,1,"","teardown"],[12,1,1,"","track_phy_stats"]],"RNS.MessageBase":[[12,3,1,"","MSGTYPE"],[12,1,1,"","pack"],[12,1,1,"","unpack"]],"RNS.Packet":[[12,3,1,"","ENCRYPTED_MDU"],[12,3,1,"","PLAIN_MDU"],[12,1,1,"","get_q"],[12,1,1,"","get_rssi"],[12,1,1,"","get_snr"],[12,1,1,"","resend"],[12,1,1,"","send"]],"RNS.PacketReceipt":[[12,1,1,"","get_rtt"],[12,1,1,"","get_status"],[12,1,1,"","set_delivery_callback"],[12,1,1,"","set_timeout"],[12,1,1,"","set_timeout_callback"]],"RNS.RawChannelReader":[[12,1,1,"","__init__"],[12,1,1,"","add_ready_callback"],[12,1,1,"","remove_ready_callback"]],"RNS.RawChannelWriter":[[12,1,1,"","__init__"]],"RNS.RequestReceipt":[[12,1,1,"","concluded"],[12,1,1,"","get_progress"],[12,1,1,"","get_request_id"],[12,1,1,"","get_response"],[12,1,1,"","get_response_time"],[12,1,1,"","get_status"]],"RNS.Resource":[[12,1,1,"","advertise"],[12,1,1,"","cancel"],[12,1,1,"","get_data_size"],[12,1,1,"","get_hash"],[12,1,1,"","get_parts"],[12,1,1,"","get_progress"],[12,1,1,"","get_segments"],[12,1,1,"","get_transfer_size"],[12,1,1,"","is_compressed"]],"RNS.Reticulum":[[12,3,1,"","ANNOUNCE_CAP"],[12,3,1,"","DEFAULT_PER_HOP_TIMEOUT"],[12,3,1,"","LINK_MTU_DISCOVERY"],[12,3,1,"","MINIMUM_BITRATE"],[12,3,1,"","MTU"],[12,1,1,"","blackhole_sources"],[12,1,1,"","discovered_interfaces"],[12,1,1,"","get_first_hop_timeout"],[12,1,1,"","get_instance"],[12,1,1,"","get_instance_pid"],[12,1,1,"","get_lowest_interface_bitrate"],[12,1,1,"","get_medium_path_timeout"],[12,1,1,"","interface_discovery_sources"],[12,1,1,"","link_mtu_discovery"],[12,1,1,"","publish_blackhole_enabled"],[12,1,1,"","remote_management_enabled"],[12,1,1,"","required_discovery_value"],[12,1,1,"","should_use_implicit_proof"],[12,1,1,"","transport_enabled"]],"RNS.Transport":[[12,3,1,"","PATHFINDER_M"],[12,1,1,"","await_path"],[12,1,1,"","blackhole_identity"],[12,1,1,"","deregister_announce_handler"],[12,1,1,"","has_path"],[12,1,1,"","hops_to"],[12,1,1,"","next_hop"],[12,1,1,"","next_hop_interface"],[12,1,1,"","register_announce_handler"],[12,1,1,"","request_path"],[12,1,1,"","unblackhole_identity"]]},"objnames":{"0":["py","class","Python class"],"1":["py","method","Python method"],"2":["py","property","Python property"],"3":["py","attribute","Python attribute"]},"objtypes":{"0":"py:class","1":"py:method","2":"py:property","3":"py:attribute"},"terms":{"":[1,2,4,5,7,8,10,11,12,13,15,16,17,18],"0":[0,2,4,5,8,11,12,15,16,17],"00":[0,5,11,15,16],"000":0,"00000000":15,"0000001":0,"00000100":15,"00000111":15,"01":[5,15],"0100":5,"01010000":15,"02":4,"03":5,"04":5,"05":[0,2,5],"0536":16,"06":0,"06915":8,"06982":0,"08":[2,16],"09":[0,5],"097":0,"0d7334d411d00120cbad24edf355fdd2":5,"0f4259fef4521ab75a3409e353fe9073eb10783b4912a6a9937c57bf44a62c1":16,"0x0101":2,"0x20":2,"0x7d":2,"0x7e":2,"0x91c421ddfb8a30a49a71d63447ddb54cebe3465":14,"0xf000":[2,12],"1":[2,4,5,7,8,11,12,15,16,18],"10":[0,5,8,11,15,16],"100":[0,2,8,11,15],"1000":2,"10000000":15,"101":0,"102":0,"1024":[2,8],"103":0,"106":0,"107":0,"1081":0,"1087":0,"109":18,"11":[0,5,11,15],"110":0,"111":0,"1115":0,"11193":11,"1121":0,"115":15,"115200":[2,8,16],"1178a8f1fad405bf2ad153bf5036bdfd":16,"118":8,"12":[0,4,5,8,11,16],"1200":15,"122":0,"125":[8,11],"125000":8,"1260p":0,"127":8,"128":[0,8,10,12,15],"13":[0,16],"132":0,"13425ec15b621c1d928589718000d814":[10,15],"1367":0,"137":0,"1373":0,"1381":0,"14":[2,5,8,11],"140":0,"140554":11,"144":0,"146":0,"147174":11,"1476":0,"149":0,"15":[0,5,8,11],"150":[8,16],"150m":8,"153cb870b4665b8c1c348896292b0bad":5,"15kb":18,"15m":16,"16":[0,5,8,10,11,15,16,18],"16190":0,"16192":0,"1625":8,"1625000":8,"167":15,"168":18,"17":[0,11,16],"1711":0,"1716230400":5,"1726dbad538775b5bf9b0ea25a4079c8":16,"175":0,"18":[0,5,16],"1800":12,"187":16,"1879":0,"188":0,"1884":0,"19":0,"190":11,"192":18,"1976":0,"1980":0,"1984":0,"1985":0,"1989":0,"1990":0,"1991":0,"1992":0,"1997":0,"1998":0,"1999":0,"1a54d64db7e8beca6f2c6cd17b0cb479":5,"1b03013c25f1c2ca068a4f080b844a10":16,"1h":16,"2":[2,4,5,7,8,11,12,15,16],"20":[0,5,8,11,15,16],"200":[8,16],"2005":1,"2008":0,"201":8,"2010":0,"2016":[9,17],"2017":0,"2018":0,"2021":0,"2023":[0,4,16],"2024":5,"2025":[0,5],"2026":[0,5,9,18],"203":0,"21":[0,4],"21a8daa6d9c3d3b8aab6e94b6bcb0e33":5,"22":[0,5,8],"2225fdeecaf6e2db4556c3c2d7637294":16,"226":0,"229":0,"23":[0,5,11,16],"2316":16,"233":0,"236":0,"23h":16,"24":[5,8,11,16],"2400":13,"2400000000":8,"25":[0,2,5,7,11,17],"250":[11,18],"252":0,"255":[8,16],"25519":12,"256":[0,5,10,11,12,15,16,17],"2592000":12,"26":[0,11],"27":[5,11,16],"280":0,"29":[0,8,11],"297":[15,17],"29716":8,"2b489d06eaf7c543808c76a5332a447d":16,"2b9ec651326d9bc274119054c70fb75":16,"2d":0,"2d03725b327348980d570f739a3a5708":16,"2d882c5586e548d79b5af27bca1776dc":16,"2f":2,"2owjajquafianpecac":4,"3":[0,2,4,5,8,13,15,16,17],"30":[0,5,11,12,16],"30602def3b3506a28ed33db6f60cc6c9":16,"31":0,"313":0,"32":[4,5,11,12,15],"3278":8,"327c1b2f87c9353e01769b01090b18f2":18,"32m":16,"33":[0,8],"34":[8,18],"340":0,"345":0,"35":0,"360":[5,8,12],"3600":[2,4,8],"3691":11,"37":[0,5],"37062":11,"374":0,"37428":16,"37429":16,"37k":0,"38":[0,5,16],"380":11,"382":11,"383":12,"3865":16,"399ea050ce0eed1816c300bcb0840938":16,"3a4f8b9c1d2e3f4g5h6i7j8k9l0m1n2o":16,"3b87":8,"3d":0,"3k":0,"4":[0,5,11,12,15,16],"40m":16,"42":[0,5,11],"420":0,"4242":[4,8,11],"4251":8,"42671":8,"43":11,"430":15,"4343":8,"44":17,"44318":8,"45":[2,5,11,15],"46":16,"464":12,"465":15,"469":16,"471":0,"48":0,"48555":8,"49":[0,16],"490":0,"49555":8,"4965":16,"499":0,"4e":8,"4ed75ffdd":0,"4faf1b2e0a077e6a9d92fa051f256038":15,"4g":18,"4ghz":8,"4h":11,"4k":0,"5":[0,2,5,8,11,12,15,16,17,18],"50":11,"500":[0,8,12,15,17,18],"5001":8,"501":0,"506":0,"508":0,"50824b711717f97c2fb1166ceddd5ea9":5,"51":[8,15],"512":[8,12,15,17],"519":0,"52":16,"521c87a83afb8f29e4455e77930b973b":16,"5233":0,"5245a8efe1788c6a1cd36144a270e13b":16,"53":[0,5],"535":0,"539":0,"54cc8d601":0,"54m":11,"55":[8,11],"56":16,"5600x":0,"564":2,"566":0,"56m":16,"57":0,"5757":8,"58":0,"5858":8,"59":16,"593":0,"598":0,"5caf":8,"5d78":8,"5k":0,"5urvjicpzi7q3ybztsef4i5ow2aq4soktfj7zedz53s47r54jnqq":8,"6":[4,5,8,11,12,13,16],"60":[2,8,16],"600":[0,8],"629":0,"63":16,"636":0,"637":0,"64":[4,8,11,15,16],"65":0,"65536":11,"67":0,"687":0,"68a4aa91ac350c4087564e8a69f84e86":16,"69":[0,11],"693":0,"6h":11,"7":[0,4,5,8,11,15,16],"709":0,"71":[11,18],"71e5":8,"72":8,"720":[8,12],"7200":8,"73":[8,16],"730":0,"737":0,"73cbd378bb0286ed11a707c13447bb1":16,"74":16,"74195":8,"74bea355":0,"75":11,"781":16,"7822":16,"7a55144adf826958a9529a3bcf08b149":16,"8":[0,2,8,11,16],"80":[14,16],"800":0,"8001":8,"805":0,"809":16,"82":0,"83":[15,16],"83b7328926fed0d2e6a10a7671f9e237":18,"84":0,"84fpy1qbxhcgdseepynmhthcrgmx4nffbytz2gkytoqhvvhjp8eaw1z1eedrnkd19b3b8nilcgvxzkv17ummmeescrpya5w":14,"86":16,"86240b027":0,"865":8,"865600000":8,"867":8,"867200000":8,"868":15,"88":[0,8],"886":0,"89":[0,8],"8a37cdd16938ce79861561adbd59023a":5,"8dd57a738226809646089335a6b03695":16,"8f3a21c9d84e927b":5,"8f7e6d5":5,"8f7e6d5c8f7e6d5c8f7e6d5c8f7e6d5c8f7e6d5":5,"8k":0,"9":[0,4,5,11,16],"90":5,"900":[0,15,16],"9037":16,"92":11,"921600":16,"928":0,"94":0,"940":0,"941bed5e228775e5a8079fc38b1ccf3f":16,"959e10e5efc1bd9d97a4083babe51dea":5,"96":[0,15],"9600":2,"9710b86":5,"9710b86ba12c42d1d8f30f74fe509286":5,"9710b86ba12c4f2":5,"982":0,"983":0,"984b74a3f768bef236af4371e6f248cd":16,"99":[0,15],"99714":8,"9a":5,"9d27af75c":0,"9fb6d773498fb3feda407ed8ef2c3229":16,"9h":16,"9k":0,"9th":0,"A":[1,2,4,5,7,8,9,10,11,12,13,15,16],"AND":9,"AS":9,"And":[1,2,7,18],"As":[0,1,4,5,6,8,11,12,13,14,15,16,17],"At":[0,4,11,15],"BE":9,"BUT":9,"Be":[0,5,12,16,18],"Being":0,"But":[1,4,7,14,15,18],"By":[1,2,4,5,7,8,11,12,15,16,18],"FOR":9,"For":[1,4,5,7,8,10,12,13,15,16,17],"IN":[2,9,11,12],"If":[0,1,2,4,5,6,8,10,11,12,13,14,15,16,17,18],"In":[1,2,4,5,6,7,8,10,11,12,13,15,16,17],"It":[0,1,2,4,5,6,8,10,11,12,13,15,16,17,18],"Its":[0,11],"NO":9,"NOT":9,"No":[2,4,7,8,10,15,16,17,18],"Not":7,"OF":9,"OR":9,"Of":[10,15],"On":[1,2,4,5,7,8,10,16,18],"One":[0,4,5,6,8,12,15,18],"Or":[5,7,8,15,16,17],"Such":[0,1,8,11],"THE":9,"TO":9,"That":[1,5,7,11,13,15,18],"The":[2,4,6,7,8,9,10,11,12,13,14,17],"Their":0,"Then":[0,1,2,4],"There":[0,1,4,10,11,15,16,18],"These":[1,4,5,7,8,10,11,12,13,15,16],"To":[2,4,5,6,7,8,10,15,16,17],"WITH":9,"Will":12,"With":[1,7,8,10,11,13,15,16,18],"_":15,"__":15,"______":15,"_______":15,"________":15,"________________":15,"__future__":2,"__init__":[2,12],"__main__":2,"__name__":2,"__str__":2,"_no_us":12,"a010e6613":0,"a0c289d131c7bfa8d5ddc8b652c0f40d":11,"a1b2c3d4e5f686ba12c42d1ba12ef1aa":5,"a4d":8,"a79f":8,"aarch64":[0,4],"ab":2,"abandon":[0,1],"abc":5,"abil":[0,1,4,5,6,7,9,16,17],"abl":[0,1,2,4,5,8,12,15,16],"abolish":18,"abort":[1,2,5,8],"about":[0,2,4,5,6,8,10,11,12,15,16,18],"abov":[0,4,5,6,8,9,11,15,16],"abridg":0,"absenc":0,"absent":0,"absolut":[0,8,14,17,18],"abstract":[0,10,12,15,18],"abstractmethod":12,"absurd":0,"abund":[6,18],"abus":[0,11,16],"academ":1,"acceler":0,"accept":[0,1,5,8,11,12,14,15,16,18],"accept_al":[2,12],"accept_app":12,"accept_non":12,"accepts_link":12,"access":[0,1,4,7,8,10,11,12,16,18],"access_point":[8,10],"accid":[0,13,18],"accommod":[12,15],"accomod":18,"accompani":0,"accord":[0,2,4,5,10,11,15],"accordingli":[2,8,11],"account":[0,1,10,12,18],"accumul":0,"accus":0,"achiev":[0,1,4,8,10,12,15,17],"acknowledg":[0,10,17],"acquir":0,"across":[0,1,2,5,6,8,10,11,12,15,16,18],"act":[0,1,4,8,11,12,15,16,18],"action":[0,1,2,9,16],"activ":[0,1,2,4,5,8,11,12,13,15,16],"actor":[1,11,15,16,18],"actual":[1,2,4,5,7,8,10,11,15,16,18],"ad":[0,1,2,5,6,7,8,10,11,12,13,15,16,17,18],"adapt":[0,4,6,18],"add":[0,1,2,4,5,8,10,11,12,16],"add_argu":2,"add_message_handl":[2,12],"add_ready_callback":12,"addendum":7,"addict":18,"addit":[0,5,6,8,10,11,12,13,15,16,17],"addition":[4,5,6,8,15],"addr":16,"address":[0,1,2,4,5,7,8,12,15,16,17],"adher":[8,12],"adjust":[0,4,5,11,12,16,18],"adm":5,"admin":[5,8],"administ":[0,5],"administr":[0,5,7,10,15,16,18],"admit":0,"adopt":[0,15],"adress":[12,15],"advanc":[0,11,13,15],"advantag":12,"advers":17,"adversari":[0,4,10,14,18],"advertis":[0,2,8,12],"advic":[0,14],"advis":[8,15],"ae":[0,12,15,17],"aetherlab":13,"af73":8,"aff":0,"affair":0,"affect":[0,4,8,18],"affili":1,"affin":8,"affirm":0,"afford":10,"after":[0,2,4,5,8,10,11,12,15,16],"afterthought":[0,18],"ag":[0,1],"again":[0,8,11,15,16],"against":[0,1,4,5,8,11,15,18],"agenc":[7,15],"agenda":0,"agent":[7,15,18],"aggress":0,"agnost":[10,15],"agnostic":[15,18],"ago":[0,16],"agpl":0,"agreement":[0,1,18],"ahead":[0,10],"ai":[0,18],"aim":[0,1,4,7,13,15],"air":[4,6],"airmax":6,"airtim":[0,8,10,18],"airtime_limit_long":8,"airtime_limit_short":8,"airwav":0,"akin":15,"alexand":0,"algorithm":[0,1,9,10,18],"alia":5,"alias":7,"aliased_nam":5,"alic":[5,15],"alien":18,"align":[0,4,16,18],"aliv":[12,15],"all":[0,1,2,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18],"allerg":0,"allevi":6,"alloc":[0,8,10,11,12,15,16],"allow":[0,1,2,4,5,6,8,10,11,12,13,15,16,17,18],"allow_al":[2,12],"allow_list":12,"allow_non":12,"allowed_hash":16,"allowed_ident":16,"allowed_list":12,"allowed_typ":11,"allowedsignersfil":5,"almost":[0,1,6,8,11,15,16,18],"alon":[0,8],"along":[5,8,11,12,15,16],"alongsid":[5,10],"alpha":13,"alreadi":[0,2,4,5,6,10,11,12,13,15,16,18],"also":[0,1,2,4,5,6,7,8,10,11,12,13,15,16,17,18],"altai":0,"alter":[4,12,15],"altern":[0,2,4,5,8,16],"although":[4,15,17],"altitud":8,"alwai":[0,1,4,5,8,10,11,12,15,16,18],"always_stamp_lr":11,"am":18,"amateur":[8,17],"ambigu":0,"amd64":0,"america":0,"among":[1,18],"amongst":[0,9],"amount":[0,2,8,10,11,12,15,17,18],"amplifi":1,"amsterdam":[8,16],"an":[0,1,2,4,5,6,8,9,10,11,12,13,15,16,17,18],"analog":[13,18],"analysi":[1,5,7],"analyt":14,"analyz":[0,1],"ancestri":0,"anchor":7,"andi":0,"android":[7,8,13,16],"ani":[0,1,2,4,5,6,8,9,10,11,12,13,14,15,16,17],"annonuc":8,"annot":2,"annouce_cap":8,"announc":[0,4,5,7,10,11,12,16],"announce_cap":[8,11,12],"announce_handl":2,"announce_interv":[5,8],"announce_packet_hash":12,"announce_rate_grac":[4,8],"announce_rate_penalti":[4,8],"announce_rate_target":[4,8],"announced_ident":[2,12],"announceloop":2,"announces_from_intern":8,"announces_to_intern":8,"announcesampl":2,"annoy":16,"anonym":[0,4,10,11,12,15,17],"anoth":[0,5,8,10,12,15,16,18],"another_ident":11,"answer":[15,16,18],"antenna":[0,6,18],"anticip":[0,5],"antidot":0,"anxieti":18,"anymor":[4,18],"anyon":[0,1,2,4,5,6,8,10,11,12,15,16,18],"anyth":[0,1,5,6,8,11,13,15,16,17,18],"anywai":[0,8],"anywher":[0,1,2,8,18],"ap":8,"apach":0,"api":[4,5,7,11,15,17,18],"apk":4,"app":[0,2,4,12,13,15,18],"app_and_aspects_from_nam":12,"app_data":[2,12],"app_nam":[2,12],"app_timeout":2,"appar":[0,1],"apparatu":0,"appeal":0,"appear":[0,18],"append":[2,15,16],"appl":0,"appli":[0,1,5,8,11,12,15,18],"applic":[0,1,2,8,10,11,12,13,15,16,17,18],"appreci":5,"approach":[0,1,4,6,10,11,15,16],"appropri":[0,1,5,8,10,18],"approv":[0,1,10,11,15,18],"approxim":[0,8,11,16],"april":[0,4],"apt":4,"ar":[1,2,4,5,6,7,8,10,11,12,13,14,15,16,17,18],"arbit":18,"arbitrari":[5,12,15,16,17],"arch":[0,4,18],"architect":[14,18],"architectur":[0,4,7,13],"archiv":[0,5,7,13],"area":[1,4,6,8,10,15,17],"arg":[2,16],"argon":2,"argpars":2,"argument":[2,5,7,12,16],"argumentpars":2,"aris":9,"arithmet":0,"arm":0,"arm64":7,"armi":18,"armor":[5,18],"around":[0,4,8,15,18],"arrai":[0,4],"arrang":[0,1],"arriv":[0,2,8,11,15,18],"art":[0,18],"articl":0,"artifact":[0,5,7],"artifacts_dir":5,"artifex":0,"artifici":[0,9],"artist":0,"arx":16,"ascii":5,"ask":[0,2,4,6,12,13,18],"aspect":[2,4,6,8,10,11,12,15,16],"aspect_filt":[2,12],"aspir":0,"assembl":0,"assent":0,"assert":[0,1,18],"assess":0,"assign":[0,2,10,15,16,18],"assist":[7,13],"associ":[0,5,9,11,12,15,16],"assum":[0,8,10,15,18],"assumpt":[0,10,14,18],"assuredli":18,"asymmetr":[15,16,17],"asymmetri":[0,1],"asynchron":[10,18],"atop":1,"atrophi":0,"attach":[0,1,13,16],"attached_interfac":12,"attack":[0,4],"attain":[0,4],"attempt":[0,2,4,5,6,8,11,12,16],"attend":0,"attent":[0,1,14,18],"attest":[0,5],"attract":0,"attribut":[1,7,12],"atx":16,"audienc":0,"audio":13,"audit":0,"auth":16,"authent":[1,5,8,10,12,13,15,16,17],"author":[1,7,9,11,15,16,18],"authoris":[0,16],"authorit":[0,5,15,17],"authorship":[0,1],"auto":[4,5,6,7,12,15,16],"auto_compress":12,"autoconfigur":17,"autoconnect":16,"autoconnect_announces_to_intern":16,"autoconnect_discovered_interfac":[8,16],"autoconnect_interface_grav":8,"autoconnect_interface_mod":16,"autoconnect_unverified_implement":16,"autodiscov":8,"autoinstal":[6,16],"autointerfac":[4,6,8,16],"autom":[0,1,4,5,6,7,11,13,14,15],"automat":[2,4,7,8,10,11,12,13,15,16,17,18],"autonom":[1,10,15,18],"autonomi":[1,17,18],"avail":[0,1,2,4,5,6,7,8,10,11,12,13,15,16,17,18],"avatar":0,"averag":[11,15],"avoid":[6,15,16],"awai":[0,1,2,8,15,16,18],"await_path":12,"awar":[0,4,5,8,11,15],"ax":[7,17],"ax25kissinterfac":8,"axiom":0,"b":[0,2,5,11,16],"b32":8,"back":[0,1,2,5,8,15,17,18],"backbon":[0,6,7,10,16,18],"backboneinterfac":[0,4,8,11,16],"backend":[8,11,15],"background":[4,8,16],"backhaul":[6,10],"backup":[1,16],"backward":[0,11],"bad":0,"badg":0,"badli":0,"baker":0,"balanc":[0,8],"ban":0,"banal":0,"band":[6,15,18],"bandwidth":[0,4,7,8,10,11,12,13,15,16,17],"bar":[0,18],"bare":[0,1,2,5,8,18],"barrier":[1,8,15,18],"base":[0,1,5,7,8,10,12,13,15,16,17,18],"base32":[8,16],"base64":[5,16],"baselin":0,"bash":[8,16],"bash_sourc":5,"basi":[0,1,8,11,12,15,16,17],"basic":[0,2,4,7,8,10,11,12,13,16],"batch":5,"batter":0,"batteri":[11,18],"baud":[8,16],"baud_flash":16,"baudrat":2,"bc1pgqgu8h8xvj4jtafslq396v7ju7hkgymyrzyqft4llfslz5vp99psqfk3a6":14,"bc7291552be7a58f361522990465165c":[16,17],"beacon":8,"bear":0,"beast":18,"beat":18,"beauti":[1,13],"becam":[0,1],"becaus":[0,1,5,10,15,18],"becki":2,"becom":[0,1,2,4,5,8,10,11,15,18],"bedrock":0,"been":[0,1,2,4,5,6,8,10,11,12,13,14,15,16,17,18],"befor":[0,2,4,5,8,10,11,12,14,15,16,18],"beg":18,"begin":[0,2,6,12,18],"begun":[0,12],"behalf":[8,10],"behav":[0,6,13],"behavior":[0,8,13,18],"behaviour":[0,4,8,11,16],"behind":[0,4,8,14,15,18],"being":[0,1,4,5,8,11,12,13,15,18],"beings":[0,1,9,15],"belief":[0,15],"believ":[0,1,18],"belong":[0,8,10,15,16,18],"below":[0,6,8,11,16],"benchmark":0,"bend":18,"benefici":[8,16],"beneficiari":0,"benefit":[4,16],"berlin":18,"bern":11,"besid":0,"best":[0,4,10,12,15,18],"beta":0,"better":[0,1,4,8,10,14,15,18],"between":[0,1,2,8,10,11,12,13,15,16,18],"beyond":[0,1,5],"bi":[12,15],"bicker":0,"bidirect":15,"big":18,"bill":18,"billion":[10,15],"billionair":18,"bin":[4,8,16],"binari":[0,2,4,8,10,11,12,15,16,18],"bind":[0,7,8],"bio":0,"bit":[0,2,4,5,8,10,12,13,15,16,17,18],"bitcoin":14,"bitrat":[2,8,12,13],"bizarr":0,"black":1,"blackhol":[4,7,10,12,15],"blackhole_ident":12,"blackhole_sourc":[12,16],"blackhole_update_interv":16,"blackholed_ident":16,"blackholeupdat":16,"blatant":0,"ble":8,"bless":0,"blindli":[0,16,18],"blizzard":0,"blob":[2,5,15],"block":[0,4,5,7,10,12,13,15,16,18],"block_fast_flap":8,"blockchain":18,"blocklist":[11,16],"blog":0,"blood":18,"blueprint":18,"bluetooth":16,"board":[0,4,7,8,13,15,17],"boat":18,"bob":5,"bobs_nod":5,"bodi":0,"bogu":[8,11],"boil":6,"bolt":11,"bond":18,"book":[0,13,18],"bookworm":7,"bool":12,"boot":[4,16],"bootstrap":[7,8,16],"bootstrap_onli":[4,8],"borrow":18,"bot":13,"both":[0,1,2,4,5,6,8,10,11,12,13,15,16,17],"bother":0,"bottl":0,"bounc":[4,18],"bound":[7,10,11,18],"boundari":[0,1,5,8,10,15,16],"box":[1,6],"bp":11,"brain":0,"branch":[1,5,16],"brandolini":7,"breach":0,"breadcrumb":5,"breadth":0,"break":[0,4,12,15,18],"breath":[0,4,18],"breviti":16,"bridg":[6,8],"brief":7,"briefli":[0,6,15],"brillianc":0,"bring":[0,8,16],"brittl":[4,18],"broad":[4,6],"broadcast":[0,4,7,8,10,11,12,13,15,16,18],"broadcast_destin":2,"broadcastloop":2,"broader":[0,4,15],"broken":[0,4,8,11,16,18],"brought":[0,8,16],"brows":[1,5,7,18],"browser":[0,5,7,18],"buffer":[7,8,12,17],"bufferedread":12,"bufferedrwpair":12,"bufferedwrit":12,"bufferexampl":2,"bug":[0,5,13,14],"bui":18,"build":[0,1,2,5,6,7,8,13,15,17,18],"builder":[0,18],"built":[0,1,4,8,10,11,13,15,16,17,18],"bulletin":13,"bulli":0,"bullshit":0,"bundl":[0,2],"bureaucraci":[11,18],"bureaucrat":[17,18],"burgundi":0,"buri":0,"burrow":0,"burst":[7,16],"busi":11,"busiest":0,"busy":1,"butlerian":0,"button":[0,18],"bw":16,"bypass":[0,8,11,14,18],"byte":[0,2,7,10,11,12,15,16,17],"bytes":2,"c":[0,2,5,9,16],"c4ace368262d845c9dd3":11,"c50cc4e4f7838b6c31f60ab9032cbc62":16,"c89b4da064bf66d280f0e4d8abfd9806":16,"ca":0,"cabl":[8,13,18],"cach":[8,10,16],"cadenc":[0,11],"cafe":18,"cage":18,"cal":0,"calcul":[10,12,15,16],"calibr":0,"call":[0,1,2,10,11,12,13,15,17,18],"callabl":[2,12],"callback":[2,12],"callsign":8,"calm":0,"calmli":0,"cambrian":0,"came":[0,5],"camp":1,"campaign":0,"can":[0,1,2,4,5,6,7,8,10,11,12,13,14,15,16,18],"cancel":[0,5,11,12],"candid":[0,10],"cannot":[0,1,2,4,5,8,10,11,17,18],"canon":0,"cap":8,"capabl":[0,1,2,4,8,10,11,13,15,16],"capac":[0,4,6,10,12,15],"capit":[1,18],"captur":[0,1,18],"car":10,"carambola":2,"card":[1,13,18],"care":[0,1,4,5,10,11,12,16,17,18],"carefulli":[0,4],"cargo_build_target":4,"caricatur":0,"carri":[0,1,8,10,11,12,15,16,17,18],"carrier":[7,10,17],"cascad":0,"case":[1,2,4,5,6,7,8,10,11,13,15,16],"cast":0,"castl":18,"casual":0,"cat":16,"catalogu":0,"catastroph":[0,1],"categori":[0,6],"catiou":0,"caught":0,"caus":[0,4,8,11],"caution":8,"caveat":11,"cb":[12,15],"cbc":[15,17],"cc4d524a3":0,"cd":5,"cdma":8,"ceas":[0,1,18],"cede":1,"cell":[0,10],"cellular":18,"cement":18,"censor":[1,11,15,16,18],"censorship":[15,17],"center":[0,7],"centr":0,"central":[0,1,4,5,6,8,10,13,15,16,18],"centralis":15,"centric":1,"centuri":1,"ceo":18,"certain":[0,2,8,10,11,15,16,18],"certainti":0,"certif":[0,18],"certifi":[0,1],"cetera":0,"chain":[0,5,8,18],"challeng":[0,4,11,13,15,18],"chanc":6,"chang":[0,1,2,4,5,8,12,15,16,17,18],"channel":[0,1,4,5,7,8,10,12,14,15,17,18],"channelarg":2,"channelexampl":2,"chaotic":18,"chapter":[0,1,4,5,6,8,10,11,12,13,15,16,17],"charact":[0,2,5,8,11,16],"characteris":0,"characterist":[0,8,10,11,15,18],"charad":0,"charg":[0,9],"chart":[0,5],"charter":15,"chase":18,"chat":7,"cheap":[0,6,8,11,15],"cheaper":0,"cheapli":4,"check":[0,2,4,5,12,13,15,16,18],"checksum":[5,12,17],"chmod":5,"choic":[0,4,10,18],"choke":18,"choos":[0,1,2,4,8,13,15,18],"choreographi":0,"choru":0,"chose":[0,15],"chosen":15,"chunk":2,"churn":0,"ci":0,"cific":8,"ciphertext":12,"ciphertext_token":12,"cir":0,"circl":18,"circuit":0,"circul":0,"circumst":[14,15,18],"citat":0,"cite":0,"citi":[0,18],"cl":2,"claim":[5,7,9,15],"claimant":0,"clamp":11,"clariti":18,"class":[0,2,10,11,12,17],"classifi":[0,11],"claud":0,"clean":7,"cleanest":0,"clear":[0,2,8,11,12,16,18],"clear_default_app_data":12,"clear_screen":2,"clearer":0,"clearli":[0,18],"click":5,"client":[1,2,5,6,7,11,12,13,16,18],"client_buffer_readi":2,"client_config":5,"client_connect":2,"client_disconnect":2,"client_ident":[2,5],"client_loop":2,"client_message_receiv":2,"client_packet_receiv":2,"client_request":2,"climat":18,"clone":[0,5,15],"close":[0,2,10,11,12,16],"closed_callback":12,"closer":[13,15],"closest":15,"closur":0,"cloth":18,"cloud":[1,7,8,13],"cluster":[1,15],"co":[0,5,6,8,17],"code":[1,4,5,6,7,8,10,11,13,14,16,17,18],"codebas":0,"codens":0,"codex":0,"codic":1,"codifi":0,"codingr":8,"coexist":[7,10],"coffe":18,"coher":18,"coin":0,"collabor":[1,5,13,15,16],"collaps":[0,1,4,18],"collect":[0,1,4,14],"collis":10,"colon":18,"color":5,"columba":7,"columbia":0,"com":[0,2,5,14,18],"combat":11,"combin":[0,1,4,5,7,11,13,15,16,18],"combinatori":18,"come":[0,1,4,8,10,15,16,18],"comma":[8,16],"command":[0,1,2,4,7,8,13,16],"commend":18,"commensur":0,"comment":[0,1,5,8,16],"commentari":0,"commerci":[0,18],"commiss":0,"commit":[0,1,4,7,13],"committ":0,"committe":[0,18],"common":[1,2,4,6,7,10,11,15,16,17,18],"commonli":[0,5,6,8],"commun":[0,1,2,4,5,7,8,10,11,12,13,14,15,16,17,18],"communica":8,"compact":11,"compani":18,"companion":[0,13],"compar":[10,18],"comparison":[0,11],"compass":18,"compat":[0,1,2,4,5,6,8,11,12,13,15,16,17],"compet":[0,1,18],"compil":[0,4],"compiled_refer":0,"complain":18,"complaint":0,"complement":0,"complementari":11,"complet":[0,1,2,4,5,6,8,10,11,12,13,15,16,17],"complex":[0,1,4,8,14,15,18],"compli":10,"complianc":0,"compon":[6,7,14,15,18],"compos":[0,5,7,11,15],"comprehens":[1,11,13,14],"compress":[2,12,15,16,17],"compromis":[1,15,18],"comput":[0,1,4,8,11,15,17,18],"computation":[8,11,16],"concaten":[12,16],"conceal":0,"conceiv":[0,1,4,6],"concept":[0,1,7,15,16,18],"conceptu":[0,1,5,7],"concern":[0,18],"concert":15,"concis":0,"conclud":[0,2,12],"conclus":7,"concret":[0,18],"concurr":[6,15,16],"condens":0,"condit":[4,7,9,11,15,17,18],"conduct":[0,1],"conduit":18,"conf":[4,13],"confer":0,"confess":0,"confid":0,"config":[2,4,5,8,10,16,18],"configarg":2,"configdir":12,"configobj":5,"configpath":2,"configur":[0,1,2,4,6,7,10,12,13,15,17],"configuraion":6,"configuraiton":16,"configure_devic":2,"confirm":[5,10,15,17,18],"conflict":[4,10],"conform":[1,7],"confront":18,"confus":[0,6,15],"congest":15,"conglomer":18,"conjunct":8,"connect":[0,1,2,5,6,7,9,11,12,14,15,16,17,18],"conscienc":18,"consciou":0,"conscious":[0,1],"conscript":18,"consent":1,"consequ":[1,7,10,15],"conserv":[0,8],"consid":[0,2,4,8,11,12,13,15,16,17,18],"consider":[0,7,15],"consist":[0,5,15,16],"consol":16,"constant":[1,12,18],"constantli":[15,18],"constitu":0,"constitut":[0,1,4,15],"constrain":[10,12],"constraint":[0,18],"construct":[0,1,5,15,17,18],"constructor":2,"consult":0,"consum":[0,5,10,11,12,18],"consumpt":[10,11,18],"contact":[0,8,10,13,15,18],"contain":[0,1,2,5,8,10,11,12,15,16],"contamin":0,"contempl":18,"contemporari":1,"contend":15,"content":[0,1,2,4,5,10,11,16],"contest":0,"context":[4,7,15,16,18],"contin":[2,4,18],"continu":[0,1,5,8,11,12,14,16,17,18],"contract":[0,9],"contractu":0,"contradict":0,"contrari":[0,18],"contrast":[0,1,11],"contribut":[0,1,7,9,10,14],"contributor":[0,1],"control":[0,1,2,4,5,6,7,10,12,13,15,16,17,18],"controversi":0,"convei":[0,2,18],"conveni":[0,1,2,5,16,18],"convent":[0,2,10],"converg":[4,10,15,18],"convers":[0,1,5,11,13,15,18],"convert":[0,1,5],"convinc":0,"convincingli":0,"cook":4,"coordin":[0,8,10,12,15,17,18],"copi":[1,5,7,9,16],"copier":0,"copilot":0,"copyleft":0,"copyright":[1,7,9],"core":[0,1,10,11,15,16,17,18],"corner":18,"corollari":0,"corp":0,"corpor":[0,1,18],"corpu":0,"correct":[0,1,2,5,8,10,11,15],"correctli":[0,2,5,10,11],"correspond":[5,10,15,18],"corrobor":0,"corrrectli":11,"corrupt":[1,5],"cosmologi":0,"cost":[0,2,5,6,7,8,11,12,15,17],"costum":0,"could":[0,1,2,4,8,10,12,15,16,17,18],"counsel":0,"count":[0,5,13,15,18],"counter":2,"coupl":0,"courier":0,"couriership":0,"cours":[0,4,5,8,10,15,18],"court":0,"coven":[0,18],"cover":[0,4,5,6,10,11,12,15,17],"coverag":[8,10],"cp313":0,"cpp":0,"cpu":[0,2,8,10,11,15],"cpuinfo":16,"cpython":0,"cr":16,"craft":[0,1,5,18],"craftsman":18,"crash":18,"crate":0,"creat":[0,1,2,7,8,10,11,12,13,16,17,18],"create_bidirectional_buff":[2,12],"create_kei":12,"create_read":12,"create_receipt":[2,12],"create_writ":12,"creation":[0,1,7,9,10,11,13,15,16,17],"creativ":[0,1,18],"creator":[0,1,7,15,18],"credenti":[8,15],"credit":0,"crippl":0,"crisi":0,"criteria":0,"criterion":0,"critic":[0,1,10,11,15,16],"crn":0,"cron":1,"cross":[0,8,11,13],"crowd":18,"crucial":10,"cruft":18,"crypto":0,"cryptograph":[0,1,4,7,8,10,16,17,18],"cryptographi":[1,4,15,17],"crystal":18,"ctrl":2,"cull":12,"culmin":18,"cultur":[0,1],"cumbersom":5,"curl":8,"currenc":0,"current":[0,1,2,4,5,7,8,11,12,13,16,18],"current_download":2,"current_filenam":2,"current_ratchet_id":12,"cursor":0,"curtain":0,"curv":[10,12,15,17],"curve25519":[10,12,15,17],"custodian":18,"custom":[0,6,7,11,12,13,15,17],"custom_network_nam":8,"customis":[8,11],"cut":[0,18],"cv":0,"cycl":[0,11],"cynic":18,"cython":0,"d":[0,5,16],"d09285e660cfe27cee6d9a0beb58b7e0":5,"d56a4fa02c0a77b3575935aedd90bdb2":16,"daemon":[0,2,4,8,12,13,16],"dai":[0,5,12,13,18],"daili":[0,5],"damag":[0,1,9,18],"damn":0,"danc":18,"dang":0,"danger":[0,18],"dark":18,"darwin":0,"data":[0,1,2,4,5,6,7,8,10,12,15,17,18],"data_buff":2,"data_port":8,"databas":[1,13,16,18],"databit":[2,8,16],"datacent":4,"datar":8,"dataset":[0,9,18],"date":[2,4,5,7,16],"datetim":2,"dawn":0,"db":[2,16],"dbm":[2,8,16],"dead":0,"deadlin":1,"deal":[0,8,9],"dealt":0,"death":[0,7],"deb":0,"debas":0,"debat":0,"debian":[0,7,15,16],"debug":[0,4,16],"decad":[0,1,6,14,18],"deceiv":0,"decentr":[4,7,8,16],"decentralis":17,"decept":0,"decid":[0,1,8,10,12,15,18],"decim":[8,11],"decis":[0,1,5,8,10,11,15,18],"declar":[0,15],"declin":0,"decod":[0,2,8,16],"decor":0,"decoupl":1,"decreas":[5,8,16],"decrypt":[0,8,10,12,15,16],"dedic":[0,5,8,15,17,18],"dedupl":0,"deed":0,"deep":[0,4,18],"deeper":[0,16],"deepli":[0,1,18],"deepseek":0,"def":[2,5],"default":[0,2,4,5,6,8,10,11,12,13,15,16],"default_ar_grac":8,"default_ar_penalti":8,"default_ar_target":8,"default_grav":8,"default_ifac_s":2,"default_per_hop_timeout":12,"defenc":7,"defenceless":0,"defend":0,"defens":[0,11],"defin":[0,2,5,8,11,12,15,16,17,18],"definit":[0,2,4,5,11,15,16,18],"deflect":0,"defunct":[0,16],"degrad":[0,10],"degre":[0,8],"delai":[8,13,15,16,18],"deleg":[1,5,15],"delet":[0,1,5,18],"deliber":0,"delimit":2,"deliv":[0,2,4,10,12,13,18],"deliveri":[0,1,2,5,10,12,13,17],"delus":7,"delusion":0,"demand":[0,5,12,18],"demonstr":[0,1,2,4,8,18],"deni":[1,5,11,18],"denomin":[0,1],"densiti":0,"depend":[0,1,2,5,6,7,8,10,12,15,16,18],"depict":0,"deploi":[0,15,18],"deploy":[0,5,11],"deprec":0,"depriorit":18,"depth":[0,18],"derail":0,"deregist":[11,12],"deregister_announce_handl":12,"deregister_request_handl":12,"deriv":[0,4,10,12,15,17],"descend":0,"describ":[0,5,6,8,12,15],"descript":[0,2,5,16],"descriptor":2,"deseri":2,"deserializ":2,"deserv":0,"design":[0,1,4,5,6,7,8,10,11,13,14,15,16,17],"desir":[0,2,6,8,15],"desk":18,"desktop":[8,13],"dest_len":2,"destin":[0,2,4,7,11,12,16,18],"destination_1":2,"destination_2":2,"destination_clos":2,"destination_cost":11,"destination_hash":[2,5,11,12,16],"destination_hexhash":2,"destination_typ":11,"destination_valu":11,"destroi":[1,18],"destruct":[0,18],"detach":[5,8,11,16],"detail":[0,1,2,4,5,7,8,11,12,16,17],"detect":[0,2,5],"deterior":0,"determin":[0,4,10,11,12,15,18],"determinist":5,"detriment":16,"dev":[2,4,5,8,11,16],"devalu":0,"devel":4,"develop":[0,5,6,7,9,12,13,14,15,16,17,18],"deviant":0,"devic":[0,2,4,7,8,10,11,12,15,16,18],"dfsg":0,"dh":12,"dhcp":[6,8,10,16],"di":18,"diagnosi":0,"diagnost":11,"dial":[0,13],"diametr":0,"dichotomi":7,"dict":2,"dictat":[16,18],"dictatori":0,"dictatorship":[0,18],"dictionari":16,"did":[0,1,2,13,18],"didn":0,"diff":5,"differ":[0,1,2,4,5,6,8,10,11,12,13,15,16,17,18],"differenti":16,"diffi":[10,15],"difficult":[0,4,6,11,16],"difficulti":[8,11,16],"digit":[1,4,6,15,17,18],"digniti":[0,1,18],"dilut":1,"dimens":0,"dinner":18,"dipol":0,"dir":[2,5],"dire":6,"direct":[0,1,2,4,5,6,10,12,13,15,16],"direction":[0,15],"directli":[1,4,5,6,7,8,9,10,11,12,13,15,16,17,18],"directori":[2,4,5,8,10,16,18],"dirnam":5,"dirt":0,"dirti":0,"dirtiest":0,"disabl":[8,12,15,16],"disadvantag":0,"disagre":0,"disappear":[8,11,16,18],"disassoci":15,"discard":[4,12,15],"discern":[0,1],"disciplin":[0,1,18],"disclos":7,"disclosur":0,"disconnect":[2,4,7,8,11],"discourag":1,"discov":[0,1,4,7,8,10,12,15,18],"discover":[4,7,16],"discover_interfac":16,"discovered_interfac":12,"discoveri":[0,4,5,7,12,13,15,16],"discovery_bandwidth":8,"discovery_encrypt":8,"discovery_frequ":8,"discovery_lxmf_address":8,"discovery_modul":8,"discovery_nam":8,"discovery_port":8,"discovery_scop":8,"discovery_stamp_valu":8,"discret":1,"discrimin":[0,10],"discuss":[0,1,5,6,15],"disk":[2,5,12,16],"dismiss":0,"displai":[2,5,8,10,13,15,16],"disproven":0,"disput":0,"disqualifi":0,"disregard":0,"disrupt":[1,8,11],"dissemin":1,"dissent":0,"dissip":0,"dissolv":[10,18],"dissuad":0,"dissuas":0,"dist":5,"distanc":[6,15,16],"distant":[4,12,15],"distinct":[0,1,8,10,15,18],"distinguish":[0,10,15],"distribut":[2,5,7,9,10,12,13,15,16,17,18],"district":0,"dive":4,"diverg":[0,1],"divers":[0,1],"divid":12,"divmod":2,"dn":[6,8,13,18],"dna":18,"dnf":4,"do":[1,2,4,5,6,7,8,9,10,11,12,15,16,18],"doc":0,"doc_id":5,"doctrin":0,"document":[0,1,4,7,9,12,13,15,16,17,18],"doe":[1,2,4,5,6,7,8,11,12,13,15,16,18],"doer":0,"doesn":[1,8,10,11,18],"dollar":[0,18],"domain":[0,1,4,7,8,15,16,17],"domin":18,"don":[0,2,4,5,10,12,15,16,18],"donat":[0,7],"done":[0,2,4,5,8,15,16,18],"door":[0,18],"dot":[15,16],"doubl":11,"doubt":[0,4],"dowload":4,"down":[0,1,2,6,8,11,12,13,16,18],"download":[1,2,4,5,8,10,16],"download_began":2,"download_conclud":2,"download_finish":2,"download_start":2,"download_tim":2,"downstream":[0,16],"dozen":[7,16],"draft":0,"drag":[0,13],"drain":[0,8,11],"dramat":0,"drastic":16,"draught":0,"draw":[0,18],"drawn":[0,18],"dress":0,"drift":0,"drink":0,"drive":[1,14],"driver":[16,17],"droid":4,"drone":18,"drop":[0,5,8,10,11,12,13,15,16,18],"drown":1,"dsrdtr":2,"dual":[0,6,16],"dualiti":0,"dublin":16,"due":[1,2,11],"dumb":18,"dump":[8,11,16],"duplex":[15,17],"durabl":[0,1],"durat":[11,16],"dure":[0,5,11,16],"duti":0,"dynam":[1,4,5,8,11,13,16,18],"dysfunct":14,"dysregul":1,"e":[2,5,13,16],"e5c032d3ec4e64a6aca9927ba8ab73336780f6d71790":16,"e702c42ba8":16,"e7536ee90bd4a440e130490b87a25124":16,"each":[0,1,2,4,5,8,10,12,13,15,16],"earli":[0,11,13,18],"earlier":[0,15],"earliest":0,"earn":0,"earth":0,"eas":[8,13,15],"easi":[0,4,5,6,8,11,13,15,16,17],"easier":[0,4,5,8,10,16,17],"easiest":[4,6,8,15],"easili":[0,1,4,5,8,10,15,16,17,18],"eastern":15,"eaten":0,"ec_pr_freq":8,"ecdh":[15,17],"echo":[0,5,7],"echo_destin":2,"echo_request":2,"econom":[1,11],"economi":18,"ecosystem":[0,1,4,8,13,15,16,18],"ed25519":[1,5,15,17],"edd8e72b":0,"edg":[0,16],"edit":[0,4,5,16],"editor":[5,16],"editori":0,"educ":0,"ee":5,"eeprom":16,"effect":[0,1,5,8,11,15,16],"effici":[0,2,4,8,10,11,12,13,15,16,17,18],"effort":[0,6,12,18],"effortless":0,"effortlessli":13,"eg":16,"egress":8,"egress_control":8,"ei":2,"eight":0,"either":[0,4,5,6,10,11,12,15,16,18],"elaps":[5,8],"electromagnet":18,"eleg":18,"element":[0,10,18],"elev":1,"elif":2,"elig":0,"elimin":[1,10,18],"ellipsoid":8,"ellipt":[10,12,15,17],"elong":7,"els":[0,1,2,10,11,13,14,15,17,18],"elsewher":0,"email":[1,5,13],"emb":5,"embbed":11,"embed":[0,1,5,6,11,13],"embellish":0,"embodi":0,"embrac":18,"emerg":[1,7,13],"emiss":[11,13],"emit":11,"emot":1,"empir":0,"emploi":[0,1,6,11,15],"empow":[0,17],"empti":[2,7,8,18],"emul":[4,16],"enabl":[1,2,4,6,7,10,11,12,13,15,16,17,18],"enable_ratchet":12,"enable_remote_manag":16,"enable_stamp":12,"enable_transport":[8,15,16],"encapsul":[8,17],"enclos":5,"enclosur":0,"encod":[0,2,5,12,13,16,18],"encount":[0,4,10],"encourag":[0,1,4,18],"encrypt":[0,1,2,4,5,7,8,10,12,13,15,16,17],"encrypted_mdu":12,"encumbr":0,"end":[0,2,5,8,10,12,13,15,17],"endeavor":[0,1],"endless":[0,8,18],"endors":0,"endow":1,"endpoint":[2,10,11,12,13,15,18],"energi":[0,4,11,18],"enforc":[0,8,11,12,15,16],"enforce_ratchet":12,"enforce_stamp":[11,12],"engag":[0,1,18],"engin":[1,4,11,13,14,18],"enginest":0,"enhanc":15,"enjoy":1,"enorm":0,"enough":[0,1,4,6,8,13,15],"ensur":[0,1,2,4,5,8,10,11,12,13,15,16,17,18],"ensurepath":4,"entail":0,"enter":[1,2,16],"enterpris":0,"entertain":0,"enthusiast":0,"entir":[0,1,2,4,5,8,10,11,12,13,15,16,17,18],"entireti":0,"entiti":[1,10,15,16,18],"entitl":[0,1],"entri":[1,2,4,11,15,16,18],"entropi":18,"entrypoint":[7,8,16],"enumer":2,"envelop":[5,12,18],"environ":[0,1,4,5,7,8,10,14,15,16],"environment":15,"environmentlogg":15,"eof":8,"ephemer":[0,1,10,11,12,15,17],"epub":7,"equal":[0,1,10,11,12,15,18],"equat":0,"equip":[8,10,15],"equival":[0,5,8,18],"era":18,"eras":0,"eridanu":13,"erod":18,"eros":0,"erron":14,"error":[0,2,4,5,8,14,16,18],"esc":2,"esc_mask":2,"escal":0,"escap":[0,2,16],"esoter":1,"esp32":[0,6],"especi":[0,4,5,6,8,16],"essenc":0,"essenti":[0,1,4,5,8,13,15,16,18],"establish":[0,1,2,4,5,8,10,11,12,13,16,17,18],"established_callback":12,"establishment_timeout_per_hop":12,"estim":[0,12],"et":0,"etc":[0,5,16],"eth0":8,"eth1":8,"ether":18,"ethereum":14,"ethernet":[4,7,8,10,13,15,17,18],"ethic":[0,7],"etho":0,"evad":11,"evalu":[1,7],"evapor":18,"even":[0,1,2,4,5,8,10,11,12,13,15,16,17,18],"event":[0,8,9,18],"eventu":12,"ever":[0,15],"everi":[0,1,2,4,5,8,10,11,12,15,16,18],"everydai":4,"everyon":[0,1,4,5,11,13,14,15,16,18],"everyth":[0,1,2,5,10,13,14,15,18],"everywher":[0,11],"evict":18,"evid":0,"evidentiari":0,"evolut":0,"evolv":[0,1,4,10,15],"exact":[0,5,6,8,11,15],"exactli":[0,5,12,15,18],"examin":0,"exampl":[0,1,4,6,7,10,11,12,13,15,16,17],"example_util":2,"exampleannouncehandl":2,"exampleconfig":[4,16],"exampleinterfac":2,"exce":[0,2,8,11,12],"exceed":11,"excel":[0,13],"except":[0,2,8,11,12],"excercis":11,"excerpt":0,"excess":[8,16],"exchang":[1,10,12,15,17],"exclud":[0,5,12,15],"exclus":[0,1,5],"execstart":16,"execstartpr":16,"execut":[0,1,2,4,5,8,12,16],"exemplifi":0,"exercis":[0,1],"exhaust":[0,6,11,13,15,16],"exist":[1,2,4,5,6,7,8,10,13,15,16,17],"exit":[1,2,5,8,12,16],"expand":[5,7,10,11,13,15,17],"expand_nam":12,"expans":[1,5,18],"expect":[0,2,5,8,12,14,15,16],"expend":11,"expens":[0,6,8,11],"experi":[0,10,13,15,16,18],"experienc":2,"experiment":[0,16],"expert":0,"expertis":0,"expir":[8,12],"expiri":[8,11,12],"explain":[0,6,12],"explan":[0,15,16],"explicit":[0,12],"explicitli":[0,8,10,11,15,16],"exploit":[0,1],"explor":[2,11,15,16,17,18],"explos":0,"exponenti":11,"export":[4,16],"expos":[0,8,12,16],"exposur":[0,8],"express":[1,5,7,9],"ext_payload":12,"extend":[0,1,2,11,12],"extens":[0,5,8,16,17],"extent":0,"extern":[0,1,2,4,5,8,11,12,16,17,18],"extra":[0,4,8,16],"extract":[1,5,16,18],"extract_id":5,"extrem":[0,4,11,13,15,16,17,18],"ey":0,"f":[0,2,4,5,16],"f2d31b2e080e5d4e358d32822ee4a3b7":5,"f4":8,"f53a1c4278e0726bb73fcc623d6ce763":16,"fabric":[0,7,10,11],"facad":0,"face":[0,8],"facebook":1,"facil":0,"facilit":[13,15],"fact":[0,1,4,8,17],"factor":[0,8,12,16],"factual":0,"fade":18,"fail":[0,1,2,4,5,8,11,12,18],"failed_callback":[2,12],"failur":[0,1,4,5,8,12,18],"fair":7,"faith":0,"fake":[0,16],"fall":0,"fallaci":7,"fallback":[5,18],"fallen":18,"fals":[2,7,8,10,12],"falsehood":0,"falsiti":0,"famili":[0,4],"familiar":[0,1,13],"fan":16,"fantasi":[0,18],"far":[0,1,4,10,15],"farcic":0,"fart":0,"fashion":14,"fast":[0,7,8,10,12,13,15,16],"fast_flapping_block_tim":8,"fast_flapping_grac":8,"fast_flapping_threshold":8,"faster":[0,4,8,15,18],"fastest":[8,15],"fat":18,"fata":11,"favor":4,"favour":0,"fe80":4,"featur":[0,4,5,7,8,10,13,15,16,17],"feb":0,"fed":0,"feder":[0,11,13,15,16,18],"fedora":4,"fee":0,"feed":[0,1,4,12,18],"feedback":[0,1,2,7],"feel":[13,18],"feist":0,"ferment":7,"fernet":15,"fetch":[1,5,8,16],"few":[0,1,4,6,8,10,11,13,15,16,17,18],"fewer":12,"ff":16,"ffcffb4e255e156e77f79b82c13086a6":5,"fi":[5,14],"fiber":[6,18],"fibr":17,"fiction":0,"fictiti":0,"fidel":0,"field":[0,5,15,18],"fifth":0,"fight":0,"figur":8,"file":[0,1,2,4,5,6,8,9,10,11,12,13,15,16,17],"file_resourc":2,"file_s":2,"filelist":2,"filelist_data":2,"filelist_receiv":2,"filelist_timeout_job":2,"filenam":2,"filesync":7,"filetransf":[7,12],"fill":0,"filter":[1,2,7,10,15,16],"final":[0,2,5,11,12,15,18],"find":[0,1,5,7,8,13,15,16,18],"find_spec":2,"fine":[0,1,5,8,16],"fingerprint":18,"finish":[0,7],"finit":18,"fire":18,"firewal":[0,4,8,10,18],"firm":0,"firmli":0,"firmwar":[0,4,6,15,16],"firmware_hash":16,"first":[0,1,2,4,5,8,10,11,12,15,16,18],"fit":[1,2,9,18],"five":[2,16,18],"fix":[0,5,7,15,18],"fixed_mtu":8,"flag":[0,2,4,5,12,15,16],"flap":[7,8],"flash":[0,16],"flasher":[0,4,7],"flat":[0,16,18],"flaw":[0,18],"fleet":15,"flesh":18,"flexibl":[4,5,6,8,10,11,13,16,17],"flexibli":5,"fli":15,"flicker":18,"flight":12,"flip":18,"float":[2,8,12],"flood":[0,8,16],"floor":0,"flourish":0,"flow":[0,1,2,4,7,8,10,11,15],"flow_control":8,"flt":11,"fluenci":7,"fluent":0,"fluentli":0,"fluid":18,"fluiditi":18,"fluidli":[0,18],"flush":2,"focu":[1,16],"focus":[0,13,15],"folder":[1,2,5],"folklor":0,"follow":[0,1,2,4,5,6,8,9,11,12,14,15,16,17,18],"font":5,"footnot":0,"footprint":0,"footsoldi":0,"forbid":[0,18],"forbidden":0,"forc":[0,1,2,16,18],"forcibli":[12,16],"foreground":4,"forens":0,"forese":0,"forev":[0,18],"forg":[0,18],"forgeri":0,"forget":[0,10,16],"forgiv":0,"forgotten":[0,1,11],"fork":[0,1,7],"forker":5,"form":[0,4,7,8,10,12,15,16,18],"formal":0,"format":[0,1,2,7,8,11,13,16,17],"formula":0,"forth":2,"fortifi":1,"fortiori":0,"fortun":18,"forum":0,"forward":[0,1,5,7,8,10,12,13,15,16,17],"forward_ip":8,"forward_port":8,"found":[0,2,4,5,8,11,12,15,16,18],"foundat":[1,7,10,14,15,17,18],"founder":0,"four":[0,8],"fourth":0,"fraction":[0,11],"fragil":[1,7,18],"frame":[0,2,8],"framework":[0,13],"fraud":0,"fraudul":0,"free":[4,7,9,10,13,14,17,18],"freedom":[7,15,18],"freedv":6,"freeli":[0,11,15],"freq":16,"frequenc":[0,4,6,8,15,16],"frequent":[0,8,10],"fresh":0,"frictionless":0,"friend":[4,18],"friendship":0,"from":[1,2,4,5,6,7,8,9,10,11,12,13,14,15,16,17],"from_byt":12,"from_fil":12,"from_identity_hash":12,"fromhex":2,"front":[0,5,15],"fruit":2,"ftdi_ft230x_basic_uart_43891ckm":16,"fudg":0,"fuel":[0,18],"full":[0,1,2,4,5,8,10,11,12,13,15,16,17],"full_hash":12,"full_nam":[12,16],"fulli":[0,2,4,5,6,8,13,15,16,17],"fun":0,"funcion":12,"function":[0,1,2,4,5,6,7,8,9,10,11,12,13,14,16,17,18],"fund":0,"fundament":[0,1,6,10,11,15,16,18],"funnel":0,"furnish":9,"further":[0,1,4,7,8,11,16,18],"furthermor":11,"futur":[0,1,5,7,10,16,18],"fuzz":0,"fw":16,"g":[2,5,11,15,16],"ga":2,"gain":[1,6,11,12,15,18],"galact":15,"game":0,"gap":[0,4],"gaslit":18,"gate":11,"gatekeep":[0,1,15,18],"gatewai":[2,4,8,10,11,15,16,18],"gbp":[0,16],"gcc":0,"gear":18,"gemini":0,"gen_tim":5,"gener":[1,2,4,5,6,7,8,10,11,12,15,16,17,18],"generalis":17,"genuin":[0,16],"geograph":[1,4,8],"geoid":8,"get":[0,1,2,5,6,7,8,10,11,12,13,16,18],"get_ag":12,"get_channel":[2,12],"get_config_obj":2,"get_data_s":12,"get_establishment_r":12,"get_expected_r":12,"get_external_ip":8,"get_first_hop_timeout":12,"get_hash":12,"get_inst":[11,12],"get_instance_pid":12,"get_link_cost":12,"get_lowest_interface_bitr":12,"get_mdu":12,"get_medium_path_timeout":12,"get_mod":12,"get_mtu":12,"get_packet_rssi":2,"get_packet_snr":2,"get_part":12,"get_private_kei":12,"get_progress":[2,12],"get_public_kei":12,"get_q":12,"get_random_hash":[2,12],"get_remote_ident":[2,12],"get_request_id":12,"get_respons":12,"get_response_tim":12,"get_rssi":12,"get_rtt":[2,12],"get_seg":12,"get_snr":12,"get_statu":12,"get_transfer_s":12,"get_valu":[11,12],"geti2p":8,"ghost":18,"ghostscript":0,"ghz":15,"gi":2,"giant":18,"gift":[0,18],"gigabit":[10,18],"gigabyt":17,"gile":0,"git":[1,7,16],"githook":0,"github":[0,1,2,4,5],"gitlab":1,"give":[4,8,11,15,16,18],"given":[0,8,10,11,12,15,16,18],"glanc":0,"global":[0,2,5,7,8,10,11,12,15,16,17],"globe":18,"glue":[0,6],"gmail":1,"gnu":0,"go":[0,2,8,10,13,15,18],"goal":[0,4,7,8,10,17],"goe":[0,18],"goldsmith":0,"gone":0,"good":[0,1,4,5,6,10,11,15,16],"goodwil":18,"googl":0,"got":[0,2,18],"got_respons":2,"govern":[0,15,18],"government":1,"gp":8,"gpg":5,"gpio":13,"gpl":0,"grab":0,"grace":[11,12],"gracefulli":[8,10],"grade":7,"graham":0,"grain":[1,5,16],"grammar":1,"grant":[1,5,7,9,11,16,18],"granular":5,"grape":2,"graph":1,"gratefulli":14,"graviti":[8,18],"great":[0,4,5,13,15,16,18],"greater":[0,5,12,15,16,17],"greatli":[4,8,11],"green":18,"grep":5,"grew":0,"grid":[13,18],"grift":0,"gross":18,"ground":[0,1,18],"groundswel":0,"group":[0,1,7,8,12,13,15,16],"group_id":8,"group_nam":5,"group_root":5,"groupinstal":4,"grow":[0,1,4,18],"grown":18,"growth":[0,1,4],"guarante":[0,5,10,14,15],"guard":18,"guess":[0,8,11],"gui":13,"guid":[4,6,7,13,15],"guidanc":0,"guidelin":[0,4],"guilt":13,"gun":18,"gw":8,"gz":5,"h":[0,5,16],"ha":[1,2,5,6,7,8,10,11,12,13,14,15,16,17,18],"habit":[0,18],"habitat":[0,18],"hack":17,"had":[0,1,15],"half":[0,15,17],"hallucin":0,"halo":0,"hammer":18,"hancom":0,"hand":[0,2,18],"handheld":15,"handl":[0,1,2,4,5,6,8,10,11,12,13,15,16,17],"handler":[2,12,16,18],"handshak":18,"hang":0,"happen":[2,4,5,7,8,11,12,15,18],"happili":0,"har":0,"hard":[0,4,6,8,18],"hardcod":18,"hardlin":10,"hardwar":[0,1,2,4,7,8,11,12,13,15,16,17,18],"harm":[0,7,9],"harper":0,"harvest":[0,1],"has_path":[2,12],"hasattr":2,"hash":[1,2,5,10,11,12,15,16,18],"hash1":15,"hash2":15,"hash_from_name_and_ident":12,"hashlib":15,"hashmap":2,"hasn":0,"hastili":0,"hater":0,"haunt":0,"have":[0,1,2,4,5,6,8,10,11,12,13,14,15,16,17,18],"hazard":[0,12],"hdlc":2,"he":[0,1],"head":5,"headcount":7,"header":[0,2,5,8,12,15],"header_1":15,"header_2":15,"headlin":0,"health":7,"healthi":0,"hear":[11,15,18],"heard":[0,1,12,13,15,16],"heart":18,"heavi":[0,11,18],"heavili":0,"height":8,"heir":0,"held":[0,8,11,16],"helium":2,"hellman":[10,15],"hello":5,"hello_world":5,"help":[0,2,4,5,10,11,13,14,15,16,18],"helper":[2,5,16],"here":[0,1,2,4,8,11,15,16,18],"herebi":[0,9],"herein":0,"heterogen":[4,7,17],"hex":[2,16],"hexadecim":[2,5,11,15,16],"hexbyt":16,"hf":[13,18],"hi":0,"hidden":[0,16],"hide":[0,4,18],"hierarch":[17,18],"hierarchi":[7,18],"high":[0,6,8,10,11,15,16,17,18],"higher":[0,1,8,10,11,17],"highest":12,"highli":[0,5,8,14,15,16],"highlight":7,"hijack":[0,18],"hindsight":11,"hint":[2,5],"hire":0,"histor":1,"histori":[1,5,7,13],"hit":[0,2,11],"hkdf":15,"hmac":[15,17],"hobbi":0,"hobbyist":0,"hoc":[17,18],"hold":[0,8,12,15,18],"holder":[0,9,10],"hole":18,"holi":0,"hollow":[0,18],"home":[1,4,5,10,13,16,18],"homebrew":8,"honest":0,"honesti":0,"honestli":0,"honour":0,"hook":[0,1,5],"hop":[8,10,11,12,15,16,17,18],"hop_limit":11,"hope":0,"hopefulli":10,"hops_to":12,"hospit":0,"host":[0,1,2,5,7,8,10,13,15,16],"hostil":[0,7],"hostnam":[8,18],"hotspot":18,"hour":[0,2,5,8,16,18],"hous":[4,18],"how":[0,1,2,4,5,6,8,10,11,13,15,16,17,18],"howev":[0,4,5,8,10,11,15],"http":[1,2,5,13,14,18],"hub":[0,8,13,16],"hum":18,"human":[0,1,2,7,8,9,10,11,12,14,15],"humanli":0,"hundr":[0,1,4,10,13,16,18],"hungri":6,"hw_mtu":2,"hwrev":16,"hydraul":11,"hypothesi":0,"hypothet":0,"hysteria":0,"hz":[8,11,13,16],"i":[1,2,4,5,6,7,8,9,10,11,12,13,14,15,16],"i2p":[4,7,10,13,17],"i2p_tunnel":8,"i2pd":[4,8],"i2pinterfac":[4,8],"i7":0,"ia":16,"ibm":0,"ic":6,"ic_burst_freq":8,"ic_burst_freq_new":8,"ic_burst_hold":8,"ic_burst_penalti":8,"ic_held_release_interv":8,"ic_max_held_announc":8,"ic_new_tim":8,"ic_pr_burst_freq":8,"ic_pr_burst_freq_new":8,"icmp":13,"icon":[5,18],"id":[0,5,8,11,12,15,16],"id_callsign":8,"id_interv":8,"id_regex":5,"idea":[1,4,5,7,11,15,16,18],"ideal":[13,16,17],"ident":[0,1,2,4,7,8,10,11,12,13,16,17],"identif":[7,8,17],"identifi":[0,2,5,8,10,12,15,16,17],"identifyexampl":2,"identity_data":16,"identity_hash":12,"ideolog":0,"ideologi":0,"ie":16,"if00":16,"ifac":[2,4,8,10,15,16],"ifac_s":8,"ifconf":2,"ifconfig":16,"ignor":[0,5,8,10,11,12,14,15,16],"ignored_devic":8,"ignored_typ":11,"ii":7,"iii":7,"illegitim":0,"illus":[0,7],"illustr":[0,2,8,15],"imag":[0,18],"imagin":[0,1,10,18],"immedi":[0,1,5,8,11,16,18],"immens":[0,18],"immort":18,"immun":1,"immut":[1,18],"impact":[8,10,12,15],"impati":18,"imperson":10,"implement":[1,2,5,7,8,10,11,12,13,15,16,18],"impli":9,"implic":[0,7,8,10],"implicit":[0,10,12,15],"implicitli":16,"import":[0,1,2,4,6,8,10,11,12,15,16],"importantli":[0,1,4,18],"importlib":2,"impos":[0,11],"imposs":[0,11,15,18],"impostor":0,"impract":[11,16],"impress":0,"improv":[0,4,7,8,13,14,18],"in_fram":2,"in_wait":2,"inabl":0,"inaccess":0,"inactive_for":12,"inadvert":16,"inbound":[2,8,12],"inbox":10,"inc":0,"incant":0,"incent":[1,11],"incivil":0,"includ":[0,1,2,5,6,7,8,9,10,11,12,13,15,17],"inclus":10,"incoher":0,"incom":[2,8,11,12,16],"incommensur":0,"incompat":[1,12,15],"incompet":1,"incomplet":10,"inconveni":1,"increas":[5,8,11,12,16],"incredibli":[0,1,18],"increment":1,"incur":[1,8],"indefinit":[1,16],"independ":[0,1,5,7,12,15],"index":[2,4,7],"indic":[2,5,12],"indiffer":18,"indirectli":[0,9,15],"indistinguish":0,"individu":[1,4,5,7,8,11,12,14,15,16,17,18],"induc":0,"industri":[0,1],"inertia":0,"inevit":[4,15],"infer":[0,15],"infinit":18,"infinitum":0,"influenc":1,"influx":[8,11,13],"influxdb":13,"info":[5,12,15,16,18],"inform":[0,1,2,4,5,7,8,10,11,12,13,14,15,16,18],"infrastructur":[5,6,7,8,10,11,13,15,16],"infring":0,"ingest":[0,18],"ingo":12,"ingress":[2,7],"ingress_control":8,"inhabit":18,"inher":[1,10],"inherit":[0,5],"init":4,"initi":[0,2,5,8,10,11,12,15,16,17],"initialis":[2,5,12,16],"inject":11,"inner":0,"input":[0,2,16],"inquiri":0,"insert":15,"insid":[0,5,15,18],"insidi":[0,1],"insight":18,"insist":0,"insofar":0,"inspect":[0,4,5,8,10,11,15,16],"inspir":[13,18],"instal":[0,1,2,5,7,8,15,16,17],"instanc":[0,1,2,7,8,12,13,15,16,18],"instance_control_port":16,"instance_nam":16,"instant":[0,18],"instanti":[11,12],"instantli":16,"instead":[0,1,2,4,5,8,12,15,16,18],"institut":[1,7,18],"institution":0,"instruct":[0,4,5,18],"instrument":0,"insuffici":[0,11],"int":[2,12],"intact":0,"integ":[2,12],"integr":[0,1,4,5,13,15,16,18],"intellig":[0,1,9,18],"intend":[0,4,8,10,11,15,16],"intens":16,"intent":[7,10,11,18],"intention":[0,13,15],"inter":[4,12,15],"inter_byte_timeout":2,"interact":[0,1,2,4,7,10,12,13,15,16,18],"intercept":10,"interchang":[5,8],"interconnect":[4,8,10,11,15],"interest":[0,11,13,15,18],"interestingli":0,"interfac":[0,1,5,6,7,10,11,12],"interface_class":2,"interface_discovery_sourc":[12,16],"interface_en":16,"interfer":[10,16],"interim":11,"interlock":0,"intermedi":[10,18],"intermediari":[7,8,15],"intermesh":0,"intermitt":[1,8,10,18],"intern":[0,1,2,5,8,11,12,15,16,18],"internal_1":8,"internet":[0,1,7,8,10,13,15,16,17,18],"internetwork":4,"interop":0,"interoper":[6,10,13,15,17],"interpret":[0,5],"interregnum":7,"interrfac":0,"interrupt":[5,8,11],"interv":[5,8,11,12,16],"intervent":16,"intiat":2,"intim":18,"intox":0,"intric":0,"introduc":[1,5,15,16,18],"introduct":7,"introductori":7,"intuit":[10,15,17],"invalid":[2,5,8,12],"invari":18,"invent":0,"inventori":0,"invers":[0,15],"invert":[0,18],"invest":[0,1,10],"investig":[0,5],"invis":[4,8],"invit":[0,8],"invok":[0,5],"involv":[0,1,5,10,14],"io":6,"iodin":13,"ioerror":2,"iot":6,"ip":[0,4,6,7,8,10,15,16,17],"ipv4":[8,11],"ipv6":[4,8,16],"irc":13,"ironi":0,"irrelev":[1,11,14],"irrespons":18,"is_compress":12,"is_connected_to_shared_inst":2,"is_open":2,"is_path_respons":12,"is_ready_to_send":[2,12],"isdir":2,"isfil":2,"isinst":2,"ism":[6,15],"isn":[0,18],"isol":[0,4,8,16],"isp":[8,10,18],"issu":[0,1,5,7,8,10,11],"issuer":0,"iter":0,"its":[0,1,5,6,8,9,10,11,12,13,15,16,18],"itself":[0,1,5,7,10,11,13,15,16,18],"iv":[7,15,17],"j":[7,16],"jacobsen":0,"jail":16,"jame":0,"jan":[0,5],"javascript":13,"jihad":0,"job":[0,1,2],"join":[2,4,10,13,15],"journal":0,"journei":10,"jsc":0,"json":[16,18],"judg":0,"judgment":[0,1],"judici":0,"juli":0,"jurisdict":0,"just":[0,1,2,4,5,6,8,10,13,15,16,17,18],"justif":0,"justifi":0,"k":[2,16],"katzer":0,"kb":16,"kbp":[11,16],"keep":[0,2,4,5,10,12,15,16,17,18],"keepal":[12,15],"keepalive_timeout_factor":12,"kei":[0,1,2,5,7,8,10,11,12,16,17,18],"kenakafrosti":0,"kept":[0,8,10,12,15],"kernel":[1,8,16,17],"keyboard":0,"keyboardinterrupt":2,"keyerror":12,"keypad":13,"keypair":[10,15],"keyr":18,"keyserv":5,"keyset":[11,15,16,17],"keysiz":12,"keystor":10,"keyword":5,"khz":8,"ki":2,"kib":0,"kill":[12,15,18],"kilobit":13,"kilomet":1,"kind":[0,1,6,8,9,10,11,13,15,18],"kindergarten":0,"kiss":[6,7,16,17],"kiss_fram":8,"kissinterfac":[8,16],"knew":0,"knife":0,"knock":18,"know":[0,1,2,4,5,6,8,10,11,12,15,16,18],"knowledg":[0,10,15],"known":[0,2,8,11,12,15,16,17,18],"ko":14,"krypton":2,"l":[5,8,16],"la":16,"label":[0,1],"labor":[0,18],"lack":[0,1,15],"laid":15,"lake":1,"lament":0,"lan":8,"land":11,"landlord":18,"landmark":0,"landscap":0,"languag":[0,1,5,9,13],"lantern":18,"laptop":[0,10,18],"larg":[0,2,6,8,10,11,12,15,16,17,18],"larger":[10,11,15,16],"laser":8,"last":[0,2,5,8,12,16,18],"last_read_m":2,"last_unit":2,"lat":8,"late":0,"latenc":[4,10,11,15,17,18],"later":[0,2,4,5,8,11,13,16],"latest":[1,2,4,5,8,12,13,16],"latest_buff":2,"latest_client_link":2,"latitud":8,"latter":0,"laucnh":4,"launch":[0,13,16],"launder":7,"law":[0,18],"layer":[1,6,7,8,10,11,12,13,15,16,17,18],"layout":0,"lc":0,"lcd":13,"lead":[0,4,15,18],"leadership":0,"leak":[0,4],"learn":[0,2,4,9,10,14,15,18],"leas":[0,18],"leash":18,"least":[0,4,5,6,8,10,11,15,16,17],"leav":[0,1,10,11,13,15,18],"ledger":[15,18],"leech":1,"left":[1,8,12,15,16],"legaci":[0,10,11,18],"legal":[1,7,8,18],"legisl":[0,8],"legitim":[0,4,10,11,16],"legitimaci":0,"len":[2,18],"lend":0,"length":[0,2,5,8,12,15],"less":[0,2,4,6,8,12,15,17,18],"let":[0,1,2,4,5,8,10,13,15,16,18],"letter":0,"level":[0,1,5,6,8,10,11,13,15,16],"lever":18,"leverag":0,"li":[1,18],"liabil":[0,9],"liabl":9,"lib":0,"liber":[6,7],"liberapai":14,"libffi":4,"librari":[1,4,13,18],"librn":13,"licens":[7,15,17,18],"license":0,"licensor":0,"lie":18,"life":[0,1,18],"lifelin":18,"lifespan":1,"lift":[12,16,18],"light":[1,5,16,18],"lightli":0,"lightweight":17,"like":[1,2,4,5,6,7,8,10,11,12,13,15,16,17,18],"likewis":5,"limit":[0,2,4,5,6,7,9,10,11,13,15,16],"line":[1,2,4,7,8,11,13,15,16,17,18],"linger":16,"link":[0,1,4,5,6,7,8,10,11,12,13,16,17,18],"link_clos":2,"link_cost":5,"link_establish":2,"link_id":[2,12],"link_mtu_discoveri":12,"linkexampl":2,"linux":[0,1,4,5,6,8,13,15],"liquid":18,"list":[0,1,2,4,5,6,7,8,11,12,13,15,17,18],"list_deliv":2,"list_fil":2,"list_filt":16,"list_packet":2,"list_receipt":2,"list_timeout":2,"listdir":2,"listen":[1,2,4,5,7,11,13,15,16,18],"listen_ip":8,"listen_on":[4,8,11],"listen_port":8,"liter":[0,16],"literari":0,"literatur":0,"lithograph":0,"litig":0,"litter":18,"littl":[0,6,13,15],"live":[0,1,4,11,12,13,18],"lki":15,"lkr":15,"ll":[0,2,17,18],"llama":0,"llc":0,"llm":[0,13],"ln":16,"load":[0,2,4,5,6,8,11,12,16,17,18],"load_private_kei":12,"load_public_kei":12,"local":[0,1,2,4,5,7,8,10,11,12,13,15,17,18],"locat":[0,4,7,8,10,13,15,16,18],"location_cmd":8,"lock":[0,18],"log":[0,1,2,4,5,8,16,18],"log_crit":2,"log_error":2,"log_info":2,"log_verbos":2,"logdest":12,"logfil":16,"logic":[0,15,18],"login":16,"loginctl":16,"loglevel":[2,12,16],"lon":8,"long":[0,2,4,5,6,7,8,10,12,15,16,18],"longer":[0,2,4,8,15,16,18],"longest":8,"longitud":8,"look":[2,4,5,7,8,10,11,13,15,16,18],"loop":[0,2],"loopback":0,"loophol":0,"loos":0,"lora":[1,4,6,7,10,13,15,17,18],"lorawan":[6,15],"lord":0,"lose":[0,1],"loss":[1,8,10,13,15],"lost":18,"lot":[0,10,15,18],"loud":0,"loudest":[0,18],"low":[0,1,4,5,6,8,10,11,13,15,17,18],"lower":[2,4,8,11,16],"lowest":[1,12],"lowli":18,"lr_cost":11,"lr_stamp_timeout":11,"ltu":6,"lunar":7,"luxuri":0,"lxmf":[0,5,7,8,10,11,12,16],"lxmfy":7,"lxst":[7,11],"m":[2,4,5,15,16],"m4":0,"mac":[8,15],"machin":[1,4,7,9,15,16,18],"machineri":[0,13],"maco":[0,7,13],"mad":7,"made":[0,4,5,8,11,12,15,18],"madman":0,"magic":0,"magnitud":0,"mai":[0,1,4,5,8,10,11,12,13,15,16,18],"mail":0,"mailbox":13,"mailmap":5,"main":[0,2,5,12],"maintain":[0,1,4,5,10,11,15,16,17],"mainten":[0,4,10,11,15,18],"major":[0,5],"make":[0,1,2,4,5,6,8,10,11,13,15,16,17,18],"maker":0,"malici":[1,4,5,10,11,15,16],"malinform":14,"malloc_arena_max":16,"man":0,"manag":[0,1,4,7,10,12,13,15,17,18],"mandatori":11,"mani":[0,2,4,5,6,8,10,12,13,15,16,17,18],"manifest":[1,5],"manipul":[15,17,18],"manjaro":4,"manner":[0,5,10,13],"manual":[0,1,2,4,8,10,11,12,13,15,16,17,18],"manufactur":[0,6,8],"map":[8,13,15,16,18],"mar":0,"margin":0,"mark":[0,4,5,8,9,12,15,17,18],"markdown":5,"marker":0,"market":[0,1,18],"markqvist":[2,14],"markup":[5,13],"mask":1,"masquerad":0,"mass":[0,18],"massiv":[0,8],"mast":0,"master":[2,5,12,18],"match":[0,1,2,5,8,11,15,16,18],"materi":[0,11,13],"math":18,"mathemat":[0,18],"matter":[1,4,7,8,10,11,18],"matur":[11,16],"max":16,"max_request_s":12,"max_response_s":12,"maximum":[2,8,11,12,15,16],"mayb":18,"mb":[0,5,11],"mbp":[0,11,16],"md":[0,5],"mdu":[2,12],"mdy":0,"me":[0,8,18],"mean":[1,4,5,6,7,8,10,11,12,15,16,18],"meaning":[0,4,11],"meaningfulli":0,"meaningless":[0,1],"meant":0,"meantim":12,"measur":[0,1,10,15,18],"mechan":[0,1,4,5,7,8,10,11,16,17],"media":[0,5,18],"mediat":[0,1],"mediev":18,"medium":[0,1,2,6,7,8,10,12,13,15,17],"meet":[0,1,11,18],"megaphon":18,"member":[0,4,15],"membership":0,"memori":[0,4,10,11,15],"men":1,"mental":18,"mention":[0,8,15],"menu":2,"menu_mod":2,"merchant":9,"merci":0,"mere":[0,1,18],"merg":[0,1,9,11,16],"merit":[0,7],"mesh":[0,4,8,10,15,16,17,18],"meshchat":0,"meshchatx":7,"messag":[0,2,4,5,7,10,12,15,16,18],"message_class":12,"messagebas":[2,7,12],"messagecallbacktyp":12,"messeng":[10,15],"met":[0,1,4,18],"meta":5,"metadata":[1,4,5,8,15,16,18],"metaphor":18,"metavar":2,"meter":8,"meth":2,"method":[2,4,7,8,12,15],"methodologi":[0,15,16],"metric":[1,13],"mevpekyafshak5wr":8,"mhz":[8,15],"mi":2,"mib":0,"microcontrol":[0,11,15],"micromanag":18,"micron":[5,7],"microsoft":0,"microsystem":0,"microwav":10,"mid":0,"middl":1,"middlemen":1,"midjournei":0,"midnight":0,"might":[0,1,4,5,8,10,11,15,16,18],"migrat":1,"mikrotik":6,"mileston":0,"millimet":6,"million":[0,18],"millisecond":[2,10,16,18],"mind":[0,1,10,18],"mindset":18,"mine":[0,18],"minefield":0,"miner":18,"minim":[0,1,6,7,8,11,15],"minimalsampl":2,"minimum":[0,2,4,8,11,12,15,16,18],"minimum_bitr":12,"miniscul":18,"minor":5,"mint":0,"minut":[0,2,4,5,8,11,15,18],"mirror":[0,1,7,10,13,16],"mirror_interv":5,"misbehav":11,"mischaracteris":0,"misconcept":0,"misconfigur":4,"mislabel":0,"mislead":[0,4,18],"mismatch":0,"misrepres":0,"miss":[0,2,4,5],"missil":18,"mistak":[0,4],"mistaken":0,"misunderstand":14,"mit":0,"mitig":[10,11],"mix":[7,8,10,16],"mixtur":17,"mobil":[8,10,11,13,15,16],"mode":[0,1,2,4,5,6,7,10,11,12,13,15,16,17,18],"model":[0,1,9,10,16,18],"modem":[7,8,10,12,13,15,17,18],"modem73":7,"modem73interfac":13,"moder":[0,8],"modern":[0,4,6,13,18],"modif":[0,1,5],"modifi":[0,1,5,8,9,10,15,16],"modul":[0,2,4,5,6,7,8,10,11,15,16,17],"modular":13,"moment":[0,11,15,18],"momentarili":8,"mon":5,"monei":0,"monero":14,"monet":1,"monitor":[4,8,13,15,16],"monolith":1,"monopol":1,"month":0,"monthli":0,"mood":0,"moon":2,"moral":[0,18],"more":[0,1,2,4,5,6,8,10,11,12,13,14,15,16,17,18],"moron":0,"moscow":[13,15],"most":[1,4,6,7,8,10,11,12,13,15,16,18],"mostli":[0,8,10,11,15],"motion":0,"motiv":[0,7],"mountain":[0,18],"move":[0,5,8,10,11,15,16,18],"movement":7,"msg":0,"msgpack":5,"msgtype":[2,12],"msvc":0,"mtu":[2,8,11,12,13,15,17],"mu":5,"much":[0,4,8,10,11,13,15,16,17,18],"muddi":0,"multi":[1,7,10,11,13,15,16,17],"multicast":8,"multicast_address_typ":8,"multilater":15,"multipl":[1,2,5,8,10,13,15,16],"multiplex":[2,16],"multipoint":15,"multitud":4,"mumbl":13,"music":[0,1,13],"must":[0,1,2,4,5,8,10,12,15,16,18],"mutat":0,"mutual":18,"mw":8,"my":[0,5,8,15,18],"my_app":11,"my_destin":11,"my_fil":16,"my_ident":[11,16],"my_network":[15,16],"my_network_ident":8,"my_nod":5,"myapp":[5,11],"mycal":8,"myfork":5,"myfriend":18,"mymirror":5,"myrepo":5,"myriad":15,"mysteri":18,"n":[0,2,5,15,16],"name":[0,2,4,5,7,8,10,12],"name_of_other_branch":5,"namespac":2,"nano":5,"narg":2,"narr":0,"narrat":0,"narrow":0,"nat":[4,8],"nation":[0,1],"nativ":[0,2,10,13],"natur":[0,1,8,11],"navig":[0,1,5],"ncurs":13,"nearbi":[8,10],"nearest":8,"nearli":0,"nears":15,"neat":10,"neccessari":8,"necesarri":8,"necess":[0,1],"necessari":[0,1,5,6,8,10,11,12,15,16],"necessarili":15,"need":[0,1,2,4,5,6,7,8,10,11,12,13,14,15,16,17,18],"needless":[8,11],"neg":[4,8],"neglig":[15,18],"negoti":[1,18],"neighbor":18,"neighbour":0,"neighbourhood":0,"neither":[0,12,15],"neon":2,"neopixel":16,"nerd":5,"net":8,"netcat":8,"network":[1,2,6,8,12,16,17,18],"network_ident":[8,15,16],"network_nam":[4,8],"neutral":[0,10,18],"never":[0,1,8,10,11,12,15,18],"new":[1,2,4,5,7,10,11,12,15,16,18],"new_id":16,"new_ident":16,"newcom":0,"newer":[12,15],"newest":15,"newli":[8,11,12,15],"newlin":[8,16],"next":[0,1,4,5,8,12,15,18],"next_hop":12,"next_hop_interfac":12,"nice":18,"nicknam":15,"nilli":0,"nine":0,"nixo":0,"no1cll":8,"no_data_for":12,"no_id":5,"no_inbound_for":12,"no_outbound_for":12,"no_std":0,"noauth":16,"nobl":2,"noble_ga":2,"noble_gas":2,"nobodi":[0,5,16],"nocheck":16,"node":[0,1,4,7,8,16,17],"node_nam":5,"noid":16,"nois":[0,1,8,12,14,18],"noisi":18,"nomad":[1,7],"nomadnet":[0,5,13],"non":[0,4,5,8,11,12,13,15,18],"none":[0,2,4,5,8,12,15,16],"nonetheless":0,"nonexclus":0,"noninfring":9,"nonsens":0,"nonstandard":0,"nor":[0,4,18],"normal":[0,1,2,4,5,8,12,15,16],"nostalgia":1,"notabl":13,"notar":5,"notaris":0,"notat":[15,16],"note":[0,1,2,5,6,7,8,12,15,16],"noth":[0,5,6,10,11,17,18],"notic":[0,5,8,9,15,16],"notif":[1,2,12],"novel":0,"now":[0,2,4,5,11,15,16,18],"nowher":0,"np":16,"nrf":0,"nrf52":6,"nrf52840":0,"nt":2,"nuanc":0,"null":5,"num":2,"number":[0,2,4,5,8,10,11,12,13,15,16,18],"nurtur":1,"o":[0,2,4,5,8,15,16,17],"obj":5,"object":[0,2,5,12,18],"oblig":0,"obscur":[0,1,4],"observ":[0,1,10,11,18],"obsess":0,"obsolet":18,"obstacl":18,"obtain":[0,1,4,6,7,9,11,12,15],"obviou":0,"obvious":15,"oc":0,"occas":0,"occasion":[0,11],"occupi":18,"occur":[0,2,8,11,16,17],"ocean":18,"ocur":12,"odd":2,"odin":13,"off":[0,4,8,10,11,13,15,16,17,18],"offer":[0,1,4,7,8,10,12,13,15,16,18],"offic":[0,10],"offici":0,"offlin":[0,1,2,4,7,10,13],"often":[0,1,4,8,10,11,15,16,18],"oganesson":2,"old":[0,1,2,4,6,13,14,15,18],"older":[0,11,16],"oldest":0,"omit":12,"on_interfac":12,"onc":[0,2,4,5,6,8,11,12,15,16,17,18],"one":[0,1,2,4,5,6,8,10,11,12,13,15,16,17,18],"ones":[0,4,8,10,11,16],"oneself":15,"ongo":13,"onli":[0,1,2,4,5,6,8,10,11,12,13,15,16,17,18],"onlin":[0,2,12,16,18],"onto":[0,4,11,15,18],"ontolog":1,"opaqu":[0,10],"open":[1,2,4,5,6,7,8,10,12,13,14,15,16,17],"open_port":2,"openli":0,"openmodem":[8,17],"openssl":[4,15],"openwrt":7,"oper":[0,1,4,5,6,8,10,11,12,13,15,16,17,18],"opinion":[1,14],"opkg":4,"opportun":4,"opportunist":10,"oppos":[0,5],"opposit":[0,2,8,11],"oppress":18,"opt":15,"optic":[6,17,18],"optim":[0,1,4,5,10,18],"option":[1,2,4,5,6,7,10,11,12,13,15,16,18],"oracl":0,"orbit":0,"ord":2,"order":[0,1,2,8,11,12,16],"ordinari":0,"organ":[0,1,4,5,10,15,16,18],"organis":[0,8],"organiz":1,"orient":[0,15],"origin":[0,2,5,7,10,11,15,18],"orthodoxi":0,"orthogon":1,"os":4,"osi":0,"other":[1,2,4,5,6,7,8,9,10,11,12,13,15,16,18],"otherwis":[0,2,5,8,9,12],"our":[0,2,8,15,18],"ourselv":10,"out":[0,2,6,8,9,12,13,15,16,18],"outag":1,"outbound":[8,11,12,15],"outcom":0,"outdat":0,"outgo":[2,8,11,12,15,16],"outlast":1,"outlin":[0,4,6,15],"outperform":0,"output":[1,5,7,8,16],"outrag":0,"outright":0,"outsid":[0,12,17,18],"outward":0,"over":[0,2,6,7,8,10,11,12,14,15,16,17,18],"overal":[7,15,16],"overcom":15,"overdo":4,"overhead":[4,6,8,15,16,18],"overlai":4,"overlap":0,"overli":14,"overlord":18,"overrid":[2,5],"overridden":11,"oversight":[0,15],"overview":[5,7,8],"overwhelm":[0,1,8,10,11,12],"overwrit":16,"ow":0,"own":[0,1,2,4,5,10,11,12,13,15,16,17,18],"owner":[0,2,11,18],"ownership":[0,1,18],"p":[2,5,11,16],"pace":1,"pack":[2,12],"packag":[0,1,2,4,5,8,13,15],"packb":2,"packed_s":2,"packet":[0,1,2,4,7,8,10,11,12,13,16,17,18],"packet_callback":2,"packet_deliv":2,"packet_hash":2,"packet_receipt":[2,12],"packet_timed_out":2,"packetreceipt":[2,7,12],"pad":[15,17],"page":[0,1,7,15,16,18],"page_cont":5,"pagin":5,"paid":1,"painstak":0,"painstakingli":0,"pair":[8,12,15,16],"pamac":4,"panic":[2,16,18],"panic_on_interface_error":[2,16],"panopticon":18,"paper":13,"par":[2,4],"paradigm":[0,11],"paradox":18,"parallel":4,"paralysi":18,"param":2,"paramet":[2,6,7,11,12,15,16],"paranoia":18,"parasit":[0,18],"pariti":[0,2,8,16,17],"parity_even":2,"parity_non":2,"parity_odd":2,"pars":[2,5],"parse_arg":2,"parser":[0,2,5,7],"part":[0,1,2,4,5,8,10,11,12,13,15,16,18],"parti":[0,1,5],"partial":[0,5],"particip":[0,1,4,7,8,10,15,16,18],"participant_nod":0,"particular":[0,1,2,6,8,9,11,15,16],"particularli":[1,5,8,16],"partli":0,"partner":18,"partylin":7,"pass":[2,5,6,8,10,11,12,15,16,18],"passphras":[4,8,10,15],"passport":15,"past":[0,16],"patch":[1,5,18],"patent":0,"path":[0,1,2,4,5,6,7,10,11,12,13,15,16,18],"path_respons":12,"pathfinder_m":12,"patient":18,"pattern":[1,5,6,7,10,11,15],"paydai":0,"payload":[0,2,5,8,12,15,16],"pc":0,"pdf":7,"peac":18,"peach":2,"peak":[0,5],"peer":[0,1,2,4,5,8,11,12,13,15,16,18],"penalti":[8,11],"pend":[2,15],"peopl":[0,1,4,13,15,18],"per":[0,1,5,8,10,11,12,13,15,16,17,18],"percent":[2,8],"percentag":12,"perfect":0,"perfectli":[1,4],"perform":[1,2,4,5,7,8,10,11,12,13,15,16,18],"perhap":[4,18],"period":[0,2,5,8,11,12,15,16],"peripher":13,"peripheri":0,"perlmutt":0,"perm":5,"perman":[4,8,16],"permiss":[0,1,7,8,9,11,16,18],"permissionless":[1,11,15,16],"permit":9,"perpetu":[0,18],"persecut":15,"persist":[1,7,8,16,18],"person":[0,7,8,9,10,14,15],"personag":1,"perspect":[0,1,8,10,12,15,17],"persuad":0,"pervers":0,"pet":2,"petit":18,"petti":0,"phantom":0,"phase":11,"phenomenon":0,"philosophi":[1,14,15,17,18],"phoenix":0,"phone":[0,4,7,10,16,18],"phonebook":13,"phonorecord":0,"photo":18,"photocopi":0,"phrase":0,"phy":16,"physic":[0,1,2,4,5,6,7,8,10,12,13,15,16,17],"pi":[1,2,7,10,15,16,17,18],"pick":[0,15],"pictur":0,"piec":[0,15],"pierian":0,"pillar":18,"pin":0,"ping":[16,18],"pip":[0,2,4,5,6,16],"pip3":4,"pipe":[7,13,16,17,18],"pipeinterfac":[6,8,13],"pipelin":0,"pipx":4,"piss":0,"pitch":0,"pitfal":15,"pkcs7":[15,17],"pkg":4,"place":[2,4,5,7,8,10,15,16,18],"plaform":6,"plain":[0,2,6,8,12,15,18],"plain_mdu":12,"plainli":0,"plaintext":[2,12,18],"plan":[0,10,11,15,18],"planet":[1,11,18],"planetari":[17,18],"platform":[0,2,5,6,7,13,15,16,18],"plausibl":0,"plausibli":0,"pleas":[2,4,8,12,16,18],"plenti":[10,15],"plethora":0,"plu":12,"plug":[16,18],"plugin":[13,18],"plural":0,"pmr":15,"pocket":0,"poetri":18,"point":[0,1,4,5,6,8,10,11,13,14,15,16,18],"pointer":4,"polici":[0,1,16,18],"polish":0,"polit":[0,18],"pomelo":2,"pope":0,"popul":[0,12],"popular":[0,17],"port":[0,2,4,6,7,8,10,11,15,17,18],"port0":16,"portabl":[1,7,8,10,15],"portion":[0,9],"pose":[0,4,15],"posit":[2,5,7,8,16],"posix":4,"possess":[0,8,15,18],"possibl":[1,4,5,6,7,8,10,11,12,13,15,16,17],"possibli":[0,4,15],"post":[0,2,7],"postfix":16,"postur":0,"potenti":[0,1,2,4,5,8,14,15,16,17,18],"pour":0,"power":[0,1,4,6,7,8,10,11,13,15,16,17],"powershel":4,"ppp":2,"pr":16,"pr_cost":11,"pr_stamp_timeout":11,"pr_valu":11,"practic":[0,1,5,10,11,15,17,18],"prais":0,"pre":[0,4,10,11,12,15],"preambl":[8,16],"prebuilt":0,"preced":[0,2,5],"preciou":10,"precis":[0,1],"precompil":4,"predatori":18,"predic":1,"predict":[7,15],"preexist":0,"prefer":[0,4,5,14,15],"prefer_ipv6":8,"prejudic":0,"premis":[0,10,18],"prepar":[0,2,15,16],"preposter":0,"prerequisit":[7,12],"prescrib":1,"presenc":[0,1,7,8,12],"present":[1,7,8,10,13,15,16,18],"preserv":[0,1,4,7,11,12],"preshar":15,"press":[0,2],"pressur":1,"prestig":0,"pretend":[0,13,15],"prettyhexrep":2,"prevent":[0,1,5,8,10,16,18],"preview":5,"previou":[0,2],"previous":[0,8,11,12,15],"price":18,"primari":[0,1,5,15,18],"primarili":[0,8,10,13],"primarlii":4,"prime":0,"primit":[0,4,5,7],"princip":0,"principl":[1,7,10,11,15,17],"print":[2,5,8,16],"print_filelist":2,"print_help":2,"print_menu":2,"prior":0,"priorit":[0,8,10,11,15,18],"prioriti":[0,8,11,15],"prioritis":[7,8,10,11,12],"privaci":[4,8,13,18],"privat":[1,4,5,8,10,11,12,13,14,15,16,17,18],"private_ret":4,"privileg":[1,16,18],"prn":7,"probabl":[0,2,4,5,10,15,16,17],"probe":16,"problem":[0,1,4,5,11,15,16,18],"problemat":5,"proc":16,"proce":0,"procedur":[0,4,5,11,12,15],"process":[0,1,2,4,5,6,8,10,11,12,15,16,18],"process_incom":2,"process_outgo":2,"proclaim":0,"proclam":0,"produc":[0,1],"product":[0,1,16,18],"profil":18,"profit":[0,18],"profound":[10,18],"profoundli":18,"program":[0,2,5,6,7,8,12,15,17],"program_setup":2,"programm":[0,15],"programmat":[1,15],"progress":[0,2,5,12,16,17],"progress_callback":12,"prohibitevli":0,"project":[1,5,7,13,14,18],"promis":[0,4],"promot":0,"prompt":[0,2,4],"prompter":0,"proof":[0,1,2,5,8,10,12,15,16,18],"proof_packet":2,"proof_requested_callback":12,"proof_strategi":12,"prop":0,"propag":[0,7,8,10,11,12,13,16,18],"proper":4,"properli":[0,4],"properti":[1,2,7,10,12],"proport":15,"proportion":0,"propos":[0,7],"prose":0,"prospect":1,"protect":[1,4,7,16,18],"protocol":[0,4,5,6,7,8,10,11,17],"prototyp":13,"proudli":0,"prove":[0,2,5,10,11,15,18],"prove_al":[2,12],"prove_app":12,"prove_non":12,"proven":[1,5,12,15],"provid":[0,1,2,4,5,6,7,8,9,10,11,12,13,15,16,17,18],"provis":[0,6,16],"prv_byte":12,"prx":16,"pseudo":16,"psycholog":[1,18],"ptt":13,"ptx":16,"pub_byt":12,"pub_to_fil":12,"public":[0,2,5,7,8,10,11,12,13,14,16,17],"public_inform":2,"publicli":[0,4,8,15,16],"publish":[0,1,4,5,7,8,9,11,12,15],"publish_blackhol":16,"publish_blackhole_en":12,"publish_ifac":8,"pull":[0,1,5],"puppet":18,"purchas":[4,15,17],"pure":[0,7,15],"purg":12,"purport":0,"purpos":[1,4,5,6,7,8,9,10,11,12,13,15,16,18],"purposefulli":[0,9],"pursu":1,"push":[1,5,11,13,18],"put":[0,1,2,6,8,16],"pwd":5,"py":[0,2,5,15,16],"py3":[4,5],"pyca":[4,15],"pyd":0,"pygment":5,"pyseri":[2,4],"python":[0,1,2,5,7,12,15,16,17,18],"python3":[2,4,6],"pyximport":0,"q":[2,5,16],"q8_k_xl":0,"qlen_in_announc":8,"qlen_in_data":8,"qlen_in_il":8,"qlen_in_pr":8,"qo":7,"qr":[10,13],"qua":0,"qualiti":[0,1,11,12,16,18],"quant":0,"quantiti":1,"quantiz":11,"quantum":0,"queri":[2,4,5,12,16,18],"question":[4,6,7,8],"queu":[12,16],"queue":[7,11,15,16],"quick":16,"quickli":[0,8,11,13,15,17],"quiet":[5,8,16,18],"quietest":0,"quill":0,"quinc":2,"quirk":4,"quit":[0,2,4],"quot":[0,5],"qvist":[9,17],"r":[0,2,5,8,15,16],"radic":18,"radio":[0,1,7,8,10,12,13,15,16,17,18],"radon":2,"rain":0,"rais":[0,1,2,11,12],"rak":6,"ram":[0,4,8],"ramp":0,"randint":2,"random":[0,1,2,12,14,15],"random_text_gener":2,"randomis":15,"randomli":[2,15],"rang":[0,1,2,4,5,6,8,10,15,16,17,18],"rapidli":[0,8,11],"rare":[4,8],"raspberri":[1,7,10,15,16,17],"rasperri":4,"ratchet":[0,12,15],"ratchet_count":12,"ratchet_expiri":12,"ratchet_id_receiv":12,"ratchet_interv":12,"ratchets":12,"ratchets_path":12,"rate":[0,2,4,7,11,12,13,16],"rather":[0,1,4,11,12,16,18],"ratio":[0,1,12],"rational":0,"raw":[0,2,5,6,12],"rawchannelread":[7,12],"rawchannelwrit":[7,12],"rawiobas":12,"rawmu":5,"rb":2,"re":[0,1,2,8,10,11,12,15,16,18],"reach":[0,1,4,7,8,10,11,12,16,18],"reachabl":[1,2,4,8,10,11,12,13,15,16],"reachable_on":8,"reaction":0,"reactiv":[0,1],"read":[0,1,2,4,5,8,10,12,13,15,16,17,18],"read_loop":2,"readabl":[0,1,2,8,11,12,15,16,18],"reader":[0,2,12],"readi":[2,4,6,8,12,17,18],"readili":17,"readm":[0,5],"readwrit":5,"ready_byt":[2,12],"ready_callback":12,"real":[0,1,4,6,8,10,13,16,17,18],"realist":0,"realiti":[1,4,11,18],"realiz":18,"realli":[0,8,11,12,16,18],"realm":18,"realtim":13,"reappear":8,"reason":[4,7,8,11,12,15,16],"reassembl":15,"reboot":18,"rebroadcast":[10,11],"rebuilt":18,"rebutt":0,"recal":[0,2,5,12,16],"recall_app_data":12,"recall_link_cost":[11,12],"recall_stamp_valu":[11,12],"recap":15,"recast":0,"receipt":[2,10,12,15],"receiv":[0,2,4,5,8,10,11,12,14,15,16,18],"receive_path_respons":12,"receive_stream_id":12,"received_announc":[2,12],"recent":[0,12,15],"recept":12,"reception_rssi":2,"reception_snr":2,"reception_stat":2,"recip":4,"recipi":[1,5,15,18],"reciproc":0,"reclaim":18,"recogn":[0,15,18],"recognis":[0,16],"recognit":[1,7,18],"recombin":1,"recommend":[1,2,4,8,15],"recondit":16,"reconnect":[2,10,11,18],"reconnect_port":2,"reconstruct":15,"record":[0,1,4,5,15],"record_stat":5,"recov":1,"recoveri":8,"recreat":15,"recur":0,"recurr":0,"recurs":[0,8,12,15],"recursive_pr":8,"recycl":7,"red":0,"reddit":0,"redistribut":0,"reduc":[0,8,11,16],"redund":[4,10,16],"reestablish":1,"ref":5,"refactor":[0,5],"refer":[1,2,4,5,7,8,11,13,16,18],"referenc":0,"referenti":0,"refin":[0,14],"reflect":[0,1],"reflex":0,"refram":0,"refresh":16,"refus":[0,10,11],"refut":0,"reg":0,"regain":[1,4],"regard":[0,1,13,15],"regardless":[0,1,5,8],"regener":0,"region":8,"regist":[0,2,5,11,12,16],"register_announce_handl":[2,12],"register_message_typ":[2,12],"register_request_handl":[2,12],"registr":0,"registrar":18,"registri":[1,18],"regrett":0,"regul":8,"regular":16,"regularli":0,"regulatori":18,"regurgit":[0,18],"reid":0,"reimplement":0,"reintroduc":1,"reject":[0,5,11,18],"rel":[0,5,6,8,10,11,15],"relai":[0,4,7],"relat":[0,4,5],"relationship":[0,1,10,15,16,18],"releas":[0,1,4,7,8,11,15,16,18],"relev":[0,2,4,5,6,8,11,12,15,16,18],"reli":[0,4,5,8,10,14,15,16,18],"reliabl":[0,4,6,8,10,12,15,17,18],"relianc":[4,18],"relief":10,"reload":16,"rem":[2,11],"remain":[0,1,5,8,10,12,13,15,18],"remaind":0,"rememb":[8,10,11,12,15,16],"remind":0,"remot":[2,7,11,12,15],"remote_ident":[2,5,12],"remote_identifi":2,"remote_management_allow":16,"remote_management_en":12,"remote_nod":5,"remote_p":2,"remotesensor":15,"remov":[0,1,5,12,16,18],"remove_message_handl":12,"remove_ready_callback":12,"ren":7,"renam":0,"render":[5,13,18],"rendezv":0,"rent":18,"rental":0,"reopen":5,"rep":0,"repeat":0,"repeatedli":[0,1,8,11],"repertoir":11,"replac":[0,1,2,4,10,12,13,15,16,18],"repli":[0,2,16],"replic":[1,6,15],"reply_data":2,"reply_messag":2,"reply_text":2,"repo":[5,16],"repo_nam":5,"report":[0,8,12,14,16],"repositori":[0,1,4,7,13,15,16,18],"repres":[0,1,10,15,18],"represent":[2,11,12,18],"reproduc":0,"reproduct":0,"republish":0,"repudi":5,"repurpos":4,"reput":[15,16],"request":[0,1,5,7,10,11,12,15,16,17,18],"request_destin":2,"request_fail":2,"request_id":[2,12],"request_packet":2,"request_path":[2,12],"request_receipt":[2,12],"request_receiv":2,"requested_at":[2,12],"requestexampl":2,"requestor":8,"requestreceipt":[7,12],"requir":[0,1,2,4,5,8,10,11,12,13,15,16,17,18],"require_shared_inst":12,"required_announces_onli":11,"required_destination_typ":11,"required_discovery_valu":[12,16],"required_onli":11,"rerout":18,"rescu":7,"research":1,"resend":12,"reserv":[0,2,10,12,18],"reset":5,"reshap":1,"resid":[8,13,18],"resili":[0,1,4,10,13,16,17,18],"resist":10,"resiz":16,"resolut":[0,4,5,8,11,15],"resolv":[5,7,8,10,15,16],"resort":0,"resourc":[0,2,4,7,8,10,11,12,14,16,18],"resource_callback":12,"resource_sending_conclud":2,"resource_strategi":12,"respawn":8,"respawn_delai":8,"respawn_interv":8,"respect":[0,1,5,8,10,11,17,18],"respond":[0,1,2,10,12,16],"respond_to_prob":16,"respons":[1,7,8,11,12,15,17,18],"response_callback":[2,12],"response_gener":[2,12],"rest":[0,10,11,17,18],"restart":[8,16],"restartsec":16,"restor":[0,4,7,8,18],"restrict":[5,7,8,9,10,11,16,18],"resubmit":5,"result":[0,1,2,4,8,15,16],"ret":[7,15],"retain":[0,1,5,8,11,12],"retained_ratchet":12,"retibb":7,"reticul":7,"reticulum":[1,2,8,10,11,12],"retipedia":7,"retransmiss":[10,15],"retransmit":[8,15],"retreat":0,"retri":[0,2,5,12,15],"retriev":[1,5,11,12,16],"return":[1,2,8,12,16,18],"reusabl":11,"reveal":[4,12,15,17],"revers":[0,16],"revert":0,"review":[0,1,15],"revis":[0,16],"revisit":0,"revok":[5,18],"revolut":18,"revolutionari":1,"rewrit":0,"rfe":16,"rhetor":0,"rich":13,"ridicul":[0,15],"right":[0,1,4,5,8,9,18],"rigid":18,"rigor":0,"rington":13,"rippl":18,"risc":7,"risk":[5,15],"riski":18,"rm":5,"rmap":4,"rn":[0,1,2,4,5,6,7,11,12,15,16,18],"rncp":7,"rngc":5,"rngit":[1,7,13],"rngit_config":5,"rnid":[5,7,15],"rnmon":7,"rnode":[4,7,11,13,15,16,17],"rnodeconf":[6,7,13],"rnodef3b9":8,"rnodeinterfac":[4,6,8,11,16],"rnodemultiinterfac":8,"rnpath":[4,7,8,11],"rnphone":13,"rnprobe":[4,7],"rns_bin_dir":16,"rns_config":5,"rns_remot":5,"rnsconfig":[5,16],"rnsd":[0,4,7],"rnsh":[7,13],"rnspure":[4,15],"rnstatu":[4,7,8,11,15],"rnstransport":[8,16],"rnx":7,"road":[7,18],"roadmap":18,"roam":[7,8,10],"robot":15,"robust":[4,8,18],"role":[7,10],"roll":8,"rom":16,"room":[7,11,13,18],"root":[0,5,15],"rotat":[8,11,12,15,16],"rou":0,"roughli":0,"round":[0,2,12,16],"roundtrip":0,"rout":[0,4,6,8,10,12,13,15,16,17,18],"router":[4,8,10,16,18],"row":0,"rpc":16,"rpc_kei":16,"rprogress":2,"rrc":7,"rrcd":13,"rsg":[1,5],"rsm":[1,5],"rssi":[2,12,16],"rtsct":2,"rtt":[2,12,15],"rttstring":2,"rubber":18,"rule":[0,1,4,5,7,8,10,11,16,18],"run":[0,1,2,4,5,6,8,10,11,12,13,15,16,17,18],"runtim":[2,11,15],"rural":0,"rust":[0,4],"rvp":5,"rw":5,"rx":[8,16],"rxb":2,"ryzen":0,"s3":0,"sa":13,"safe":[5,15,16,18],"safeguard":18,"safer":0,"safeti":[0,1],"sai":[0,1,18],"said":[0,5,15],"sake":[0,1],"sale":0,"same":[0,1,2,4,5,6,8,10,11,12,13,15,16,18],"sand":18,"sane":11,"saniti":0,"saroni":0,"satellit":10,"satisfi":[0,15],"satur":1,"saturdai":0,"save":[0,5,12,15,16],"save_error":2,"saved_filenam":2,"saw":[0,13],"scaffold":0,"scalabl":[16,17],"scale":[0,11,15,17,18],"scan":[4,8,11],"scandal":0,"scarc":18,"scarcest":0,"scarciti":7,"scatter":18,"scenario":[0,4,8,11,15],"schedul":[0,5,12],"scheme":[1,5,6,8,16],"scholarship":0,"school":[0,13],"scienc":0,"scope":[5,7,8,11],"scrape":[0,11,18],"scratch":[0,6,18],"scream":0,"screen":[0,2],"script":[1,4,5,6,8,16],"scrub":0,"scrubber":0,"scrutini":[0,15],"sd":1,"sdk":0,"se":5,"sea":8,"seal":0,"seamless":[8,13,15],"seamlessli":[8,10,13],"search":[7,12,13],"seat":0,"second":[0,2,8,10,11,12,13,15,16,17,18],"secreci":[8,12,13,15,17],"secret":[0,10,15],"section":[0,4,5,6,8,10,11,13,15,16],"secur":[0,1,4,5,7,10,13,15,16,17,18],"sed":5,"see":[0,2,4,5,8,10,11,12,15,16,17,18],"seek":[0,1,15,18],"seem":0,"seen":[0,8,15,18],"segment":[2,4,8,10,11,12,15,16,17],"seiz":0,"seizur":0,"selden":0,"select":[0,2,4,5,8,18],"self":[0,1,2,4,5,11,15,17,18],"sell":[0,9],"semant":0,"semi":[5,16],"semtech":6,"send":[0,2,5,8,10,11,12,15,16,18],"send_stream_id":12,"sender":[2,4,10,15,16],"sens":[0,1,10,18],"sensibl":[4,6,8,11,16],"sensit":18,"sensor":[10,15],"sent":[2,4,10,11,12,15,16,18],"sentenc":0,"sentiment":[0,15],"separ":[0,1,2,8,10,13,15,16],"sept":0,"septemb":0,"seq":5,"sequenc":[0,2,5,11,12,15,16,17],"sequenti":[5,17],"serfdom":18,"seri":[0,6,11],"serial":[0,2,4,7,10,15,17,18],"serialinterfac":[6,8],"seriou":[0,1,16],"serious":0,"serv":[0,1,2,6,7,8,10,11,13,14,15,16,18],"serve_nomadnet":5,"serve_path":2,"server":[0,1,2,4,5,6,7,10,12,13,15,16,18],"server_buffer_readi":2,"server_callback":2,"server_client_connect":2,"server_destin":2,"server_fil":2,"server_ident":2,"server_link":2,"server_loop":2,"server_message_receiv":2,"server_packet_receiv":2,"servic":[0,1,4,5,7,8,10,11,13,15,18],"session":[4,13,15,16],"set":[0,1,2,4,5,6,8,10,11,12,13,15,16,17,18],"set_default_app_data":12,"set_delivery_callback":[2,12],"set_link_closed_callback":[2,12],"set_link_cost":[2,11,12],"set_link_established_callback":[2,12],"set_max_request_s":12,"set_packet_callback":[2,12],"set_proof_requested_callback":12,"set_proof_strategi":[2,12],"set_ratchet_interv":12,"set_remote_identified_callback":[2,12],"set_resource_callback":12,"set_resource_concluded_callback":[2,12],"set_resource_started_callback":[2,12],"set_resource_strategi":[2,12],"set_retained_ratchet":12,"set_timeout":[2,12],"set_timeout_callback":[2,12],"set_valu":[11,12],"settl":0,"setup":[2,4,5,7,8,11,16],"sever":[0,4,5,10,12,13,16],"sf":16,"sh":8,"sha":[10,12,15],"sha256":[5,15,17],"shall":[0,9,15],"shallow":0,"shame":0,"shape":[0,10,18],"share":[0,1,2,4,10,11,12,13,15,16,18],"share_inst":16,"shared_instance_port":16,"shared_instance_typ":[12,16],"sharper":0,"shatter":0,"shelf":[15,17],"shell":[1,4,5,7,16,18],"shelter":1,"shift":[1,18],"shim":[0,5],"shine":18,"ship":[0,15,18],"shop":[2,18],"short":[0,6,7,8,11,15,16],"shortcom":0,"shorter":8,"shorthand":[8,16],"shortli":11,"shortlog":5,"shot":4,"should":[0,1,2,4,5,8,10,11,12,13,15,16,18],"should_ingress_limit":2,"should_quit":2,"should_use_implicit_proof":12,"shout":18,"shove":1,"show":[0,4,5,16,18],"shown":[0,1,2,14],"shrink":0,"shut":[0,1,18],"side":[0,1,8,16,17],"sideband":[0,4,7,16],"sign":[0,1,7,8,10,12,15,16,18],"signal":[1,2,7,8,11,12,15,16,18],"signatur":[0,1,7,10,12,15,16,17,18],"signer":5,"signifi":15,"signific":10,"significantli":[8,12],"signingkei":5,"silent":[0,16],"silk":0,"similar":[0,1,2,4,5,6,8,12,13,16,17],"simpl":[0,2,4,5,6,12,13,15,16,17,18],"simpler":[5,8,10,17],"simplest":[8,15],"simpli":[0,1,2,4,5,6,8,10,11,13,14,15,16,18],"simplic":15,"simplifi":2,"simplyequip":6,"simul":[13,15],"simultan":[4,11,15],"sinc":[0,2,4,5,8,10,11,12,15,18],"sine":0,"sing":0,"singl":[0,1,2,4,5,8,10,11,12,15,16,17,18],"singular":15,"sit":[0,4,16,18],"site":[1,8,10,18],"situat":[0,4,5,6,8,10,11,15,16],"six":[0,16],"size":[0,2,4,5,8,12,15,16],"size_str":2,"skeptic":0,"skill":[0,1],"skin":0,"skip":[2,5],"sky":7,"slap":18,"slave":18,"sleep":[2,4,16],"slice":[0,2,18],"slight":0,"slightli":[2,4,11,18],"slip":0,"slop":0,"sloppi":[0,18],"slot":0,"slottim":[8,16],"slow":[0,2,8,10,13,15,18],"slower":[0,8,12,15],"slowest":[0,12],"slowli":11,"slyli":0,"small":[0,2,4,8,10,12,15,17,18],"smaller":[0,12],"smallest":4,"smear":0,"smooth":0,"snapshot":0,"sneez":0,"snippet":16,"snr":[2,12,16],"so":[0,1,2,4,5,6,8,9,10,11,12,13,14,15,16,17,18],"sober":0,"social":[0,1,4,18],"societi":18,"socket":[8,16,17,18],"sockpuppet":0,"soft":18,"softdevic":0,"softwar":[0,1,4,5,6,8,9,13,15,16,18],"solar":18,"soldier":0,"sole":[0,8,11],"solemn":0,"solicitud":0,"solid":[0,14],"solo":1,"solut":[0,1,13,15,16],"solv":[1,11,15,18],"some":[0,1,2,4,6,8,10,11,12,13,15,16,18],"some_program":5,"some_program_1":5,"some_remot":5,"somehow":0,"someon":[0,1,4,5,8,16,18],"someth":[0,1,5,8,10,11,15,18],"somethign":2,"sometim":[0,6,8,13,18],"somewhat":4,"somewher":[0,18],"soon":[5,12,16],"sort":[0,8,11,15,16],"soul":18,"sound":[0,13,18],"soundmodem":8,"sour":0,"sourc":[1,2,4,5,6,7,10,11,12,13,15,17,18],"source_":5,"sovereign":[1,4,15,18],"sovereignli":18,"sovereignti":[7,17],"space":[0,1,2,4,6,10,15,17,18],"spam":[4,8,11,15,16],"spammi":16,"span":[0,8,10,15],"spawn":[0,8,13],"spe":8,"speak":[0,1,14,18],"speaker":0,"spec":15,"speci":0,"special":[0,13,15,16],"specif":[0,1,2,5,6,7,8,10,11,12,16,17,18],"specifi":[0,1,2,4,5,6,8,10,11,12,15,16],"spectacularli":0,"spectrum":[0,8,15,18],"specul":0,"speech":0,"speed":[0,2,8,12,15,16,18],"spend":[0,11],"spent":0,"spew":0,"sphere":18,"spin":0,"spinner":18,"spirit":[0,13],"split":2,"spoof":[5,18],"spread":[0,8,16],"spreadingfactor":8,"spring":0,"spun":0,"squelch":8,"ssh":[5,13,16],"ssid":8,"ssl":18,"stabil":[0,10,18],"stabl":[4,8,10,15,17],"stack":[2,4,10,12,13,15,16,17,18],"stackexchang":13,"stage":[11,15],"stai":[2,8,15,16,18],"stake":[0,1],"stale":[10,12,16],"stale_grac":12,"stale_tim":12,"stall":0,"stamp":[2,5,7,8,12,16],"stamp_destin":11,"stamp_pr":11,"stamp_valu":5,"stanc":[1,18],"stand":[0,1,18],"standalon":[7,13],"standard":[1,5,6,7,8,11,13,15,16],"start":[0,2,5,6,7,8,10,11,12,13,15,16,18],"starter":0,"startup":[2,4,11,16],"stat":[5,12,16],"state":[0,1,2,7,10,11,18],"statement":0,"static":[4,5,8,11,12,18],"staticmethod":2,"station":8,"stationari":[10,16,18],"statist":[2,7,8,12,14],"stats_ignore_ident":5,"statu":[0,2,4,5,7,8,11,12,13,15,16,18],"statut":7,"statutori":0,"stderr":16,"stdin":[8,16],"stdio":17,"stdout":[2,5,8,16],"steel":18,"stem":[11,14],"step":[0,2,4,5,6,11,18],"stewardship":18,"still":[0,1,2,4,5,8,10,11,15,16,18],"stock":[0,2],"stole":0,"stolen":0,"stone":18,"stop":[0,12,17,18],"stopbit":[2,8,16],"storag":[4,7,8,13,15,16,18],"store":[1,2,5,7,12,13,15,16],"store_tru":2,"stori":0,"storm":18,"str":[2,12],"straight":0,"straightforward":8,"strang":18,"stranger":18,"strangl":18,"strateg":10,"strategi":[0,1,7,8,12],"strawman":0,"stream":[0,1,2,12,13,15,16,18],"stream_id":[2,12],"street":18,"strength":[0,12,17,18],"strict":[1,18],"strictli":[0,8,15],"string":[0,2,12,18],"stringmessag":2,"strip":[0,1,5,18],"strong":[4,5,15,18],"stronger":[0,4],"strongli":4,"struct":2,"structur":[0,1,2,7,10,12,15,17,18],"studi":[0,1],"style":[0,5,8],"stylist":0,"sub":[2,8,11],"subclass":[2,12],"subcommand":5,"subdirectori":5,"subinterfac":8,"subject":[0,4,9,16,17,18],"sublicens":[0,9],"submit":[0,1],"subnet":[4,10],"subreddit":0,"subscrib":[4,11,16,18],"subsequ":[0,2,5,15],"subset":8,"subsid":[8,11],"subsist":0,"substanc":7,"substant":0,"substanti":[0,1,9],"substitut":7,"substrat":[1,18],"subsystem":11,"subtl":18,"subtli":[0,18],"succe":[4,5,16],"succeed":[0,2,12],"succesfulli":10,"success":[0,1,4,5,8,12],"successful":12,"successfulli":[0,2,12,15],"sudden":0,"suddenli":[0,18],"sudo":[4,16],"sue":0,"suffer":10,"suffic":15,"suffici":[0,4,8,11,15,16,17],"suffix":2,"suggest":0,"suit":[0,1,4,6,11,13,15,16,18],"suitabl":[2,4,8,10,15,16,17],"sum":[0,18],"sun":0,"super":2,"superfici":0,"supersed":8,"superstructur":1,"supp":0,"suppli":[0,2,8,11,12,15,16,17],"supplier":4,"support":[0,1,2,4,5,7,8,10,11,12,13,15,16,17],"suprem":[0,1],"sure":[0,2,4,5,6,8,13,16],"surfac":[7,18],"surgic":0,"surprisingli":0,"surrend":1,"surround":[0,1,18],"surveil":[1,15,18],"surviv":[0,4,15,16,18],"suspend":1,"sustain":[0,18],"swim":1,"switch":[6,8,10,15,16,18],"sx1262":6,"sx1268":6,"sx1276":6,"sx1278":6,"sx1280":6,"sy":2,"syllog":0,"symbol":[0,5],"symlink":16,"symmetr":[12,15],"sync":5,"syncer":5,"synchron":[1,7,13,18],"syntax":7,"synthesi":0,"synthet":[0,18],"system":[0,1,2,4,5,6,7,8,9,10,11,12,14,15,17],"systemat":0,"systemctl":16,"systemd":16,"t":[0,1,2,4,5,8,10,11,12,15,16,18],"tabl":[0,4,8,10,11,15,16,18],"tablet":[0,4],"tackl":13,"tactic":0,"tag":[5,11,12],"taglin":0,"tail":8,"tailor":15,"take":[0,1,2,4,5,8,12,13,15,16,17,18],"taken":[0,2,5,15,16,18],"takeov":0,"talent":0,"talk":[0,13,18],"tamper":[1,5,18],"tangerin":2,"tangibl":0,"tantrum":0,"tap":[6,18],"tar":5,"target":[0,2,4,5,8,11,12,13,16,18],"target_hash":12,"target_host":8,"target_port":[8,16],"task":[5,16],"tast":0,"taught":18,"tcp":[0,4,6,7,10,15,16,17,18],"tcpclientinterfac":[0,4,6,8],"tcpinterfac":16,"tcpserverinterfac":[0,4,8],"tdata":2,"teach":[0,16,18],"teahous":[1,14],"team":[0,5],"teardown":[2,12],"teardown_reason":2,"tech":18,"technic":[0,1,5,13],"technician":18,"technolog":[0,1],"technologi":[0,4,10,11,18],"teffect":2,"telco":18,"telecom":18,"telemetri":[13,14],"telephon":[0,7],"telephoni":[7,11],"televis":18,"tell":[0,2,4,8,10,11,18],"temperatur":15,"templat":[0,7],"temporari":[4,8,16],"temporarili":[0,8,10,11],"tempt":[0,16],"ten":[0,15],"tenanc":18,"tenant":18,"tend":[0,8],"tenuou":18,"terabyt":0,"term":[0,1,4,8,10,11,15,18],"termin":[0,2,4,5,12,13,16],"terminolog":0,"terminologi":[10,15],"termux":4,"terrifi":18,"territori":1,"terror":0,"test":[0,4,5,11,13,15,16,18],"testimoni":1,"testnet":16,"tether":18,"text":[0,2,13,15,16],"textur":[0,18],"tfile":2,"tgz":[5,16],"thaler":0,"than":[0,1,2,4,5,8,10,11,12,13,14,15,16,17,18],"thank":[0,5],"theater":0,"theatr":0,"theatric":[0,1],"theft":0,"thei":[0,1,2,4,5,8,10,11,12,13,15,16,18],"theirs":0,"them":[0,1,2,4,5,6,8,10,11,13,15,16,17,18],"theme":5,"themself":0,"themselv":[0,1,5,8,10,11,16],"theoret":0,"theori":[0,1,18],"thereaft":15,"therefor":[0,4,11,15,17,18],"thereof":0,"thi":[1,2,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18],"thin":0,"thing":[0,2,4,10,13],"think":[4,6,8,10,14,15,18],"thinner":0,"third":[0,1,5],"those":[0,1,4,10,11,15,16,18],"though":[0,1,4,8,10,11,15],"thought":[0,18],"thoughtfulli":11,"thousand":[0,1,4,8,11,15,16,18],"thread":[0,1,2,5],"threat":[0,16],"three":[0,4,15,18],"threshold":8,"throough":8,"throttl":[8,10],"through":[0,2,4,5,6,7,8,10,11,12,13,15,16,17],"throughout":[10,15],"throughput":[0,1,12,13,15,17],"thrown":[12,18],"thu":[10,12,15],"ti":[2,10,11,15],"tickinput":0,"tickoutput":0,"tighten":18,"tightrop":18,"tild":16,"time":[0,1,2,4,5,6,7,8,10,11,12,13,14,15,16],"time_since_last":2,"timefram":1,"timeout":[2,12,16,18],"timeoutarg":2,"timer":5,"timescal":1,"timespan":11,"timestamp":[2,5,12,15,18],"timestr":2,"tion":8,"titl":[0,5],"tl":18,"tmp":16,"tnc":[6,8,12,16,17],"to_fil":12,"todai":[0,1,15,18],"togeth":[0,6,10,15,16,18],"toggl":16,"token":[0,11,12,15,17],"tokyo":18,"told":[0,18],"toler":8,"tomorrow":18,"too":[0,2,10,11,18],"took":0,"tool":[0,1,4,5,6,7,8,10,11,13,15,16,17],"toolkit":[4,10],"top":[0,1,11,13,15,16,18],"topic":[4,15],"topograph":8,"topographi":[4,10,15,18],"topologi":[4,8,10,11,13,15,16,17,18],"torn":[11,12,16],"tort":9,"tortur":18,"torvald":1,"total":[0,5,11,12,15,16,17],"total_s":2,"touch":[8,18],"toward":[0,2,8,11,15],"tower":18,"toxic":[0,1],"tr":11,"trace":0,"track":[0,1,5,12,16,18],"track_phy_stat":12,"trade":[0,10,15],"tradit":[0,5,10,15,18],"tradition":1,"traffic":[0,2,4,8,10,11,12,15,16,18],"train":[0,9,18],"trajectori":0,"transceiv":[4,6,8,13,15,17],"transfer":[0,2,5,12,13,15,16,17],"transfer_s":2,"transform":[0,17],"transient":18,"transistor":18,"transit":[0,11],"transitori":11,"translat":[7,10],"transmiss":[4,8,11,12,15,18],"transmit":[0,2,5,8,15,18],"transmitt":18,"transpar":[0,5,6,8,10,11,15,16],"transport":[0,1,2,4,5,7,8,12,13,16,17,18],"transport_en":12,"transport_ident":16,"trap":7,"travel":[1,18],"travers":[1,4,8,12,15,18],"treat":[0,1,5,10,15,18],"tree":[0,1,5],"tremend":10,"tri":[0,2],"triad":7,"trigger":[8,11],"trip":[2,12,16],"trivial":[15,17],"troll":0,"troubl":18,"true":[0,1,2,4,8,11,12,13,16,18],"truli":[0,6,11,15,18],"truncat":[12,15,16],"truncated_hash":12,"truncated_hashlength":[2,12],"trust":[0,1,4,5,7,8,10,11,15,16],"trustless":[7,15,17],"trustworthi":[10,16],"truth":[0,5],"try":[2,5,7,8,10,12,13],"ttime":2,"ttransfer":2,"ttyacm0":8,"ttyusb0":[2,8,11,16],"ttyusb1":8,"ttyusb2":8,"tui":7,"tun":[6,8],"tun0":8,"tune":[7,11],"tunnel":[4,8,10,15,17,18],"tupl":12,"turbo":0,"turn":[0,1,2,8,16,18],"turnaround":8,"tutori":4,"twelv":0,"two":[1,2,5,6,7,8,10,11,12,15,16],"tx":[8,16],"txb":2,"txp":16,"txpower":8,"txt":[5,16],"txtail":[8,16],"type":[0,2,4,7,8,10,12,16],"typeerror":12,"typic":[5,8,10,11,15],"tyrant":18,"u":[0,15,16,18],"ubiqu":6,"ubuntu":[7,16],"uci":4,"udp":[7,10,15,16,17],"udpinterfac":[0,8],"uhf":[13,16,17],"ui":[13,18],"ultim":[4,11,15,18],"umsgpack":2,"unaffect":11,"unaid":0,"unanswer":0,"unapologet":0,"unauthor":0,"unavail":[0,5],"unblackhol":16,"unblackhole_ident":12,"unblock":[11,16],"unbound":[0,18],"uncar":18,"uncencrypt":2,"uncentraliz":7,"uncertainti":0,"unchang":[0,10],"uncheck":0,"uncomfort":0,"uncontamin":0,"uncontroversi":0,"uncoordin":[4,18],"under":[0,1,5,8,11,12,14,15,16,17,18],"underli":[2,8,10,12,15,17],"undermin":[0,18],"underneath":18,"undersea":18,"understand":[0,1,4,7,8,10,11,12,16,17,18],"understood":[0,18],"underwai":4,"underwear":18,"undetect":0,"unencrypt":[2,12,15],"unencumb":0,"unenforc":0,"unequivoc":15,"unexamin":0,"unexcit":0,"unexplor":10,"unfair":0,"unforeseen":1,"unforg":[10,17],"unfortun":[0,4],"unfre":0,"unhealthi":0,"unicod":5,"unicode_icon":5,"unidentifi":2,"unidirect":2,"unifi":[10,15],"uniform":0,"uninform":1,"uninterest":2,"uniqu":[2,8,10,11,12,15,16,17,18],"unison":0,"unit":[0,1,2,4,12,16],"univers":[11,18],"unix":[5,12],"unknow":0,"unknown":[0,2,8,10,11,12,15,16],"unlawfulli":0,"unlearn":18,"unless":[2,4,8,10,11,12,15,16],"unlicens":[0,15],"unlik":[1,5,15],"unlock":16,"unmask":0,"unmeasur":0,"unmedi":1,"unnecessari":8,"unorganis":10,"unown":0,"unpack":[2,12],"unpackb":2,"unpaid":18,"unplug":[16,18],"unpreced":0,"unprofession":0,"unprotect":0,"unproven":0,"unreach":0,"unread":0,"unrecover":[2,16],"unrel":0,"unreli":8,"unrestrict":0,"unreview":0,"unsatur":1,"unset":15,"unstamp":11,"unsubstanti":0,"unsupport":12,"until":[2,4,8,11,12],"untrust":[5,16],"untrustworthi":18,"unus":16,"unverifi":[0,16],"unwant":[11,15,16],"unwants_destination_typ":11,"unwrap_or":0,"unwritten":0,"up":[0,1,2,4,5,6,8,10,11,12,13,15,16,17,18],"upcom":11,"updat":[0,1,2,4,5,11,12,13,15,16,18],"upgrad":[0,4,11,12,15],"upkeep":[8,11],"upload":5,"upon":[0,1,2,8,15],"upset":2,"upstream":[0,1,5,11,13,16],"uptim":[0,18],"urandom":[15,17],"urgenc":[0,1],"urgent":18,"uri":13,"url":[1,5,16,18],"urwid":13,"us":[1,2,5,6,7,8,9,10,11,12,18],"usabl":[5,8,15],"usag":[5,7,8,11,12,13,14,16],"usb":[1,6,15,16],"useabl":15,"useless":[1,18],"user":[0,1,2,4,5,8,10,11,13,15,16,17,18],"user_input":2,"userland":17,"usernam":[0,18],"usernameher":16,"usr":[8,16],"usual":[0,4,8,10,11],"usurp":0,"utf":2,"util":[2,6,7,8,11,15,18],"utilis":[2,4,8,12,13,15,16,17],"ux":13,"v":[5,7,16],"v4":0,"vaccuum":0,"valid":[0,1,2,4,7,8,10,11,12,15,16,18],"vallei":0,"valu":[0,1,2,4,5,8,11,12,15,16,18],"valuabl":[0,1,5,6,14,18],"valueerror":[2,12],"vanish":[0,18],"vanishingli":[0,18],"var":5,"vari":[4,8,15,16],"variabl":[2,4,5,12],"varianc":0,"variant":0,"variat":0,"varieti":[8,13,15,16,17],"variou":[0,2,4,8,10,12,13,15,16,17],"vast":[0,1,4,15,18],"vastli":10,"vau001480196":0,"vc":0,"ve":10,"vector":0,"vehicl":[0,8],"veloc":[0,1],"vendor":[0,2,6,17],"ventur":18,"venu":1,"verbatim":0,"verbos":[5,12,16],"verdict":7,"veri":[0,1,4,5,6,8,10,11,12,13,14,15,16,17,18],"verif":[0,1,7,10,11,12,13,15,16,18],"verifi":[0,1,2,4,7,8,10,11,12,15,16,17,18],"versa":17,"version":[0,1,2,4,5,11,15,16,18],"versu":7,"vet":0,"vhf":[13,15,17],"vi":[5,7],"via":[1,4,5,6,8,10,11,13,14,15,16,17,18],"viabl":[10,11],"vice":17,"video":18,"view":[1,4,5,8,13,14,15,16],"viewabl":5,"vim":5,"vindic":0,"violat":[0,8,11],"violatn":11,"violenc":0,"violent":0,"viral":0,"virtu":0,"virtual":[4,6,8,10,15,16,17],"virtuou":18,"visibl":[0,1,2,5,8],"visibli":0,"visual":[0,5,15,18],"vital":18,"vocabulari":0,"voic":[0,1,7,11,14,18],"voicemail":13,"void":7,"volum":[0,11],"volunt":4,"voluntari":4,"vouch":18,"vpn":[10,18],"vport":8,"vulner":10,"vv":16,"vvv":4,"w":[5,16],"wa":[1,2,5,6,7,8,10,11,12,15,16,17,18],"wai":[0,1,2,5,7,8,10,11,12,13,15,16,18],"wait":[0,2,4,8,11,13,15,16,18],"waiv":0,"walk":18,"wall":[0,18],"wander":18,"want":[0,1,2,4,5,8,10,11,13,14,15,16,18],"wantedbi":16,"wants_destination_typ":11,"warhol":0,"warn":[0,16],"warrant":17,"warranti":9,"wash":18,"wasm":0,"wast":[0,4,8,10,11,14,16,18],"watch":0,"wave":[0,6,18],"wb":2,"we":[0,1,2,4,6,8,10,14,15,18],"weaken":15,"weapon":[0,1,18],"weaponis":0,"wear":[0,18],"weather":18,"weav":18,"web":[0,4,13,18],"websit":[0,4,8,18],"week":0,"weekdai":0,"weekend":0,"weigh":18,"weight":[0,1,5,16,18],"weird":0,"welcom":[0,1],"well":[0,1,5,6,8,10,11,12,13,14,15,16,17,18],"went":2,"were":[0,1,2,5,13,18],"what":[1,2,4,5,7,8,10,11,12,15,16,18],"whatev":[0,10,12,15],"whatsoev":0,"wheel":[4,5],"when":[0,1,2,4,5,6,8,10,11,12,13,15,16,18],"whenev":[0,2,11,12,15],"where":[0,1,4,5,6,7,8,10,11,12,13,15,16,18],"whereupon":15,"wherev":18,"whether":[0,2,4,5,8,9,10,11,12,15,18],"which":[1,2,4,5,7,8,9,10,11,12,15,16,17,18],"while":[0,1,2,4,5,6,8,10,11,12,13,15,16,17,18],"whim":18,"whitelist":15,"whl":[4,5],"who":[1,4,5,7,8,10,11,15,16,18],"whole":[7,16,18],"wholesal":0,"whom":[0,9,18],"whose":[0,16,18],"why":[1,7,18],"wide":[0,4,5,6,8,10,11,13,15,16,17],"wider":[0,4,8,10,15,16],"wield":[0,1],"wifi":[4,7,8,10,13,15,16,17,18],"wikipedia":13,"wild":[5,16,18],"wildcard":[2,5],"wilder":18,"wildli":0,"willi":0,"willing":[0,16],"win":0,"win_amd64":0,"window":[0,7,8,13,16],"windowsil":18,"wine":7,"wipe":16,"wire":[0,6,7,8,11,13,17,18],"wireless":[6,10],"wirelessli":8,"wish":[0,2,8,15,16,18],"witchcraft":0,"withhold":0,"within":[0,1,2,4,5,8,10,11,12,15,16,18],"without":[0,2,4,5,6,7,8,9,10,11,13,15,16,17,18],"wlan0":8,"wolf":6,"won":2,"word":[0,1,4,18],"wore":0,"work":[1,4,6,7,8,10,11,13,15,16,17],"workabl":10,"workflow":7,"workspac":0,"world":[0,1,4,6,8,10,13,16,17,18],"worldwid":0,"worri":[0,10,11],"wors":0,"worst":0,"worth":[0,1,4],"worthless":0,"would":[0,1,5,8,12,15,16,18],"wrap":5,"write":[0,1,2,4,5,6,8,12,13,15,16,18],"write_timeout":2,"writer":[0,2,12],"written":[0,2,5,15,17,18],"wrong":[0,2,4,8,18],"wrote":[0,2,8],"x":[0,5,11,12,15,16],"x25519":[15,17],"x86_64":[0,5],"xenon":2,"xonxoff":2,"y":[0,2,5],"ye":[0,4,5,8,11,15,16,18],"year":[0,15,18],"yearn":0,"yet":[0,1,2,8,15,18],"yggdrasil":8,"yi":2,"yield":0,"you":[0,1,2,4,5,6,7,8,10,11,12,13,14,15,16,17,18],"young":0,"your":[0,1,2,5,6,7,8,10,11,13,14,15,17,18],"yourself":[0,1,4,15,16,17,18],"z":2,"zarya":0,"zen":[0,7,17],"zero":[0,7,8,12,13,17],"zi":2,"zim":13,"zip":5,"zone":[0,1,15],"zshrc":4},"titles":["Brandolini\u2019s Reference","Distributed Development","Code Examples","An Explanation of Reticulum for Human Beings","Getting Started Fast","Git Over Reticulum","Communications Hardware","Reticulum Network Stack Manual","Configuring Interfaces","Reticulum License","Building Networks","Protecting Open Networks","API Reference","Programs Using Reticulum","Support Reticulum","Understanding Reticulum","Using Reticulum on Your System","What is Reticulum?","Zen of Reticulum"],"titleterms":{"":0,"0":6,"1":[0,6],"2":0,"25":8,"A":[0,18],"And":0,"Beings":3,"But":0,"By":0,"For":[0,11,18],"In":[0,18],"No":0,"Not":[0,10,18],"Of":[0,1,7,18],"On":[0,11],"Or":[0,18],"That":0,"The":[0,1,5,15,16,18],"These":0,"To":[0,18],"With":[4,5],"abil":18,"access":[5,15],"actual":0,"ad":4,"addendum":0,"address":[10,18],"administr":13,"agenc":[0,18],"agent":0,"alias":5,"an":3,"analysi":0,"anchor":18,"android":4,"announc":[2,8,15,18],"answer":0,"api":12,"ar":0,"architectur":[1,18],"archiv":1,"argument":0,"arm64":4,"artifact":1,"assist":0,"attribut":[0,5],"author":[0,5],"auto":8,"autom":[8,16],"automat":5,"ax":8,"backbon":[4,8],"bandwidth":18,"base":[4,6,11],"basic":15,"beam":6,"bind":5,"blackhol":[11,16],"block":[8,11],"board":6,"bookworm":4,"bootstrap":4,"bound":0,"brandolini":0,"brief":0,"broadcast":2,"brows":13,"browser":13,"buffer":2,"build":[4,10],"burst":[8,11],"byte":18,"can":17,"carrier":18,"case":0,"center":[1,18],"channel":2,"chat":13,"citizenship":0,"claim":0,"clean":0,"client":8,"cloud":18,"code":[0,2,15],"coexist":0,"columba":13,"combin":6,"command":5,"commit":5,"common":[0,8],"commun":6,"compon":13,"compos":1,"concept":10,"conceptu":15,"conclus":0,"condit":0,"configur":[5,8,11,16],"conform":0,"connect":[4,8,10,13],"consequ":0,"consider":[8,10],"content":7,"context":0,"contribut":4,"control":[8,11],"copi":0,"copyright":0,"cost":18,"creat":[4,5,6,15],"creation":5,"creator":5,"cryptograph":[5,11,15],"current":[15,17],"custom":[2,4,5,8],"data":16,"date":0,"death":18,"debian":4,"decentr":18,"deck":6,"defenc":0,"delus":0,"depend":4,"design":18,"destin":[5,8,10,15],"detail":15,"develop":[1,4,11],"devic":[6,13,17],"dichotomi":0,"directli":0,"disclos":0,"disconnect":18,"discov":16,"discover":8,"discoveri":8,"distribut":[0,1,4],"do":0,"document":5,"doe":[0,17],"domain":18,"donat":14,"dozen":0,"echo":[2,6],"elong":0,"emerg":18,"empti":5,"enabl":[5,8],"encrypt":18,"engin":0,"entrypoint":4,"environ":18,"establish":15,"ethernet":6,"ethic":18,"evalu":0,"exampl":[2,5,8],"exist":[0,18],"expand":0,"explan":3,"express":0,"fabric":18,"fair":0,"fallaci":18,"fals":0,"fast":[4,11],"featur":18,"feedback":14,"ferment":0,"filesync":13,"filetransf":2,"filter":11,"find":4,"finish":18,"fix":16,"flap":11,"flasher":13,"flow":18,"fluenci":0,"fork":5,"form":5,"format":[5,15],"forward":18,"foundat":0,"fragil":0,"free":0,"freedom":0,"from":[0,18],"function":15,"further":15,"futur":15,"gener":0,"get":[4,15],"git":[5,13],"global":4,"goal":15,"grade":18,"grant":0,"group":5,"guid":0,"ha":0,"happen":0,"hardwar":6,"harm":18,"headcount":0,"health":[0,4],"heltec":6,"heterogen":10,"hierarchi":5,"highlight":5,"histori":0,"host":4,"hostil":18,"human":[3,18],"i":[0,17,18],"i2p":8,"idea":0,"ident":[5,15,18],"identif":2,"ii":0,"iii":0,"illus":18,"implement":[0,17],"implic":15,"improv":16,"includ":[4,16],"independ":18,"indic":7,"individu":0,"influenc":0,"infrastructur":[0,1,4,18],"ingress":[8,11],"instal":[4,6],"instanc":[4,10,11],"institut":0,"intent":0,"interact":5,"interfac":[2,4,8,13,15,16,17,18],"intermediari":1,"internet":4,"interregnum":1,"introduct":15,"introductori":10,"ip":18,"issu":4,"iv":0,"j":13,"kei":15,"kiss":8,"launder":0,"layer":0,"legal":0,"liber":18,"licens":[0,9],"like":0,"lilygo":6,"limit":[8,18],"line":[0,5,6],"link":[2,15],"list":16,"listen":8,"local":16,"locat":5,"long":1,"look":0,"lora":8,"lora32":6,"lunar":4,"lxmf":13,"lxmfy":13,"lxst":13,"machin":0,"maco":4,"mad":0,"manag":[5,11,16],"manual":[5,7],"matter":0,"mean":0,"mechan":15,"medium":18,"merit":18,"meshchatx":13,"messag":13,"method":[0,5],"micron":13,"minim":2,"mirror":5,"mix":4,"mode":8,"modem":6,"modem73":13,"modul":13,"monetari":0,"most":0,"motiv":15,"movement":0,"multi":8,"name":[15,16,18],"network":[0,4,5,7,10,11,13,15],"new":[0,8],"node":[5,10,11,13,15,18],"nomad":[5,13,18],"note":4,"obtain":5,"offer":17,"offlin":5,"open":[0,11,18],"opencom":6,"openwrt":4,"option":8,"origin":1,"other":0,"output":0,"over":[1,4,5,13],"overal":0,"overview":[10,15],"packet":[6,15],"page":[5,13],"paramet":[5,8],"parser":13,"partylin":13,"path":8,"pattern":[0,18],"perform":0,"permiss":5,"persist":0,"person":[4,18],"phone":13,"physic":18,"pi":4,"pipe":8,"place":0,"platform":[1,4],"port":16,"portabl":18,"posit":0,"possibl":0,"post":18,"power":18,"predict":0,"prerequisit":5,"presenc":18,"present":0,"preserv":18,"primit":[1,11,15],"principl":[0,18],"prioritis":15,"prn":0,"program":[4,13,16],"project":0,"propag":15,"properti":0,"propos":5,"protect":[0,11],"protocol":[1,13,15,18],"proven":0,"provid":14,"public":[4,15,18],"publish":[13,16],"pure":4,"purpos":0,"python":4,"qo":11,"question":0,"queue":8,"radio":[4,6],"rak4631":6,"raspberri":4,"rate":8,"reach":15,"realiti":0,"reason":0,"recognit":0,"recycl":0,"refer":[0,12,15,17],"relai":13,"releas":5,"remot":[5,8,13,16],"ren":13,"repositori":5,"request":[2,8],"rescu":0,"resolv":[0,4],"resourc":[13,15],"respons":[0,2,4],"restor":1,"restrict":0,"ret":4,"retibb":13,"reticul":13,"reticulum":[0,3,4,5,6,7,9,13,14,15,16,17,18],"retipedia":13,"risc":4,"rn":13,"rncp":16,"rngit":[5,16],"rnid":16,"rnmon":13,"rnode":[6,8],"rnodeconf":16,"rnpath":16,"rnprobe":16,"rnsd":16,"rnsh":16,"rnstatu":16,"rnx":16,"road":1,"roam":18,"role":0,"room":0,"rrc":13,"rule":15,"scarciti":18,"scope":0,"secur":8,"serial":[6,8,16],"serv":5,"server":8,"servic":16,"setup":15,"shell":13,"short":5,"sideband":13,"sign":5,"signal":0,"signatur":5,"sky":18,"sourc":[0,16],"sovereignti":[1,18],"specif":[4,15],"stack":7,"stamp":11,"standalon":4,"standard":0,"start":[1,4],"state":5,"statist":5,"statu":17,"statut":0,"storag":5,"store":18,"strategi":4,"structur":5,"substanc":0,"substitut":0,"support":[6,14],"suprem":6,"surfac":0,"synchron":5,"syntax":5,"system":[13,16,18],"systemwid":16,"t":6,"t114":6,"t3s3":6,"tabl":7,"tcp":8,"telephon":13,"telephoni":13,"templat":5,"thi":0,"through":[1,18],"time":18,"tool":18,"translat":0,"transport":[10,11,15],"trap":0,"triad":0,"trust":18,"trustless":10,"try":4,"tui":13,"tune":8,"two":0,"type":[5,6,11,15,17],"ubuntu":4,"udp":8,"uncentraliz":18,"understand":15,"unsign":6,"us":[0,4,13,15,16,17],"usag":[6,15],"userspac":16,"util":[4,5,13,16],"v":[0,4],"v1":6,"v2":6,"v3":6,"v4":6,"valid":5,"verdict":0,"verif":5,"verifi":5,"versu":0,"vi":0,"voic":13,"void":0,"wa":0,"wai":4,"what":[0,17],"where":17,"which":0,"who":0,"whole":0,"why":0,"wifi":6,"window":4,"wine":0,"wire":15,"without":1,"work":[0,5,18],"workflow":[1,5],"x":6,"xl":6,"your":[4,16],"zen":18,"zero":18}}) \ No newline at end of file +Search.setIndex({"alltitles":{"A Carrier-Grade Fallacy":[[16,"a-carrier-grade-fallacy"]],"API Reference":[[10,null]],"ARM64":[[3,"arm64"]],"AX.25 KISS Interface":[[7,"ax-25-kiss-interface"]],"Accessing Repository Pages":[[4,"accessing-repository-pages"]],"Adding Radio Interfaces":[[3,"adding-radio-interfaces"]],"An Explanation of Reticulum for Human Beings":[[2,null]],"Anchor In The Flow":[[16,"anchor-in-the-flow"]],"Android":[[3,"android"]],"Announce":[[1,"announce"]],"Announce Propagation Rules":[[13,"announce-propagation-rules"]],"Announce Rate Control":[[7,"announce-rate-control"]],"Announcing Presence":[[16,"announcing-presence"]],"Artifact-Centered Workflows":[[0,"artifact-centered-workflows"]],"Author Identity Binding":[[4,"author-identity-binding"]],"Auto Interface":[[7,"auto-interface"]],"Automated Blocking":[[7,"automated-blocking"]],"Automated List Sourcing":[[14,"automated-list-sourcing"]],"Automatic Mirror Synchronization":[[4,"automatic-mirror-synchronization"]],"Backbone Interface":[[7,"backbone-interface"]],"Blackhole Management":[[14,"blackhole-management"]],"Bootstrapping Connectivity":[[3,"bootstrapping-connectivity"]],"Broadcast":[[1,"broadcast"]],"Buffer":[[1,"buffer"]],"Build Personal Infrastructure":[[3,"build-personal-infrastructure"]],"Building Networks":[[9,null]],"Channel":[[1,"channel"]],"Code Examples":[[1,null]],"Combining Hardware Types":[[5,"combining-hardware-types"]],"Command-Line Interaction":[[4,"command-line-interaction"]],"Commit Signing":[[4,"commit-signing"]],"Common Interface Options":[[7,"common-interface-options"]],"Communications Hardware":[[5,null]],"Composable Primitives":[[0,"composable-primitives"]],"Concepts & Overview":[[9,"concepts-overview"]],"Conceptual Overview":[[13,"conceptual-overview"]],"Configuration":[[4,"configuration"],[4,"id1"]],"Configuration & Data":[[14,"configuration-data"]],"Configuration Example":[[4,"configuration-example"]],"Configuration Methods":[[4,"configuration-methods"]],"Configuring Interfaces":[[7,null]],"Connect to the Distributed Backbone":[[3,"connect-to-the-distributed-backbone"]],"Connecting Remotes":[[7,"connecting-remotes"]],"Connecting Reticulum Instances Over the Internet":[[3,"connecting-reticulum-instances-over-the-internet"]],"Contributing to the Global Ret":[[3,"contributing-to-the-global-ret"]],"Cost Of A Byte":[[16,"cost-of-a-byte"]],"Creating Empty Repositories":[[4,"creating-empty-repositories"]],"Creating RNodes":[[5,"creating-rnodes"]],"Creating Signed Releases":[[4,"creating-signed-releases"]],"Creating a Network With Reticulum":[[3,"creating-a-network-with-reticulum"]],"Creating and Using Custom Interfaces":[[3,"creating-and-using-custom-interfaces"]],"Creating and Using a Network Identity":[[13,"creating-and-using-a-network-identity"]],"Creator Permissions":[[4,"creator-permissions"]],"Cryptographic Attribution":[[4,"cryptographic-attribution"]],"Cryptographic Primitives":[[13,"cryptographic-primitives"]],"Current Status":[[15,"current-status"]],"Current Usage":[[13,"current-usage"]],"Custom Interfaces":[[1,"custom-interfaces"],[7,"custom-interfaces"]],"Customizing Templates":[[4,"customizing-templates"]],"Death To The Address":[[16,"death-to-the-address"]],"Debian Bookworm":[[3,"debian-bookworm"]],"Decentralization Or Uncentralizability?":[[16,"decentralization-or-uncentralizability"]],"Design Patterns For Post-IP Systems":[[16,"design-patterns-for-post-ip-systems"]],"Destination Naming":[[13,"destination-naming"]],"Destinations":[[13,"destinations"]],"Destinations, Not Addresses":[[9,"destinations-not-addresses"]],"Develop a Program with Reticulum":[[3,"develop-a-program-with-reticulum"]],"Discoverable Interfaces":[[7,"discoverable-interfaces"]],"Discovering Interfaces":[[14,"discovering-interfaces"]],"Discovery Parameters":[[7,"discovery-parameters"]],"Distributed Development":[[0,null]],"Distribution Without Intermediaries":[[0,"distribution-without-intermediaries"]],"Donations":[[12,"donations"]],"Echo":[[1,"echo"]],"Emergent Patterns":[[16,"emergent-patterns"]],"Enabling Discovery":[[7,"enabling-discovery"]],"Enabling the Git Page Node":[[4,"enabling-the-git-page-node"]],"Encryption Is Not A Feature":[[16,"encryption-is-not-a-feature"]],"Ethernet-based Hardware":[[5,"ethernet-based-hardware"]],"Ethics Of The Tool":[[16,"ethics-of-the-tool"]],"Example Configuration":[[7,"example-configuration"]],"Fabric Of The Independent":[[16,"fabric-of-the-independent"]],"Fallacy Of The Cloud":[[16,"fallacy-of-the-cloud"]],"Filetransfer":[[1,"filetransfer"]],"Finding Your Way":[[3,"finding-your-way"]],"Fixed Serial Port Names":[[14,"fixed-serial-port-names"]],"Flow & Time":[[16,"flow-time"]],"Forking Repositories":[[4,"forking-repositories"]],"Formatting & Syntax Highlighting":[[4,"formatting-syntax-highlighting"]],"Future Implications":[[13,"future-implications"]],"Getting Further":[[13,"getting-further"]],"Getting Started Fast":[[3,null]],"Git Configuration Parameters":[[4,"git-configuration-parameters"]],"Git Over Reticulum":[[4,null]],"Goals":[[13,"goals"]],"Heltec LoRa32 v2.0":[[5,"heltec-lora32-v2-0"]],"Heltec LoRa32 v3.0":[[5,"heltec-lora32-v3-0"]],"Heltec LoRa32 v4.0":[[5,"heltec-lora32-v4-0"]],"Heltec T114":[[5,"heltec-t114"]],"Heterogeneous Connectivity":[[9,"heterogeneous-connectivity"]],"Hostile Environments":[[16,"hostile-environments"]],"Hosting Public Entrypoints":[[3,"hosting-public-entrypoints"]],"I2P Interface":[[7,"i2p-interface"]],"Identification":[[1,"example-identify"]],"Identities":[[13,"understanding-identities"]],"Identity & Destination Aliases":[[4,"identity-destination-aliases"]],"Identity and Nomadism":[[16,"identity-and-nomadism"]],"Improving System Configuration":[[14,"improving-system-configuration"]],"Included Utility Programs":[[14,"included-utility-programs"]],"Indices and Tables":[[6,"indices-and-tables"]],"Installation":[[5,"installation"]],"Interface Access Codes":[[13,"interface-access-codes"]],"Interface Modes":[[7,"interface-modes"],[7,"interfaces-modes"]],"Interface Modules & Connectivity Resources":[[11,"interface-modules-connectivity-resources"]],"Interface Types and Devices":[[15,"interface-types-and-devices"]],"Introduction & Basic Functionality":[[13,"introduction-basic-functionality"]],"Introductory Considerations":[[9,"introductory-considerations"]],"KISS Interface":[[7,"kiss-interface"]],"LXMF":[[11,"lxmf"]],"LXMF Interactive Client":[[11,"lxmf-interactive-client"]],"LXMFy":[[11,"lxmfy"]],"LXST":[[11,"id16"]],"LXST Phone":[[11,"lxst-phone"]],"Liberation From Limits":[[16,"liberation-from-limits"]],"LilyGO LoRa32 v1.0":[[5,"lilygo-lora32-v1-0"]],"LilyGO LoRa32 v2.0":[[5,"lilygo-lora32-v2-0"]],"LilyGO LoRa32 v2.1":[[5,"lilygo-lora32-v2-1"]],"LilyGO T-Beam":[[5,"lilygo-t-beam"]],"LilyGO T-Beam Supreme":[[5,"lilygo-t-beam-supreme"]],"LilyGO T-Deck":[[5,"lilygo-t-deck"]],"LilyGO T-Echo":[[5,"lilygo-t-echo"]],"LilyGO T3S3":[[5,"lilygo-t3s3"]],"Link":[[1,"link"]],"Link Establishment in Detail":[[13,"link-establishment-in-detail"]],"Listeners":[[7,"listeners"]],"Local Blackhole Management":[[14,"local-blackhole-management"]],"Long Archive":[[0,"long-archive"]],"MacOS":[[3,"macos"]],"Managing Group Permissions":[[4,"managing-group-permissions"]],"Managing Repository Permissions":[[4,"managing-repository-permissions"]],"Managing Work Document Permissions":[[4,"managing-work-document-permissions"]],"Manual Synchronization":[[4,"manual-synchronization"]],"Merits Of Scarcity":[[16,"merits-of-scarcity"]],"MeshChatX":[[11,"meshchatx"]],"Micron Parser JS":[[11,"micron-parser-js"]],"Minimal":[[1,"minimal"]],"Mirroring Repositories":[[4,"mirroring-repositories"]],"Mixing Strategies":[[3,"mixing-strategies"]],"Motivation":[[13,"motivation"]],"Naming Is Power":[[16,"naming-is-power"]],"Network Health & Responsibility":[[3,"network-health-responsibility"]],"Network Identities":[[13,"network-identities"]],"New Destination Rate Limiting":[[7,"new-destination-rate-limiting"]],"Node Types":[[13,"node-types"]],"Nomad Network":[[11,"nomad-network"]],"Obtaining Verified Releases":[[4,"obtaining-verified-releases"]],"Offline Verification":[[4,"offline-verification"]],"Open Sky":[[16,"open-sky"]],"OpenCom XL":[[5,"opencom-xl"]],"OpenWRT":[[3,"openwrt"]],"Packet Prioritisation":[[13,"packet-prioritisation"]],"Packet Radio Modems":[[5,"packet-radio-modems"]],"Path Request Burst Control":[[7,"path-request-burst-control"]],"Permission Configuration Locations":[[4,"permission-configuration-locations"]],"Permission Examples":[[4,"permission-examples"]],"Permission Hierarchy":[[4,"permission-hierarchy"]],"Permission Short Forms":[[4,"permission-short-forms"]],"Permission Types":[[4,"permission-types"]],"Permission Validation":[[4,"permission-validation"]],"Permissions":[[4,"permissions"]],"Personal Infrastructure":[[16,"personal-infrastructure"]],"Physics Of Trust":[[16,"physics-of-trust"]],"Pipe Interface":[[7,"pipe-interface"]],"Platform-Specific Install Notes":[[3,"platform-specific-install-notes"]],"Portable Existence":[[16,"portable-existence"]],"Prerequisites":[[4,"prerequisites"]],"Preserving Human Agency":[[16,"preserving-human-agency"]],"Programs & Utilities":[[11,"programs-utilities"]],"Programs Using Reticulum":[[11,null]],"Proposing Work Documents":[[4,"proposing-work-documents"]],"Protocol Specifics":[[13,"protocol-specifics"]],"Protocols":[[11,"protocols"]],"Protocols Over Platforms":[[0,"protocols-over-platforms"]],"Provide Feedback":[[12,"provide-feedback"]],"Public Domain Protocol":[[16,"public-domain-protocol"]],"Public Key Announcements":[[13,"public-key-announcements"]],"Publishing Blackhole Lists":[[14,"publishing-blackhole-lists"]],"Pure-Python Reticulum":[[3,"pure-python-reticulum"]],"RAK4631-based Boards":[[5,"rak4631-based-boards"]],"RBrowser":[[11,"rbrowser"]],"RISC-V":[[3,"risc-v"]],"RNMon":[[11,"rnmon"]],"RNS FileSync":[[11,"rns-filesync"]],"RNS Page Node":[[11,"rns-page-node"]],"RNode":[[5,"rnode"]],"RNode LoRa Interface":[[7,"rnode-lora-interface"]],"RNode Multi Interface":[[7,"rnode-multi-interface"]],"RRC":[[11,"rrc"]],"Raspberry Pi":[[3,"raspberry-pi"]],"Reaching the Destination":[[13,"reaching-the-destination"]],"Reference Implementation":[[15,"reference-implementation"]],"Reference Setup":[[13,"reference-setup"]],"Release Management":[[4,"release-management"]],"Release Storage & Structure":[[4,"release-storage-structure"]],"Remote Management":[[14,"remote-management"]],"Remote Permission Management":[[4,"remote-permission-management"]],"Remote Shell":[[11,"remote-shell"]],"Repository Creation & Management":[[4,"repository-creation-management"]],"Repository Statistics":[[4,"repository-statistics"]],"Repository Structure":[[4,"repository-structure"]],"Requests & Responses":[[1,"requests-responses"]],"Resolving Dependency & Installation Issues":[[3,"resolving-dependency-installation-issues"]],"Resources":[[13,"resources"]],"Restoration":[[0,"restoration"]],"RetiBBS":[[11,"retibbs"]],"Reticulum License":[[8,null]],"Reticulum Network Stack Manual":[[6,null]],"Reticulum Network Telephone":[[11,"reticulum-network-telephone"]],"Reticulum Relay Chat":[[11,"reticulum-relay-chat"]],"Reticulum Transport":[[13,"reticulum-transport"]],"Reticulum as a System Service":[[14,"reticulum-as-a-system-service"]],"Retipedia":[[11,"retipedia"]],"Roaming Nodes":[[16,"roaming-nodes"]],"Security Considerations":[[7,"security-considerations"]],"Serial Interface":[[7,"serial-interface"]],"Serial Lines & Devices":[[5,"serial-lines-devices"]],"Serving Pages Over Nomad Network":[[4,"serving-pages-over-nomad-network"]],"Sideband":[[11,"sideband"]],"Signing Commits":[[4,"signing-commits"]],"Sovereignty Through Infrastructure":[[0,"sovereignty-through-infrastructure"],[16,"sovereignty-through-infrastructure"]],"Standalone Reticulum Installation":[[3,"standalone-reticulum-installation"]],"Start Of The Road":[[0,"start-of-the-road"]],"State Management":[[4,"state-management"]],"Store & Forward":[[16,"store-forward"]],"Support Reticulum":[[12,null]],"Supported Boards and Devices":[[5,"supported-boards-and-devices"]],"Systemwide Service":[[14,"systemwide-service"]],"TCP Client Interface":[[7,"tcp-client-interface"]],"TCP Server Interface":[[7,"tcp-server-interface"]],"Table Of Contents":[[6,"table-of-contents"]],"The Ability To Disconnect":[[16,"the-ability-to-disconnect"]],"The Announce Mechanism in Detail":[[13,"the-announce-mechanism-in-detail"]],"The Bandwidth Fallacy":[[16,"the-bandwidth-fallacy"]],"The Harm Principle":[[16,"the-harm-principle"]],"The Illusion Of The Center":[[16,"the-illusion-of-the-center"]],"The Interface Is The Medium":[[16,"the-interface-is-the-medium"]],"The Original Architecture":[[0,"the-original-architecture"]],"The Platform Interregnum":[[0,"the-platform-interregnum"]],"The Release Workflow":[[4,"the-release-workflow"]],"The Work Is Finished":[[16,"the-work-is-finished"]],"The rncp Utility":[[14,"the-rncp-utility"]],"The rngit Utility":[[4,"the-rngit-utility"],[14,"the-rngit-utility"]],"The rnid Utility":[[14,"the-rnid-utility"]],"The rnodeconf Utility":[[14,"the-rnodeconf-utility"]],"The rnpath Utility":[[14,"the-rnpath-utility"]],"The rnprobe Utility":[[14,"the-rnprobe-utility"]],"The rnsd Utility":[[14,"the-rnsd-utility"]],"The rnsh Utility":[[14,"the-rnsh-utility"]],"The rnstatus Utility":[[14,"the-rnstatus-utility"]],"The rnx Utility":[[14,"the-rnx-utility"]],"Transport Nodes and Instances":[[9,"transport-nodes-and-instances"]],"Trustless Networking":[[9,"trustless-networking"]],"Try Using a Reticulum-based Program":[[3,"try-using-a-reticulum-based-program"]],"Tuning Ingress Queues":[[7,"tuning-ingress-queues"]],"UDP Interface":[[7,"udp-interface"]],"Ubuntu Lunar":[[3,"ubuntu-lunar"]],"Understanding Reticulum":[[13,null]],"Unsigned RNode v2.x":[[5,"unsigned-rnode-v2-x"]],"Usage with Reticulum":[[5,"usage-with-reticulum"]],"Userspace Service":[[14,"userspace-service"]],"Using Reticulum on Your System":[[14,null]],"Using the Included Utilities":[[3,"using-the-included-utilities"]],"Validating Commit Signatures":[[4,"validating-commit-signatures"]],"Verified Releases":[[4,"verified-releases"]],"What does Reticulum Offer?":[[15,"what-does-reticulum-offer"]],"What is Reticulum?":[[15,null]],"Where can Reticulum be Used?":[[15,"where-can-reticulum-be-used"]],"WiFi-based Hardware":[[5,"wifi-based-hardware"]],"Windows":[[3,"windows"]],"Wire Format":[[13,"wire-format"]],"Work Document Permissions":[[4,"work-document-permissions"]],"Work Documents":[[4,"work-documents"]],"Working With Work Documents":[[4,"working-with-work-documents"]],"Zen of Reticulum":[[16,null]],"Zero-Trust Architectures":[[16,"zero-trust-architectures"]]},"docnames":["distributed","examples","forhumans","gettingstartedfast","git","hardware","index","interfaces","license","networks","reference","software","support","understanding","using","whatis","zen"],"envversion":{"sphinx":65,"sphinx.domains.c":3,"sphinx.domains.changeset":1,"sphinx.domains.citation":1,"sphinx.domains.cpp":9,"sphinx.domains.index":1,"sphinx.domains.javascript":3,"sphinx.domains.math":2,"sphinx.domains.python":4,"sphinx.domains.rst":2,"sphinx.domains.std":2},"filenames":["distributed.rst","examples.rst","forhumans.rst","gettingstartedfast.rst","git.rst","hardware.rst","index.rst","interfaces.rst","license.rst","networks.rst","reference.rst","software.rst","support.rst","understanding.rst","using.rst","whatis.rst","zen.rst"],"indexentries":{"__init__() (rns.rawchannelreader method)":[[10,"RNS.RawChannelReader.__init__",false]],"__init__() (rns.rawchannelwriter method)":[[10,"RNS.RawChannelWriter.__init__",false]],"accepts_links() (rns.destination method)":[[10,"RNS.Destination.accepts_links",false]],"add_message_handler() (rns.channel.channel method)":[[10,"RNS.Channel.Channel.add_message_handler",false]],"add_ready_callback() (rns.rawchannelreader method)":[[10,"RNS.RawChannelReader.add_ready_callback",false]],"advertise() (rns.resource method)":[[10,"RNS.Resource.advertise",false]],"announce() (rns.destination method)":[[10,"RNS.Destination.announce",false]],"announce_cap (rns.reticulum attribute)":[[10,"RNS.Reticulum.ANNOUNCE_CAP",false]],"app_and_aspects_from_name() (rns.destination static method)":[[10,"RNS.Destination.app_and_aspects_from_name",false]],"await_path() (rns.transport static method)":[[10,"RNS.Transport.await_path",false]],"blackhole_identity() (rns.transport static method)":[[10,"RNS.Transport.blackhole_identity",false]],"blackhole_sources() (rns.reticulum static method)":[[10,"RNS.Reticulum.blackhole_sources",false]],"buffer (class in rns)":[[10,"RNS.Buffer",false]],"cancel() (rns.resource method)":[[10,"RNS.Resource.cancel",false]],"channel (class in rns.channel)":[[10,"RNS.Channel.Channel",false]],"clear_default_app_data() (rns.destination method)":[[10,"RNS.Destination.clear_default_app_data",false]],"concluded() (rns.requestreceipt method)":[[10,"RNS.RequestReceipt.concluded",false]],"create_bidirectional_buffer() (rns.buffer static method)":[[10,"RNS.Buffer.create_bidirectional_buffer",false]],"create_keys() (rns.destination method)":[[10,"RNS.Destination.create_keys",false]],"create_reader() (rns.buffer static method)":[[10,"RNS.Buffer.create_reader",false]],"create_writer() (rns.buffer static method)":[[10,"RNS.Buffer.create_writer",false]],"current_ratchet_id() (rns.identity static method)":[[10,"RNS.Identity.current_ratchet_id",false]],"curve (rns.identity attribute)":[[10,"RNS.Identity.CURVE",false]],"curve (rns.link attribute)":[[10,"RNS.Link.CURVE",false]],"decrypt() (rns.destination method)":[[10,"RNS.Destination.decrypt",false]],"decrypt() (rns.identity method)":[[10,"RNS.Identity.decrypt",false]],"default_per_hop_timeout (rns.reticulum attribute)":[[10,"RNS.Reticulum.DEFAULT_PER_HOP_TIMEOUT",false]],"deregister_announce_handler() (rns.transport static method)":[[10,"RNS.Transport.deregister_announce_handler",false]],"deregister_request_handler() (rns.destination method)":[[10,"RNS.Destination.deregister_request_handler",false]],"destination (class in rns)":[[10,"RNS.Destination",false]],"discovered_interfaces() (rns.reticulum static method)":[[10,"RNS.Reticulum.discovered_interfaces",false]],"enable_ratchets() (rns.destination method)":[[10,"RNS.Destination.enable_ratchets",false]],"encrypt() (rns.destination method)":[[10,"RNS.Destination.encrypt",false]],"encrypt() (rns.identity method)":[[10,"RNS.Identity.encrypt",false]],"encrypted_mdu (rns.packet attribute)":[[10,"RNS.Packet.ENCRYPTED_MDU",false]],"enforce_ratchets() (rns.destination method)":[[10,"RNS.Destination.enforce_ratchets",false]],"establishment_timeout_per_hop (rns.link attribute)":[[10,"RNS.Link.ESTABLISHMENT_TIMEOUT_PER_HOP",false]],"expand_name() (rns.destination static method)":[[10,"RNS.Destination.expand_name",false]],"from_bytes() (rns.identity static method)":[[10,"RNS.Identity.from_bytes",false]],"from_file() (rns.identity static method)":[[10,"RNS.Identity.from_file",false]],"full_hash() (rns.identity static method)":[[10,"RNS.Identity.full_hash",false]],"get_age() (rns.link method)":[[10,"RNS.Link.get_age",false]],"get_channel() (rns.link method)":[[10,"RNS.Link.get_channel",false]],"get_data_size() (rns.resource method)":[[10,"RNS.Resource.get_data_size",false]],"get_establishment_rate() (rns.link method)":[[10,"RNS.Link.get_establishment_rate",false]],"get_expected_rate() (rns.link method)":[[10,"RNS.Link.get_expected_rate",false]],"get_first_hop_timeout() (rns.reticulum method)":[[10,"RNS.Reticulum.get_first_hop_timeout",false]],"get_hash() (rns.resource method)":[[10,"RNS.Resource.get_hash",false]],"get_instance() (rns.reticulum static method)":[[10,"RNS.Reticulum.get_instance",false]],"get_lowest_interface_bitrate() (rns.reticulum method)":[[10,"RNS.Reticulum.get_lowest_interface_bitrate",false]],"get_mdu() (rns.link method)":[[10,"RNS.Link.get_mdu",false]],"get_medium_path_timeout() (rns.reticulum method)":[[10,"RNS.Reticulum.get_medium_path_timeout",false]],"get_mode() (rns.link method)":[[10,"RNS.Link.get_mode",false]],"get_mtu() (rns.link method)":[[10,"RNS.Link.get_mtu",false]],"get_parts() (rns.resource method)":[[10,"RNS.Resource.get_parts",false]],"get_private_key() (rns.destination method)":[[10,"RNS.Destination.get_private_key",false]],"get_private_key() (rns.identity method)":[[10,"RNS.Identity.get_private_key",false]],"get_progress() (rns.requestreceipt method)":[[10,"RNS.RequestReceipt.get_progress",false]],"get_progress() (rns.resource method)":[[10,"RNS.Resource.get_progress",false]],"get_public_key() (rns.identity method)":[[10,"RNS.Identity.get_public_key",false]],"get_q() (rns.link method)":[[10,"RNS.Link.get_q",false]],"get_q() (rns.packet method)":[[10,"RNS.Packet.get_q",false]],"get_random_hash() (rns.identity static method)":[[10,"RNS.Identity.get_random_hash",false]],"get_remote_identity() (rns.link method)":[[10,"RNS.Link.get_remote_identity",false]],"get_request_id() (rns.requestreceipt method)":[[10,"RNS.RequestReceipt.get_request_id",false]],"get_response() (rns.requestreceipt method)":[[10,"RNS.RequestReceipt.get_response",false]],"get_response_time() (rns.requestreceipt method)":[[10,"RNS.RequestReceipt.get_response_time",false]],"get_rssi() (rns.link method)":[[10,"RNS.Link.get_rssi",false]],"get_rssi() (rns.packet method)":[[10,"RNS.Packet.get_rssi",false]],"get_rtt() (rns.packetreceipt method)":[[10,"RNS.PacketReceipt.get_rtt",false]],"get_segments() (rns.resource method)":[[10,"RNS.Resource.get_segments",false]],"get_snr() (rns.link method)":[[10,"RNS.Link.get_snr",false]],"get_snr() (rns.packet method)":[[10,"RNS.Packet.get_snr",false]],"get_status() (rns.packetreceipt method)":[[10,"RNS.PacketReceipt.get_status",false]],"get_status() (rns.requestreceipt method)":[[10,"RNS.RequestReceipt.get_status",false]],"get_transfer_size() (rns.resource method)":[[10,"RNS.Resource.get_transfer_size",false]],"has_path() (rns.transport static method)":[[10,"RNS.Transport.has_path",false]],"hash() (rns.destination static method)":[[10,"RNS.Destination.hash",false]],"hash_from_name_and_identity() (rns.destination static method)":[[10,"RNS.Destination.hash_from_name_and_identity",false]],"hops_to() (rns.transport static method)":[[10,"RNS.Transport.hops_to",false]],"identify() (rns.link method)":[[10,"RNS.Link.identify",false]],"identity (class in rns)":[[10,"RNS.Identity",false]],"inactive_for() (rns.link method)":[[10,"RNS.Link.inactive_for",false]],"interface_discovery_sources() (rns.reticulum static method)":[[10,"RNS.Reticulum.interface_discovery_sources",false]],"is_compressed() (rns.resource method)":[[10,"RNS.Resource.is_compressed",false]],"is_ready_to_send() (rns.channel.channel method)":[[10,"RNS.Channel.Channel.is_ready_to_send",false]],"keepalive (rns.link attribute)":[[10,"RNS.Link.KEEPALIVE",false]],"keepalive_timeout_factor (rns.link attribute)":[[10,"RNS.Link.KEEPALIVE_TIMEOUT_FACTOR",false]],"keysize (rns.identity attribute)":[[10,"RNS.Identity.KEYSIZE",false]],"link (class in rns)":[[10,"RNS.Link",false]],"link_mtu_discovery (rns.reticulum attribute)":[[10,"RNS.Reticulum.LINK_MTU_DISCOVERY",false]],"link_mtu_discovery() (rns.reticulum static method)":[[10,"RNS.Reticulum.link_mtu_discovery",false]],"load_private_key() (rns.destination method)":[[10,"RNS.Destination.load_private_key",false]],"load_private_key() (rns.identity method)":[[10,"RNS.Identity.load_private_key",false]],"load_public_key() (rns.identity method)":[[10,"RNS.Identity.load_public_key",false]],"mdu (rns.channel.channel property)":[[10,"RNS.Channel.Channel.mdu",false]],"messagebase (class in rns)":[[10,"RNS.MessageBase",false]],"minimum_bitrate (rns.reticulum attribute)":[[10,"RNS.Reticulum.MINIMUM_BITRATE",false]],"msgtype (rns.messagebase attribute)":[[10,"RNS.MessageBase.MSGTYPE",false]],"mtu (rns.reticulum attribute)":[[10,"RNS.Reticulum.MTU",false]],"next_hop() (rns.transport static method)":[[10,"RNS.Transport.next_hop",false]],"next_hop_interface() (rns.transport static method)":[[10,"RNS.Transport.next_hop_interface",false]],"no_data_for() (rns.link method)":[[10,"RNS.Link.no_data_for",false]],"no_inbound_for() (rns.link method)":[[10,"RNS.Link.no_inbound_for",false]],"no_outbound_for() (rns.link method)":[[10,"RNS.Link.no_outbound_for",false]],"pack() (rns.messagebase method)":[[10,"RNS.MessageBase.pack",false]],"packet (class in rns)":[[10,"RNS.Packet",false]],"packetreceipt (class in rns)":[[10,"RNS.PacketReceipt",false]],"pathfinder_m (rns.transport attribute)":[[10,"RNS.Transport.PATHFINDER_M",false]],"plain_mdu (rns.packet attribute)":[[10,"RNS.Packet.PLAIN_MDU",false]],"pub_to_file() (rns.identity method)":[[10,"RNS.Identity.pub_to_file",false]],"publish_blackhole_enabled() (rns.reticulum static method)":[[10,"RNS.Reticulum.publish_blackhole_enabled",false]],"ratchet_count (rns.destination attribute)":[[10,"RNS.Destination.RATCHET_COUNT",false]],"ratchet_expiry (rns.identity attribute)":[[10,"RNS.Identity.RATCHET_EXPIRY",false]],"ratchet_interval (rns.destination attribute)":[[10,"RNS.Destination.RATCHET_INTERVAL",false]],"ratchetsize (rns.identity attribute)":[[10,"RNS.Identity.RATCHETSIZE",false]],"rawchannelreader (class in rns)":[[10,"RNS.RawChannelReader",false]],"rawchannelwriter (class in rns)":[[10,"RNS.RawChannelWriter",false]],"recall() (rns.identity static method)":[[10,"RNS.Identity.recall",false]],"recall_app_data() (rns.identity static method)":[[10,"RNS.Identity.recall_app_data",false]],"register_announce_handler() (rns.transport static method)":[[10,"RNS.Transport.register_announce_handler",false]],"register_message_type() (rns.channel.channel method)":[[10,"RNS.Channel.Channel.register_message_type",false]],"register_request_handler() (rns.destination method)":[[10,"RNS.Destination.register_request_handler",false]],"remote_management_enabled() (rns.reticulum static method)":[[10,"RNS.Reticulum.remote_management_enabled",false]],"remove_message_handler() (rns.channel.channel method)":[[10,"RNS.Channel.Channel.remove_message_handler",false]],"remove_ready_callback() (rns.rawchannelreader method)":[[10,"RNS.RawChannelReader.remove_ready_callback",false]],"request() (rns.link method)":[[10,"RNS.Link.request",false]],"request_path() (rns.transport static method)":[[10,"RNS.Transport.request_path",false]],"requestreceipt (class in rns)":[[10,"RNS.RequestReceipt",false]],"required_discovery_value() (rns.reticulum static method)":[[10,"RNS.Reticulum.required_discovery_value",false]],"resend() (rns.packet method)":[[10,"RNS.Packet.resend",false]],"resource (class in rns)":[[10,"RNS.Resource",false]],"reticulum (class in rns)":[[10,"RNS.Reticulum",false]],"send() (rns.channel.channel method)":[[10,"RNS.Channel.Channel.send",false]],"send() (rns.packet method)":[[10,"RNS.Packet.send",false]],"set_default_app_data() (rns.destination method)":[[10,"RNS.Destination.set_default_app_data",false]],"set_delivery_callback() (rns.packetreceipt method)":[[10,"RNS.PacketReceipt.set_delivery_callback",false]],"set_link_closed_callback() (rns.link method)":[[10,"RNS.Link.set_link_closed_callback",false]],"set_link_established_callback() (rns.destination method)":[[10,"RNS.Destination.set_link_established_callback",false]],"set_max_request_size() (rns.destination method)":[[10,"RNS.Destination.set_max_request_size",false]],"set_packet_callback() (rns.destination method)":[[10,"RNS.Destination.set_packet_callback",false]],"set_packet_callback() (rns.link method)":[[10,"RNS.Link.set_packet_callback",false]],"set_proof_requested_callback() (rns.destination method)":[[10,"RNS.Destination.set_proof_requested_callback",false]],"set_proof_strategy() (rns.destination method)":[[10,"RNS.Destination.set_proof_strategy",false]],"set_ratchet_interval() (rns.destination method)":[[10,"RNS.Destination.set_ratchet_interval",false]],"set_remote_identified_callback() (rns.link method)":[[10,"RNS.Link.set_remote_identified_callback",false]],"set_resource_callback() (rns.link method)":[[10,"RNS.Link.set_resource_callback",false]],"set_resource_concluded_callback() (rns.link method)":[[10,"RNS.Link.set_resource_concluded_callback",false]],"set_resource_started_callback() (rns.link method)":[[10,"RNS.Link.set_resource_started_callback",false]],"set_resource_strategy() (rns.link method)":[[10,"RNS.Link.set_resource_strategy",false]],"set_retained_ratchets() (rns.destination method)":[[10,"RNS.Destination.set_retained_ratchets",false]],"set_timeout() (rns.packetreceipt method)":[[10,"RNS.PacketReceipt.set_timeout",false]],"set_timeout_callback() (rns.packetreceipt method)":[[10,"RNS.PacketReceipt.set_timeout_callback",false]],"should_use_implicit_proof() (rns.reticulum static method)":[[10,"RNS.Reticulum.should_use_implicit_proof",false]],"sign() (rns.destination method)":[[10,"RNS.Destination.sign",false]],"sign() (rns.identity method)":[[10,"RNS.Identity.sign",false]],"stale_grace (rns.link attribute)":[[10,"RNS.Link.STALE_GRACE",false]],"stale_time (rns.link attribute)":[[10,"RNS.Link.STALE_TIME",false]],"teardown() (rns.link method)":[[10,"RNS.Link.teardown",false]],"to_file() (rns.identity method)":[[10,"RNS.Identity.to_file",false]],"track_phy_stats() (rns.link method)":[[10,"RNS.Link.track_phy_stats",false]],"transport (class in rns)":[[10,"RNS.Transport",false]],"transport_enabled() (rns.reticulum static method)":[[10,"RNS.Reticulum.transport_enabled",false]],"truncated_hash() (rns.identity static method)":[[10,"RNS.Identity.truncated_hash",false]],"truncated_hashlength (rns.identity attribute)":[[10,"RNS.Identity.TRUNCATED_HASHLENGTH",false]],"unblackhole_identity() (rns.transport static method)":[[10,"RNS.Transport.unblackhole_identity",false]],"unpack() (rns.messagebase method)":[[10,"RNS.MessageBase.unpack",false]],"validate() (rns.identity method)":[[10,"RNS.Identity.validate",false]]},"objects":{"RNS":[[10,0,1,"","Buffer"],[10,0,1,"","Destination"],[10,0,1,"","Identity"],[10,0,1,"","Link"],[10,0,1,"","MessageBase"],[10,0,1,"","Packet"],[10,0,1,"","PacketReceipt"],[10,0,1,"","RawChannelReader"],[10,0,1,"","RawChannelWriter"],[10,0,1,"","RequestReceipt"],[10,0,1,"","Resource"],[10,0,1,"","Reticulum"],[10,0,1,"","Transport"]],"RNS.Buffer":[[10,1,1,"","create_bidirectional_buffer"],[10,1,1,"","create_reader"],[10,1,1,"","create_writer"]],"RNS.Channel":[[10,0,1,"","Channel"]],"RNS.Channel.Channel":[[10,1,1,"","add_message_handler"],[10,1,1,"","is_ready_to_send"],[10,2,1,"","mdu"],[10,1,1,"","register_message_type"],[10,1,1,"","remove_message_handler"],[10,1,1,"","send"]],"RNS.Destination":[[10,3,1,"","RATCHET_COUNT"],[10,3,1,"","RATCHET_INTERVAL"],[10,1,1,"","accepts_links"],[10,1,1,"","announce"],[10,1,1,"","app_and_aspects_from_name"],[10,1,1,"","clear_default_app_data"],[10,1,1,"","create_keys"],[10,1,1,"","decrypt"],[10,1,1,"","deregister_request_handler"],[10,1,1,"","enable_ratchets"],[10,1,1,"","encrypt"],[10,1,1,"","enforce_ratchets"],[10,1,1,"","expand_name"],[10,1,1,"","get_private_key"],[10,1,1,"","hash"],[10,1,1,"","hash_from_name_and_identity"],[10,1,1,"","load_private_key"],[10,1,1,"","register_request_handler"],[10,1,1,"","set_default_app_data"],[10,1,1,"","set_link_established_callback"],[10,1,1,"","set_max_request_size"],[10,1,1,"","set_packet_callback"],[10,1,1,"","set_proof_requested_callback"],[10,1,1,"","set_proof_strategy"],[10,1,1,"","set_ratchet_interval"],[10,1,1,"","set_retained_ratchets"],[10,1,1,"","sign"]],"RNS.Identity":[[10,3,1,"","CURVE"],[10,3,1,"","KEYSIZE"],[10,3,1,"","RATCHETSIZE"],[10,3,1,"","RATCHET_EXPIRY"],[10,3,1,"","TRUNCATED_HASHLENGTH"],[10,1,1,"","current_ratchet_id"],[10,1,1,"","decrypt"],[10,1,1,"","encrypt"],[10,1,1,"","from_bytes"],[10,1,1,"","from_file"],[10,1,1,"","full_hash"],[10,1,1,"","get_private_key"],[10,1,1,"","get_public_key"],[10,1,1,"","get_random_hash"],[10,1,1,"","load_private_key"],[10,1,1,"","load_public_key"],[10,1,1,"","pub_to_file"],[10,1,1,"","recall"],[10,1,1,"","recall_app_data"],[10,1,1,"","sign"],[10,1,1,"","to_file"],[10,1,1,"","truncated_hash"],[10,1,1,"","validate"]],"RNS.Link":[[10,3,1,"","CURVE"],[10,3,1,"","ESTABLISHMENT_TIMEOUT_PER_HOP"],[10,3,1,"","KEEPALIVE"],[10,3,1,"","KEEPALIVE_TIMEOUT_FACTOR"],[10,3,1,"","STALE_GRACE"],[10,3,1,"","STALE_TIME"],[10,1,1,"","get_age"],[10,1,1,"","get_channel"],[10,1,1,"","get_establishment_rate"],[10,1,1,"","get_expected_rate"],[10,1,1,"","get_mdu"],[10,1,1,"","get_mode"],[10,1,1,"","get_mtu"],[10,1,1,"","get_q"],[10,1,1,"","get_remote_identity"],[10,1,1,"","get_rssi"],[10,1,1,"","get_snr"],[10,1,1,"","identify"],[10,1,1,"","inactive_for"],[10,1,1,"","no_data_for"],[10,1,1,"","no_inbound_for"],[10,1,1,"","no_outbound_for"],[10,1,1,"","request"],[10,1,1,"","set_link_closed_callback"],[10,1,1,"","set_packet_callback"],[10,1,1,"","set_remote_identified_callback"],[10,1,1,"","set_resource_callback"],[10,1,1,"","set_resource_concluded_callback"],[10,1,1,"","set_resource_started_callback"],[10,1,1,"","set_resource_strategy"],[10,1,1,"","teardown"],[10,1,1,"","track_phy_stats"]],"RNS.MessageBase":[[10,3,1,"","MSGTYPE"],[10,1,1,"","pack"],[10,1,1,"","unpack"]],"RNS.Packet":[[10,3,1,"","ENCRYPTED_MDU"],[10,3,1,"","PLAIN_MDU"],[10,1,1,"","get_q"],[10,1,1,"","get_rssi"],[10,1,1,"","get_snr"],[10,1,1,"","resend"],[10,1,1,"","send"]],"RNS.PacketReceipt":[[10,1,1,"","get_rtt"],[10,1,1,"","get_status"],[10,1,1,"","set_delivery_callback"],[10,1,1,"","set_timeout"],[10,1,1,"","set_timeout_callback"]],"RNS.RawChannelReader":[[10,1,1,"","__init__"],[10,1,1,"","add_ready_callback"],[10,1,1,"","remove_ready_callback"]],"RNS.RawChannelWriter":[[10,1,1,"","__init__"]],"RNS.RequestReceipt":[[10,1,1,"","concluded"],[10,1,1,"","get_progress"],[10,1,1,"","get_request_id"],[10,1,1,"","get_response"],[10,1,1,"","get_response_time"],[10,1,1,"","get_status"]],"RNS.Resource":[[10,1,1,"","advertise"],[10,1,1,"","cancel"],[10,1,1,"","get_data_size"],[10,1,1,"","get_hash"],[10,1,1,"","get_parts"],[10,1,1,"","get_progress"],[10,1,1,"","get_segments"],[10,1,1,"","get_transfer_size"],[10,1,1,"","is_compressed"]],"RNS.Reticulum":[[10,3,1,"","ANNOUNCE_CAP"],[10,3,1,"","DEFAULT_PER_HOP_TIMEOUT"],[10,3,1,"","LINK_MTU_DISCOVERY"],[10,3,1,"","MINIMUM_BITRATE"],[10,3,1,"","MTU"],[10,1,1,"","blackhole_sources"],[10,1,1,"","discovered_interfaces"],[10,1,1,"","get_first_hop_timeout"],[10,1,1,"","get_instance"],[10,1,1,"","get_lowest_interface_bitrate"],[10,1,1,"","get_medium_path_timeout"],[10,1,1,"","interface_discovery_sources"],[10,1,1,"","link_mtu_discovery"],[10,1,1,"","publish_blackhole_enabled"],[10,1,1,"","remote_management_enabled"],[10,1,1,"","required_discovery_value"],[10,1,1,"","should_use_implicit_proof"],[10,1,1,"","transport_enabled"]],"RNS.Transport":[[10,3,1,"","PATHFINDER_M"],[10,1,1,"","await_path"],[10,1,1,"","blackhole_identity"],[10,1,1,"","deregister_announce_handler"],[10,1,1,"","has_path"],[10,1,1,"","hops_to"],[10,1,1,"","next_hop"],[10,1,1,"","next_hop_interface"],[10,1,1,"","register_announce_handler"],[10,1,1,"","request_path"],[10,1,1,"","unblackhole_identity"]]},"objnames":{"0":["py","class","Python class"],"1":["py","method","Python method"],"2":["py","property","Python property"],"3":["py","attribute","Python attribute"]},"objtypes":{"0":"py:class","1":"py:method","2":"py:property","3":"py:attribute"},"terms":{"":[0,1,3,4,7,9,10,13,14,15,16],"0":[1,3,4,7,10,13,14,15],"00":[4,13,14],"00000000":13,"00000100":13,"00000111":13,"01":[4,13],"0100":4,"01010000":13,"02":3,"03":4,"04":4,"05":[1,4],"0536":14,"06915":7,"08":[1,14],"09":4,"0d7334d411d00120cbad24edf355fdd2":4,"0f4259fef4521ab75a3409e353fe9073eb10783b4912a6a9937c57bf44a62c1":14,"0x0101":1,"0x20":1,"0x7d":1,"0x7e":1,"0x91c421ddfb8a30a49a71d63447ddb54cebe3465":12,"0xf000":[1,10],"1":[1,3,4,7,10,13,14,16],"10":[4,7,13,14],"100":[1,7,13],"1000":1,"10000000":13,"1024":[1,7],"109":16,"11":[4,13],"115":13,"115200":[1,7,14],"1178a8f1fad405bf2ad153bf5036bdfd":14,"118":7,"12":[3,4,7,14],"1200":13,"125":7,"125000":7,"127":7,"128":[7,9,10,13],"13":14,"13425ec15b621c1d928589718000d814":[9,13],"14":[4,7],"15":[4,7],"150":[7,14],"150m":7,"153cb870b4665b8c1c348896292b0bad":4,"15kb":16,"15m":14,"16":[4,7,9,13,14,16],"1625":7,"1625000":7,"167":13,"168":16,"17":14,"1716230400":4,"1726dbad538775b5bf9b0ea25a4079c8":14,"18":[4,14],"1800":10,"187":14,"192":16,"1a54d64db7e8beca6f2c6cd17b0cb479":4,"1b03013c25f1c2ca068a4f080b844a10":14,"1h":14,"2":[1,3,4,7,10,13,14],"20":[4,7,13,14],"200":[7,14],"2005":0,"201":7,"2016":[8,15],"2023":[3,14],"2024":4,"2025":4,"2026":[4,8,16],"21":3,"21a8daa6d9c3d3b8aab6e94b6bcb0e33":4,"22":[4,7],"2225fdeecaf6e2db4556c3c2d7637294":14,"23":[4,14],"2316":14,"23h":14,"24":[4,7,14],"2400000000":7,"25":[1,6,15],"250":16,"255":[7,14],"25519":10,"256":[4,7,9,10,13,14,15],"2592000":10,"27":14,"29":7,"297":[13,15],"29716":7,"2b489d06eaf7c543808c76a5332a447d":14,"2b9ec651326d9bc274119054c70fb75":14,"2d03725b327348980d570f739a3a5708":14,"2d882c5586e548d79b5af27bca1776dc":14,"2f":1,"2owjajquafianpecac":3,"3":[1,3,4,7,13,14,15],"30":[4,7,10,14],"30602def3b3506a28ed33db6f60cc6c9":14,"32":[3,4,10,13],"3278":7,"327c1b2f87c9353e01769b01090b18f2":16,"32m":14,"33":7,"34":[7,16],"360":[4,7,10],"3600":[1,3,7],"37":4,"37428":14,"37429":14,"38":[4,14],"383":10,"3865":14,"399ea050ce0eed1816c300bcb0840938":14,"3a4f8b9c1d2e3f4g5h6i7j8k9l0m1n2o":14,"3b87":7,"4":[4,10,13,14],"40m":14,"42":4,"4242":[3,7],"4251":7,"42671":7,"430":13,"4343":7,"44":15,"44318":7,"45":[1,4,13],"46":14,"464":10,"465":13,"469":14,"48555":7,"49":14,"49555":7,"4965":14,"4e":7,"4faf1b2e0a077e6a9d92fa051f256038":13,"4g":16,"4ghz":7,"5":[1,4,7,10,13,14,15,16],"500":[7,10,13,15,16],"5001":7,"50824b711717f97c2fb1166ceddd5ea9":4,"51":[7,13],"512":[7,10,13,15],"52":14,"521c87a83afb8f29e4455e77930b973b":14,"5245a8efe1788c6a1cd36144a270e13b":14,"53":4,"55":7,"56":14,"564":1,"56m":14,"5757":7,"5858":7,"59":14,"5caf":7,"5d78":7,"5urvjicpzi7q3ybztsef4i5ow2aq4soktfj7zedz53s47r54jnqq":7,"6":[3,4,7,10,14],"60":[1,7,14],"600":7,"63":14,"64":[3,13,14],"68a4aa91ac350c4087564e8a69f84e86":14,"7":[3,7,13,14],"71":16,"71e5":7,"72":7,"720":[7,10],"7200":7,"73":[7,14],"73cbd378bb0286ed11a707c13447bb1":14,"74":14,"74195":7,"781":14,"7822":14,"7a55144adf826958a9529a3bcf08b149":14,"8":[1,7,14],"80":[12,14],"8001":7,"809":14,"83":[13,14],"83b7328926fed0d2e6a10a7671f9e237":16,"84fpy1qbxhcgdseepynmhthcrgmx4nffbytz2gkytoqhvvhjp8eaw1z1eedrnkd19b3b8nilcgvxzkv17ummmeescrpya5w":12,"86":14,"865":7,"865600000":7,"867":7,"867200000":7,"868":13,"88":7,"89":7,"8a37cdd16938ce79861561adbd59023a":4,"8dd57a738226809646089335a6b03695":14,"8f3a21c9d84e927b":4,"8f7e6d5":4,"8f7e6d5c8f7e6d5c8f7e6d5c8f7e6d5c8f7e6d5":4,"9":[3,4,14],"90":4,"900":[13,14],"9037":14,"921600":14,"941bed5e228775e5a8079fc38b1ccf3f":14,"959e10e5efc1bd9d97a4083babe51dea":4,"96":13,"9600":1,"9710b86":4,"9710b86ba12c42d1d8f30f74fe509286":4,"9710b86ba12c4f2":4,"984b74a3f768bef236af4371e6f248cd":14,"99":13,"99714":7,"9a":4,"9fb6d773498fb3feda407ed8ef2c3229":14,"9h":14,"A":[0,1,3,4,6,7,8,9,10,11,13,14],"AND":8,"AS":8,"And":[0,1,16],"As":[0,3,4,5,7,10,11,12,13,14,15],"At":[3,13],"BE":8,"BUT":8,"Be":[4,10,14,16],"But":[0,12,13,16],"By":[0,1,3,4,7,10,13,14,16],"FOR":8,"For":[0,3,4,6,7,9,10,13,14,15],"IN":[1,8,10],"If":[0,1,3,4,5,7,9,10,11,12,13,14,15,16],"In":[0,1,3,4,5,6,7,9,10,11,13,14,15],"It":[0,1,3,4,5,7,9,10,11,13,14,15,16],"NO":8,"NOT":8,"No":[1,3,7,9,13,14,15,16],"Not":6,"OF":8,"OR":8,"Of":[9,13],"On":[0,1,3,4,7,9,14,16],"One":[3,4,5,7,10,13,16],"Or":[4,6,7,13,14,15],"Such":[0,7],"THE":8,"TO":8,"That":[0,4,11,13,16],"The":[1,3,5,6,7,8,9,10,11,12,15],"Then":[0,1,3],"There":[0,3,9,13,14,16],"These":[0,3,4,7,9,10,11,13,14],"To":[1,3,4,5,6,7,9,13,14,15],"WITH":8,"Will":10,"With":[0,6,7,9,11,13,14,16],"_":13,"__":13,"______":13,"_______":13,"________":13,"________________":13,"__future__":1,"__init__":[1,10],"__main__":1,"__name__":1,"__str__":1,"_no_us":10,"a1b2c3d4e5f686ba12c42d1ba12ef1aa":4,"a4d":7,"a79f":7,"aarch64":3,"ab":1,"abandon":0,"abc":4,"abil":[0,3,4,5,6,8,14,15],"abl":[0,1,3,4,7,10,13,14],"abolish":16,"abort":[0,1,4,7],"about":[1,3,4,5,7,9,10,13,14,16],"abov":[3,4,5,7,8,13,14],"absolut":[7,12,15,16],"abstract":[9,10,13,16],"abstractmethod":10,"abund":[5,16],"abus":14,"academ":0,"accept":[0,4,7,10,12,13,14,16],"accept_al":[1,10],"accept_app":10,"accept_non":10,"accepts_link":10,"access":[0,3,6,7,9,10,14,16],"access_point":[7,9],"accid":[11,16],"accommod":[10,13],"accomod":16,"accord":[1,3,4,9,13],"accordingli":[1,7],"account":[0,9,10,16],"achiev":[0,3,7,9,10,13,15],"acknowledg":[9,15],"across":[0,1,4,5,7,9,10,13,14,16],"act":[0,3,7,10,13,14,16],"action":[0,1,8,14],"activ":[0,1,3,4,7,10,13,14],"actor":[0,13,14,16],"actual":[0,1,3,4,7,9,13,14,16],"ad":[0,1,4,5,6,7,9,10,11,13,14,15,16],"adapt":[3,5,16],"add":[0,1,3,4,7,9,10,14],"add_argu":1,"add_message_handl":[1,10],"add_ready_callback":10,"addict":16,"addit":[4,5,7,9,10,11,13,14,15],"addition":[3,4,5,7,13],"addr":14,"address":[0,1,3,4,6,7,10,13,14,15],"adher":[7,10],"adjust":[3,4,10,14,16],"adm":4,"admin":[4,7],"administ":4,"administr":[4,9,11,13,14,16],"adopt":13,"adress":[10,13],"advanc":[11,13],"advantag":10,"advers":15,"adversari":[3,9,12,16],"advertis":[1,7,10],"advic":12,"advis":[7,13],"ae":[10,13,15],"af73":7,"affect":[3,7,16],"affili":[0,11],"affin":7,"afford":9,"after":[1,3,4,7,9,10,13,14],"afterthought":16,"ag":0,"again":[7,13,14],"against":[0,3,4,7,13,16],"agenc":[6,13],"agent":[13,16],"agnost":[9,13],"agnostic":[13,16],"ago":14,"agreement":[0,16],"ahead":9,"ai":16,"aim":[0,3,6,13],"air":[3,5],"airmax":5,"airtim":[7,9,16],"airtime_limit_long":7,"airtime_limit_short":7,"akin":13,"algorithm":[0,8,9,16],"alia":4,"alias":6,"aliased_nam":4,"alic":[4,13],"alien":16,"align":[3,14,16],"aliv":[10,13],"all":[0,1,3,4,5,6,7,8,9,10,11,12,13,14,15,16],"allevi":5,"alloc":[7,9,10,13,14],"allow":[0,1,3,4,5,7,9,10,11,13,14,15,16],"allow_al":[1,10],"allow_list":10,"allow_non":10,"allowed_hash":14,"allowed_ident":14,"allowed_list":10,"allowedsignersfil":4,"almost":[0,5,7,13,14,16],"alon":7,"along":[4,7,10,13,14],"alongsid":[4,9],"alreadi":[1,3,4,5,9,10,11,13,14,16],"also":[0,1,3,4,5,6,7,9,10,11,13,14,15,16],"alter":[3,10,13],"altern":[1,3,4,7,14],"although":[3,13,15],"altitud":7,"alwai":[0,3,4,7,9,10,13,14,16],"am":16,"amateur":[7,15],"among":[0,16],"amongst":8,"amount":[1,7,9,10,13,15,16],"amplifi":0,"amsterdam":[7,14],"an":[0,1,3,4,5,7,8,9,10,11,13,14,15,16],"analog":[11,16],"analysi":[0,4],"analyt":12,"analyz":0,"anchor":6,"android":[6,7,11,14],"ani":[0,1,3,4,5,7,8,9,10,11,12,13,14,15],"annonuc":7,"annot":1,"annouce_cap":7,"announc":[3,4,6,9,10,11,14],"announce_cap":[7,10],"announce_handl":1,"announce_interv":[4,7],"announce_packet_hash":10,"announce_rate_grac":[3,7],"announce_rate_penalti":[3,7],"announce_rate_target":[3,7],"announced_ident":[1,10],"announceloop":1,"announces_from_intern":7,"announces_to_intern":7,"announcesampl":1,"annoy":14,"anonym":[3,9,10,13,15],"anoth":[4,7,9,10,13,14,16],"answer":[13,14,16],"antenna":[5,16],"anticip":4,"anxieti":16,"anymor":[3,16],"anyon":[0,1,3,4,5,7,9,10,13,14,16],"anyth":[0,4,5,7,11,13,14,15,16],"anywai":7,"anywher":[0,1,7,16],"ap":7,"api":[3,4,6,13,15,16],"apk":3,"app":[1,3,10,13,16],"app_and_aspects_from_nam":10,"app_data":[1,10],"app_nam":[1,10],"app_timeout":1,"appar":0,"appear":16,"append":[1,13,14],"appli":[0,4,7,10,13,16],"applic":[0,1,7,9,10,11,13,14,15,16],"appreci":4,"approach":[0,3,5,9,13,14],"appropri":[0,4,7,9,16],"approv":[0,9,13,16],"approxim":[7,14],"april":3,"apt":3,"ar":[0,1,3,4,5,7,9,10,11,12,13,14,15,16],"arbit":16,"arbitrari":[4,10,13,14,15],"arch":[3,16],"architect":[12,16],"architectur":[3,6,11],"archiv":[4,6,11],"area":[0,3,5,7,9,13,15],"arg":[1,14],"argon":1,"argpars":1,"argument":[1,4,10,14],"argumentpars":1,"aris":8,"arm64":6,"armi":16,"armor":[4,16],"around":[3,7,13,16],"arrai":3,"arrang":0,"arriv":[1,7,13,16],"art":16,"artifact":[4,6],"artifacts_dir":4,"artifici":8,"arx":14,"ascii":4,"ask":[1,3,5,10,11,16],"aspect":[1,3,5,7,9,10,13,14],"aspect_filt":[1,10],"assert":[0,16],"assign":[1,9,13,14,16],"assist":11,"associ":[4,8,10,13,14],"assum":[7,9,13,16],"assumpt":[9,12,16],"assuredli":16,"asymmetr":[13,14,15],"asymmetri":0,"asynchron":[9,16],"atop":0,"attach":[0,11,14],"attached_interfac":10,"attack":3,"attain":3,"attempt":[1,3,4,5,7,10,14],"attent":[0,12,16],"attest":4,"attribut":[0,6,10],"atx":14,"auth":14,"authent":[0,4,7,9,10,11,13,14,15],"author":[0,6,8,13,14,16],"authoris":14,"authorit":[4,13,15],"authorship":0,"auto":[3,4,5,6,10,13,14],"auto_compress":10,"autoconfigur":15,"autoconnect_announces_to_intern":14,"autoconnect_discovered_interfac":[7,14],"autoconnect_interface_grav":7,"autoconnect_interface_mod":14,"autodiscov":7,"autoinstal":[5,14],"autointerfac":[3,5,7,14],"autom":[0,3,4,5,6,11,12,13],"automat":[1,3,6,7,9,10,11,13,14,15,16],"autonom":[0,9,13,16],"autonomi":[0,15,16],"avail":[0,1,3,4,5,6,7,9,10,11,13,14,15,16],"averag":13,"avoid":[5,13,14],"awai":[0,1,7,13,14,16],"await_path":10,"awar":[3,4,7,13],"ax":[6,15],"ax25kissinterfac":7,"b":[1,4,14],"b32":7,"back":[0,1,4,7,13,15,16],"backbon":[5,6,9,14,16],"backboneinterfac":[3,7,14],"backend":[7,13],"background":[3,7,14],"backhaul":[5,9],"backup":[0,14],"balanc":7,"band":[5,13,16],"bandwidth":[3,6,7,9,10,11,13,14,15],"bar":16,"bare":[0,1,4,7,16],"barrier":[0,7,13,16],"base":[0,4,6,7,9,10,11,13,14,15,16],"base32":[7,14],"base64":[4,14],"bash":[7,14],"bash_sourc":4,"basi":[0,7,10,13,14,15],"basic":[1,3,6,7,9,10,14],"batch":4,"batteri":16,"baud":[7,14],"baud_flash":14,"baudrat":1,"bc1pgqgu8h8xvj4jtafslq396v7ju7hkgymyrzyqft4llfslz5vp99psqfk3a6":12,"bc7291552be7a58f361522990465165c":[14,15],"beacon":7,"beast":16,"beat":16,"beauti":[0,11],"becam":0,"becaus":[0,4,9,13,16],"becki":1,"becom":[0,1,3,4,7,9,13,16],"been":[0,1,3,4,5,7,9,10,11,12,13,14,15,16],"befor":[1,3,4,7,9,10,12,13,14,16],"beg":16,"begin":[1,5,10,16],"begun":10,"behalf":[7,9],"behav":[5,11],"behavior":[7,16],"behaviour":[3,7,14],"behind":[3,7,12,13,16],"being":[0,3,4,7,10,13,16],"beings":[0,8,13],"belief":13,"believ":[0,16],"belong":[7,9,13,14,16],"below":[5,7,14],"bend":16,"benefici":[7,14],"berlin":16,"best":[3,9,10,13,16],"better":[0,3,7,9,12,13,16],"between":[0,1,7,9,10,11,13,14,16],"beyond":[0,4],"bi":[10,13],"bidirect":13,"big":16,"bill":16,"billion":[9,13],"billionair":16,"bin":[3,7,14],"binari":[1,3,7,9,10,13,14,16],"bind":[6,7],"bit":[1,3,4,7,9,10,11,13,14,15,16],"bitcoin":12,"bitrat":[1,7,10],"black":0,"blackhol":[3,6,9,10,13],"blackhole_ident":10,"blackhole_sourc":[10,14],"blackhole_update_interv":14,"blackholed_ident":14,"blackholeupdat":14,"ble":7,"blindli":[14,16],"blob":[1,4,13],"block":[3,4,6,9,10,11,13,14,16],"block_fast_flap":7,"blockchain":16,"blocklist":14,"blood":16,"blueprint":16,"bluetooth":14,"board":[3,6,7,11,13,15],"boat":16,"bob":4,"bobs_nod":4,"bogu":7,"boil":5,"bond":16,"book":16,"bookworm":6,"bool":10,"boot":[3,14],"bootstrap":[6,7,14],"bootstrap_onli":[3,7],"borrow":16,"bot":11,"both":[0,1,3,4,5,7,9,10,11,13,14,15],"bounc":[3,16],"bound":[9,16],"boundari":[0,4,7,9,13],"box":[0,5],"branch":[0,4,14],"breadcrumb":4,"break":[3,10,13,16],"breath":[3,16],"breviti":14,"bridg":[5,7],"briefli":[5,13],"bring":[7,14],"brittl":[3,16],"broad":[3,5],"broadcast":[3,6,7,9,10,13,14,16],"broadcast_destin":1,"broadcastloop":1,"broader":[3,13],"broken":[3,7,16],"brought":[7,14],"brows":[0,4,11,16],"browser":[4,11,16],"buffer":[6,7,10,15],"bufferedread":10,"bufferedrwpair":10,"bufferedwrit":10,"bufferexampl":1,"bug":[4,11,12],"bui":16,"build":[0,1,4,5,6,7,11,13,15,16],"builder":16,"built":[0,3,7,9,11,13,14,15,16],"bulletin":11,"bundl":1,"bureaucraci":16,"bureaucrat":[15,16],"burst":[6,14],"busy":0,"button":16,"bw":14,"bypass":[7,12,16],"byte":[1,6,9,10,13,14,15],"bytes":1,"c":[1,4,8,14],"c50cc4e4f7838b6c31f60ab9032cbc62":14,"c89b4da064bf66d280f0e4d8abfd9806":14,"cabl":[7,16],"cach":[7,9,14],"cafe":16,"cage":16,"calcul":[9,10,13,14],"call":[0,1,9,10,11,13,15,16],"callabl":[1,10],"callback":[1,10],"callsign":7,"came":4,"camp":0,"can":[0,1,3,4,5,6,7,9,10,11,12,13,14,16],"cancel":[4,10],"candid":9,"cannot":[0,1,3,4,7,9,15,16],"cap":7,"capabl":[0,1,3,7,9,13],"capac":[3,5,9,10,13],"capit":[0,16],"captur":[0,16],"car":9,"carambola":1,"card":[0,16],"care":[0,3,4,9,10,14,15,16],"carefulli":3,"cargo_build_target":3,"carri":[0,7,9,10,13,14,15,16],"carrier":[6,9,15],"case":[0,1,3,4,5,7,9,13,14],"castl":16,"cat":14,"catastroph":0,"categori":5,"caus":[3,7],"caution":7,"cb":[10,13],"cbc":[13,15],"cd":4,"cdma":7,"ceas":[0,16],"cede":0,"cell":9,"cellular":16,"cement":16,"censor":[0,13,14,16],"censorship":[13,15],"center":6,"central":[0,3,4,5,7,9,11,13,14,16],"centralis":13,"centric":0,"centuri":0,"ceo":16,"certain":[1,7,9,12,13,14,16],"certif":16,"certifi":0,"chain":[4,7,16],"challeng":[3,11,13,16],"chanc":5,"chang":[0,1,3,4,7,10,13,14,15,16],"channel":[0,3,4,6,7,9,10,12,13,15,16],"channelarg":1,"channelexampl":1,"chaotic":16,"chapter":[0,3,4,5,7,9,10,11,13,14,15],"charact":[1,4,7,14],"characterist":[7,9,13,16],"charg":8,"chart":4,"charter":13,"chase":16,"chat":6,"cheap":[5,7,13],"cheapli":3,"check":[1,3,4,10,13,14,16],"checksum":[4,10,15],"chmod":4,"choic":[3,9,16],"choke":16,"choos":[0,1,3,7,11,13,16],"chose":13,"chosen":13,"chunk":1,"cific":7,"ciphertext":10,"ciphertext_token":10,"circl":16,"circumst":[12,13,16],"citi":16,"cl":1,"claim":[4,8,13],"clariti":16,"class":[1,9,10,15],"clear":[1,7,10,14,16],"clear_default_app_data":10,"clear_screen":1,"clearli":16,"click":4,"client":[0,1,4,5,6,10,14,16],"client_buffer_readi":1,"client_config":4,"client_connect":1,"client_disconnect":1,"client_ident":[1,4],"client_loop":1,"client_message_receiv":1,"client_packet_receiv":1,"client_request":1,"climat":16,"clone":[4,13],"close":[1,9,10,14],"closed_callback":10,"closer":[11,13],"closest":13,"cloth":16,"cloud":[0,6,7,11],"cluster":[0,13],"co":[4,5,7,15],"code":[0,3,4,5,6,7,9,11,12,14,15,16],"codic":0,"codingr":7,"coexist":9,"coffe":16,"coher":16,"collabor":[0,4,13,14],"collaps":[0,3,16],"collect":[0,3,12],"collis":9,"colon":16,"color":4,"com":[1,4,12,16],"combin":[0,3,4,6,11,13,14,16],"combinatori":16,"come":[0,3,7,9,13,16],"comma":[7,14],"command":[0,1,3,6,7,11,14],"commend":16,"comment":[0,4,7,14],"commerci":16,"commit":[0,3,6,11],"committe":16,"common":[0,1,3,5,6,9,13,14,15,16],"commonli":[4,5,7],"commun":[0,1,3,4,6,7,9,10,11,12,13,14,15,16],"communica":7,"compani":16,"compar":[9,16],"compass":16,"compat":[0,1,3,4,5,7,10,11,13,14,15],"compet":[0,16],"compil":3,"complain":16,"complet":[0,1,3,4,5,7,9,10,11,13,14,15],"complex":[0,3,7,12,13,16],"compli":9,"compon":[5,12,13,16],"compos":[4,6,13],"comprehens":[0,11,12],"compress":[1,10,13,14,15],"compromis":[0,13,16],"comput":[0,3,7,13,15,16],"computation":[7,14],"concaten":[10,14],"conceiv":[0,3,5],"concept":[0,6,13,14,16],"conceptu":[0,4,6],"concern":16,"concert":13,"conclud":[1,10],"concret":16,"concurr":[5,13,14],"condit":[3,8,13,15,16],"conduct":0,"conduit":16,"conf":[3,11],"config":[1,3,4,7,9,14,16],"configarg":1,"configdir":10,"configobj":4,"configpath":1,"configur":[0,1,3,5,6,9,10,13,15],"configuraion":5,"configuraiton":14,"configure_devic":1,"confirm":[4,9,13,15,16],"conflict":[3,9],"conform":0,"confront":16,"confus":[5,13],"congest":13,"conglomer":16,"conjunct":7,"connect":[0,1,4,5,6,8,10,12,13,14,15,16],"conscienc":16,"conscious":0,"conscript":16,"consent":0,"consequ":[0,9,13],"conserv":7,"consid":[1,3,7,10,11,13,14,15,16],"consider":[6,13],"consist":[4,13,14],"consol":14,"constant":[0,10,16],"constantli":[13,16],"constitut":[0,3,13],"constrain":[9,10],"constraint":16,"construct":[0,4,13,15,16],"constructor":1,"consum":[4,9,10,16],"consumpt":[9,16],"contact":[7,9,11,13,16],"contain":[0,1,4,7,9,10,13,14],"contempl":16,"contemporari":0,"contend":13,"content":[0,1,3,4,9,11,14],"context":[3,13,14,16],"contin":[1,3,16],"continu":[0,4,7,10,12,14,15,16],"contract":8,"contrari":16,"contrast":0,"contribut":[0,6,8,9,12],"contributor":0,"control":[0,1,3,4,5,6,9,10,11,13,14,15,16],"convei":[1,16],"conveni":[0,1,4,14,16],"convent":[1,9],"converg":[3,9,13,16],"convers":[0,4,11,13,16],"convert":[0,4],"cook":3,"coordin":[7,9,10,13,15,16],"copi":[0,4,8,14],"copyright":[0,8],"core":[0,9,13,14,15,16],"corner":16,"corpor":[0,16],"correct":[0,1,4,7,9,13],"correctli":[1,4,9],"correspond":[4,9,13,16],"corrupt":[0,4],"cost":[5,6,7,13,15],"could":[0,1,3,7,9,10,13,14,15,16],"count":[4,11,13,16],"counter":1,"cours":[3,4,7,9,13,16],"coven":16,"cover":[3,4,5,9,10,13,15],"coverag":[7,9],"cpu":[1,7,9,13],"cpuinfo":14,"cr":14,"craft":[0,4,16],"craftsman":16,"crash":16,"creat":[0,1,6,7,9,10,11,14,15,16],"create_bidirectional_buff":[1,10],"create_kei":10,"create_read":10,"create_receipt":[1,10],"create_writ":10,"creation":[0,6,8,9,11,13,14,15],"creativ":[0,16],"creator":[0,6,13,16],"credenti":[7,13],"critic":[0,9,13,14],"cron":0,"cross":[7,11],"crowd":16,"crucial":9,"cruft":16,"cryptograph":[0,3,6,7,9,14,15,16],"cryptographi":[0,3,13,15],"crystal":16,"ctrl":1,"cull":10,"culmin":16,"cultur":0,"cumbersom":4,"curl":7,"current":[0,1,3,4,6,7,10,11,14,16],"current_download":1,"current_filenam":1,"current_ratchet_id":10,"curv":[9,10,13,15],"curve25519":[9,10,13,15],"custodian":16,"custom":[5,6,10,11,13,15],"custom_network_nam":7,"customis":7,"cut":16,"cynic":16,"d":[4,14],"d09285e660cfe27cee6d9a0beb58b7e0":4,"d56a4fa02c0a77b3575935aedd90bdb2":14,"daemon":[1,3,7,10,11,14],"dai":[4,10,11,16],"daili":4,"damag":[0,8,16],"danc":16,"danger":16,"dark":16,"data":[0,1,3,4,5,6,7,9,10,13,15,16],"data_buff":1,"data_port":7,"databas":[0,11,14,16],"databit":[1,7,14],"datacent":3,"datar":7,"dataset":[8,16],"date":[1,3,4,11,14],"datetim":1,"db":[1,14],"dbm":[1,7,14],"deadlin":0,"deal":[7,8],"death":6,"debian":[6,13,14],"debug":[3,14],"decad":[0,5,12,16],"decentr":[3,6,7,14],"decentralis":15,"decid":[0,7,9,10,13,16],"decim":7,"decis":[0,4,7,9,13,16],"declar":13,"decod":[1,7,14],"decoupl":0,"decreas":[4,7,14],"decrypt":[7,9,10,13,14],"dedic":[4,7,13,15,16],"deep":[3,16],"deepli":[0,16],"def":[1,4],"default":[1,3,4,5,7,9,10,11,13,14],"default_ar_grac":7,"default_ar_penalti":7,"default_ar_target":7,"default_grav":7,"default_ifac_s":1,"default_per_hop_timeout":10,"defin":[1,4,7,10,13,14,15,16],"definit":[1,3,4,13,14,16],"defunct":14,"degrad":9,"degre":7,"delai":[7,11,13,14,16],"deleg":[0,4,13],"delet":[0,4,16],"delimit":1,"deliv":[1,3,9,10,11,16],"deliveri":[0,1,4,9,10,11,15],"demand":[4,10,16],"demonstr":[0,1,3,7,16],"deni":[0,4,16],"denomin":0,"depend":[0,1,4,5,6,7,9,10,13,14,16],"deploi":[13,16],"deploy":4,"depriorit":16,"depth":16,"deregist":10,"deregister_announce_handl":10,"deregister_request_handl":10,"deriv":[3,9,10,13,15],"describ":[4,5,7,10,13],"descript":[1,4,14],"descriptor":1,"deseri":1,"deserializ":1,"design":[0,3,4,5,6,7,9,11,12,13,14,15],"desir":[1,5,7,13],"desk":16,"desktop":[7,11],"dest_len":1,"destin":[1,3,6,10,14,16],"destination_1":1,"destination_2":1,"destination_clos":1,"destination_hash":[1,4,10,14],"destination_hexhash":1,"destroi":[0,16],"destruct":16,"detach":[4,7],"detail":[0,1,3,4,6,7,10,14,15],"detect":[1,4],"determin":[3,9,10,13,16],"determinist":4,"detriment":14,"dev":[1,3,4,7,14],"devel":3,"develop":[4,5,6,8,10,11,12,13,14,15,16],"devic":[1,3,6,7,9,10,11,13,14,16],"dh":10,"dhcp":[5,7,9,14],"di":16,"dict":1,"dictat":[14,16],"dictatorship":16,"dictionari":14,"did":[0,1,11,16],"diff":4,"differ":[0,1,3,4,5,7,9,10,11,13,14,15,16],"differenti":14,"diffi":[9,13],"difficult":[3,5,14],"difficulti":[7,14],"digit":[0,3,5,13,15,16],"digniti":[0,16],"dilut":0,"dinner":16,"dir":[1,4],"dire":5,"direct":[0,1,3,4,5,9,10,11,13,14],"direction":13,"directli":[0,3,4,5,7,8,9,10,11,13,14,15,16],"directori":[1,3,4,7,9,14,16],"dirnam":4,"disabl":[7,13,14],"disappear":[7,14,16],"disassoci":13,"discard":[3,10,13],"discern":0,"disciplin":[0,16],"disconnect":[1,3,6,7],"discourag":0,"discov":[0,3,6,7,9,10,11,13,16],"discover":[3,6,14],"discover_interfac":14,"discovered_interfac":10,"discoveri":[3,4,6,10,13,14],"discovery_bandwidth":7,"discovery_encrypt":7,"discovery_frequ":7,"discovery_lxmf_address":7,"discovery_modul":7,"discovery_nam":7,"discovery_port":7,"discovery_scop":7,"discovery_stamp_valu":7,"discret":0,"discrimin":9,"discuss":[0,4,5,13],"disk":[1,4,10,14],"displai":[1,4,7,9,11,13,14],"disrupt":[0,7],"dissemin":0,"dissolv":[9,16],"dist":4,"distanc":[5,13,14],"distant":[3,10,13],"distinct":[0,7,9,13,16],"distinguish":[9,13],"distribut":[1,4,6,8,9,10,11,13,14,15,16],"dive":3,"diverg":0,"divers":0,"divid":10,"divmod":1,"dn":[5,7,11,16],"dna":16,"dnf":3,"do":[0,1,3,4,5,7,8,9,10,13,14,16],"doc_id":4,"document":[0,3,6,8,10,11,13,14,15,16],"doe":[0,1,3,4,5,6,7,10,11,13,14,16],"doesn":[0,7,9,16],"dollar":16,"domain":[0,3,6,7,13,14,15],"domin":16,"don":[1,3,4,9,10,13,14,16],"donat":6,"done":[1,3,4,7,13,14,16],"door":16,"dot":[13,14],"doubt":3,"dowload":3,"down":[0,1,5,7,10,14,16],"download":[0,1,3,4,7,9,11,14],"download_began":1,"download_conclud":1,"download_finish":1,"download_start":1,"download_tim":1,"downstream":14,"drag":11,"drain":7,"drastic":14,"draw":16,"drawn":16,"drive":[0,12],"driver":[14,15],"droid":3,"drone":16,"drop":[4,7,9,10,11,13,14,16],"drown":0,"dsrdtr":1,"dual":[5,14],"dublin":14,"due":[0,1],"dumb":16,"dump":[7,14],"duplex":[13,15],"durabl":0,"durat":14,"dure":[4,14],"dynam":[0,3,4,7,11,14,16],"dysfunct":12,"dysregul":0,"e":[1,4,14],"e5c032d3ec4e64a6aca9927ba8ab73336780f6d71790":14,"e702c42ba8":14,"e7536ee90bd4a440e130490b87a25124":14,"each":[0,1,3,4,7,9,10,11,13,14],"earli":16,"earlier":13,"eas":[7,13],"easi":[3,4,5,7,11,13,14,15],"easier":[3,4,7,9,14,15],"easiest":[3,5,7,13],"easili":[0,3,4,7,9,13,14,15,16],"eastern":13,"ec_pr_freq":7,"ecdh":[13,15],"echo":[4,6],"echo_destin":1,"echo_request":1,"econom":0,"economi":16,"ecosystem":[0,3,7,11,13,14,16],"ed25519":[0,4,13,15],"edit":[3,4,14],"editor":[4,14],"ee":4,"eeprom":14,"effect":[0,4,7,13,14],"effici":[1,3,7,9,10,11,13,14,15,16],"effort":[5,10,16],"effortlessli":11,"eg":14,"egress":7,"egress_control":7,"ei":1,"either":[3,4,5,9,10,13,14,16],"elaps":[4,7],"electromagnet":16,"eleg":16,"element":[9,16],"elev":0,"elif":1,"elimin":[0,9,16],"ellipsoid":7,"ellipt":[9,10,13,15],"els":[0,1,9,11,12,13,15,16],"email":[0,4,11],"emb":4,"embed":[0,4,5],"embrac":16,"emerg":[0,6,11],"emiss":11,"emot":0,"emploi":[0,5,13],"empow":15,"empti":[1,6,7,16],"emul":[3,14],"enabl":[0,1,3,5,6,9,10,11,13,14,15,16],"enable_ratchet":10,"enable_remote_manag":14,"enable_transport":[7,13,14],"encapsul":[7,15],"enclos":4,"encod":[1,4,10,11,14,16],"encount":[3,9],"encourag":[0,3,16],"encrypt":[0,1,3,4,6,7,9,10,11,13,14,15],"encrypted_mdu":10,"end":[1,4,7,9,10,11,13,15],"endeavor":0,"endless":[7,16],"endow":0,"endpoint":[1,9,10,11,13,16],"energi":[3,16],"enforc":[7,10,13,14],"enforce_ratchet":10,"engag":[0,16],"engin":[0,3,11,12,16],"enhanc":13,"enjoy":0,"enough":[0,3,5,7,11,13],"ensur":[0,1,3,4,7,9,10,11,13,14,15,16],"ensurepath":3,"enter":[0,1,14],"entir":[0,1,3,4,7,9,10,11,13,14,15,16],"entiti":[0,9,13,14,16],"entitl":0,"entri":[0,1,3,13,14,16],"entropi":16,"entrypoint":[6,7,14],"enumer":1,"envelop":[4,10,16],"environ":[0,3,4,6,7,9,12,13,14],"environment":13,"environmentlogg":13,"eof":7,"ephemer":[0,9,10,13,15],"epub":6,"equal":[0,9,10,13,16],"equip":[7,9,13],"equival":[4,7,16],"era":16,"erod":16,"erron":12,"error":[1,3,4,7,12,14,16],"esc":1,"esc_mask":1,"escap":[1,14],"esoter":0,"esp32":5,"especi":[3,4,5,7,14],"essenti":[0,3,4,7,11,13,14,16],"establish":[0,1,3,7,9,10,11,14,15,16],"established_callback":10,"establishment_timeout_per_hop":10,"estim":10,"etc":[4,14],"eth0":7,"eth1":7,"ether":16,"ethereum":12,"ethernet":[3,6,7,9,11,13,15,16],"ethic":6,"evalu":0,"evapor":16,"even":[0,1,3,4,7,9,10,11,13,14,15,16],"event":[7,8,16],"eventu":10,"ever":13,"everi":[0,1,3,4,7,9,10,13,14,16],"everydai":3,"everyon":[0,3,4,11,12,13,16],"everyth":[0,1,4,9,11,12,13,16],"evict":16,"evolv":[0,3,9,13],"exact":[4,5,7,13],"exactli":[4,10,13,16],"exampl":[0,3,5,6,9,10,13,14,15],"example_util":1,"exampleannouncehandl":1,"exampleconfig":[3,14],"exampleinterfac":1,"exce":[1,7,10],"except":[1,7,10],"excess":[7,14],"exchang":[0,9,10,13,15],"exclud":[4,10,13],"exclus":[0,4],"execstart":14,"execstartpr":14,"execut":[0,1,3,4,7,10,14],"exercis":0,"exhaust":[5,11,13,14],"exist":[0,1,3,4,5,6,7,9,11,13,14,15],"exit":[0,1,4,7,10,14],"expand":[4,9,11,13,15],"expand_nam":10,"expans":[0,4,16],"expect":[1,4,7,10,12,13,14],"expens":[5,7],"experi":[9,11,13,14,16],"experienc":1,"expir":[7,10],"expiri":[7,10],"explain":[5,10],"explan":[13,14],"explicit":10,"explicitli":[7,9,13,14],"exploit":0,"explor":[1,11,13,15,16],"export":[3,14],"expos":[7,10,14],"exposur":7,"express":[0,4,8],"extend":[0,1,10],"extens":[4,7,11,14,15],"extern":[0,1,3,4,7,10,14,15,16],"extra":[3,7,14],"extract":[0,4,14,16],"extract_id":4,"extrem":[3,11,13,14,15,16],"f":[1,3,4,14],"f2d31b2e080e5d4e358d32822ee4a3b7":4,"f4":7,"f53a1c4278e0726bb73fcc623d6ce763":14,"fabric":[6,9],"face":[7,11],"facebook":0,"facilit":[11,13],"fact":[0,3,7,15],"factor":[7,10,14],"fade":16,"fail":[0,1,3,4,7,10,16],"failed_callback":[1,10],"failur":[0,3,4,7,10,16],"fake":14,"fallaci":6,"fallback":[4,16],"fallen":16,"fals":[1,7,9,10],"famili":3,"familiar":0,"fantasi":16,"far":[0,3,9,13],"fashion":12,"fast":[6,7,9,10,11,13],"fast_flapping_block_tim":7,"fast_flapping_grac":7,"fast_flapping_threshold":7,"faster":[3,7,13,16],"fastest":[7,13],"fat":16,"favor":3,"favorit":11,"fe80":3,"featur":[3,4,6,7,9,11,12,13,14,15],"feder":[11,13,14,16],"fedora":3,"feed":[0,3,10,16],"feedback":[0,1,6],"feel":[11,16],"fernet":13,"fetch":[0,4,7,14],"few":[0,3,5,7,9,11,13,14,15,16],"fewer":10,"ff":14,"ffcffb4e255e156e77f79b82c13086a6":4,"fi":[4,12],"fiber":[5,16],"fibr":15,"field":[4,13,16],"figur":7,"file":[0,1,3,4,5,7,8,9,10,11,13,14,15],"file_resourc":1,"file_s":1,"filelist":1,"filelist_data":1,"filelist_receiv":1,"filelist_timeout_job":1,"filenam":1,"filesync":6,"filetransf":[6,10],"filter":[0,1,9,13,14],"final":[1,4,10,13,16],"find":[0,4,6,7,11,13,14,16],"find_spec":1,"fine":[0,4,7,14],"fingerprint":16,"finish":6,"finit":16,"fire":16,"firewal":[3,7,9,16],"firmwar":[3,5,13,14],"firmware_hash":14,"first":[0,1,3,4,7,9,10,13,14,16],"fit":[0,1,8,16],"five":[1,16],"fix":[4,6,13,16],"fixed_mtu":7,"flag":[1,3,4,10,13,14],"flap":7,"flash":14,"flasher":3,"flat":16,"flaw":16,"fleet":13,"flesh":16,"flexibl":[3,4,5,7,9,11,14,15],"flexibli":4,"fli":13,"flicker":16,"flight":10,"flip":16,"float":[1,7,10],"flood":[7,14],"flow":[0,1,3,6,7,9,13],"flow_control":7,"fluid":16,"fluiditi":16,"fluidli":16,"flush":1,"focu":[0,14],"focus":[11,13],"folder":[0,1,4],"follow":[0,1,3,4,5,7,8,10,12,13,14,15,16],"font":4,"forbid":16,"forc":[0,1,14,16],"forcibli":[10,14],"foreground":3,"forev":16,"forg":16,"forget":[9,14],"forgotten":0,"fork":[0,6,11],"forker":4,"form":[3,6,7,9,10,13,14,16],"format":[0,1,6,7,11,14,15],"forth":1,"fortifi":0,"fortun":16,"forward":[0,4,6,7,9,10,11,13,14,15],"forward_ip":7,"forward_port":7,"found":[1,3,4,7,10,13,14,16],"foundat":[0,9,12,13,15,16],"four":7,"fragil":[0,16],"frame":[1,7],"framework":11,"free":[3,8,9,11,12,15,16],"freedom":[13,16],"freedv":5,"freeli":13,"freq":14,"frequenc":[3,5,7,13,14],"frequent":[7,9],"friend":[3,16],"friendli":11,"from":[0,1,3,4,5,6,7,8,9,10,11,12,13,14,15],"from_byt":10,"from_fil":10,"from_identity_hash":10,"fromhex":1,"front":[4,13],"frontend":11,"fruit":1,"ftdi_ft230x_basic_uart_43891ckm":14,"fuel":16,"full":[0,1,3,4,7,9,10,11,13,14,15],"full_hash":10,"full_nam":[10,14],"fulli":[1,3,4,5,7,11,13,14,15],"funcion":10,"function":[0,1,3,4,5,6,7,8,9,10,11,12,14,15,16],"fundament":[0,5,9,13,14,16],"furnish":8,"further":[0,3,6,7,14,16],"futur":[0,4,6,9,11,14,16],"fw":14,"g":[1,4,13,14],"ga":1,"gain":[0,5,10,13,16],"galact":13,"gap":3,"gaslit":16,"gatekeep":[0,13,16],"gatewai":[1,3,7,9,13,14,16],"gbp":14,"gear":16,"gen_tim":4,"gener":[0,1,3,4,5,7,9,10,13,14,15,16],"generalis":15,"genuin":14,"geograph":[0,3,7],"geoid":7,"get":[0,1,4,5,6,7,9,10,11,14,16],"get_ag":10,"get_channel":[1,10],"get_config_obj":1,"get_data_s":10,"get_establishment_r":10,"get_expected_r":10,"get_external_ip":7,"get_first_hop_timeout":10,"get_hash":10,"get_inst":10,"get_lowest_interface_bitr":10,"get_mdu":10,"get_medium_path_timeout":10,"get_mod":10,"get_mtu":10,"get_packet_rssi":1,"get_packet_snr":1,"get_part":10,"get_private_kei":10,"get_progress":[1,10],"get_public_kei":10,"get_q":10,"get_random_hash":[1,10],"get_remote_ident":[1,10],"get_request_id":10,"get_respons":10,"get_response_tim":10,"get_rssi":10,"get_rtt":[1,10],"get_seg":10,"get_snr":10,"get_statu":10,"get_transfer_s":10,"geti2p":7,"ghost":16,"ghz":13,"gi":1,"giant":16,"gift":16,"gigabit":[9,16],"gigabyt":15,"git":[0,6,14],"github":[0,1,3,4],"gitlab":0,"give":[3,7,13,14,16],"given":[7,9,10,13,14,16],"global":[1,4,6,7,9,10,13,14,15],"globe":16,"glue":5,"gmail":0,"go":[1,7,9,13,16],"goal":[3,6,7,9,11,15],"goe":16,"good":[0,3,4,5,9,13,14],"goodwil":16,"got":[1,16],"got_respons":1,"govern":[13,16],"government":0,"gp":7,"gpg":4,"gpio":11,"grace":10,"gracefulli":[7,9],"grade":6,"grain":[0,4,14],"grammar":0,"grant":[0,4,8,14,16],"granular":4,"grape":1,"graph":0,"graphic":11,"gratefulli":12,"graviti":[7,16],"great":[3,4,13,14,16],"greater":[4,10,13,14,15],"greatli":[3,7],"green":16,"grep":4,"grid":[11,16],"gross":16,"ground":[0,16],"group":[0,6,7,10,11,13,14],"group_id":7,"group_nam":4,"group_root":4,"groupinstal":3,"grow":[0,3,16],"grown":16,"growth":[0,3],"guarante":[4,9,12,13],"guard":16,"guess":7,"gui":11,"guid":[3,5,11,13],"guidelin":3,"guilt":11,"gun":16,"gw":7,"gz":4,"h":[4,14],"ha":[0,1,4,5,7,9,10,11,12,13,14,15,16],"habit":16,"habitat":16,"hack":15,"had":[0,13],"half":[13,15],"hammer":16,"hand":[1,16],"handheld":13,"handl":[0,1,3,4,5,7,9,10,11,13,14,15],"handler":[1,10,14,16],"handshak":16,"happen":[1,3,4,7,10,13,16],"hard":[3,5,7,16],"hardcod":16,"hardlin":9,"hardwar":[0,1,3,6,7,10,11,13,14,15,16],"harm":[6,8],"harvest":0,"has_path":[1,10],"hasattr":1,"hash":[0,1,4,9,10,13,14,16],"hash1":13,"hash2":13,"hash_from_name_and_ident":10,"hashlib":13,"hashmap":1,"have":[0,1,3,4,5,7,9,10,11,12,13,14,15,16],"hazard":10,"hdlc":1,"he":0,"header":[1,4,7,10,13],"header_1":13,"header_2":13,"health":6,"hear":[13,16],"heard":[0,10,11,13,14],"heart":16,"heavi":16,"height":7,"held":[7,14],"helium":1,"hellman":[9,13],"hello":4,"hello_world":4,"help":[1,3,4,9,12,13,14,16],"helper":[1,4,14],"here":[0,1,3,7,13,14,16],"herebi":8,"heterogen":[3,6,15],"hex":[1,14],"hexadecim":[1,4,13,14],"hexbyt":14,"hf":[11,16],"hidden":14,"hide":[3,16],"hierarch":[15,16],"hierarchi":[6,16],"high":[5,7,9,13,14,15,16],"higher":[0,7,9,15],"highest":10,"highli":[4,7,12,13,14],"highlight":6,"hijack":16,"hint":[1,4],"histor":0,"histori":[0,4,11],"hit":1,"hkdf":13,"hmac":[13,15],"hoc":[15,16],"hold":[7,10,13,16],"holder":[8,9],"hole":16,"hollow":16,"home":[0,3,4,9,11,14,16],"homebrew":7,"hook":[0,4],"hop":[7,9,10,13,14,15,16],"hopefulli":9,"hops_to":10,"host":[0,1,4,6,7,9,11,13,14],"hostil":6,"hostnam":[7,16],"hotspot":16,"hour":[1,4,7,14,16],"hous":[3,16],"how":[0,1,3,4,5,7,9,11,13,14,15,16],"howev":[3,4,7,9,13],"http":[0,1,4,11,12,16],"hub":[7,11,14],"hum":16,"human":[0,1,6,7,8,9,10,12,13],"hundr":[0,9,11,16],"hungri":5,"hw_mtu":1,"hwrev":14,"hz":[7,14],"i":[0,1,3,4,5,6,7,8,9,10,11,12,13,14],"i2p":[3,6,9,11,15],"i2p_tunnel":7,"i2pd":[3,7],"i2pinterfac":[3,7],"ia":14,"ic":5,"ic_burst_freq":7,"ic_burst_freq_new":7,"ic_burst_hold":7,"ic_burst_penalti":7,"ic_held_release_interv":7,"ic_max_held_announc":7,"ic_new_tim":7,"ic_pr_burst_freq":7,"ic_pr_burst_freq_new":7,"icmp":11,"icon":[4,16],"id":[4,7,10,13,14],"id_callsign":7,"id_interv":7,"id_regex":4,"idea":[0,3,4,13,14,16],"ideal":[11,14,15],"ident":[0,1,3,6,7,9,10,11,14,15],"identif":[6,7,15],"identifi":[1,7,9,10,13,14,15],"identifyexampl":1,"identity_data":14,"identity_hash":10,"ie":14,"if00":14,"ifac":[1,3,7,9,13,14],"ifac_s":7,"ifconf":1,"ifconfig":14,"ignor":[4,7,9,10,12,13,14],"ignored_devic":7,"illus":6,"illustr":[1,7,13],"imag":16,"imagin":[0,9,16],"immedi":[0,4,7,14,16],"immens":16,"immort":16,"immun":0,"immut":[0,16],"impact":[7,9,10,13],"impati":16,"imperson":9,"implement":[0,1,4,6,7,9,10,11,12,13,16],"impli":8,"implic":[6,7,9],"implicit":[9,10,13],"implicitli":14,"import":[0,1,3,5,7,9,10,12,13,14],"importantli":[0,3,16],"importlib":1,"imposs":[13,16],"impract":14,"improv":[3,6,7,11,12,16],"in_fram":1,"in_wait":1,"inactive_for":10,"inadvert":14,"inbound":[1,7,10],"inbox":9,"incent":0,"includ":[0,1,4,5,6,7,8,9,10,11,13,15],"inclus":9,"incom":[1,7,10,14],"incompat":[0,10,13],"incompet":0,"incomplet":9,"inconveni":0,"increas":[4,7,10,14],"incredibli":[0,16],"increment":0,"incur":[0,7],"indefinit":[0,14],"independ":[0,4,6,10,13],"index":[1,3,6],"indic":[1,4,10],"indiffer":16,"indirectli":[8,13],"individu":[0,3,4,7,10,12,13,14,15,16],"industri":0,"inevit":[3,13],"infer":13,"infinit":16,"influenc":0,"influx":[7,11],"influxdb":11,"info":[4,10,13,14,16],"inform":[0,1,3,4,6,7,9,10,11,12,13,14,16],"infrastructur":[4,5,6,7,9,11,13,14],"ingest":16,"ingo":10,"ingress":[1,6],"ingress_control":7,"inhabit":16,"inher":[0,9],"inherit":4,"init":3,"initi":[1,4,7,9,10,13,14,15],"initialis":[1,4,10,14],"input":[1,14],"insert":13,"insid":[4,13,16],"insidi":0,"insight":16,"inspect":[3,4,7,9,13,14],"inspir":16,"instal":[0,1,4,6,7,13,14,15],"instanc":[0,1,6,7,10,11,13,14,16],"instance_control_port":14,"instance_nam":14,"instant":16,"instanti":10,"instantli":14,"instead":[0,1,3,4,7,10,13,14,16],"institut":[0,16],"instruct":[3,4,16],"int":[1,10],"integ":[1,10],"integr":[0,3,4,11,13,14,16],"intellig":[0,8,16],"intend":[3,7,9,13,14],"intens":14,"intent":[9,16],"intention":[11,13],"inter":[3,10,13],"inter_byte_timeout":1,"interact":[0,1,3,6,9,10,13,14,16],"intercept":9,"interchang":[4,7],"interconnect":[3,7,9,13],"interest":[11,13,16],"interfac":[0,4,5,6,9,10],"interface_class":1,"interface_discovery_sourc":[10,14],"interface_en":14,"interfer":[9,14],"intermedi":[9,16],"intermediari":[6,7,13],"intermitt":[0,7,9,16],"intern":[0,1,4,7,10,13,14,16],"internal_1":7,"internet":[0,6,7,9,11,13,14,15,16],"internetwork":3,"interoper":[5,9,11,13,15],"interpret":4,"interregnum":6,"interrupt":[4,7],"interv":[4,7,10,14],"intervent":14,"intiat":1,"intim":16,"introduc":[0,4,13,14,16],"introduct":6,"introductori":6,"intuit":[9,13,15],"invalid":[1,4,7,10],"invari":16,"invers":13,"invert":16,"invest":[0,9],"investig":4,"invis":[3,7],"invit":7,"invok":4,"involv":[0,4,9,12],"io":5,"iodin":11,"ioerror":1,"iot":5,"ip":[3,5,6,7,9,13,14,15],"ipv4":7,"ipv6":[3,7,14],"irc":11,"irrelev":[0,12],"irrespons":16,"is_compress":10,"is_connected_to_shared_inst":1,"is_open":1,"is_path_respons":10,"is_ready_to_send":[1,10],"isdir":1,"isfil":1,"isinst":1,"ism":[5,13],"isn":16,"isol":[3,7,14],"isp":[7,9,16],"issu":[0,4,6,7,9],"its":[0,4,5,7,8,9,10,13,14,16],"itself":[0,4,6,9,11,13,14,16],"iv":[13,15],"j":[6,14],"jail":14,"jan":4,"javascript":11,"job":[0,1],"join":[1,3,9,11,13],"journei":9,"json":[14,16],"judgment":0,"just":[0,1,3,4,5,7,9,11,13,14,15,16],"k":[1,14],"kb":14,"kbp":14,"keep":[1,3,4,9,10,13,14,15,16],"keepal":[10,13],"keepalive_timeout_factor":10,"kei":[0,1,4,6,7,9,10,14,15,16],"kept":[7,9,10,13],"kernel":[0,7,14,15],"keyboardinterrupt":1,"keyerror":10,"keypad":11,"keypair":[9,13],"keyr":16,"keyserv":4,"keyset":[13,14,15],"keysiz":10,"keystor":9,"keyword":4,"khz":7,"ki":1,"kill":[10,13,16],"kilomet":0,"kind":[0,5,7,8,9,11,13,16],"kiss":[5,6,11,14,15],"kiss_fram":7,"kissinterfac":[7,14],"knock":16,"know":[0,1,3,4,5,7,9,10,13,14,16],"knowledg":[9,13],"known":[1,7,10,13,14,15,16],"ko":12,"krypton":1,"l":[4,7,14],"la":14,"label":0,"labor":16,"lack":[0,13],"laid":13,"lake":0,"lan":7,"landlord":16,"languag":[0,4,8,11],"lantern":16,"laptop":[9,16],"larg":[1,5,7,9,10,13,14,15,16],"larger":[9,13,14],"laser":7,"last":[1,4,7,10,14,16],"last_read_m":1,"last_unit":1,"lat":7,"latenc":[3,9,13,15,16],"later":[1,3,4,7,11,14],"latest":[0,1,3,4,7,10,14],"latest_buff":1,"latest_client_link":1,"latitud":7,"laucnh":3,"launch":[11,14],"law":16,"layer":[0,5,7,9,10,11,13,14,15,16],"lcd":11,"lead":[3,13,16],"leak":3,"learn":[1,3,8,9,12,13,16],"leas":16,"leash":16,"least":[3,4,5,7,9,13,14,15],"leav":[0,9,11,13,16],"ledger":[13,16],"leech":0,"left":[0,7,10,13,14],"legaci":[9,16],"legal":[0,7,16],"legisl":7,"legitim":[3,9,14],"len":[1,16],"length":[1,4,7,10,13],"less":[1,3,5,7,10,13,15,16],"let":[0,1,3,4,7,9,11,13,14,16],"level":[0,4,5,7,9,13,14],"lever":16,"li":[0,16],"liabil":8,"liabl":8,"liber":[5,6],"liberapai":12,"libffi":3,"librari":[0,3,11,16],"licens":[6,13,15,16],"lie":16,"life":[0,16],"lifelin":16,"lifespan":0,"lift":[10,14,16],"light":[0,4,14,16],"lightweight":15,"like":[0,1,3,4,5,7,9,10,11,13,14,15,16],"likewis":4,"limit":[1,3,4,5,6,8,9,11,13],"line":[0,1,3,6,7,11,13,14,15,16],"linger":14,"link":[0,3,4,5,6,7,9,10,11,14,15,16],"link_clos":1,"link_establish":1,"link_id":[1,10],"link_mtu_discoveri":10,"linkexampl":1,"linux":[0,3,4,5,7,11,13],"liquid":16,"list":[0,1,3,4,5,6,7,10,11,13,15,16],"list_deliv":1,"list_fil":1,"list_filt":14,"list_packet":1,"list_receipt":1,"list_timeout":1,"listdir":1,"listen":[0,1,3,4,6,11,13,14,16],"listen_ip":7,"listen_on":[3,7],"listen_port":7,"liter":14,"litter":16,"littl":[5,11,13],"live":[0,3,10,11,16],"lki":13,"lkr":13,"ll":[1,15,16],"llm":11,"ln":14,"load":[1,3,4,5,7,10,14,15,16],"load_private_kei":10,"load_public_kei":10,"local":[0,1,3,4,6,7,9,10,11,13,15,16],"locat":[3,6,7,9,13,14,16],"location_cmd":7,"lock":16,"log":[0,1,3,4,7,14,16],"log_crit":1,"log_error":1,"log_info":1,"log_verbos":1,"logdest":10,"logfil":14,"logic":[13,16],"login":14,"loginctl":14,"loglevel":[1,10,14],"lon":7,"long":[1,3,4,5,6,7,9,10,13,14,16],"longer":[1,3,7,13,14,16],"longest":7,"longitud":7,"look":[1,3,4,7,9,11,13,14,16],"loop":1,"lora":[0,3,5,6,9,11,13,15,16],"lorawan":[5,13],"lose":0,"loss":[0,7,9,13],"lost":16,"lot":[9,13,16],"loudest":16,"low":[0,3,4,5,7,9,11,13,15,16],"lower":[1,3,7,14],"lowest":[0,10],"lowli":16,"ltu":5,"lunar":6,"lxmf":[4,6,7,9,10,14],"lxmfy":6,"lxst":6,"m":[1,3,4,13,14],"mac":[7,13],"machin":[0,3,8,13,14,16],"machineri":11,"maco":[6,11],"made":[3,4,7,10,13,16],"mai":[0,3,4,7,9,10,11,13,14,16],"mailbox":11,"mailmap":4,"main":[1,4],"maintain":[0,3,4,9,11,13,14,15],"mainten":[3,9,13,16],"major":4,"make":[0,1,3,4,5,7,9,11,12,13,14,15,16],"malici":[0,3,4,9,13,14],"malinform":12,"manag":[0,3,6,9,10,11,13,15,16],"mani":[1,3,4,5,7,9,10,11,13,14,15,16],"manifest":[0,4],"manipul":[13,15,16],"manjaro":3,"manner":[4,9,11],"manual":[0,1,3,7,9,10,13,14,15,16],"manufactur":[5,7],"map":[7,11,13,14,16],"mark":[3,4,7,8,10,13,15,16],"markdown":4,"market":[0,16],"markqvist":[1,12],"markup":[4,11],"mask":0,"mass":16,"massiv":7,"master":[1,4,10,16],"match":[0,1,4,7,13,14,16],"math":16,"mathemat":16,"matter":[0,3,7,9,16],"matur":14,"max":14,"max_request_s":10,"max_response_s":10,"maximum":[1,7,10,13,14],"mayb":16,"mb":4,"mbp":14,"md":4,"mdu":[1,10],"me":[7,16],"mean":[0,3,4,5,7,9,10,13,14,16],"meaning":3,"meaningless":0,"meantim":10,"measur":[0,9,13,16],"mechan":[0,3,4,6,7,9,14,15],"media":[4,16],"mediat":0,"mediev":16,"medium":[0,1,5,6,7,9,10,11,13,15],"meet":[0,16],"megaphon":16,"member":[3,13],"memori":[3,9,13],"men":0,"mental":16,"mention":[7,13],"menu":1,"menu_mod":1,"merchant":8,"mere":[0,16],"merg":[0,8,14],"merit":6,"mesh":[3,7,9,13,14,15,16],"meshchat":11,"meshchatx":6,"messag":[1,3,4,9,10,11,13,14,16],"message_class":10,"messagebas":[1,6,10],"messagecallbacktyp":10,"messeng":[9,13],"met":[0,3,16],"meta":4,"metadata":[0,3,4,7,13,14,16],"metaphor":16,"metavar":1,"meter":7,"meth":1,"method":[1,3,6,7,10,13],"methodologi":[13,14],"metric":[0,11],"mevpekyafshak5wr":7,"mhz":[7,13],"mi":1,"microcontrol":13,"micromanag":16,"micron":[4,6],"microwav":9,"middl":0,"middlemen":0,"might":[0,3,4,7,9,13,14,16],"migrat":0,"mikrotik":5,"millimet":5,"million":16,"millisecond":[1,9,14,16],"mind":[0,9,16],"mindset":16,"mine":16,"miner":16,"minim":[0,5,6,7,13],"minimalsampl":1,"minimum":[1,3,7,10,13,14,16],"minimum_bitr":10,"miniscul":16,"minor":4,"minut":[1,3,4,7,13,16],"mirror":[0,6,9,14],"mirror_interv":4,"misconfigur":3,"mislead":[3,16],"miss":[1,3,4],"missil":16,"mistak":3,"misunderstand":12,"mitig":9,"mix":[6,7,9,14],"mixtur":15,"mobil":[7,9,13],"mode":[0,1,3,4,5,6,9,10,11,13,14,15,16],"model":[0,8,9,14,16],"modem":[6,7,9,10,11,13,15,16],"modem73":11,"moder":7,"modern":[3,5,11,16],"modif":[0,4],"modifi":[0,4,7,8,9,13,14],"modul":[1,3,4,5,6,7,9,13,14,15],"modular":11,"moment":[13,16],"momentarili":7,"mon":4,"monero":12,"monet":0,"monitor":[3,7,11,13,14],"monolith":0,"monopol":0,"moon":1,"moral":16,"more":[0,1,3,4,5,7,9,10,11,12,13,14,15,16],"moscow":13,"most":[0,3,5,7,9,10,11,13,14,16],"mostli":[7,9,13],"motiv":6,"mountain":16,"move":[4,7,9,13,14,16],"msgpack":4,"msgtype":[1,10],"mtu":[1,7,10,13,15],"mu":4,"much":[3,7,9,11,13,14,15,16],"multi":[0,6,9,11,13,14,15],"multicast":7,"multicast_address_typ":7,"multilater":13,"multipl":[0,1,4,7,9,11,13,14],"multiplex":[1,14],"multipoint":13,"multitud":3,"music":0,"must":[0,1,3,4,7,9,10,13,14,16],"mutual":16,"mw":7,"my":[4,7,13,16],"my_fil":14,"my_ident":14,"my_network":[13,14],"my_network_ident":7,"my_nod":4,"myapp":4,"mycal":7,"myfork":4,"myfriend":16,"mymirror":4,"myrepo":4,"myriad":13,"mysteri":16,"n":[1,4,13,14],"name":[1,3,4,6,7,9,10],"namespac":1,"nano":4,"narg":1,"nat":[3,7],"nation":0,"nativ":[1,9],"natur":[0,7],"navig":[0,4],"nearbi":[7,9],"nearest":7,"nears":13,"neat":9,"neccessari":7,"necesarri":7,"necess":0,"necessari":[0,4,5,7,9,10,13,14],"necessarili":13,"need":[0,1,3,4,5,6,7,9,10,11,12,13,14,15,16],"needless":7,"neg":[3,7],"neglig":[13,16],"negoti":[0,16],"neighbor":16,"neither":[10,13],"neon":1,"neopixel":14,"nerd":4,"net":7,"netcat":7,"network":[0,1,5,7,10,14,15,16],"network_ident":[7,13,14],"network_nam":[3,7],"neutral":[9,16],"never":[0,7,9,10,13,16],"new":[0,1,3,4,6,9,10,13,14,16],"new_id":14,"new_ident":14,"newer":[10,13],"newest":13,"newli":[7,10,13],"newlin":[7,14],"next":[0,3,4,7,10,13,16],"next_hop":10,"next_hop_interfac":10,"nice":16,"nicknam":13,"no1cll":7,"no_data_for":10,"no_inbound_for":10,"no_outbound_for":10,"noauth":14,"nobl":1,"noble_ga":1,"noble_gas":1,"nobodi":4,"nocheck":14,"node":[0,3,6,7,14,15],"node_nam":4,"noid":14,"nois":[0,7,10,12,16],"noisi":16,"nomad":[0,6],"nomadnet":[4,11],"nomadnetwork":11,"non":[3,7,10,11,13,16],"none":[1,3,4,7,10,13,14],"noninfring":8,"nor":[3,16],"normal":[0,1,3,4,7,10,13,14],"nostalgia":0,"notabl":11,"notar":4,"notat":[13,14],"note":[0,1,4,5,6,7,10,13,14],"noth":[4,5,9,15,16],"notic":[4,7,8,13,14],"notif":[0,1,10],"now":[1,3,4,13,14,16],"np":14,"nrf52":5,"nt":1,"null":4,"num":1,"number":[1,3,4,7,9,10,11,13,14,16],"nurtur":0,"o":[1,3,4,7,13,14,15],"obj":4,"object":[1,4,10,16],"obscur":[0,3],"observ":[0,9,16],"obsolet":16,"obstacl":16,"obtain":[0,3,5,6,8,10,13],"obvious":13,"occupi":16,"occur":[1,7,14,15],"ocean":16,"ocur":10,"odd":1,"ofdm":11,"off":[3,7,9,11,13,14,15,16],"offer":[0,3,6,7,9,10,11,13,14,16],"offic":9,"offlin":[0,1,3,6,9,11],"often":[0,3,7,9,13,14,16],"oganesson":1,"old":[0,1,3,5,12,13,16],"older":14,"omit":10,"on_interfac":10,"onc":[1,3,4,5,7,10,13,14,15,16],"one":[0,1,3,4,5,7,9,10,11,13,14,15,16],"ones":[3,7,9,14],"oneself":13,"ongo":11,"onli":[0,1,3,4,5,7,9,10,13,14,15,16],"onlin":[1,10,14,16],"onto":[3,13,16],"ontolog":0,"opaqu":9,"open":[0,1,3,4,5,6,7,9,10,11,12,13,14,15],"open_port":1,"openmodem":[7,15],"openssl":[3,13],"openwrt":6,"oper":[0,3,4,5,7,9,10,13,14,15,16],"opinion":[0,12],"opkg":3,"opportun":3,"opportunist":9,"oppos":4,"opposit":[1,7],"oppress":16,"opt":13,"optic":[5,15,16],"optim":[0,3,4,9,16],"option":[0,1,3,4,5,6,9,10,11,13,14,16],"ord":1,"order":[0,1,7,10,14],"organ":[0,3,4,9,13,14,16],"organis":[7,12],"organiz":0,"orient":13,"origin":[1,4,6,9,11,13,16],"orthogon":0,"os":3,"other":[0,1,3,4,5,7,8,9,10,11,13,14,16],"otherwis":[1,4,7,8,10],"our":[1,7,13,16],"ourselv":9,"out":[1,5,7,8,10,11,13,14,16],"outag":0,"outbound":[7,10,13],"outgo":[1,7,10,13,14],"outlast":0,"outlin":[3,5,13],"output":[0,4,7,14],"outsid":[10,15,16],"over":[1,5,6,7,9,10,11,12,13,14,15,16],"overal":[13,14],"overcom":13,"overhead":[3,5,7,13,16],"overlai":3,"overli":12,"overlord":16,"overrid":[1,4],"oversight":13,"overview":[4,6,7],"overwhelm":[0,7,9,10],"overwrit":14,"own":[0,1,3,4,9,10,13,14,15,16],"owner":[1,16],"ownership":[0,16],"p":[1,4,14],"pace":0,"pack":[1,10],"packag":[0,1,3,4,7,11,13],"packb":1,"packed_s":1,"packet":[0,1,3,6,7,9,10,11,14,15,16],"packet_callback":1,"packet_deliv":1,"packet_hash":1,"packet_receipt":[1,10],"packet_timed_out":1,"packetreceipt":[1,6,10],"pad":[13,15],"page":[0,6,13,14,16],"page_cont":4,"pagin":4,"paid":0,"pair":[7,10,13,14],"pamac":3,"panic":[1,14,16],"panic_on_interface_error":[1,14],"panopticon":16,"paper":11,"par":[1,3],"paradox":16,"parallel":3,"paralysi":16,"param":1,"paramet":[1,5,6,10,13,14],"paranoia":16,"parasit":16,"pariti":[1,7,14,15],"parity_even":1,"parity_non":1,"parity_odd":1,"pars":[1,4],"parse_arg":1,"parser":[1,4,6],"part":[0,1,3,4,7,9,10,11,13,14,16],"parti":[0,4],"partial":4,"particip":[0,3,6,7,9,13,14,16],"particular":[0,1,5,7,8,13,14],"particularli":[0,4,7,14],"partner":16,"pass":[1,4,5,7,9,10,13,14,16],"passphras":[3,7,9,13],"passport":13,"past":14,"patch":[0,4,16],"path":[0,1,3,4,5,6,9,10,13,14,16],"path_respons":10,"pathfinder_m":10,"patient":16,"pattern":[0,4,5,6,9,13],"payload":[1,4,7,10,13,14],"pdf":6,"peac":16,"peach":1,"peak":4,"peer":[0,1,3,4,7,10,11,13,14,16],"penalti":7,"pend":[1,13],"peopl":[0,3,11,13,16],"per":[0,4,7,9,10,11,13,14,15,16],"percent":[1,7],"percentag":10,"perfectli":[0,3],"perform":[0,1,3,4,7,9,10,11,13,14,16],"perhap":[3,16],"period":[1,4,7,10,13,14],"peripher":11,"perm":4,"perman":[3,7,14],"permiss":[0,6,7,8,14,16],"permissionless":[0,13,14],"permit":8,"perpetu":16,"persecut":13,"persist":[0,7,14,16],"person":[6,7,8,9,12,13],"personag":0,"perspect":[0,7,9,10,13,15],"pet":1,"petit":16,"philosophi":[0,12,13,15,16],"phone":[3,6,9,16],"phonebook":11,"photo":16,"phy":14,"physic":[0,1,3,4,5,6,7,9,10,11,13,14,15],"pi":[0,1,6,9,13,14,15,16],"pick":13,"piec":13,"pillar":16,"ping":[14,16],"pip":[1,3,4,5,7,14],"pip3":3,"pipe":[6,11,14,15,16],"pipeinterfac":[5,7,11],"pipx":3,"pitfal":13,"pkcs7":[13,15],"pkg":3,"place":[1,3,4,7,9,13,14,16],"plaform":5,"plain":[1,5,7,10,13,16],"plain_mdu":10,"plaintext":[1,10,16],"plan":[9,13,16],"planet":[0,16],"planetari":[15,16],"platform":[1,4,5,6,11,13,14,16],"pleas":[1,3,7,10,14,16],"plenti":[9,13],"plu":10,"plug":[14,16],"plugin":[11,16],"pmr":13,"poetri":16,"point":[0,3,4,5,7,9,11,12,13,14,16],"pointer":3,"polici":[0,14,16],"polit":16,"pomelo":1,"popul":10,"popular":15,"port":[1,3,5,6,7,9,13,15,16],"port0":14,"portabl":[0,6,7,9,13],"portion":8,"pose":[3,13],"posit":[1,4,7,14],"posix":3,"possess":[7,13,16],"possibl":[0,3,4,5,7,9,10,11,13,14,15],"possibli":[3,13],"post":[1,6],"postfix":14,"potenti":[0,1,3,4,7,12,13,14,15,16],"power":[0,3,5,6,7,9,11,13,14,15],"powershel":3,"ppp":1,"pr":14,"practic":[0,4,9,13,15,16],"pre":[3,9,10,13],"preambl":[7,14],"preced":[1,4],"preciou":9,"precis":0,"precompil":3,"predatori":16,"predic":0,"predict":13,"prefer":[3,4,12,13],"prefer_ipv6":7,"premis":[9,16],"prepar":[1,13],"prerequisit":[6,10],"prescrib":0,"presenc":[0,6,7,10],"present":[0,7,9,11,13,14,16],"preserv":[0,3,6,10],"preshar":13,"press":1,"pressur":0,"pretend":[11,13],"prettyhexrep":1,"prevent":[0,4,7,9,14,16],"preview":4,"previou":1,"previous":[7,10,13],"price":16,"primari":[0,13,16],"primarili":[7,9,11],"primarlii":3,"primit":[3,4,6],"principl":[0,6,9,13,15],"print":[1,4,7,14],"print_filelist":1,"print_help":1,"print_menu":1,"priorit":[7,9,13,16],"prioriti":[7,13],"prioritis":[6,7,9,10],"privaci":[3,7,11,16],"privat":[0,3,4,7,9,10,11,12,13,14,15,16],"private_ret":3,"privileg":[0,14,16],"probabl":[1,3,4,9,13,14,15],"probe":14,"problem":[0,3,4,13,14,16],"problemat":4,"proc":14,"procedur":[3,4,10,13],"process":[0,1,3,4,5,7,9,10,13,14,16],"process_incom":1,"process_outgo":1,"produc":0,"product":[0,14,16],"profil":16,"profit":16,"profound":[9,16],"profoundli":16,"program":[1,4,5,6,7,10,13,15],"program_setup":1,"programm":13,"programmat":[0,13],"progress":[1,4,10,14,15],"progress_callback":10,"project":[0,4,11,12,16],"promis":3,"prompt":[1,3],"proof":[0,1,4,7,9,10,13,14,16],"proof_packet":1,"proof_requested_callback":10,"proof_strategi":10,"propag":[6,7,9,10,11,14,16],"proper":3,"properli":3,"properti":[0,1,9,10],"proport":13,"propos":6,"prospect":0,"protect":[0,3,14,16],"protocol":[3,4,5,6,7,9,15],"prove":[1,4,9,13,16],"prove_al":[1,10],"prove_app":10,"prove_non":10,"proven":[0,4,10,13],"provid":[0,1,3,4,5,6,7,8,9,10,11,13,14,15,16],"provis":[5,14],"prv_byte":10,"prx":14,"pseudo":14,"psycholog":[0,16],"ptx":14,"pub_byt":10,"pub_to_fil":10,"public":[1,4,6,7,9,10,12,14,15],"public_inform":1,"publicli":[3,7,13,14],"publish":[0,3,4,6,7,8,10,13],"publish_blackhol":14,"publish_blackhole_en":10,"publish_ifac":7,"pull":[0,4],"puppet":16,"purchas":[3,13,15],"pure":[6,13],"purg":10,"purpos":[0,3,4,5,7,8,9,10,11,13,14,16],"purposefulli":8,"pursu":0,"push":[0,4,11,16],"put":[0,1,5,7,14],"pwd":4,"py":[1,4,13,14],"py3":[3,4],"pyca":[3,13],"pygment":4,"pyseri":[1,3],"python":[0,1,4,6,7,10,13,14,15,16],"python3":[1,3,5],"q":[1,4,14],"qlen_in_announc":7,"qlen_in_data":7,"qlen_in_il":7,"qlen_in_pr":7,"qr":[9,11],"qualiti":[0,10,14,16],"quantiti":0,"queri":[1,3,4,10,14,16],"question":[3,5,7],"queu":[10,14],"queue":[6,13,14],"quick":14,"quickli":[7,11,12,13,15],"quiet":[4,7,14,16],"quinc":1,"quirk":3,"quit":[1,3],"quot":4,"qvist":[8,15],"r":[1,4,7,13,14],"radic":16,"radio":[0,6,7,9,10,11,13,14,15,16],"radon":1,"rais":[0,1,10],"rak":5,"ram":[3,7],"randint":1,"random":[0,1,10,12,13],"random_text_gener":1,"randomis":13,"randomli":[1,13],"rang":[0,1,3,4,5,7,9,13,14,15,16],"rapidli":7,"rare":[3,7],"raspberri":[0,6,9,13,14,15],"rasperri":3,"ratchet":[10,13],"ratchet_count":10,"ratchet_expiri":10,"ratchet_id_receiv":10,"ratchet_interv":10,"ratchets":10,"ratchets_path":10,"rate":[1,3,6,10,11,14],"rather":[0,3,10,11,14,16],"ratio":[0,10],"raw":[1,4,5,10],"rawchannelread":[6,10],"rawchannelwrit":[6,10],"rawiobas":10,"rawmu":4,"rb":1,"rbrowser":6,"re":[0,1,7,9,10,13,14,16],"reach":[0,3,6,7,9,10,14,16],"reachabl":[0,1,3,7,9,10,11,13,14],"reachable_on":7,"reactiv":0,"read":[0,1,3,4,7,9,10,13,14,15,16],"read_loop":1,"readabl":[0,1,7,10,13,14,16],"reader":[1,10],"readi":[1,3,5,7,10,15,16],"readili":15,"readm":4,"readwrit":4,"ready_byt":[1,10],"ready_callback":10,"real":[0,3,5,7,9,11,14,15,16],"realiti":[0,3,12,16],"realiz":16,"realli":[7,10,14,16],"realm":16,"reappear":7,"reason":[3,7,10,13,14],"reassembl":13,"reboot":16,"rebroadcast":9,"rebuilt":16,"recal":[1,4,10,14],"recall_app_data":10,"recap":13,"receipt":[1,9,10,13],"receiv":[1,3,4,7,9,10,12,13,14,16],"receive_path_respons":10,"receive_stream_id":10,"received_announc":[1,10],"recent":[10,13],"recept":10,"reception_rssi":1,"reception_snr":1,"reception_stat":1,"recip":3,"recipi":[0,4,13,16],"reclaim":16,"recogn":[13,16],"recognis":14,"recognit":[0,16],"recombin":0,"recommend":[0,1,3,7,13],"recondit":14,"reconnect":[1,9,16],"reconnect_port":1,"reconstruct":13,"record":[0,3,4,13],"record_stat":4,"recov":0,"recoveri":7,"recreat":13,"recurs":[7,10,13],"recursive_pr":7,"reduc":[7,14],"redund":[3,9],"reestablish":0,"ref":4,"refactor":4,"refer":[0,1,3,4,6,7,11,14,16],"refin":12,"reflect":0,"refresh":14,"refus":9,"regain":[0,3],"regard":[0,13],"regardless":[0,4,7],"region":7,"regist":[1,4,10,14],"register_announce_handl":[1,10],"register_message_typ":[1,10],"register_request_handl":[1,10],"registrar":16,"registri":[0,16],"regul":7,"regular":14,"regulatori":16,"regurgit":16,"reintroduc":0,"reject":[4,16],"rel":[4,5,7,9,13],"relai":[3,6],"relat":[3,4],"relationship":[0,9,13,14,16],"releas":[0,3,6,7,13,14,16],"relev":[1,3,4,5,7,10,13,14,16],"reli":[3,4,7,9,12,13,14,16],"reliabl":[3,5,7,9,10,13,15,16],"relianc":[3,16],"relief":9,"reload":14,"rem":1,"remain":[0,4,7,9,10,11,13,16],"rememb":[7,9,10,13],"remot":[1,6,10,13],"remote_ident":[1,4,10],"remote_identifi":1,"remote_management_allow":14,"remote_management_en":10,"remote_nod":4,"remote_p":1,"remotesensor":13,"remov":[0,4,10,14,16],"remove_message_handl":10,"remove_ready_callback":10,"render":[4,11,16],"rent":16,"reopen":4,"repeatedli":[0,7],"replac":[0,1,3,9,10,11,13,14,16],"repli":[1,14],"replic":[0,5,13],"reply_data":1,"reply_messag":1,"reply_text":1,"repo":[4,14],"repo_nam":4,"report":[7,10,12,14],"repositori":[0,3,6,13,14,16],"repres":[0,9,13,16],"represent":[1,10,16],"repudi":4,"repurpos":3,"reput":[13,14],"request":[0,4,6,9,10,13,14,15,16],"request_destin":1,"request_fail":1,"request_id":[1,10],"request_packet":1,"request_path":[1,10],"request_receipt":[1,10],"request_receiv":1,"requested_at":[1,10],"requestexampl":1,"requestor":7,"requestreceipt":[6,10],"requir":[0,1,3,4,7,9,10,11,13,14,15,16],"require_shared_inst":10,"required_discovery_valu":[10,14],"rerout":16,"research":0,"resend":10,"reserv":[1,9,10,16],"reset":4,"reshap":0,"resid":[7,16],"resili":[0,3,9,11,14,15,16],"resist":9,"resiz":14,"resolut":[3,4,7,13],"resolv":[4,6,7,9,13,14],"resourc":[1,3,6,7,9,10,12,14,16],"resource_callback":10,"resource_sending_conclud":1,"resource_strategi":10,"respawn":7,"respawn_delai":7,"respawn_interv":7,"respect":[0,4,7,9,15,16],"respond":[0,1,9,10,14],"respond_to_prob":14,"respons":[0,6,7,10,13,15,16],"response_callback":[1,10],"response_gener":[1,10],"rest":[9,15,16],"restart":[7,14],"restartsec":14,"restor":[3,6,7,16],"restrict":[4,7,8,9,14,16],"resubmit":4,"result":[0,1,3,7,13,14],"ret":[6,13],"retain":[0,4,7,10],"retained_ratchet":10,"retibb":6,"reticulum":[0,1,7,9,10],"retipedia":6,"retransmiss":[9,13],"retransmit":[7,13],"retri":[1,4,10,13],"retriev":[0,4,10,14],"return":[0,1,7,10,14,16],"reveal":[3,10,13,15],"revers":14,"review":[0,13],"revis":14,"revok":[4,16],"revolut":16,"revolutionari":0,"rfe":14,"rich":11,"ridicul":13,"right":[0,3,4,7,8,16],"rigid":16,"rington":11,"rippl":16,"risc":6,"risk":[4,13],"riski":16,"rm":4,"rmap":3,"rn":[0,1,3,4,5,6,10,13,14,16],"rncp":6,"rngc":4,"rngit":[0,6],"rngit_config":4,"rnid":[4,6,13],"rnmon":6,"rnode":[3,6,13,14,15],"rnodeconf":[5,6],"rnodef3b9":7,"rnodeinterfac":[3,5,7,14],"rnodemultiinterfac":7,"rnpath":[3,6,7],"rnphone":11,"rnprobe":[3,6],"rns_bin_dir":14,"rns_config":4,"rns_remot":4,"rnsconfig":[4,14],"rnsd":[3,6],"rnsh":[6,11],"rnspure":[3,13],"rnstatu":[3,6,7,13],"rnstransport":[7,14],"rnx":6,"road":[6,16],"roadmap":[12,16],"roam":[6,7,9],"robot":13,"robust":[3,7,16],"role":9,"roll":7,"rom":14,"room":[11,16],"root":[4,13],"rotat":[7,10,13,14],"round":[1,10,14],"rout":[3,5,7,9,10,11,13,14,15,16],"router":[3,7,9,14,16],"rpc":14,"rpc_kei":14,"rprogress":1,"rrc":6,"rrcd":11,"rsg":[0,4],"rsm":[0,4],"rssi":[1,10,14],"rtsct":1,"rtt":[1,10,13],"rttstring":1,"rubber":16,"rule":[0,3,4,6,7,9,14,16],"run":[0,1,3,4,5,7,9,10,11,13,14,15,16],"runtim":[1,13],"rust":3,"rvp":4,"rw":4,"rx":[7,14],"rxb":1,"sa":11,"safe":[4,13,14,16],"safeguard":16,"safeti":0,"sai":[0,16],"said":[4,13],"sake":0,"same":[0,1,3,4,5,7,9,10,11,13,14,16],"sand":16,"satellit":9,"satisfi":13,"satur":0,"save":[4,10,13,14],"save_error":1,"saved_filenam":1,"saw":11,"scalabl":[14,15],"scale":[13,15,16],"scan":[3,7],"scarc":16,"scarciti":6,"scatter":16,"scenario":[3,7,13],"schedul":[4,10],"scheme":[0,4,5,7,14],"scope":[4,7],"scrape":16,"scratch":[5,16],"screen":1,"script":[0,3,4,5,7,14],"scrutini":13,"sd":0,"se":4,"sea":7,"seamless":[7,13],"seamlessli":[7,9],"search":[6,10,11],"second":[1,7,9,10,11,13,14,15,16],"secreci":[7,10,11,13,15],"secret":[9,13],"section":[3,4,5,7,9,11,13,14],"secur":[0,3,4,6,9,11,13,14,15,16],"sed":4,"see":[1,3,4,7,9,10,13,14,15,16],"seek":[0,13,16],"seen":[7,13,16],"segment":[1,3,7,9,10,13,14,15],"select":[1,3,4,7,16],"self":[0,1,3,4,13,15,16],"sell":8,"semi":[4,14],"semtech":5,"send":[1,4,7,9,10,13,14,16],"send_stream_id":10,"sender":[1,3,9,13,14],"sens":[0,9,16],"sensibl":[3,5,7],"sensit":16,"sensor":[9,13],"sent":[1,3,9,10,13,14,16],"sentiment":13,"separ":[0,1,7,9,11,13,14],"seq":4,"sequenc":[1,4,10,13,14,15],"sequenti":[4,15],"serfdom":16,"seri":5,"serial":[1,3,6,9,13,15,16],"serialinterfac":[5,7],"seriou":0,"serv":[0,1,5,6,7,9,11,12,13,14,16],"serve_nomadnet":4,"serve_path":1,"server":[0,1,3,4,5,6,9,10,11,13,14,16],"server_buffer_readi":1,"server_callback":1,"server_client_connect":1,"server_destin":1,"server_fil":1,"server_ident":1,"server_link":1,"server_loop":1,"server_message_receiv":1,"server_packet_receiv":1,"servic":[0,3,4,6,7,9,11,13,16],"session":[3,11,13,14],"set":[0,1,3,4,5,7,9,10,11,13,14,15,16],"set_default_app_data":10,"set_delivery_callback":[1,10],"set_link_closed_callback":[1,10],"set_link_established_callback":[1,10],"set_max_request_s":10,"set_packet_callback":[1,10],"set_proof_requested_callback":10,"set_proof_strategi":[1,10],"set_ratchet_interv":10,"set_remote_identified_callback":[1,10],"set_resource_callback":10,"set_resource_concluded_callback":[1,10],"set_resource_started_callback":[1,10],"set_resource_strategi":[1,10],"set_retained_ratchet":10,"set_timeout":[1,10],"set_timeout_callback":[1,10],"setup":[1,3,4,6,7,14],"sever":[3,4,9,10,14],"sf":14,"sh":7,"sha":[9,10,13],"sha256":[4,13,15],"shall":[8,13],"shape":[9,16],"share":[0,1,3,9,10,11,13,14,16],"share_inst":14,"shared_instance_port":14,"shared_instance_typ":[10,14],"shelf":[13,15],"shell":[0,3,4,6,14,16],"shelter":0,"shift":[0,16],"shim":4,"shine":16,"ship":[13,16],"shop":[1,16],"short":[5,6,7,13,14],"shorter":7,"shorthand":[7,14],"shortlog":4,"shot":3,"should":[0,1,3,4,7,9,10,13,14,16],"should_ingress_limit":1,"should_quit":1,"should_use_implicit_proof":10,"shout":16,"shove":0,"show":[3,4,14,16],"shown":[0,1,12],"shut":[0,16],"side":[0,7,14,15],"sideband":[3,6,14],"sign":[0,6,7,9,10,13,14,16],"signal":[0,1,7,10,13,14,16],"signatur":[0,6,9,10,13,14,15,16],"signer":4,"signifi":13,"signific":9,"significantli":[7,10],"signingkei":4,"silent":14,"similar":[0,1,3,4,5,7,10,11,14,15],"simpl":[1,3,4,5,10,11,13,14,15,16],"simpler":[4,7,9,15],"simplest":[7,13],"simpli":[0,1,3,4,5,7,9,11,12,13,14,16],"simplic":13,"simplifi":1,"simplyequip":5,"simul":13,"simultan":[3,13],"sinc":[1,3,4,7,9,10,13,16],"singl":[0,1,3,4,7,9,10,13,14,15,16],"singular":13,"sit":[3,16],"site":[0,7,9,16],"situat":[3,4,5,7,9,13,14],"size":[1,3,4,7,10,13,14],"size_str":1,"skill":0,"skip":[1,4],"sky":6,"slap":16,"slave":16,"sleep":[1,3,14],"slice":[1,16],"slightli":[1,3,16],"sloppi":16,"slottim":[7,14],"slow":[1,7,9,11,13,16],"slower":[7,10,13],"slowest":10,"small":[1,3,7,9,10,13,15,16],"smaller":10,"smallest":3,"snippet":14,"snr":[1,10,14],"so":[0,1,3,4,5,7,8,9,10,11,12,13,14,15,16],"social":[0,3,16],"societi":16,"socket":[7,14,15,16],"soft":16,"softwar":[0,3,4,5,7,8,11,13,14,16],"solar":16,"sole":7,"solid":12,"solo":0,"solut":[0,13,14],"solv":[0,13,16],"some":[0,1,3,5,7,9,10,11,13,14,16],"some_program":4,"some_program_1":4,"some_remot":4,"someon":[0,3,4,7,14,16],"someth":[0,4,7,9,13,16],"somethign":1,"sometim":[5,7,11,16],"somewhat":3,"somewher":16,"soon":[4,10,14],"sort":[7,13,14],"soul":16,"sound":16,"soundmodem":7,"sourc":[0,1,3,4,5,6,9,10,13,15,16],"source_":4,"sovereign":[0,3,13,16],"sovereignli":16,"sovereignti":[6,15],"space":[0,1,3,5,9,13,15,16],"spam":[3,7,13,14],"spammi":14,"span":[7,9,13],"spawn":7,"spe":7,"speak":[0,12,16],"spec":13,"special":[11,13,14],"specif":[0,1,4,5,6,7,9,10,14,15,16],"specifi":[0,1,3,4,5,7,9,10,13,14],"spectrum":[7,13,16],"speed":[1,7,10,13,14,16],"sphere":16,"spinner":16,"spirit":11,"split":1,"sponsor":12,"spoof":[4,16],"spread":[7,14],"spreadingfactor":7,"squelch":7,"ssh":[4,11,14],"ssid":7,"ssl":16,"stabil":[9,16],"stabl":[3,7,9,13,15],"stack":[1,3,9,10,11,13,14,15,16],"stage":13,"stai":[1,7,13,14,16],"stake":0,"stale":[9,10],"stale_grac":10,"stale_tim":10,"stamp":[7,10,14],"stanc":[0,16],"stand":[0,16],"standalon":[6,11],"standard":[0,4,5,7,11,13,14],"start":[1,4,5,6,7,9,10,11,13,14,16],"startup":[1,3,14],"stat":[4,10,14],"state":[0,1,6,9,16],"static":[3,4,7,10,16],"staticmethod":1,"station":7,"stationari":[9,14,16],"statist":[1,6,7,10,12],"stats_ignore_ident":4,"statu":[1,3,4,6,7,10,11,13,14,16],"stderr":14,"stdin":[7,14],"stdio":15,"stdout":[1,4,7,14],"steel":16,"stem":12,"step":[1,3,4,5,16],"stewardship":16,"still":[0,1,3,4,7,9,13,14,16],"stock":1,"stone":16,"stop":[10,15,16],"stopbit":[1,7,14],"storag":[3,6,7,11,13,14,16],"store":[0,1,4,6,10,11,13,14],"store_tru":1,"storm":16,"str":[1,10],"straightforward":7,"strang":16,"stranger":16,"strangl":16,"strateg":9,"strategi":[0,6,7,10],"stream":[0,1,10,11,13,14,16],"stream_id":[1,10],"street":16,"strength":[10,15,16],"strict":[0,16],"strictli":[7,13],"string":[1,10,16],"stringmessag":1,"strip":[0,4,16],"strong":[3,4,13,16],"stronger":3,"strongli":3,"struct":1,"structur":[0,1,6,9,10,13,15,16],"studi":0,"style":[4,7],"sub":[1,7],"subclass":[1,10],"subcommand":4,"subdirectori":4,"subinterfac":7,"subject":[3,8,14,15,16],"sublicens":8,"submit":0,"subnet":[3,9],"subscrib":[3,14,16],"subsequ":[1,4,13],"subset":7,"subsid":7,"substanti":[0,8],"substrat":[0,16],"subtl":16,"subtli":16,"succe":[3,4,14],"succeed":[1,10],"succesfulli":9,"success":[0,3,4,7,10],"successful":10,"successfulli":[1,10,13],"suddenli":16,"sudo":[3,14],"suffer":9,"suffic":13,"suffici":[3,7,13,14,15],"suffix":1,"suit":[0,3,5,11,13,14,16],"suitabl":[1,3,7,9,13,14,15],"sum":16,"super":1,"supersed":7,"superstructur":0,"suppli":[1,7,10,13,14,15],"supplier":3,"support":[0,1,3,4,6,7,9,10,11,13,14,15],"suprem":0,"sure":[1,3,4,5,7,14],"surfac":16,"surrend":0,"surround":[0,16],"surveil":[0,13,16],"surviv":[3,13,14,16],"suspend":0,"sustain":16,"swim":0,"switch":[5,7,9,13,14,16],"sx1262":5,"sx1268":5,"sx1276":5,"sx1278":5,"sx1280":5,"sy":1,"symlink":14,"symmetr":[10,13],"sync":4,"syncer":4,"synchron":[0,6,11,16],"syntax":6,"synthet":16,"system":[0,1,3,4,5,6,7,8,9,10,11,12,13,15],"systemctl":14,"systemd":14,"t":[0,1,3,4,7,9,10,13,14,16],"tabl":[3,7,9,13,14,16],"tablet":3,"tackl":11,"tag":[4,10],"tail":7,"tailor":13,"take":[0,1,3,4,7,10,11,13,14,15,16],"taken":[1,4,13,14,16],"talk":[11,16],"tamper":[0,4,16],"tangerin":1,"tap":[5,16],"tar":4,"target":[1,3,4,7,11,14,16],"target_hash":10,"target_host":7,"target_port":[7,14],"task":[4,14],"taught":16,"tcp":[3,5,6,9,13,14,15,16],"tcpclientinterfac":[3,5,7],"tcpinterfac":14,"tcpserverinterfac":[3,7],"tdata":1,"teach":[14,16],"teahous":[0,12],"team":4,"teardown":[1,10],"teardown_reason":1,"tech":16,"technic":[0,4],"technician":16,"technolog":0,"technologi":[3,9,16],"teffect":1,"telco":16,"telecom":16,"telemetri":[11,12],"telephon":6,"telephoni":11,"televis":16,"tell":[1,3,7,9,16],"temperatur":13,"templat":6,"temporari":[3,7,14],"temporarili":[7,9],"ten":13,"tenanc":16,"tenant":16,"tend":7,"tenuou":16,"term":[0,3,7,9,13,16],"termin":[1,3,4,10,11,14],"terminologi":[9,13],"termux":3,"terrifi":16,"territori":0,"test":[3,4,11,13,14,16],"testimoni":0,"testnet":14,"tether":16,"text":[1,11,13,14],"textur":16,"tfile":1,"tgz":[4,14],"than":[0,1,3,4,7,9,10,11,12,13,14,15,16],"thank":4,"theatric":0,"thei":[0,1,3,4,7,9,10,11,13,14,16],"them":[0,1,3,4,5,7,9,11,12,13,14,15,16],"theme":4,"themselv":[0,4,7,9,14],"theori":[0,16],"thereaft":13,"therefor":[3,13,15,16],"thi":[0,1,3,4,5,6,7,8,9,10,11,12,13,14,15,16],"thing":[1,3,9,11],"think":[3,5,7,9,12,13,16],"third":[0,4],"those":[0,3,9,13,14,16],"though":[0,3,7,9,13],"thought":16,"thousand":[0,3,7,13,14,16],"thread":[0,1,4],"threat":14,"three":[3,13,16],"threshold":7,"throough":7,"throttl":[7,9],"through":[1,3,4,5,6,7,9,10,11,13,14,15],"throughout":[9,13],"throughput":[0,10,11,13,15],"thrown":[10,16],"thu":[9,10,13],"ti":[1,9,13],"tighten":16,"tightrop":16,"tild":14,"time":[0,1,3,4,5,6,7,9,10,11,12,13,14],"time_since_last":1,"timefram":0,"timeout":[1,10,14,16],"timeoutarg":1,"timer":4,"timescal":0,"timestamp":[1,4,10,13,16],"timestr":1,"tion":7,"titl":4,"tl":16,"tmp":14,"tnc":[5,7,10,11,14,15],"to_fil":10,"todai":[0,13,16],"togeth":[5,9,13,14,16],"toggl":14,"token":[10,13,15],"tokyo":16,"told":16,"toler":7,"tomorrow":16,"too":[1,9,16],"tool":[0,3,4,5,6,7,9,11,13,14,15],"toolkit":[3,9],"top":[0,11,13,14,16],"topic":[3,13],"topograph":7,"topographi":[3,9,13,16],"topologi":[3,7,9,13,15,16],"torn":[10,14],"tort":8,"tortur":16,"torvald":0,"total":[4,10,13,14,15],"total_s":1,"touch":[7,16],"toward":[1,7,13],"tower":16,"toxic":0,"track":[0,4,10,14,16],"track_phy_stat":10,"trade":[9,13],"tradit":[4,9,13,16],"tradition":0,"traffic":[1,3,7,9,10,13,14,16],"train":[8,16],"transceiv":[3,5,7,11,13,15],"transfer":[1,4,10,13,14,15],"transfer_s":1,"transform":15,"transient":16,"transistor":16,"translat":9,"transmiss":[3,7,10,13,16],"transmit":[1,4,7,13,16],"transmitt":16,"transpar":[4,5,7,9,13,14],"transport":[0,1,3,4,6,7,10,11,14,15,16],"transport_en":10,"transport_ident":14,"travel":[0,16],"travers":[0,3,7,10,13,16],"treat":[0,4,9,13,16],"tree":[0,4],"tremend":9,"tri":1,"trigger":7,"trip":[1,10,14],"trivial":[13,15],"troubl":16,"true":[0,1,3,7,10,14,16],"truli":[5,13,16],"truncat":[10,13,14],"truncated_hash":10,"truncated_hashlength":[1,10],"trust":[0,3,4,6,7,9,13,14],"trustless":[6,13,15],"trustworthi":[9,14],"truth":4,"try":[1,4,6,7,9,10,11],"ttime":1,"ttransfer":1,"ttyacm0":7,"ttyusb0":[1,7,14],"ttyusb1":7,"ttyusb2":7,"tun":[5,7],"tun0":7,"tune":6,"tunnel":[3,7,9,13,15,16],"tupl":10,"turn":[0,1,7,14,16],"turnaround":7,"tutori":3,"two":[0,1,4,5,7,9,10,13,14],"tx":[7,14],"txb":1,"txp":14,"txpower":7,"txt":[4,14],"txtail":[7,14],"type":[1,3,6,7,9,10,14],"typeerror":10,"typic":[4,7,9,13],"tyrant":16,"u":[13,14,16],"ubiqu":5,"ubuntu":[6,14],"uci":3,"udp":[6,9,13,14,15],"udpinterfac":7,"uhf":[14,15],"ui":[11,16],"ultim":[3,13,16],"umsgpack":1,"unavail":4,"unblackhol":14,"unblackhole_ident":10,"unblock":14,"unbound":16,"uncar":16,"uncencrypt":1,"uncentraliz":6,"unchang":9,"uncoordin":[3,16],"under":[0,4,7,10,12,13,14,15,16],"underli":[1,7,9,10,13,15],"undermin":16,"underneath":16,"undersea":16,"understand":[0,3,6,7,9,10,14,15,16],"understood":16,"underwai":3,"underwear":16,"unencrypt":[1,10,13],"unequivoc":13,"unexplor":9,"unforeseen":0,"unforg":[9,15],"unfortun":3,"unicod":4,"unicode_icon":4,"unidentifi":1,"unidirect":1,"unifi":[9,13],"uninform":0,"uninterest":1,"uniqu":[1,7,9,10,11,13,14,15,16],"unit":[0,1,3,10,14],"univers":16,"unix":[4,10],"unknown":[1,7,9,10,13,14],"unlearn":16,"unless":[1,3,7,9,10,13],"unlicens":13,"unlik":[0,4,13],"unlock":14,"unmedi":0,"unnecessari":7,"unorganis":9,"unpack":[1,10],"unpackb":1,"unpaid":16,"unplug":[14,16],"unrecover":[1,14],"unreli":7,"unsatur":0,"unset":13,"unsupport":10,"until":[1,3,7,10],"untrust":[4,14],"untrustworthi":16,"unus":14,"unwant":[13,14],"up":[0,1,3,4,5,7,9,10,11,13,14,15,16],"updat":[0,1,3,4,10,13,14,16],"upgrad":[3,10,13],"upkeep":7,"upload":4,"upon":[0,1,7,13],"upset":1,"upstream":[0,4,14],"uptim":16,"urandom":[13,15],"urgenc":0,"urgent":16,"uri":11,"url":[0,4,14,16],"us":[0,1,4,5,6,7,8,9,10,16],"usabl":[4,7,13],"usag":[4,6,7,10,11,12,14],"usb":[0,5,13,14],"useabl":13,"useless":[0,16],"user":[0,1,3,4,7,9,11,13,14,15,16],"user_input":1,"userland":15,"usernam":16,"usernameher":14,"usr":[7,14],"usual":[3,7,9],"utf":1,"util":[1,5,6,7,13,16],"utilis":[1,3,7,10,13,14,15],"ux":11,"v":[4,6,14],"valid":[0,1,3,6,7,9,10,13,14,16],"valu":[0,1,3,4,7,10,13,14,16],"valuabl":[0,4,5,12,16],"valueerror":[1,10],"vanish":16,"vanishingli":16,"var":4,"vari":[3,7,13,14],"variabl":[1,3,4,10],"varieti":[7,11,13,14,15],"variou":[1,3,7,9,10,11,13,14,15],"vast":[0,3,13,16],"vastli":9,"ve":9,"vehicl":7,"veloc":0,"vendor":[1,5,15],"ventur":16,"venu":0,"verbos":[4,10,14],"veri":[0,3,4,5,7,9,10,11,12,13,14,15,16],"verif":[0,6,9,10,11,13,14,16],"verifi":[0,1,3,6,7,9,10,13,14,15,16],"versa":15,"version":[0,1,3,4,13,14,16],"vhf":[13,15],"vi":4,"via":[0,3,4,5,7,9,11,12,13,14,15,16],"viabl":9,"vice":15,"video":16,"view":[0,3,4,7,12,13,14],"viewabl":4,"vim":4,"violat":7,"virtual":[3,5,7,9,13,14,15],"virtuou":16,"visibl":[0,1,4,7],"visual":[4,13,16],"vital":16,"voic":[0,11,12,16],"voicemail":11,"volunt":3,"voluntari":3,"vouch":16,"vpn":[9,16],"vport":7,"vulner":9,"vv":14,"vvv":3,"w":[4,14],"wa":[0,1,4,5,7,9,10,13,14,15,16],"wai":[0,1,4,6,7,9,10,11,13,14,16],"wait":[1,3,7,11,13,14,16],"walk":16,"wall":16,"wander":16,"want":[0,1,3,4,7,9,11,12,13,14,16],"wantedbi":14,"warn":14,"warrant":15,"warranti":8,"wash":16,"wast":[7,9,12,16],"wave":[5,16],"wb":1,"we":[0,1,3,5,7,9,12,13,16],"weaken":13,"weapon":[0,16],"wear":16,"weather":16,"weav":16,"web":[3,11,16],"websit":[3,7,16],"weigh":16,"weight":[0,4,14,16],"welcom":0,"well":[0,4,5,7,9,10,11,12,13,14,15,16],"went":1,"were":[0,1,4,11,16],"what":[0,1,3,4,6,7,9,10,13,14,16],"whatev":[9,10,13],"wheel":[3,4],"when":[0,1,3,4,5,7,9,10,11,13,14,16],"whenev":[1,10,13],"where":[0,3,4,5,6,7,9,10,11,13,14,16],"whereupon":13,"wherev":16,"whether":[1,3,4,7,8,9,10,13,16],"which":[0,1,3,4,7,8,9,10,11,13,14,15,16],"while":[0,1,3,4,5,7,9,10,11,13,14,15,16],"whim":16,"whitelist":13,"whl":[3,4],"who":[0,3,4,7,9,13,14,16],"whole":[14,16],"whom":[8,16],"whose":[14,16],"why":[0,16],"wide":[3,4,5,7,9,11,13,14,15],"wider":[3,7,9,13,14],"wield":0,"wifi":[3,6,7,9,11,13,14,15,16],"wikipedia":11,"wild":[4,14,16],"wildcard":[1,4],"wilder":16,"willing":14,"window":[6,7,11,14],"windowsil":16,"wipe":14,"wire":[5,6,7,11,15,16],"wireless":[5,9],"wirelessli":7,"wish":[1,7,13,14,16],"within":[0,1,3,4,7,9,10,13,16],"without":[1,3,4,5,6,7,8,9,11,13,14,15,16],"wlan0":7,"wolf":5,"won":1,"word":[0,3,16],"work":[0,3,5,6,7,9,11,13,14,15],"workabl":9,"workflow":6,"world":[0,3,5,7,9,11,14,15,16],"worri":9,"worth":[0,3],"would":[0,4,7,10,11,13,14,16],"wrap":4,"write":[0,1,3,4,5,7,10,11,13,14,16],"write_timeout":1,"writer":[1,10],"written":[1,4,13,15,16],"wrong":[1,3,7,16],"wrote":[1,7],"x":[4,10,13,14],"x25519":[13,15],"x86_64":4,"xenon":1,"xonxoff":1,"y":[1,4],"ye":[3,4,7,13,14,16],"year":[13,16],"yet":[0,1,7,13,16],"yggdrasil":7,"yi":1,"you":[0,1,3,4,5,6,7,9,10,11,12,13,14,15,16],"your":[0,1,4,5,6,7,9,12,13,15,16],"yourself":[0,3,13,14,15,16],"z":1,"zen":[6,15],"zero":[6,7,10,11,15],"zi":1,"zim":11,"zip":4,"zone":[0,13],"zshrc":3},"titles":["Distributed Development","Code Examples","An Explanation of Reticulum for Human Beings","Getting Started Fast","Git Over Reticulum","Communications Hardware","Reticulum Network Stack Manual","Configuring Interfaces","Reticulum License","Building Networks","API Reference","Programs Using Reticulum","Support Reticulum","Understanding Reticulum","Using Reticulum on Your System","What is Reticulum?","Zen of Reticulum"],"titleterms":{"0":5,"1":5,"25":7,"A":16,"Beings":2,"For":16,"In":16,"Not":[9,16],"Of":[0,6,16],"Or":16,"The":[0,4,13,14,16],"To":16,"With":[3,4],"abil":16,"access":[4,13],"ad":3,"address":[9,16],"agenc":16,"alias":4,"an":2,"anchor":16,"android":3,"announc":[1,7,13,16],"api":10,"architectur":[0,16],"archiv":0,"arm64":3,"artifact":0,"attribut":4,"author":4,"auto":7,"autom":[7,14],"automat":4,"ax":7,"backbon":[3,7],"bandwidth":16,"base":[3,5],"basic":13,"beam":5,"bind":4,"blackhol":14,"block":7,"board":5,"bookworm":3,"bootstrap":3,"broadcast":1,"buffer":1,"build":[3,9],"burst":7,"byte":16,"can":15,"carrier":16,"center":[0,16],"channel":1,"chat":11,"client":[7,11],"cloud":16,"code":[1,13],"combin":5,"command":4,"commit":4,"common":7,"commun":5,"compos":0,"concept":9,"conceptu":13,"configur":[4,7,14],"connect":[3,7,9,11],"consider":[7,9],"content":6,"contribut":3,"control":7,"cost":16,"creat":[3,4,5,13],"creation":4,"creator":4,"cryptograph":[4,13],"current":[13,15],"custom":[1,3,4,7],"data":14,"death":16,"debian":3,"decentr":16,"deck":5,"depend":3,"design":16,"destin":[4,7,9,13],"detail":13,"develop":[0,3],"devic":[5,15],"disconnect":16,"discov":14,"discover":7,"discoveri":7,"distribut":[0,3],"document":4,"doe":15,"domain":16,"donat":12,"echo":[1,5],"emerg":16,"empti":4,"enabl":[4,7],"encrypt":16,"entrypoint":3,"environ":16,"establish":13,"ethernet":5,"ethic":16,"exampl":[1,4,7],"exist":16,"explan":2,"fabric":16,"fallaci":16,"fast":3,"featur":16,"feedback":12,"filesync":11,"filetransf":1,"find":3,"finish":16,"fix":14,"flow":16,"fork":4,"form":4,"format":[4,13],"forward":16,"from":16,"function":13,"further":13,"futur":13,"get":[3,13],"git":4,"global":3,"goal":13,"grade":16,"group":4,"hardwar":5,"harm":16,"health":3,"heltec":5,"heterogen":9,"hierarchi":4,"highlight":4,"host":3,"hostil":16,"human":[2,16],"i":[15,16],"i2p":7,"ident":[4,13,16],"identif":1,"illus":16,"implement":15,"implic":13,"improv":14,"includ":[3,14],"independ":16,"indic":6,"infrastructur":[0,3,16],"ingress":7,"instal":[3,5],"instanc":[3,9],"interact":[4,11],"interfac":[1,3,7,11,13,14,15,16],"intermediari":0,"internet":3,"interregnum":0,"introduct":13,"introductori":9,"ip":16,"issu":3,"j":11,"kei":13,"kiss":7,"liber":16,"licens":8,"lilygo":5,"limit":[7,16],"line":[4,5],"link":[1,13],"list":14,"listen":7,"local":14,"locat":4,"long":0,"lora":7,"lora32":5,"lunar":3,"lxmf":11,"lxmfy":11,"lxst":11,"maco":3,"manag":[4,14],"manual":[4,6],"mechan":13,"medium":16,"merit":16,"meshchatx":11,"method":4,"micron":11,"minim":1,"mirror":4,"mix":3,"mode":7,"modem":5,"modul":11,"motiv":13,"multi":7,"name":[13,14,16],"network":[3,4,6,9,11,13],"new":7,"node":[4,9,11,13,16],"nomad":[4,11,16],"note":3,"obtain":4,"offer":15,"offlin":4,"open":16,"opencom":5,"openwrt":3,"option":7,"origin":0,"over":[0,3,4],"overview":[9,13],"packet":[5,13],"page":[4,11],"paramet":[4,7],"parser":11,"path":7,"pattern":16,"permiss":4,"person":[3,16],"phone":11,"physic":16,"pi":3,"pipe":7,"platform":[0,3],"port":14,"portabl":16,"post":16,"power":16,"prerequisit":4,"presenc":16,"preserv":16,"primit":[0,13],"principl":16,"prioritis":13,"program":[3,11,14],"propag":13,"propos":4,"protocol":[0,11,13,16],"provid":12,"public":[3,13,16],"publish":14,"pure":3,"python":3,"queue":7,"radio":[3,5],"rak4631":5,"raspberri":3,"rate":7,"rbrowser":11,"reach":13,"refer":[10,13,15],"relai":11,"releas":4,"remot":[4,7,11,14],"repositori":4,"request":[1,7],"resolv":3,"resourc":[11,13],"respons":[1,3],"restor":0,"ret":3,"retibb":11,"reticulum":[2,3,4,5,6,8,11,12,13,14,15,16],"retipedia":11,"risc":3,"rn":11,"rncp":14,"rngit":[4,14],"rnid":14,"rnmon":11,"rnode":[5,7],"rnodeconf":14,"rnpath":14,"rnprobe":14,"rnsd":14,"rnsh":14,"rnstatu":14,"rnx":14,"road":0,"roam":16,"rrc":11,"rule":13,"scarciti":16,"secur":7,"serial":[5,7,14],"serv":4,"server":7,"servic":14,"setup":13,"shell":11,"short":4,"sideband":11,"sign":4,"signatur":4,"sky":16,"sourc":14,"sovereignti":[0,16],"specif":[3,13],"stack":6,"standalon":3,"start":[0,3],"state":4,"statist":4,"statu":15,"storag":4,"store":16,"strategi":3,"structur":4,"support":[5,12],"suprem":5,"synchron":4,"syntax":4,"system":[14,16],"systemwid":14,"t":5,"t114":5,"t3s3":5,"tabl":6,"tcp":7,"telephon":11,"templat":4,"through":[0,16],"time":16,"tool":16,"transport":[9,13],"trust":16,"trustless":9,"try":3,"tune":7,"type":[4,5,13,15],"ubuntu":3,"udp":7,"uncentraliz":16,"understand":13,"unsign":5,"us":[3,11,13,14,15],"usag":[5,13],"userspac":14,"util":[3,4,11,14],"v":3,"v1":5,"v2":5,"v3":5,"v4":5,"valid":4,"verif":4,"verifi":4,"wai":3,"what":15,"where":15,"wifi":5,"window":3,"wire":13,"without":0,"work":[4,16],"workflow":[0,4],"x":5,"xl":5,"your":[3,14],"zen":16,"zero":16}}) \ No newline at end of file diff --git a/docs/manual/software.html b/docs/manual/software.html index 4793a485..d705c5bd 100644 --- a/docs/manual/software.html +++ b/docs/manual/software.html @@ -7,7 +7,7 @@ - Programs Using Reticulum - Reticulum Network Stack 1.6.1 documentation + Programs Using Reticulum - Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
    @@ -204,7 +204,7 @@
    - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -218,7 +218,6 @@
  • Zen of Reticulum
  • Programs Using Reticulum
  • Using Reticulum on Your System
  • -
  • Protecting Open Networks
  • Understanding Reticulum
  • Communications Hardware
  • Configuring Interfaces
  • @@ -228,7 +227,6 @@
  • Support Reticulum
  • Code Examples
  • Reticulum License
  • -
  • Brandolini’s Reference
    • API Reference
    • @@ -266,114 +264,96 @@

      Programs Using Reticulum

      -

      This chapter provides a non-exhaustive list of notable programs, systems and application-layer protocols that have been built using Reticulum.

      -

      Many different applications using Reticulum already exist, serving a wide variety of purposes from day-to-day communication and information sharing to systems administration and tackling advanced networking and communications challenges.

      -
      -

      Tip

      -

      For ease of discovery while reading this manual over the web or as an e-book, links provided in this chapter primarily point to repositories and pages located on internet servers. In many cases, these are public web mirrors, with the upstream repositories residing on Reticulum nodes. For the latest source, updates and information regarding any project, be sure to check their Nomad Network or rngit nodes.

      -
      -

      These programs will let you get a feel for how Reticulum works. Most of them have been designed to run well even over slow networks based on LoRa or packet radio, but all can also be used over fast links, such as local WiFi, wired Ethernet, the Internet, or any combination.

      -

      As such, it is easy to get started experimenting, without having to set up any radio transceivers or infrastructure just to try it out. Launching the programs on separate devices connected to the same WiFi network is enough to get started, and physical radio interfaces can then be added later.

      -

      Development of Reticulum-based applications and systems is ongoing, so consider this list a non-exhaustive starting point of some of the options available. With a bit of searching, primarily over Reticulum itself, you will find many more interesting things.

      -
      -

      Browsing & Publishing

      -

      In addition to the programs listed in this section, other Nomad Network clients include:

      - +

      This chapter provides a non-exhaustive list of notable programs, systems and application-layer +protocols that have been built using Reticulum.

      +

      These programs will let you get a feel for how Reticulum works. Most of them have been designed +to run well even over slow networks based on LoRa or packet radio, but all can also be used over fast +links, such as local WiFi, wired Ethernet, the Internet, or any combination.

      +

      As such, it is easy to get started experimenting, without having to set up any radio +transceivers or infrastructure just to try it out. Launching the programs on separate +devices connected to the same WiFi network is enough to get started, and physical +radio interfaces can then be added later.

      +
      +

      Programs & Utilities

      +

      Many different applications using Reticulum already exist, serving a wide variety of purposes +from day-to-day communication and information sharing to systems administration and tackling +advanced networking and communications challenges.

      +

      Development of Reticulum-based applications and systems is ongoing, so consider this list +a non-exhaustive starting point of some of the options available. With a bit of searching, +primarily over Reticulum itself, you will find many more interesting things.

      +
      +

      Remote Shell

      +

      The rnsh program lets you establish fully interactive +remote shell sessions over Reticulum. It also allows you to pipe any program to or from a +remote system, and is similar to how ssh works. The rnsh program is very efficient, and +can facilitate fully interactive shell sessions, even over extremely low-bandwidth links, +such as LoRa or packet radio.

      +

      In addition to the default, fully interactive terminal mode, +for extremely limited links, rnsh offers line-interactive mode, allowing you to interact +with remote systems, even when link throughput is counted in a few hundreds of bits per second.

      +

      Nomad Network

      -

      The terminal-based program Nomad Network provides a complete encrypted communications suite built with Reticulum.

      -_images/nomadnet_6.webp +

      The terminal-based program Nomad Network +provides a complete encrypted communications suite built with Reticulum. It features +encrypted messaging (both direct and delayed-delivery for offline users), file sharing, +and has a built-in text-browser and page server with support for dynamically rendered pages, +user authentication and more.

      +_images/nomadnet_3.png -

      It features encrypted LXMF messaging (both direct and delayed-delivery for offline users), file sharing, and has a built-in text-browser and page server with support for dynamically rendered pages, user authentication and more. It also includes an RRC client and a suite of network utilities.

      -
      -
      -

      Ren Browser

      -

      Ren Browser is a modern, standalone browser for Nomad Network using the Reticulum-Go implementation. The project is actively being developed, and should be considered alpha level software, but much of the functionality is already working. If you want to help expanding the ecosystem, this is an excellent project to take a look at.

      -_images/ren_browser.webp - -

      Ren Browser is great example of an application aiming for true, seamless interoperability with the existing software ecosystem. It can operate fully standalone using it’s own embedded Go implementation of Reticulum, or seamlessly utilise a shared RNS instance already running on the system.

      +

      Nomad Network is a user-facing client +for the messaging and information-sharing protocol LXMF.

      RNS Page Node

      -

      RNS Page Node is a simple way to serve pages and files to any other Nomad Network compatible client. Drop-in replacement for NomadNet nodes that primarily serve pages and files.

      +

      RNS Page Node is a simple way to serve pages and files to any other Nomad Network compatible client. Drop-in replacement for NomadNet nodes that primarily serve pages and files.

      Retipedia

      -

      You can host the entirity of Wikipedia, StackExchange or any other .zim file, to Nomad Network clients using Retipedia.

      -_images/retipedia.webp - +

      You can host the entirity of Wikipedia (or any .zim) file to other Nomad Network clients using Retipedia.

      -
      -

      Git Over Reticulum

      -

      The included rngit system provides a fully distributed solution for managing, hosting, collaborating on and interacting with Git repositories over Reticulum.

      -_images/rngit.webp -
      -
      -
      -

      Messaging & Voice

      Sideband

      -

      Sideband is a technical LXMF and LXST client, for Android, Linux, macOS and Windows. It also serves as a multi-purpose Reticulum utility, with features and functionality targeted at advanced users.

      -_images/sideband_devices.webp +

      If you would rather use an LXMF client with a graphical user interface, you can take +a look at Sideband, which is available for Android, +Linux, macOS and Windows. Sideband is an advanced LXMF and LXST client, and a multi-purpose Reticulum +utility, with features and functionality targeted at advanced users.

      +_images/sideband_devices.webp -

      Sideband allows you to communicate with other people or LXMF-compatible systems over Reticulum networks using LoRa, Packet Radio, WiFi, I2P, Encrypted QR Paper Messages, or anything else Reticulum supports.

      -

      It interoperates with all other LXMF clients, and provides advanced features such as PTT and voice messaging, real-time voice calls, file attachments, private telemetry sharing, and a full plugin system for expandability.

      +

      Sideband allows you to communicate with other people or LXMF-compatible +systems over Reticulum networks using LoRa, Packet Radio, WiFi, I2P, Encrypted QR +Paper Messages, or anything else Reticulum supports.

      +

      It also interoperates with all other LXMF clients, and provides advanced features such as voice messaging, +real-time voice calls, file attachments, private telemetry sharing, and a full +plugin system for expandability.

      -
      -

      MeshChatX

      -

      MeshChatX is an all-in-one Reticulum client with messaging, calling, and a NomadNet browser, providing everything you need for Reticulum, LXMF, and LXST in one beautiful and feature-rich application.

      -_images/meshchatx.webp +
      +

      MeshChatX

      +

      A Reticulum MeshChat fork from the future, with the goal of providing everything you need for Reticulum, LXMF, and LXST in one beautiful and feature-rich application. This project is separate from the original Reticulum MeshChat project, and is not affiliated with the original project, but is a much more up-to-date, comprehensive and well-maintained fork.

      +_images/meshchatx.webp -

      Features include full LXST support, custom voicemail, phonebook, contact sharing, ringtone support, multi-identity handling, modern UI/UX, offline documentation, expanded tools, page archiving, integrated maps, telemetry and improved application security.

      +

      Features include full LXST support, custom voicemail, phonebook, contact sharing, and ringtone support, multi-identity handling, modern UI/UX, offline documentation, expanded tools, page archiving, integrated maps, telemetry and improved application security.

      -
      -

      Columba

      -

      Columba is a simple and familiar LXMF messaging app Android, built with a native Android interface and Material Design 3. It also includes LXST voice call functionality, and a mobile Nomad Network page browser.

      -_images/columba.webp - -
      -
      -

      Ren TUI

      -

      Ren TUI is an early prototype terminal LXMF client for Reticulum built with Odin on librns (Reticulum-Go). It aims for NomadNet-like messaging/browsing without urwid or ncurses.

      -_images/rentui.webp - -
      -
      -
      -

      Chat

      Reticulum Relay Chat

      Reticulum Relay Chat is a live chat system built on top of the Reticulum Network Stack. It exists to let people talk to each other in real time over Reticulum without dragging in message databases, synchronization engines, or architectural commitments they did not ask for.

      -_images/rrc.webp +

      The rrcd program provides a functional, reference RRC hub-server daemon implementation. RRC user clients include rrc-gui and rrc-web.

      RRC is closer in spirit to IRC than to modern “everything platforms.” You connect, you join a room, you talk, and then you leave. If you were present, you saw the conversation. If you were not, the conversation did not wait for you. This is not an accident. This is the entire design.

      -

      The rrcd program provides a functional, reference RRC hub-server daemon implementation. RRC user clients include:

      -

      RetiBBS

      -

      RetiBBS is an old-school bulletin board system implementation for Reticulum networks.

      +

      RetiBBS is a bulletin board system implementation for Reticulum networks.

      _images/retibbs.webp

      RetiBBS allows users to communicate through message boards in a secure manner.

      +
      +

      RBrowser

      +

      The rBrowser program is a cross-platform, standalone, web-based browser for exploring NomadNetwork Nodes over Reticulum Network. It automatically discovers NomadNet nodes through network announces and provides a user-friendly interface for browsing distributed content with Micron markup support.

      +_images/rbrowser.webp + +

      Includes useful features like automatic listening for announce, adding nodes to favorites, browsing and rendering any kind of NomadNet links, downloading files from remote nodes, a unique local NomadNet Search Engine and more.

      -
      -

      Voice & Telephony

      -

      In addition to the programs listed in this section, other LXST voice clients include:

      -

      Reticulum Network Telephone

      The rnphone program, included as part of the LXST package is a command-line Reticulum telephone utility and daemon, that allows building physical, hardware telephones for LXST and Reticulum, as well as simply performing calls via the command line.

      @@ -381,75 +361,34 @@

      It supports interfacing directly with hardware peripherals such as GPIO keypads and LCD displays, providing a modular system for building secure hardware telephones.

      -
      -

      Partyline

      -

      Partyline is a group voice application for Reticulum, built on LXST, inspired by Mumble.

      -_images/partyline.webp - -

      It provides both realtime group voice over any Reticulum transport capable of >6 kilobits per second, LXST dial-in support, listen-only music/broadcasting rooms, and many other useful functions.

      -

      LXST Phone

      -

      The LXST Phone program is a cross-platform desktop application for performing LXST voice calls over Reticulum. It supports various advanced features such as SAS verification, peer blocking, rate limiting, encrypted call history storage and contact management.

      +

      The LXST Phone program is a cross-platform desktop application for performing LXST voice calls over Reticulum.

      _images/lxst_phone.webp -
      -
      -
      -

      System Administration

      -
      -

      Remote Shell

      -

      The included rnsh program lets you establish fully interactive -remote shell sessions over Reticulum. It also allows you to pipe any program to or from a -remote system, and is similar to how ssh works. The rnsh program is very efficient, and -can facilitate fully interactive shell sessions, even over extremely low-bandwidth links, -such as LoRa or packet radio.

      -

      In addition to the default, fully interactive terminal mode, for extremely limited links, -rnsh offers line-interactive mode, allowing you to interact with remote systems, even -when link throughput is counted in a few hundreds of bits per second.

      -
      -
      -

      RNS FileSync

      -

      The RNS FileSync program enables automatic file synchronization between devices without requiring central servers, internet connectivity, or cloud services. It works over any network medium supported by Reticulum, including radio, LoRa, WiFi, or the internet, making it ideal for off-grid, privacy-focused, and resilient file sharing.

      -
      -
      -
      -

      Utilities & Components

      -
      -

      Modem73

      -

      MODEM73 and its companion Modem73Interface is an open source software modem that works with any HF, VHF, or UHF radio capable of 2400 Hz of bandwidth. All you need is a sound card and audio cable for your radio.

      -_images/modem73.webp - +

      It supports various advanced features such as SAS verification, peer blocking, rate limiting, encrypted call history storage and contact management.

      LXMFy

      -

      LXMFy is a comprehensive and advanced bot creation framework for LXMF, that allows building any kind of automation or bot system running over LXMF and Reticulum. Bot implementations exist for Home Assistant control, LLM integrations, and various other purposes.

      +

      LXMFy is a comprehensive and advanced bot creation framework for LXMF, that allows building any kind of automation or bot system running over LXMF and Reticulum. Bot implementations exist for Home Assistant control, LLM integrations, and various other purposes.

      +
      +
      +

      LXMF Interactive Client

      +

      LXMF Interactive Client is a feature-rich, terminal-based LXMF messaging client with many advanced features and an extensible plugin architecture.

      +
      +
      +

      RNS FileSync

      +

      The RNS FileSync program enables automatic file synchronization between devices without requiring central servers, internet connectivity, or cloud services. It works over any network medium supported by Reticulum, including radio, LoRa, WiFi, or the internet, making it ideal for off-grid, privacy-focused, and resilient file sharing.

      Micron Parser JS

      Micron Parser JS is the JavaScript-based parser for the Micron markup language, that most web-based Nomad Network browsers use. If you want to make utilities or tools that display Micron pages, this library is essential.

      -
      -

      Reticulated

      -

      Reticulated is a Reticulum Network simulator that spawns live, interactive Reticulum instances controllable from a node-based Web UI.

      -_images/reticulated.webp - -

      You can create networks of any topology and set bitrate, MTU, and configure path loss and propagation behavior. It provides a top-down view to a live network. You can connect any Reticulum application to the simulated network. It also has built in utilities like a basic LXMF chat function and Resource transfer included.

      -

      RNMon

      RNMon is a monitoring daemon designed to monitor the status of multiple RNS applications and push the metrics to an InfluxDB instance over the influx line protocol.

      -
      -

      Device Flashers

      -

      In addition to the included command-line rnodeconf flasher, several community-provided RNode device flashers exist:

      - -

      Several programs, such as Sideband and MeshChatX also include built-in device flashers that can be used fully offline.

      -

      Protocols

      A number of standard protocols have emerged through real-world usage and testing in the Reticulum community. While you may sometimes want to use completely custom protocols and implementations when writing Reticulum-based software, using these protocols provides application developers with an easy way to implement advanced functionality quickly and effortlessly. Using them also ensures compatibility and interoperability between many different client applications, creating an open communications ecosystem where users are free to choose the applications that suit their needs, while remaining connected to everyone else.

      @@ -459,8 +398,8 @@ when link throughput is counted in a few hundreds of bits per second.

      LXMF is efficient enough that it can deliver messages over extremely low-bandwidth systems such as packet radio or LoRa. Encrypted LXMF messages can also be encoded as QR-codes or text-based URIs, allowing completely analog paper message transport.

      Using Propagation Nodes, LXMF also offer a way to store and forward messages to users or endpoints that are not directly reachable at the time of message emission.

      -
      -

      LXST

      +
      +

      LXST

      LXST is a simple and flexible real-time streaming format and delivery protocol that allows a wide variety of applications, while using as little bandwidth as possible. It is built on top of Reticulum and offers zero-conf stream routing, end-to-end encryption and Forward Secrecy, and can be transported over any kind of medium that Reticulum supports. It currently powers real-time voice and telephony applications over Reticulum.

      @@ -473,11 +412,11 @@ when link throughput is counted in a few hundreds of bits per second.

      Interface Modules & Connectivity Resources

      This section provides a list of various community-provided interface modules, guides and resources for creating Reticulum networks over special or challenging mediums.

      @@ -537,49 +476,28 @@ when link throughput is counted in a few hundreds of bits per second.

      -
    + diff --git a/docs/manual/support.html b/docs/manual/support.html index 7eedacf5..20910394 100644 --- a/docs/manual/support.html +++ b/docs/manual/support.html @@ -7,7 +7,7 @@ - Support Reticulum - Reticulum Network Stack 1.6.1 documentation + Support Reticulum - Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
    @@ -204,7 +204,7 @@
    - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -218,7 +218,6 @@
  • Zen of Reticulum
  • Programs Using Reticulum
  • Using Reticulum on Your System
  • -
  • Protecting Open Networks
  • Understanding Reticulum
  • Communications Hardware
  • Configuring Interfaces
  • @@ -228,7 +227,6 @@
  • Support Reticulum
  • Code Examples
  • Reticulum License
  • -
  • Brandolini’s Reference
    • API Reference
    • @@ -287,6 +285,8 @@ Ko-Fi: https://ko-fi.com/markqvist
    +

    Are certain features in the development roadmap are important to you or your +organisation? Make them a reality quickly by sponsoring their implementation.

  • Provide Feedback

    @@ -383,7 +383,7 @@ circumstances, so we rely on old-fashioned human feedback.

    - + diff --git a/docs/manual/understanding.html b/docs/manual/understanding.html index 0c67efff..1bfc726b 100644 --- a/docs/manual/understanding.html +++ b/docs/manual/understanding.html @@ -3,11 +3,11 @@ - + - Understanding Reticulum - Reticulum Network Stack 1.6.1 documentation + Understanding Reticulum - Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
    @@ -204,7 +204,7 @@
    - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -218,7 +218,6 @@
  • Zen of Reticulum
  • Programs Using Reticulum
  • Using Reticulum on Your System
  • -
  • Protecting Open Networks
  • Understanding Reticulum
  • Communications Hardware
  • Configuring Interfaces
  • @@ -228,7 +227,6 @@
  • Support Reticulum
  • Code Examples
  • Reticulum License
  • -
  • Brandolini’s Reference
    • API Reference
    • @@ -1031,14 +1029,14 @@ those risks are acceptable to you.

    - +
    Previous
    -
    Protecting Open Networks
    +
    Using Reticulum on Your System
    @@ -1121,7 +1119,7 @@ those risks are acceptable to you.

    - + diff --git a/docs/manual/using.html b/docs/manual/using.html index 9f1ee15e..44817bfe 100644 --- a/docs/manual/using.html +++ b/docs/manual/using.html @@ -3,11 +3,11 @@ - + - Using Reticulum on Your System - Reticulum Network Stack 1.6.1 documentation + Using Reticulum on Your System - Reticulum Network Stack 1.5.1 documentation @@ -180,7 +180,7 @@
    @@ -204,7 +204,7 @@
    - Reticulum Network Stack 1.6.1 documentation + Reticulum Network Stack 1.5.1 documentation @@ -218,7 +218,6 @@
  • Zen of Reticulum
  • Programs Using Reticulum
  • Using Reticulum on Your System
  • -
  • Protecting Open Networks
  • Understanding Reticulum
  • Communications Hardware
  • Configuring Interfaces
  • @@ -228,7 +227,6 @@
  • Support Reticulum
  • Code Examples
  • Reticulum License
  • -
  • Brandolini’s Reference
    • API Reference
    • @@ -444,12 +442,10 @@ configuration file is created. The default configuration looks like this:

      change anything, and you may already be connected to a wider network. If not, you will probably need to add relevant interfaces to the configuration, in order to communicate with other systems.

      -

      The example above does not document all the available options, only the basics. -To explore all the various configuration options available, you can generate a -much more verbose and complete configuration example by running the command:

      +

      You can generate a much more verbose configuration example by running the command:

      rnsd --exampleconfig

      -

      The output includes examples for most interface types supported by Reticulum, -along with additional options and configuration parameters.

      +

      The output includes examples for most interface types supported +by Reticulum, along with additional options and configuration parameters.

      It is a good idea to read the comments and explanations in the above default config. It will teach you the basic concepts you need to understand to configure your network. Once you have done that, take a look at the Interfaces chapter @@ -508,7 +504,8 @@ options:

    The rnstatus Utility

    -

    Using the rnstatus utility, you can view the status of and control configured Reticulum interfaces, similar to the ifconfig program.

    +

    Using the rnstatus utility, you can view the status of configured Reticulum +interfaces, similar to the ifconfig program.

    Usage Examples

    Run rnstatus:

    $ rnstatus
    @@ -574,9 +571,6 @@ options:
       -h, --help            show this help message and exit
       --config CONFIG       path to alternative Reticulum config directory
       --version             show program's version number and exit
    -  --attach name         Attach interface by name
    -  --detach name         Detach interface by name
    -  --reload name         Reload interface by name
       -a, --all             show all interfaces
       -A, --announce-stats  show announce stats
       -P, --pr-stats        show path request stats
    @@ -594,8 +588,6 @@ options:
       -w seconds            timeout before giving up on remote queries
       -d, --discovered      list discovered interfaces
       -D                    show details and config entries for discovered interfaces
    -  --show-stale          show stale discovery entries
    -  --show-unknown        show discovery entries without version info
       -m, --monitor         continuously monitor status
       -I, --monitor-interval seconds
                             refresh interval for monitor mode (default: 1)
    @@ -824,7 +816,7 @@ and simply running the program in listener mode:

    $ rncp --fetch ~/path/to/file.tgz 73cbd378bb0286ed11a707c13447bb1e
     
    -

    The default identity file is stored in ~/.reticulum/storage/identities/rncp, but you can use +

    The default identity file is stored in ~/.reticulum/identities/rncp, but you can use another one, which will be created if it does not already exist

    $ rncp ~/path/to/file.tgz 73cbd378bb0286ed11a707c13447bb1e -i /path/to/identity
     
    @@ -880,7 +872,7 @@ options:

    The rnx utility is a basic remote command execution program. It allows you to execute commands on remote systems over Reticulum, and to view returned command output. For a fully interactive remote shell solution, be sure to also take a look -at the rnsh program.

    +at the rnsh program.

    Usage Examples

    Run rnx on the listening system, specifying which identities are allowed to execute commands:

    -

    The rnsh Utility

    +

    The rnsh Utility

    The rnsh utility provides a fully interactive remote shell over Reticulum. It allows you to establish encrypted, authenticated shell sessions on remote systems, complete with terminal emulation, pipe support, and window resizing.

    @@ -1068,10 +1060,9 @@ the remote process, rather than always returning rnsh is stored at -~/.rns/identity (default listener identity is in ~/.rns/identity.default), -but you can specify a different one with the -i option, which will be created if -it does not already exist:

    +

    The default identity file for rnsh is stored at +~/.reticulum/identities/rnsh, but you can specify a different one with the +-i option, which will be created if it does not already exist:

    $ rnsh -l -i /path/to/identity
     
    @@ -1245,15 +1236,6 @@ section of this manual.

  • Maintain connectivity to RNS instances with unknown or changing IP addresses

  • Discovered interfaces can be auto-connected by Reticulum, which makes it possible to create setups where an arbitrary interface can act simply as a bootstrap connection, that can be torn down again once more suitable interfaces have been discovered and connected.

    -
    -

    Important

    -

    While it might be tempting to configure Reticulum to auto-connect dozens of interfaces, this will not provide you with any benefit. It will also waste the limited resources of transport node operators. In almost all situations, using 2-3 auto-connected interfaces will be sufficient.

    -

    Remember: A deeper, more branched topology is much more efficient than a completely flat fan-out, where everyone connects to everyone!

    -

    For devices that connect directly to the distributed backbone, such as phones and other mobile devices, use one or two auto-connects - or a fixed node you that you like, and an auto-connect as redundant backup.

    -

    For a transport node in your home, serving all devices within it, 2 or 3 autoconnects will be reasonable.

    -

    For a fast boundary node that sits between a large, internal network with hundreds of active destinations, you can consider using five to six auto-connects. The same is a sensible number for general-purpose transport-providing backbone nodes on the public internet.

    -

    In extreme cases, you can consider using up to 12 auto-connected interfaces. Almost nobody will need this, but there are edge cases where it could potentially be useful. Do not auto-connect that wide unless you are prepared and capable of processing some serious traffic.

    -

    The interface discovery mechanism uses announces sent over Reticulum itself, and supports both publicly readable interfaces and private, encrypted discovery, that can only be decoded by specified network identities. It is also possible to specify which network identities should be considered valid sources for discovered interfaces, so that interfaces published by unknown entities are ignored.

    Note

    @@ -1329,7 +1311,6 @@ network_identity = ~/.reticulum/storage/identities/my_network
    • The autoconnect_interface_mode options specifies which mode discovered interfaces should be created with when auto-connecting.

    • The autoconnect_announces_to_internal option allows you to specify that auto-connected interfaces should propagate announces to internal mode interfaces, even if the auto-connected interface’s mode would normally not allow for this.

    • -
    • The autoconnect_unverified_implementations option will allow the interface discovery system to auto-connect to any announced interface, even those coming from unverified, experimental or potentially broken implementations. Be very careful with this option.

    @@ -1444,7 +1425,7 @@ remote_management_allowed = 9fb6d773498fb3feda407ed8ef2c3229, 2d882c5586e548d79b

    Federation and Trust

    The blackhole system relies on the trust relationship between the subscriber and the publisher. By subscribing to a source, you are implicitly trusting that source to only block identities that are genuinely detrimental to the network.

    As the ecosystem matures, this system is designed to integrate with Network Identities. This allows communities to verify that a published blackhole list is actually provided by a specific network or organization with a certain level of reputation and trustworthiness, adding a layer of cryptographic trust to the federation process. This prevents malicious actors from publishing fake lists intended to censor legitimate traffic.

    -

    For operators, this creates a scalable model where maintaining a single high-quality blocklist can protect thousands of downstream peers, drastically reducing the administrative overhead.

    +

    For operators, this creates a scalable model where maintaining a single high-quality blocklist can protect thousands of downstream peers, drastically reducing the administrative.

    @@ -1510,7 +1491,6 @@ Type=simple Restart=always RestartSec=3 User=USERNAMEHERE -Environment=MALLOC_ARENA_MAX=2 ExecStart=rnsd --service [Install] @@ -1545,7 +1525,6 @@ After=default.target Type=simple Restart=always RestartSec=3 -Environment=MALLOC_ARENA_MAX=2 ExecStart=RNS_BIN_DIR/rnsd --service [Install] @@ -1573,12 +1552,12 @@ systemctl --user enable rnsd.service