diff --git a/.gitignore b/.gitignore index 82fbc8a..23e3d69 100644 --- a/.gitignore +++ b/.gitignore @@ -2,4 +2,4 @@ AGENTS.md .clang-format # Built Go binary (replaces bash script in place; bash kept as isthislegit.sh) -/isthislegit +/isthislegit* diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..f288702 --- /dev/null +++ b/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/README.md b/README.md index 3a5971b..efa7acf 100644 --- a/README.md +++ b/README.md @@ -4,7 +4,14 @@ Domain Impersonation & OSINT Triage Tool. `isthislegit` compares a known-legitimate domain (target) against a suspect domain using DNS resolution, X.509 TLS certificates, and RDAP registration -data to produce a deterministic risk score and verdict. It ships as a single +data to produce a deterministic risk score and verdict. DNS answers are +cross-checked across the system resolver, 1.1.1.1, and 8.8.8.8 for +split-brain or hijacking signals (state consistency only — raw addresses +are never compared, so CDN/GeoDNS fronting stays quiet). Each unique +domain is probed once and the outcomes reused; even identical +target/suspect pairs run the full pipeline (verdict forced to legitimate). +System-dark/public-live suppression splits score on the suspect, while +split-horizon shapes stay display-only. It ships as a single static binary built on the Go standard library (plus `golang.org/x/sync` for the concurrent fetch pipeline) — no `curl`, `openssl`, `jq`, or `dig` required. @@ -146,8 +153,14 @@ VERDICT: LIKELY UNRELATED / MISCONFIGURED | Signal | Points | |---------------------------------------------|--------| -| Suspect domain age < 30 days (CRITICAL) | +80 | -| Suspect domain age 30–89 days (WARNING) | +80 | +| Suspect < 30d (CRITICAL), stacked w/ signal | +80 | +| Suspect < 30d (CRITICAL), isolated | +40 | +| Suspect 30–89d (WARNING), stacked w/ signal | +40 | +| Suspect 30–89d (WARNING), isolated | +20 | +| Shared cert infrastructure (halves age tier)| x0.5 | +| Identical target/suspect (forced LEGITIMATE) | +0 | +| Resolution tampering: suppression split (suspect) | +50 | +| DNS split-horizon / target-side (display only) | +0 | | Cert downgrade: target EV/OV vs suspect DV | +40 | | Registrar mismatch | +30 | | Same-class issuer difference (display only) | +0 | @@ -178,3 +191,9 @@ internal/rdap RDAP client, creation date and registrar extraction internal/score Risk scoring and verdict mapping internal/report Human, JSON, scale, and verbose renderers ``` + +## License + +Copyright (C) 2026 Mark Robillard Jr (MARKMENTAL). `isthislegit` is free +software licensed under the GNU General Public License v3 — see +[LICENSE](LICENSE) for the full text. diff --git a/cmd/isthislegit/main.go b/cmd/isthislegit/main.go index fbe3efb..c849972 100644 --- a/cmd/isthislegit/main.go +++ b/cmd/isthislegit/main.go @@ -1,3 +1,8 @@ +// Copyright (C) 2026 Mark Robillard Jr (MARKMENTAL) +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU General Public License v3. See LICENSE. +// SPDX-License-Identifier: GPL-3.0-only + // Command isthislegit compares a known-legitimate domain against a suspect // domain using X.509 TLS certificates, RDAP registration data, and DNS // resolution to produce a risk score and verdict. Stdlib only, plus @@ -54,11 +59,12 @@ type domainResult struct { info score.DomainData cert *cert.Details rdap *rdap.Result + cons dns.Consistency rdapErr error certErr error } -func fetchDomain(ctx context.Context, client *http.Client, domain string, now time.Time, perCall time.Duration) domainResult { +func fetchDomain(ctx context.Context, client *http.Client, domain string, now time.Time, perCall time.Duration, dc dns.DomainCheck) domainResult { res := domainResult{info: score.DomainData{Domain: domain}} var g errgroup.Group @@ -75,12 +81,17 @@ func fetchDomain(ctx context.Context, client *http.Client, domain string, now ti cd, res.certErr = c, err return err }) - // Fail-open per field; the root causes are kept for the - // fail-closed verdict gate below. + // DNS was probed once in pre-flight; reuse those outcomes here so no + // resolver is queried twice. Fail-open per field; the root causes are + // kept for the fail-closed verdict gate below. _ = g.Wait() res.rdap = rd res.cert = cd + res.cons = dc.Consistency + res.info.DNSTampered = res.cons.Tampered + res.info.DNSSplit = res.cons.Kind + res.info.DNSDetail = res.cons.Detail res.info.Date = rdap.RegistrationDate(rd) res.info.Registrar = rdap.Registrar(rd) @@ -187,20 +198,44 @@ func run() int { ctx, cancel := context.WithTimeout(context.Background(), globalTimeout) defer cancel() - // DNS pre-flight for both domains in parallel (fail fast like bash check_dns). - var dg errgroup.Group - for _, d := range []string{legit, suspect} { - d := d - dg.Go(func() error { - if err := dns.CheckDNS(ctx, d, perCall); err != nil { - return fmt.Errorf("domain '%s' failed DNS resolution (NXDOMAIN or offline). Aborting", d) - } + // DNS pre-flight probes each unique domain once across the system and + // pinned resolvers. Outcomes are reused by the fetch stage, so no + // resolver is queried twice for one domain. + uniq := []string{legit} + if suspect != legit { + uniq = append(uniq, suspect) + } + type domainProbe struct { + domain string + check dns.DomainCheck + } + probes := make([]domainProbe, len(uniq)) + var pg errgroup.Group + for i := range uniq { + pg.Go(func() error { + probes[i] = domainProbe{domain: uniq[i], check: dns.CheckDomain(ctx, uniq[i], perCall)} return nil }) } - if err := dg.Wait(); err != nil { - fmt.Fprintf(os.Stderr, "[!] Error: %v.\n", err) - return 1 + _ = pg.Wait() + probeFor := func(domain string) dns.DomainCheck { + for _, p := range probes { + if p.domain == domain { + return p.check + } + } + return dns.DomainCheck{} + } + for _, rd := range []struct{ role, domain string }{{"target", legit}, {"suspect", suspect}} { + dc := probeFor(rd.domain) + if !dc.SystemLive && dc.PublicLive { + fmt.Fprintf(os.Stderr, "[!] Error: Domain '%s' (%s) suppressed locally: system resolver reports NXDOMAIN while public resolvers resolve live — possible DNS hijacking. Aborting.\n", rd.domain, rd.role) + return 1 + } + if !dc.SystemLive { + fmt.Fprintf(os.Stderr, "[!] Error: Domain '%s' (%s) failed DNS resolution (NXDOMAIN or offline). Aborting.\n", rd.domain, rd.role) + return 1 + } } client := &http.Client{} @@ -210,17 +245,21 @@ func run() int { } now := time.Now() - var target, sus domainResult + fetched := make([]domainResult, len(uniq)) var fg errgroup.Group - fg.Go(func() error { - target = fetchDomain(ctx, client, legit, now, perCall) - return nil - }) - fg.Go(func() error { - sus = fetchDomain(ctx, client, suspect, now, perCall) - return nil - }) + for i := range uniq { + fg.Go(func() error { + fetched[i] = fetchDomain(ctx, client, uniq[i], now, perCall, probeFor(uniq[i])) + return nil + }) + } _ = fg.Wait() + results := make(map[string]domainResult, len(uniq)) + for i, d := range uniq { + results[d] = fetched[i] + } + target := results[legit] + sus := results[suspect] if err := score.VerifyDataQuality(target.info, sus.info); err != nil { msg := fmt.Sprintf("[!] Error: %v.", err) diff --git a/compile.go b/compile.go index 69c6ff3..3c35d68 100644 --- a/compile.go +++ b/compile.go @@ -1,3 +1,8 @@ +// Copyright (C) 2026 Mark Robillard Jr (MARKMENTAL) +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU General Public License v3. See LICENSE. +// SPDX-License-Identifier: GPL-3.0-only + // Command compile is the build driver for isthislegit. It cross-compiles // ./cmd/isthislegit for the requested platform/arch matrix: // diff --git a/docs/cert.html b/docs/cert.html index 96e1fea..30e844a 100644 --- a/docs/cert.html +++ b/docs/cert.html @@ -65,5 +65,7 @@ already-parsed leaf certificate. Preferred entry point for tests.

func (d *Details) SANsString() string

Joins SANs with ", " for display, or returns "Unknown" when empty. Nil-receiver safe.

+
+Licensed under the GNU General Public License v3 - Mark Robillard Jr (MARKMENTAL) diff --git a/docs/dns.html b/docs/dns.html index f2041a5..7874423 100644 --- a/docs/dns.html +++ b/docs/dns.html @@ -5,8 +5,9 @@

Package dns

 -

Domain normalization, syntax validation, and DNS pre-flight resolution -checks. Source: internal/dns/dns.go.

+

Domain normalization, syntax validation, DNS pre-flight resolution +checks, and multi-resolver consistency cross-checks. Sources: +internal/dns/dns.go, internal/dns/resolvers.go.

@@ -28,17 +29,69 @@ input before any network call.

dns.ValidSyntax("no-dot") // => false
- -

CheckDNS

 -
func CheckDNS(ctx context.Context, domain string, timeout time.Duration) error
-

Aborts early on NXDOMAIN or unresolvable names via -net.DefaultResolver.LookupIP with the given deadline. Returns -nil when at least one IPv4 address resolves, an error otherwise.

+ +

DomainCheck

 +
type DomainCheck struct {
+    SystemLive bool
+    PublicLive bool
+    Consistency Consistency
+}
+

One domain's full probe: system liveness for pre-flight gating, public +liveness for suppression attribution, and the aggregate consistency +verdict. The pre-flight gate aborts on system failure and reuses these +outcomes downstream, so each resolver is queried exactly once per +domain.

+ +
+ +

CheckDomain

 +
func CheckDomain(ctx context.Context, domain string, timeout time.Duration) DomainCheck
+

Probes the system resolver and pinned public resolvers once. Use +SystemLive for NXDOMAIN gating and Consistency for +scoring and messaging.

+ +
+ +

Consistency

 +
type Consistency struct {
+    Checked  bool
+    Tampered bool
+    Kind     SplitKind
+    Detail   string
+}
+

Verdict of a multi-resolver cross-check. Detail names the +disagreeing resolvers and the split kind when tampered.

+ +
+ +

SplitKind

 +
const (
+    SplitNone SplitKind = iota
+    SplitSuppression
+    SplitHorizon
+    SplitNS
+)
+

Split direction. Suppression (system dark, public live) signals local +tampering; horizon (system live, public dark) is the expected split-horizon +shape of internal names and never scores; NS marks delegation splits.

+ +
+ +

CheckConsistency

 +
func CheckConsistency(ctx context.Context, domain string, timeout time.Duration) Consistency
+

Queries the system resolver plus pinned 1.1.1.1 and 8.8.8.8 servers in +parallel (stdlib net.Resolver with a pinned dialer; filtered +resolvers excluded by design). Flags NXDOMAIN-vs-live splits and NS +delegation splits; raw A records are never compared, so CDN/GeoDNS churn +stays quiet. Inconclusive resolvers abstain, and fewer than two conclusive +votes is never tampering. Never fails closed.

- - + +
ParameterDescription
ctxParent context; the global 15 second budget.
domainAlready-normalized domain to resolve.
timeoutPer-call deadline (the CLI --timeout value).
domainAlready-normalized domain to cross-check.
timeoutPer-resolver deadline (the CLI --timeout value).
+
+Licensed under the GNU General Public License v3 - Mark Robillard Jr (MARKMENTAL) diff --git a/docs/index.html b/docs/index.html index 8bc8645..e6c26e5 100644 --- a/docs/index.html +++ b/docs/index.html @@ -18,6 +18,8 @@
  • Package report
  • Command main
    • +
    +Licensed under the GNU General Public License v3 - Mark Robillard Jr (MARKMENTAL) diff --git a/docs/main.html b/docs/main.html index 383f3f9..a7590f9 100644 --- a/docs/main.html +++ b/docs/main.html @@ -31,7 +31,11 @@ include the underlying fetch cause(s).

    Flow
      -
    1. DNS pre-flight for both domains in parallel; any failure aborts.
      2. +
    2. DNS pre-flight probes each unique domain once across the system and +pinned resolvers; system failure aborts (with hijack-aware messaging when +public resolvers resolve live). Outcomes are reused downstream, so no +resolver is queried twice - identical domains are fetched once and the +result shared.
    3. Per-domain fetch in parallel: RDAP (rdap.Query) plus TLS (cert.InspectDomain) concurrently. @@ -51,5 +55,7 @@ plus report.Verbose when verbose.
      4. output, and --scale header. Build target: CGO_ENABLED=0 go build -ldflags="-s -w" -o isthislegit ./cmd/isthislegit.

      +
      +Licensed under the GNU General Public License v3 - Mark Robillard Jr (MARKMENTAL) diff --git a/docs/nav.html b/docs/nav.html index a7e398f..f160814 100644 --- a/docs/nav.html +++ b/docs/nav.html @@ -21,7 +21,11 @@

      cert

      +
      +Licensed under the GNU General Public License v3 - Mark Robillard Jr (MARKMENTAL) diff --git a/docs/overview.html b/docs/overview.html index 859caea..031d25f 100644 --- a/docs/overview.html +++ b/docs/overview.html @@ -44,6 +44,16 @@ cause(s).

      --help), 1 on bad flags, invalid domains, DNS failure, or failed data-quality verification.

      +

      DNS Consistency

       +

      Each domain is probed once by the system resolver plus pinned 1.1.1.1 and +8.8.8.8 servers, and the outcomes are reused downstream. Only state is +compared, never raw addresses: system-dark/public-live suppression splits +and NS delegation splits flag tampering (+50 on the suspect), while +system-live/public-dark split-horizon shapes and target-side splits stay +display-only NOTEs. CDN/GeoDNS address churn stays quiet. Inconclusive +resolvers abstain; filtered resolvers are excluded by design. The +pre-flight gate aborts on system failure with hijack-aware messaging.

      +

      Embedded Systems

      The tool runs on embedded ARM devices (verified on a Miyoo Mini Plus), but minimal firmware often ships without a CA certificate store. DNS and @@ -55,8 +65,14 @@ where possible, otherwise use -k/--insecure as a last resort.

      Scoring Scale

       - - + + + + + + + + @@ -79,5 +95,7 @@ where possible, otherwise use -k/--insecure as a last resort.

    4. report - human, JSON, scale, and verbose renderers.
    5. main - CLI entry point and fetch orchestration.
      6. +
      +Licensed under the GNU General Public License v3 - Mark Robillard Jr (MARKMENTAL) diff --git a/docs/rdap.html b/docs/rdap.html index 1da45ce..2633c78 100644 --- a/docs/rdap.html +++ b/docs/rdap.html @@ -65,5 +65,7 @@ Non-2xx status and invalid JSON are errors.

      Best-effort registrar name, or "Unknown". Prefers entities with the registrar role, falling back to the first vCard fn property. Nil-safe.

      +
      +Licensed under the GNU General Public License v3 - Mark Robillard Jr (MARKMENTAL) diff --git a/docs/report.html b/docs/report.html index c8d1d89..2a276b4 100644 --- a/docs/report.html +++ b/docs/report.html @@ -60,5 +60,7 @@ newline for pipeline use.

      Raw policy OIDs with classes, per-domain TLS details (issuer, subject, validity, SANs), and raw RDAP JSON for both domains. Missing data renders an explicit unavailable notice per section.

      +
      +Licensed under the GNU General Public License v3 - Mark Robillard Jr (MARKMENTAL) diff --git a/docs/score.html b/docs/score.html index 87e41c0..32741ac 100644 --- a/docs/score.html +++ b/docs/score.html @@ -5,7 +5,8 @@

      Package score

       -

      Deterministic risk scoring: domain-age check (+80), certificate +

      Deterministic risk scoring: domain-age check (contextual tiers with +stacking and shared-cert discount), certificate downgrade check (+40), and registrar mismatch (+30), mapped onto a four-tier verdict. Sources: internal/score/score.go, internal/score/date.go.

      @@ -56,11 +57,18 @@ The CLI aborts instead of printing a verdict built on missing data.

      Score

      SignalPoints
      Suspect domain age < 30 days (CRITICAL)+80
      Suspect domain age 30-89 days (WARNING)+80
      Suspect < 30d (CRITICAL), stacked w/ signal+80
      Suspect < 30d (CRITICAL), isolated+40
      Suspect 30-89d (WARNING), stacked w/ signal+40
      Suspect 30-89d (WARNING), isolated+20
      Shared cert infrastructure (halves age tier)x0.5
      Identical target/suspect (forced LEGITIMATE)+0
      Resolution tampering: suppression split (suspect)+50
      DNS split-horizon / target-side (display only)+0
      Cert downgrade: target EV/OV vs suspect DV+40
      Registrar mismatch+30
      Same-class issuer difference (display only)+0
      func Score(target, suspect DomainData) Result
      -

      Applies the three signals. Suspect age under 30 days adds 80 with a -CRITICAL flag; 30-89 days adds 80 with a WARNING flag. Target EV/OV versus +

      Applies the signals. Identical domains force score zero and LEGITIMATE +while still attaching DNS NOTEs. Suspect age +is contextual: the full tier (< 30d: 80, 30-89d: 40) needs company +(registrar mismatch or cert downgrade), otherwise the next tier down; +shared certificate infrastructure (either domain in the other's SANs, +exactly or via parent wildcard) halves whatever remains. Target EV/OV versus suspect DV adds 40 as DOWNGRADE; a same-class issuer difference is a display-only NOTE (+0). Case-insensitive registrar mismatch adds 30, -skipped when either side is unknown.

      +skipped when either side is unknown. Suspect-side DNS suppression and NS +splits add 50; split-horizon shapes and anything target-side are +display-only NOTEs (+0). Identical domains force score zero and LEGITIMATE +while still attaching DNS NOTEs.

      r := score.Score(target, suspect)
 // r.Score, r.Findings, r.Verdict, r.AgeFlag
      @@ -84,5 +92,7 @@ sentinel or garbage value fails by design.

      func AgeDays(ymd string, now time.Time) (days int, ok bool)

      Whole days between ymd and now; ok is false when ymd is unparseable.

      +
      +Licensed under the GNU General Public License v3 - Mark Robillard Jr (MARKMENTAL) diff --git a/internal/cert/cert.go b/internal/cert/cert.go index c550610..3040aaf 100644 --- a/internal/cert/cert.go +++ b/internal/cert/cert.go @@ -1,3 +1,8 @@ +// Copyright (C) 2026 Mark Robillard Jr (MARKMENTAL) +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU General Public License v3. See LICENSE. +// SPDX-License-Identifier: GPL-3.0-only + // Package cert fetches leaf X.509 certificates and classifies the // CA/Browser Forum validation level from policy OIDs. // Mirrors bash get_cert_issuer / get_cert_sans / get_cert_class. diff --git a/internal/cert/cert_test.go b/internal/cert/cert_test.go index 4bad05f..3fd00e7 100644 --- a/internal/cert/cert_test.go +++ b/internal/cert/cert_test.go @@ -1,3 +1,8 @@ +// Copyright (C) 2026 Mark Robillard Jr (MARKMENTAL) +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU General Public License v3. See LICENSE. +// SPDX-License-Identifier: GPL-3.0-only + package cert import ( diff --git a/internal/dns/dns.go b/internal/dns/dns.go index e5f6634..7f42577 100644 --- a/internal/dns/dns.go +++ b/internal/dns/dns.go @@ -1,14 +1,15 @@ +// Copyright (C) 2026 Mark Robillard Jr (MARKMENTAL) +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU General Public License v3. See LICENSE. +// SPDX-License-Identifier: GPL-3.0-only + // Package dns provides domain normalization, syntax validation, -// and DNS pre-flight resolution checks. +// and multi-resolver resolution checks. package dns import ( - "context" - "fmt" - "net" "regexp" "strings" - "time" ) var domainRe = regexp.MustCompile(`^[a-z0-9]([a-z0-9-]{0,61}[a-z0-9])?(\.[a-z0-9]([a-z0-9-]{0,61}[a-z0-9])?)+$`) @@ -35,18 +36,3 @@ func NormalizeDomain(d string) string { func ValidSyntax(d string) bool { return domainRe.MatchString(d) } - -// CheckDNS aborts early on NXDOMAIN / unresolvable names. -// Mirrors bash check_dns (dig +short A). Uses the stdlib resolver. -func CheckDNS(ctx context.Context, domain string, timeout time.Duration) error { - ctx, cancel := context.WithTimeout(ctx, timeout) - defer cancel() - addrs, err := net.DefaultResolver.LookupIP(ctx, "ip4", domain) - if err != nil { - return fmt.Errorf("domain '%s' failed DNS resolution (NXDOMAIN or offline): %w", domain, err) - } - if len(addrs) == 0 { - return fmt.Errorf("domain '%s' failed DNS resolution (NXDOMAIN or offline): no addresses", domain) - } - return nil -} diff --git a/internal/dns/dns_test.go b/internal/dns/dns_test.go index e4a644c..0183443 100644 --- a/internal/dns/dns_test.go +++ b/internal/dns/dns_test.go @@ -1,3 +1,8 @@ +// Copyright (C) 2026 Mark Robillard Jr (MARKMENTAL) +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU General Public License v3. See LICENSE. +// SPDX-License-Identifier: GPL-3.0-only + package dns import "testing" diff --git a/internal/dns/resolvers.go b/internal/dns/resolvers.go new file mode 100644 index 0000000..954a6d1 --- /dev/null +++ b/internal/dns/resolvers.go @@ -0,0 +1,233 @@ +// Copyright (C) 2026 Mark Robillard Jr (MARKMENTAL) +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU General Public License v3. See LICENSE. +// SPDX-License-Identifier: GPL-3.0-only + +// Multi-resolver consistency checks: cross-validate the system resolver +// against pinned public resolvers to catch split-brain DNS, local resolver +// poisoning, or targeted routing manipulation. +// +// Only resolution *state* is compared, never raw A records: CDN and GeoDNS +// fronting legitimately returns different IPs per egress geography, while +// existence (live vs NXDOMAIN) and NS delegation stay stable. Tampering +// requires two conclusive votes; timeouts and lookup errors abstain. +package dns + +import ( + "context" + "errors" + "fmt" + "net" + "sort" + "strings" + "sync" + "time" +) + +// pinned public resolvers. Filtered resolvers (Quad9, OpenDNS) are +// deliberately excluded: they alter answers by design and would +// manufacture discrepancies. +var pinnedServers = []struct { + name string + addr string +}{ + {"1.1.1.1", "1.1.1.1:53"}, + {"8.8.8.8", "8.8.8.8:53"}, +} + +// Consistency is the verdict of a multi-resolver cross-check. +type Consistency struct { + Checked bool + Tampered bool + Kind SplitKind + Detail string +} + +// SplitKind names the direction of a resolution split. Suppression +// (system dark, public live) signals local tampering; horizon +// (system live, public dark) is the expected split-horizon shape for +// internal names and never scores. +type SplitKind int + +const ( + SplitNone SplitKind = iota + SplitSuppression + SplitHorizon + SplitNS +) + +type outcomeKind int + +const ( + outcomeLive outcomeKind = iota + outcomeNXDomain + outcomeInconclusive +) + +type resolverOutcome struct { + name string + kind outcomeKind + ns []string +} + +// pinnedResolver dials one DNS server directly, bypassing resolv.conf. +func pinnedResolver(addr string) *net.Resolver { + return &net.Resolver{ + PreferGo: true, + Dial: func(ctx context.Context, network, _ string) (net.Conn, error) { + var d net.Dialer + return d.DialContext(ctx, network, addr) + }, + } +} + +// DomainCheck is one domain's full probe: system liveness for gating, +// public liveness for suppression attribution, and the aggregate verdict. +type DomainCheck struct { + SystemLive bool + PublicLive bool + Consistency Consistency +} + +// CheckDomain probes the system resolver and pinned public resolvers once +// and returns everything callers need: gating votes plus the aggregate +// consistency verdict. Query every resolver exactly once per domain. +func CheckDomain(ctx context.Context, domain string, timeout time.Duration) DomainCheck { + names := []string{"system"} + resolvers := []*net.Resolver{net.DefaultResolver} + for _, s := range pinnedServers { + names = append(names, s.name) + resolvers = append(resolvers, pinnedResolver(s.addr)) + } + + outcomes := make([]resolverOutcome, len(resolvers)) + var wg sync.WaitGroup + for i := range resolvers { + wg.Add(1) + go func(i int) { + defer wg.Done() + callCtx, cancel := context.WithTimeout(ctx, timeout) + defer cancel() + addrs, err := resolvers[i].LookupIP(callCtx, "ip4", domain) + out := resolverOutcome{name: names[i], kind: classifyOutcome(addrs, err)} + if out.kind == outcomeLive { + if nss, nsErr := resolvers[i].LookupNS(callCtx, domain); nsErr == nil { + for _, ns := range nss { + out.ns = append(out.ns, normalizeNS(ns.Host)) + } + } + } + outcomes[i] = out + }(i) + } + wg.Wait() + + var dc DomainCheck + for _, o := range outcomes { + if o.name == "system" && o.kind == outcomeLive { + dc.SystemLive = true + } + if o.name != "system" && o.kind == outcomeLive { + dc.PublicLive = true + } + } + kind, detail := detectSplit(domain, outcomes) + dc.Consistency = Consistency{Checked: true, Tampered: kind == SplitSuppression || kind == SplitNS, Kind: kind, Detail: detail} + return dc +} + +// CheckConsistency queries the system resolver and pinned public resolvers +// in parallel and reports state splits. Never fails closed: inconclusive +// resolvers abstain, and agreement (or too few votes) is not tampering. +func CheckConsistency(ctx context.Context, domain string, timeout time.Duration) Consistency { + return CheckDomain(ctx, domain, timeout).Consistency +} + +// classifyOutcome maps a lookup result to live, NXDOMAIN, or inconclusive. +// Anything that is not a clean answer or an authoritative NXDOMAIN abstains. +func classifyOutcome(addrs []net.IP, err error) outcomeKind { + if err != nil { + var dnsErr *net.DNSError + if errors.As(err, &dnsErr) && dnsErr.IsNotFound { + return outcomeNXDomain + } + return outcomeInconclusive + } + if len(addrs) == 0 { + return outcomeInconclusive + } + return outcomeLive +} + +// normalizeNS lowercases and strips the trailing root dot for comparison. +func normalizeNS(host string) string { + return strings.TrimSuffix(strings.ToLower(strings.TrimSpace(host)), ".") +} + +// nsSetsEqual compares normalized NS sets as sets, ignoring order. +func nsSetsEqual(a, b []string) bool { + if len(a) != len(b) { + return false + } + set := make(map[string]int, len(a)) + for _, ns := range a { + set[ns]++ + } + for _, ns := range b { + set[ns]-- + if set[ns] < 0 { + return false + } + } + return true +} + +// detectSplit flags existence and NS-delegation splits across conclusive +// resolver outcomes, with direction: system-dark/public-live is +// suppression (local tampering shape), system-live/public-dark is the +// split-horizon shape of internal names. Pure function; safe to unit test. +func detectSplit(domain string, outcomes []resolverOutcome) (SplitKind, string) { + sysKind := outcomeInconclusive + var pubLive, pubNX []string + var nsVotes [][]string + var nsNames []string + for _, o := range outcomes { + if o.name == "system" { + sysKind = o.kind + } + if o.name != "system" && o.kind == outcomeLive { + pubLive = append(pubLive, o.name) + } + if o.name != "system" && o.kind == outcomeNXDomain { + pubNX = append(pubNX, o.name) + } + if o.kind == outcomeLive && len(o.ns) > 0 { + nsVotes = append(nsVotes, o.ns) + nsNames = append(nsNames, o.name) + } + } + if sysKind == outcomeNXDomain && len(pubLive) > 0 { + sort.Strings(pubLive) + return SplitSuppression, fmt.Sprintf("suppression pattern on %s: system reports NXDOMAIN while %s resolve live", + domain, strings.Join(pubLive, ", ")) + } + if sysKind == outcomeLive && len(pubNX) > 0 { + sort.Strings(pubNX) + return SplitHorizon, fmt.Sprintf("split-horizon pattern on %s: system resolves live while %s report NXDOMAIN", + domain, strings.Join(pubNX, ", ")) + } + if sysKind == outcomeInconclusive && len(pubLive) > 0 && len(pubNX) > 0 { + sort.Strings(pubLive) + sort.Strings(pubNX) + return SplitSuppression, fmt.Sprintf("existence split on %s: %s report NXDOMAIN while %s resolve live (system inconclusive)", + domain, strings.Join(pubNX, ", "), strings.Join(pubLive, ", ")) + } + for i := 1; i < len(nsVotes); i++ { + if !nsSetsEqual(nsVotes[0], nsVotes[i]) { + sort.Strings(nsNames) + return SplitNS, fmt.Sprintf("NS delegation split on %s across resolvers (%s)", + domain, strings.Join(nsNames, ", ")) + } + } + return SplitNone, "" +} diff --git a/internal/dns/resolvers_test.go b/internal/dns/resolvers_test.go new file mode 100644 index 0000000..b4d1fe3 --- /dev/null +++ b/internal/dns/resolvers_test.go @@ -0,0 +1,115 @@ +// Copyright (C) 2026 Mark Robillard Jr (MARKMENTAL) +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU General Public License v3. See LICENSE. +// SPDX-License-Identifier: GPL-3.0-only + +package dns + +import ( + "errors" + "net" + "strings" + "testing" +) + +func TestClassifyOutcome(t *testing.T) { + live := classifyOutcome([]net.IP{net.ParseIP("93.184.216.34")}, nil) + if live != outcomeLive { + t.Errorf("addrs, no error = %v, want live", live) + } + nx := classifyOutcome(nil, &net.DNSError{Err: "no such host", IsNotFound: true}) + if nx != outcomeNXDomain { + t.Errorf("not-found DNSError = %v, want nxdomain", nx) + } + timeout := classifyOutcome(nil, &net.DNSError{Err: "i/o timeout", IsTimeout: true}) + if timeout != outcomeInconclusive { + t.Errorf("timeout DNSError = %v, want inconclusive", timeout) + } + generic := classifyOutcome(nil, errors.New("boom")) + if generic != outcomeInconclusive { + t.Errorf("generic error = %v, want inconclusive", generic) + } + empty := classifyOutcome(nil, nil) + if empty != outcomeInconclusive { + t.Errorf("empty answer = %v, want inconclusive", empty) + } +} + +func TestNsSetsEqual(t *testing.T) { + a := []string{"ns1.example.com", "ns2.example.com"} + b := []string{"ns2.example.com", "ns1.example.com"} + if !nsSetsEqual(a, b) { + t.Error("same set, different order should be equal") + } + if nsSetsEqual(a, []string{"ns1.example.com"}) { + t.Error("different cardinality should not be equal") + } + if nsSetsEqual(a, []string{"ns1.example.com", "ns9.example.com"}) { + t.Error("different members should not be equal") + } +} + +func TestDetectSplitSuppression(t *testing.T) { + outcomes := []resolverOutcome{ + {name: "system", kind: outcomeNXDomain}, + {name: "1.1.1.1", kind: outcomeLive, ns: []string{"ns1.x"}}, + {name: "8.8.8.8", kind: outcomeInconclusive}, + } + kind, detail := detectSplit("evil.test", outcomes) + if kind != SplitSuppression { + t.Fatalf("system-dark/public-live should be suppression, got %v", kind) + } + if !strings.Contains(detail, "1.1.1.1") || !strings.Contains(detail, "suppression") { + t.Errorf("detail should name suppression, got %q", detail) + } +} + +func TestDetectSplitHorizon(t *testing.T) { + outcomes := []resolverOutcome{ + {name: "system", kind: outcomeLive, ns: []string{"ns1.x"}}, + {name: "1.1.1.1", kind: outcomeNXDomain}, + {name: "8.8.8.8", kind: outcomeNXDomain}, + } + kind, detail := detectSplit("internal.test", outcomes) + if kind != SplitHorizon { + t.Fatalf("system-live/public-dark should be horizon, got %v", kind) + } + if !strings.Contains(detail, "split-horizon") { + t.Errorf("detail should name split-horizon, got %q", detail) + } +} + +func TestDetectSplitNS(t *testing.T) { + outcomes := []resolverOutcome{ + {name: "system", kind: outcomeLive, ns: []string{"ns1.x"}}, + {name: "1.1.1.1", kind: outcomeLive, ns: []string{"ns9.y"}}, + } + kind, detail := detectSplit("evil.test", outcomes) + if kind != SplitNS { + t.Fatalf("NS delegation split should be SplitNS, got %v", kind) + } + if !strings.Contains(detail, "NS delegation split") { + t.Errorf("detail should name NS split, got %q", detail) + } +} + +func TestDetectSplitAgreement(t *testing.T) { + // Same NS everywhere, different A records (CDN) is not observable here + // by design: only state and NS sets vote. + agree := []resolverOutcome{ + {name: "system", kind: outcomeLive, ns: []string{"ns1.x"}}, + {name: "1.1.1.1", kind: outcomeLive, ns: []string{"ns1.x"}}, + {name: "8.8.8.8", kind: outcomeInconclusive}, + } + if kind, _ := detectSplit("ok.test", agree); kind != SplitNone { + t.Errorf("agreement should be SplitNone, got %v", kind) + } + thin := []resolverOutcome{ + {name: "system", kind: outcomeLive, ns: []string{"ns1.x"}}, + {name: "1.1.1.1", kind: outcomeInconclusive}, + {name: "8.8.8.8", kind: outcomeInconclusive}, + } + if kind, _ := detectSplit("ok.test", thin); kind != SplitNone { + t.Errorf("single conclusive vote should be SplitNone, got %v", kind) + } +} diff --git a/internal/rdap/rdap.go b/internal/rdap/rdap.go index 268f4ca..7c5abd3 100644 --- a/internal/rdap/rdap.go +++ b/internal/rdap/rdap.go @@ -1,3 +1,8 @@ +// Copyright (C) 2026 Mark Robillard Jr (MARKMENTAL) +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU General Public License v3. See LICENSE. +// SPDX-License-Identifier: GPL-3.0-only + // Package rdap queries RDAP registration data via https://rdap.org/domain/. // Mirrors bash rdap_query / get_registration_date / get_registrar. package rdap diff --git a/internal/rdap/rdap_test.go b/internal/rdap/rdap_test.go index 03660d8..293d0ed 100644 --- a/internal/rdap/rdap_test.go +++ b/internal/rdap/rdap_test.go @@ -1,3 +1,8 @@ +// Copyright (C) 2026 Mark Robillard Jr (MARKMENTAL) +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU General Public License v3. See LICENSE. +// SPDX-License-Identifier: GPL-3.0-only + package rdap import ( diff --git a/internal/report/report.go b/internal/report/report.go index 4add169..e8206c5 100644 --- a/internal/report/report.go +++ b/internal/report/report.go @@ -1,3 +1,8 @@ +// Copyright (C) 2026 Mark Robillard Jr (MARKMENTAL) +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU General Public License v3. See LICENSE. +// SPDX-License-Identifier: GPL-3.0-only + // Package report renders human, JSON, scale, and verbose output. // Mirrors bash render_human / render_json / render_scale / render_verbose, // plus the restored Validation line (per user decision). @@ -32,14 +37,20 @@ type Data struct { // Scale prints the scoring reference table (no lookups performed). func Scale(version string) string { - return fmt.Sprintf(`isthislegit? [v%s] — Scoring Scale (max total: 150) + return fmt.Sprintf(`isthislegit? [v%s] — Scoring Scale (max total: 200) Signals: +-----------------------------------------------+--------+ | Signal | Points | +-----------------------------------------------+--------+ - | Suspect domain age < 30 days (CRITICAL) | +80 | - | Suspect domain age 30-89 days (WARNING) | +80 | + | Suspect < 30d (CRITICAL), stacked w/ signal | +80 | + | Suspect < 30d (CRITICAL), isolated | +40 | + | Suspect 30-89d (WARNING), stacked w/ signal | +40 | + | Suspect 30-89d (WARNING), isolated | +20 | + | Shared cert infrastructure (halves age tier) | x0.5 | + | Identical target/suspect (forced LEGITIMATE) | +0 | + | DNS suppression split (suspect) | +50 | + | DNS split-horizon/target-side (info) | +0 | | Cert downgrade: target EV/OV vs suspect DV | +40 | | Registrar mismatch | +30 | | Same-class issuer difference (display only) | +0 | @@ -200,9 +211,25 @@ func Verbose(d Data) string { writeRDAP(d.TargetDomain, d.TargetRDAP) writeTLS(d.SuspectDomain, d.SuspectCert) writeRDAP(d.SuspectDomain, d.SuspectRDAP) + writeDNS(&b, "Target", d.TargetDomain, d.Target.DNSTampered, d.Target.DNSDetail) + writeDNS(&b, "Suspect", d.SuspectDomain, d.Suspect.DNSTampered, d.Suspect.DNSDetail) return b.String() } +// writeDNS renders the multi-resolver consistency verdict for one domain. +func writeDNS(b *strings.Builder, label, domain string, tampered bool, detail string) { + fmt.Fprintf(b, "--- DNS consistency (%s):\n", domain) + if detail == "" { + fmt.Fprintf(b, " consistent across resolvers (%s)\n\n", label) + return + } + status := detail + if tampered { + status = "TAMPERED: " + detail + } + fmt.Fprintf(b, " %s\n\n", status) +} + func classOf(c *cert.Details) string { if c == nil || c.Class == "" { return "Unknown" diff --git a/internal/score/date.go b/internal/score/date.go index 6227b52..46e1fe9 100644 --- a/internal/score/date.go +++ b/internal/score/date.go @@ -1,3 +1,8 @@ +// Copyright (C) 2026 Mark Robillard Jr (MARKMENTAL) +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU General Public License v3. See LICENSE. +// SPDX-License-Identifier: GPL-3.0-only + package score import ( diff --git a/internal/score/score.go b/internal/score/score.go index afec446..7464d54 100644 --- a/internal/score/score.go +++ b/internal/score/score.go @@ -1,22 +1,33 @@ +// Copyright (C) 2026 Mark Robillard Jr (MARKMENTAL) +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU General Public License v3. See LICENSE. +// SPDX-License-Identifier: GPL-3.0-only + // Package score implements the deterministic risk scoring logic. -// It mirrors the bash implementation exactly (spec AGENTS.md section 4.4 -// as refined by the bash script: <30 and 30-89 both +80, downgrade only -// EV/OV -> DV for +40, registrar mismatch +30 case-insensitive). +// Age tiers (<30 CRITICAL, 30-89 WARNING) are contextual: full weight +// needs company (registrar mismatch or cert downgrade), shared certificate +// infrastructure halves the tier, and identical domains score zero. +// Downgrade (EV/OV -> DV) is +40, registrar mismatch +30 case-insensitive. package score import "fmt" import "strings" +import "isthislegit/internal/dns" + // DomainData holds the collected triage fields for one domain. type DomainData struct { - Domain string - Date string // YYYY-MM-DD or sentinel on failure - Registrar string // "Unknown" when unavailable - Issuer string // "Unknown" when unavailable - Class string // EV, OV, IV, DV, or Unknown - SANs string // comma-joined, or "Unknown" - AgeDays int - AgeKnown bool + Domain string + Date string // YYYY-MM-DD or sentinel on failure + Registrar string // "Unknown" when unavailable + Issuer string // "Unknown" when unavailable + Class string // EV, OV, IV, DV, or Unknown + SANs string // comma-joined, or "Unknown" + AgeDays int + AgeKnown bool + DNSTampered bool // suppression/NS split (scores on suspect) + DNSSplit dns.SplitKind // split direction (horizon never scores) + DNSDetail string // human-readable split description } // Result is the outcome of scoring a target/suspect pair. @@ -67,27 +78,46 @@ func VerifyDataQuality(target, suspect DomainData) error { return nil } -// Score applies the three signals and maps the total to a verdict. +// Score applies the signals and maps the total to a verdict. +// +// Age is contextual, not a binary cliff: identical domains force zero +// with findings attached; shared certificate infrastructure halves the +// tier; full tier needs company (registrar mismatch or cert downgrade), +// with isolated domains scoring the next tier down. func Score(target, suspect DomainData) Result { var r Result - // Age check: suspect created < 90 days => +80. - if suspect.AgeKnown { - switch { - case suspect.AgeDays < 30: - r.Score += 80 - r.AgeFlag = " [CRITICAL: Domain created < 30 days ago]" - r.Findings = append(r.Findings, fmt.Sprintf("HIGH RISK: Suspect domain created recently (%s).", suspect.Date)) - case suspect.AgeDays < 90: - r.Score += 80 - r.AgeFlag = " [WARNING: Domain created < 90 days ago]" - r.Findings = append(r.Findings, fmt.Sprintf("HIGH RISK: Suspect domain created recently (%s).", suspect.Date)) + if target.Domain != "" && strings.EqualFold(target.Domain, suspect.Domain) { + r.Findings = append(r.Findings, "INFO: Target and suspect are identical — a domain cannot impersonate itself.") + noteDNS(&r, target, "target") + if suspect.DNSDetail != target.DNSDetail { + noteDNS(&r, suspect, "suspect") } + r.Verdict = Verdict(r.Score) + return r } // Cert validation downgrade: target EV/OV but suspect DV => +40. // Same-class issuer differences are display-only (no points). isDowngrade := (target.Class == "EV" || target.Class == "OV") && suspect.Class == "DV" + mismatch := registrarMismatch(target, suspect) + stacked := mismatch || isDowngrade + sharedCert := sansOverlap(target, suspect) + + // Age check with stacking and shared-infrastructure discount. + if suspect.AgeKnown { + switch { + case suspect.AgeDays < 30: + r.AgeFlag = " [CRITICAL: Domain created < 30 days ago]" + r.Score += agePoints(80, stacked, sharedCert) + r.Findings = append(r.Findings, ageFinding(suspect.Date, 80, stacked, sharedCert)) + case suspect.AgeDays < 90: + r.AgeFlag = " [WARNING: Domain created < 90 days ago]" + r.Score += agePoints(40, stacked, sharedCert) + r.Findings = append(r.Findings, ageFinding(suspect.Date, 40, stacked, sharedCert)) + } + } + if isDowngrade { r.Score += 40 r.Findings = append(r.Findings, fmt.Sprintf("DOWNGRADE: Target uses %s (%s) while Suspect uses DV automated cert (%s).", target.Class, target.Issuer, suspect.Issuer)) @@ -97,17 +127,115 @@ func Score(target, suspect DomainData) Result { } // Registrar mismatch => +30 (skipped when either side is unknown). - if target.Registrar != "Unknown" && suspect.Registrar != "Unknown" && target.Registrar != "" && suspect.Registrar != "" { - if !strings.EqualFold(target.Registrar, suspect.Registrar) { - r.Score += 30 - r.Findings = append(r.Findings, fmt.Sprintf("MISMATCH: Registrars do not align (%s vs %s).", target.Registrar, suspect.Registrar)) - } + if mismatch { + r.Score += 30 + r.Findings = append(r.Findings, fmt.Sprintf("MISMATCH: Registrars do not align (%s vs %s).", target.Registrar, suspect.Registrar)) } + // Resolution tampering => +50 on the suspect side for suppression and + // NS splits. Split-horizon shapes describe split-horizon or observer + // networks, never the suspect, so they stay display-only — as does + // anything on the target side. + if suspect.DNSTampered { + r.Score += 50 + r.Findings = append(r.Findings, fmt.Sprintf("TAMPERING: Inconsistent DNS resolution for suspect (%s).", suspect.DNSDetail)) + } + if suspect.DNSSplit == dns.SplitHorizon { + r.Findings = append(r.Findings, fmt.Sprintf("NOTE: Split-horizon DNS for suspect (%s); resolves locally only.", suspect.DNSDetail)) + } + noteDNS(&r, target, "target") + r.Verdict = Verdict(r.Score) return r } +// noteDNS appends display-only DNS findings for one side: tampering notes +// observer-side suspicion, horizon notes split-horizon shape. No points. +func noteDNS(r *Result, d DomainData, role string) { + if d.DNSDetail == "" { + return + } + if d.DNSTampered { + r.Findings = append(r.Findings, fmt.Sprintf("NOTE: Inconsistent DNS resolution for %s (%s); observer-side network suspected.", role, d.DNSDetail)) + return + } + if d.DNSSplit == dns.SplitHorizon { + r.Findings = append(r.Findings, fmt.Sprintf("NOTE: Split-horizon DNS for %s (%s); resolves locally only.", role, d.DNSDetail)) + } +} + +// registrarMismatch reports a case-insensitive registrar difference, +// skipped when either side is unknown. +func registrarMismatch(target, suspect DomainData) bool { + known := func(s string) bool { return s != "" && s != "Unknown" } + return known(target.Registrar) && known(suspect.Registrar) && !strings.EqualFold(target.Registrar, suspect.Registrar) +} + +// agePoints resolves an age tier to points: the full tier needs company +// (stacked signals), otherwise the next tier down; shared certificate +// infrastructure halves whatever remains. +func agePoints(tier int, stacked, sharedCert bool) int { + points := tier + if !stacked { + points /= 2 + } + if sharedCert { + points /= 2 + } + return points +} + +// ageFinding words the age finding by final points, with the reason the +// tier was reduced when it was. +func ageFinding(date string, tier int, stacked, sharedCert bool) string { + points := agePoints(tier, stacked, sharedCert) + level := "LOW RISK" + if points >= 80 { + level = "HIGH RISK" + } + if points >= 40 && points < 80 { + level = "ELEVATED RISK" + } + reason := "" + if sharedCert { + reason = " Shared certificate infrastructure with target." + } + if reason == "" && !stacked { + reason = " No corroborating registrar or certificate signals." + } + return fmt.Sprintf("%s: Suspect domain created recently (%s).%s", level, date, reason) +} + +// sansOverlap reports shared certificate infrastructure: either domain +// appearing in the other's SAN set, exactly or via a parent wildcard. +// Unknown or empty SAN fields never match. +func sansOverlap(target, suspect DomainData) bool { + return sanCovers(suspect.SANs, target.Domain) || sanCovers(target.SANs, suspect.Domain) +} + +// sanCovers reports whether a comma-joined SAN field covers domain. +func sanCovers(sansField, domain string) bool { + domain = strings.ToLower(strings.TrimSpace(domain)) + if domain == "" { + return false + } + for _, san := range strings.Split(sansField, ",") { + san = strings.ToLower(strings.TrimSpace(san)) + if san == "" || san == "unknown" { + continue + } + if san == domain { + return true + } + if parent, ok := strings.CutPrefix(san, "*."); ok && parent != "" { + if domain == parent || strings.HasSuffix(domain, "."+parent) { + return true + } + } + } + return false +} + // isIssuerNote reports a display-only issuer difference: distinct known // issuers at comparable validation levels. Avoids false positives when both // sides legitimately use different DV CAs. diff --git a/internal/score/score_test.go b/internal/score/score_test.go index 568a0c8..471307d 100644 --- a/internal/score/score_test.go +++ b/internal/score/score_test.go @@ -1,8 +1,16 @@ +// Copyright (C) 2026 Mark Robillard Jr (MARKMENTAL) +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU General Public License v3. See LICENSE. +// SPDX-License-Identifier: GPL-3.0-only + package score import ( + "strings" "testing" "time" + + "isthislegit/internal/dns" ) func TestScorePhishing(t *testing.T) { @@ -32,6 +40,80 @@ func TestScoreLegitimate(t *testing.T) { } } +func TestScoreWarningTier(t *testing.T) { + target := DomainData{Domain: "a.com", Date: "2000-01-01", Registrar: "Same Inc.", Issuer: "Let's Encrypt", Class: "DV", SANs: "a.com", AgeDays: 9000, AgeKnown: true} + suspect := DomainData{Domain: "b.com", Date: "2026-07-25", Registrar: "Same Inc.", Issuer: "Let's Encrypt", Class: "DV", SANs: "b.com", AgeDays: 45, AgeKnown: true} + r := Score(target, suspect) + if r.Score != 20 { + t.Errorf("Score = %d, want 20 (isolated warning tier)", r.Score) + } + if got := Verdict(r.Score); got != "LIKELY UNRELATED / MISCONFIGURED" { + t.Errorf("Verdict = %q", got) + } + if r.AgeFlag == "" { + t.Error("expected AgeFlag for 30-89d domain") + } + found := false + for _, f := range r.Findings { + if strings.Contains(f, "LOW RISK") { + found = true + } + if strings.Contains(f, "HIGH RISK") { + t.Errorf("isolated warning tier must not emit HIGH RISK, got %q", f) + } + } + if !found { + t.Errorf("expected LOW RISK finding, got %v", r.Findings) + } +} + +func TestScoreWarningTierStacked(t *testing.T) { + target := DomainData{Domain: "a.com", Date: "2000-01-01", Registrar: "Registrar A", Issuer: "Let's Encrypt", Class: "DV", SANs: "a.com", AgeDays: 9000, AgeKnown: true} + suspect := DomainData{Domain: "b.com", Date: "2026-07-25", Registrar: "Registrar B", Issuer: "Let's Encrypt", Class: "DV", SANs: "b.com", AgeDays: 45, AgeKnown: true} + r := Score(target, suspect) + if r.Score != 70 { + t.Errorf("Score = %d, want 70 (stacked warning 40 + registrar 30)", r.Score) + } + if got := Verdict(r.Score); got != "LIKELY PHISHING / IMPERSONATION ATTEMPT" { + t.Errorf("Verdict = %q", got) + } +} + +func TestScoreIdenticalDomains(t *testing.T) { + a := DomainData{Domain: "same.com", Date: "2026-09-08", Registrar: "R", Issuer: "I", Class: "DV", SANs: "same.com", AgeDays: 1, AgeKnown: true} + r := Score(a, a) + if r.Score != 0 { + t.Errorf("Score = %d, want 0 (identical domains)", r.Score) + } + if got := Verdict(r.Score); got != "LIKELY LEGITIMATE" { + t.Errorf("Verdict = %q", got) + } + if len(r.Findings) != 1 || !strings.Contains(r.Findings[0], "INFO") { + t.Errorf("expected single INFO finding, got %v", r.Findings) + } +} + +func TestScoreSharedCertDiscount(t *testing.T) { + target := DomainData{Domain: "corp.com", Date: "2000-01-01", Registrar: "Same Inc.", Issuer: "DigiCert Inc", Class: "OV", SANs: "corp.com", AgeDays: 9000, AgeKnown: true} + suspect := DomainData{Domain: "new-corp.com", Date: "2026-09-01", Registrar: "Same Inc.", Issuer: "DigiCert Inc", Class: "OV", SANs: "new-corp.com, corp.com", AgeDays: 8, AgeKnown: true} + r := Score(target, suspect) + if r.Score != 20 { + t.Errorf("Score = %d, want 20 (isolated critical 40 halved by shared cert)", r.Score) + } +} + +func TestScoreCriticalUnstacked(t *testing.T) { + target := DomainData{Domain: "a.com", Date: "2000-01-01", Registrar: "Same Inc.", Issuer: "Let's Encrypt", Class: "DV", SANs: "a.com", AgeDays: 9000, AgeKnown: true} + suspect := DomainData{Domain: "b.com", Date: "2026-09-01", Registrar: "Same Inc.", Issuer: "Let's Encrypt", Class: "DV", SANs: "b.com", AgeDays: 8, AgeKnown: true} + r := Score(target, suspect) + if r.Score != 40 { + t.Errorf("Score = %d, want 40 (isolated critical)", r.Score) + } + if got := Verdict(r.Score); got != "SUSPICIOUS — MANUAL REVIEW RECOMMENDED" { + t.Errorf("Verdict = %q", got) + } +} + func TestScoreSameClassIssuerDiffNoPoints(t *testing.T) { target := DomainData{Domain: "a.com", Date: "2000-01-01", Registrar: "Same Inc.", Issuer: "Let's Encrypt", Class: "DV", AgeDays: 9000, AgeKnown: true} suspect := DomainData{Domain: "b.com", Date: "2000-01-01", Registrar: "Same Inc.", Issuer: "ZeroSSL", Class: "DV", AgeDays: 8000, AgeKnown: true} @@ -44,6 +126,87 @@ func TestScoreSameClassIssuerDiffNoPoints(t *testing.T) { } } +func TestScoreTamperedSuspect(t *testing.T) { + target := DomainData{Domain: "a.com", Date: "2000-01-01", Registrar: "Same Inc.", Issuer: "CA", Class: "DV", SANs: "a.com", AgeDays: 9000, AgeKnown: true} + suspect := DomainData{Domain: "b.com", Date: "2000-01-01", Registrar: "Same Inc.", Issuer: "CA", Class: "DV", SANs: "b.com", AgeDays: 8000, AgeKnown: true, + DNSTampered: true, DNSDetail: "resolution split on b.com: 1.1.1.1 report NXDOMAIN while system resolve live"} + r := Score(target, suspect) + if r.Score != 50 { + t.Errorf("Score = %d, want 50 (isolated tampering)", r.Score) + } + if got := Verdict(r.Score); got != "SUSPICIOUS — MANUAL REVIEW RECOMMENDED" { + t.Errorf("Verdict = %q", got) + } + found := false + for _, f := range r.Findings { + if strings.Contains(f, "TAMPERING") { + found = true + } + } + if !found { + t.Errorf("expected TAMPERING finding, got %v", r.Findings) + } +} + +func TestScoreTamperedSuspectStacked(t *testing.T) { + target := DomainData{Domain: "a.com", Date: "2000-01-01", Registrar: "Registrar A", Issuer: "DigiCert Inc", Class: "EV", SANs: "a.com", AgeDays: 9000, AgeKnown: true} + suspect := DomainData{Domain: "b.com", Date: "2026-09-01", Registrar: "Registrar B", Issuer: "Let's Encrypt", Class: "DV", SANs: "b.com", AgeDays: 8, AgeKnown: true, + DNSTampered: true, DNSDetail: "NS delegation split on b.com"} + r := Score(target, suspect) + // Stacked critical 80 + downgrade 40 + registrar 30 + tampering 50. + if r.Score != 200 { + t.Errorf("Score = %d, want 200 (fully stacked)", r.Score) + } + if got := Verdict(r.Score); got != "LIKELY PHISHING / IMPERSONATION ATTEMPT" { + t.Errorf("Verdict = %q", got) + } +} + +func TestScoreTamperedTargetNoteOnly(t *testing.T) { + target := DomainData{Domain: "a.com", Date: "2000-01-01", Registrar: "Same Inc.", Issuer: "CA", Class: "DV", SANs: "a.com", AgeDays: 9000, AgeKnown: true, + DNSTampered: true, DNSDetail: "NS delegation split on a.com"} + suspect := DomainData{Domain: "b.com", Date: "2000-01-01", Registrar: "Same Inc.", Issuer: "CA", Class: "DV", SANs: "b.com", AgeDays: 8000, AgeKnown: true} + r := Score(target, suspect) + if r.Score != 0 { + t.Errorf("Score = %d, want 0 (target-side split is display-only)", r.Score) + } + if len(r.Findings) != 1 || !strings.Contains(r.Findings[0], "NOTE") { + t.Errorf("expected single NOTE finding, got %v", r.Findings) + } +} + +func TestScoreHorizonNoteOnly(t *testing.T) { + target := DomainData{Domain: "a.com", Date: "2000-01-01", Registrar: "Same Inc.", Issuer: "CA", Class: "DV", SANs: "a.com", AgeDays: 9000, AgeKnown: true} + suspect := DomainData{Domain: "b.com", Date: "2000-01-01", Registrar: "Same Inc.", Issuer: "CA", Class: "DV", SANs: "b.com", AgeDays: 8000, AgeKnown: true, + DNSSplit: dns.SplitHorizon, DNSDetail: "split-horizon pattern on b.com"} + r := Score(target, suspect) + if r.Score != 0 { + t.Errorf("Score = %d, want 0 (horizon never scores)", r.Score) + } + if len(r.Findings) != 1 || !strings.Contains(r.Findings[0], "split-horizon") { + t.Errorf("expected single split-horizon NOTE, got %v", r.Findings) + } +} + +func TestScoreIdenticalWithDNSFindings(t *testing.T) { + a := DomainData{Domain: "same.com", Date: "2026-09-08", Registrar: "R", Issuer: "I", Class: "DV", SANs: "same.com", AgeDays: 1, AgeKnown: true, + DNSTampered: true, DNSSplit: dns.SplitSuppression, DNSDetail: "suppression pattern on same.com"} + r := Score(a, a) + if r.Score != 0 { + t.Errorf("Score = %d, want 0 (identical domains never score)", r.Score) + } + if got := Verdict(r.Score); got != "LIKELY LEGITIMATE" { + t.Errorf("Verdict = %q", got) + } + if len(r.Findings) != 2 { + t.Fatalf("expected INFO + single NOTE, got %v", r.Findings) + } + for _, f := range r.Findings { + if strings.Contains(f, "TAMPERING") { + t.Errorf("identical domains must not emit TAMPERING, got %q", f) + } + } +} func TestVerifyDataQuality(t *testing.T) { ok := DomainData{Domain: "a.com", Date: "2000-01-01", Registrar: "R", Issuer: "I", Class: "DV", AgeKnown: true} if err := VerifyDataQuality(ok, ok); err != nil {