commit f6301fc20c20b6e519807268ff394f5a76355c0c Author: Duke Leto Date: Mon Jan 6 12:09:46 2020 -0500 Initial WIP 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/Makefile b/Makefile new file mode 100644 index 0000000..a292292 --- /dev/null +++ b/Makefile @@ -0,0 +1,18 @@ +sietch.pdf: sietch.tex sietch.bib + $(MAKE) pdf + +LATEX=pdflatex + +.PHONY: pdf +pdf: + printf '\\renewcommand{\\docversion}{Version %s}' "$$(git describe --tags --abbrev=6)" |tee sietch.ver + # If $(LATEX) fails, touch an input so that 'make' won't think it is up-to-date next time. + rm -f sietch.aux sietch.bbl sietch.blg sietch.brf sietch.bcf + $(LATEX) sietch.tex + biber sietch + $(LATEX) sietch.tex + $(LATEX) sietch.tex + $(LATEX) sietch.tex +.PHONY: clean +clean: + rm -f sietch.dvi sietch.pdf sietch.bbl sietch.blg sietch.brf sietch.toc sietch.aux sietch.out sietch.log sietch.bcf sietch.run.xml sietch.ver diff --git a/README.md b/README.md new file mode 100644 index 0000000..a26ffda --- /dev/null +++ b/README.md @@ -0,0 +1,19 @@ +# Sietch Whitepaper + +## What is Sietch? + +Sietch is a way to increase the privacy and anonymity set of Zcash Protocol blockchains. + +This is a whitepaper for the rough notes at https://github.com/myhush/sietch + +## Install deps + +Build dependencies on Debian-based systems include, at least: + + apt-get install texlive texlive-science texlive-fonts-extra texlive-generic-recommended biber + +## Building the Whitepaper + + make + +will create a PDF in the current directory. diff --git a/sietch.bib b/sietch.bib new file mode 100644 index 0000000..0121c1f --- /dev/null +++ b/sietch.bib @@ -0,0 +1,576 @@ +@misc{Zcash, + author={Daira Hopwood}, + title={Zcash Protocol Specification}, + url={https://github.com/zcash/zips/blob/master/protocol/protocol.pdf}, + urldate={2017-12-28} +} + +@misc{Komodo, + author={superNET}, + title={Komodo Platform}, + url={https://komodoplatform.com}, + urldate={2017-12-28} +} + +@misc{BarterDEX, + author={jl777}, + title={barterDEX - Atomic Swap Decentralized Exchange of Native Coins}, + url={https://github.com/SuperNETorg/komodo/wiki/barterDEX-Whitepaper-v2}, + urldate={2017-12-28} +} + +@misc{dPOW, + author={jl777}, + title={Delayed Proof of Work (dPoW)}, + url={https://supernet.org/en/technology/whitepapers/delayed-proof-of-work-dpow}, + urldate={2017-12-27} +} + +@misc{BCG+2014, + author={Eli Ben-Sasson and Alessandro Chiesa and Christina Garman and Matthew Green and Ian Miers and Eran Tromer and Madars Virza}, + title={Zerocash: Decentralized {A}nonymous {P}ayments from {B}itcoin (extended version)}, + url={http://zerocash-project.org/media/pdf/zerocash-extended-20140518.pdf}, + urldate={2016-08-06}, + addendum={A condensed version appeared in \textsl{Proceedings of the IEEE Symposium on Security and Privacy (Oakland) 2014}, +pages 459--474; IEEE, 2014.} +} + +@misc{BCTV2015, + author={Eli Ben-Sasson and Alessandro Chiesa and Eran Tromer and Madars Virza}, + title={Succinct {N}on-{I}nteractive {Z}ero {K}nowledge for a von {N}eumann {A}rchitecture}, + url={https://eprint.iacr.org/2013/879}, + urldate={2016-08-21}, + howpublished={Cryptology ePrint Archive: Report 2013/879. +Last revised \mbox{May 19,} 2015.} +} + +@misc{PGHR2013, + author={Bryan Parno and Craig Gentry and Jon Howell and Mariana Raykova}, + title={Pinocchio: {N}early {P}ractical {V}erifiable {C}omputation}, + url={https://eprint.iacr.org/2013/279}, + urldate={2016-08-31}, + howpublished={Cryptology ePrint Archive: Report 2013/279. Last revised \mbox{May 13,} 2013.} +} + +@misc{BCGTV2013, + author={Eli Ben-Sasson and Alessandro Chiesa and Daniel Genkin and Eran Tromer and Madars Virza}, + title={{SNARK}s for {C}: {V}erifying {P}rogram {E}xecutions {S}uccinctly and in {Z}ero {K}nowledge}, + url={https://eprint.iacr.org/2013/507}, + urldate={2016-08-31}, + howpublished={Cryptology ePrint Archive: Report 2013/507. +Last revised \mbox{October 7,} 2013.}, + addendum={An earlier version appeared in \textsl{Proceedings of the 33rd Annual International Cryptology Conference, +CRYPTO '13}, pages 90--108; IACR, 2013.} +} + +@misc{GGPR2013, + author={Rosario Gennaro and Craig Gentry and Bryan Parno and Mariana Raykova}, + title={Quadratic {S}pan {P}rograms and {S}uccinct {NIZK}s without {PCP}s}, + howpublished={Cryptology ePrint Archive: Report 2012/215. +Last revised \mbox{June 18,} 2012.}, + addendum={Also published in \textsl{Advances in Cryptology - EUROCRYPT 2013}, Vol. 7881 pages 626--645; +Lecture Notes in Computer Science; Springer, 2013.}, + url={https://eprint.iacr.org/2012/215}, + urldate={2016-09-01} +} + +@inproceedings{BCTV2014, + author={Eli Ben-Sasson and Alessandro Chiesa and Eran Tromer and Madars Virza}, + title={Scalable {Z}ero {K}nowledge via {C}ycles of {E}lliptic {C}urves (extended version)}, + booktitle={Advances in Cryptology - CRYPTO 2014}, + volume={8617}, + series={Lecture Notes in Computer Science}, + pages={276--294}, + year={2014}, + publisher={Springer}, + url={https://www.cs.tau.ac.il/~tromer/papers/scalablezk-20140803.pdf}, + urldate={2016-09-01} +} + +@misc{BGG2016, + author={Sean Bowe and Ariel Gabizon and Matthew Green}, + title={A multi-party protocol for constructing the public parameters of the {P}inocchio zk-{SNARK}}, + date={2016-11-24}, + url={https://github.com/zcash/mpc/blob/master/whitepaper.pdf}, + urldate={2017-02-11} +} + +@misc{Bitcoin, + author={Satoshi Nakamoto}, + title={Bitcoin:\, {A}\, {P}eer-to-{P}eer\, {E}lectronic\, {C}ash\, {S}ystem}, + date={2008-10-31}, + url={https://bitcoin.org/en/bitcoin-paper}, + urldate={2016-08-14} +} + +@misc{BK2016, + author={Alex Biryukov and Dmitry Khovratovich}, + title={Equihash: {A}symmetric {P}roof-of-{W}ork {B}ased on the {G}eneralized {B}irthday {P}roblem (full version)}, + url={https://eprint.iacr.org/2015/946}, + urldate={2016-10-30}, + howpublished={Cryptology ePrint Archive: Report 2015/946. +Last revised \mbox{October 27,} 2016.} +} + +@inproceedings{Bern2006, + author={Daniel Bernstein}, + title={Curve25519: new {D}iffie-{H}ellman speed records}, + booktitle={Public Key Cryptography - PKC 2006. Proceedings of the 9th International Conference on Theory and Practice in Public-Key Cryptography, New York, NY, USA, April 24-26}, + publisher={Springer-Verlag}, + date={2006-02-09}, + url={http://cr.yp.to/papers.html#curve25519}, + urldate={2016-08-14}, + addendum={Document ID: 4230efdfa673480fc079449d90f322c0.} +} + +@article{BDL+2012, + author={Daniel Bernstein and Niels Duif and Tanja Lange and Peter Schwabe and Bo-Yin Yang}, + title={High-speed high-security signatures}, + journal={Journal of Cryptographic Engineering}, + volume={2}, + pages={77-89}, + date={2011-09-26}, + url={http://cr.yp.to/papers.html#ed25519}, + urldate={2016-08-14}, + addendum={Document ID: a1a62a2f76d23f65d622484ddd09caf8.} +} + +@misc{Zave2012, + author={Gregory M. Zaverucha}, + title={Hybrid {E}ncryption in the {M}ulti-{U}ser {S}etting}, + url={https://eprint.iacr.org/2012/159}, + urldate={2016-09-24}, + howpublished={Cryptology ePrint Archive: Report 2012/159. +Received \mbox{March 20,} 2012.} +} + +@inproceedings{Bern2005, + author={Daniel Bernstein}, + title={Understanding brute force}, + date={2005-04-25}, + booktitle={ECRYPT STVL Workshop on Symmetric Key Encryption, eSTREAM report 2005/036}, + url={https://cr.yp.to/papers.html#bruteforce}, + urldate={2016-09-24}, + addendum={Document ID: 73e92f5b71793b498288efe81fe55dee.} +} + +@book{Unicode, + author={The Unicode Consortium}, + publisher={The Unicode Consortium}, + year={2016}, + title={The Unicode Standard}, + url={http://www.unicode.org/versions/latest/}, + urldate={2016-08-31} +} + +@misc{libsodium-Seal, + title={Sealed boxes \hspace{0.2em}---\hspace{0.2em} libsodium}, + url={https://download.libsodium.org/doc/public-key_cryptography/sealed_boxes.html}, + urldate={2016-02-01} +} + +@misc{NIST2015, + author={NIST}, + title={{FIPS} 180-4: Secure {H}ash {S}tandard ({SHS})}, + month={August}, + year={2015}, + doi={10.6028/NIST.FIPS.180-4}, + url={http://csrc.nist.gov/publications/PubsFIPS.html#180-4}, + urldate={2016-08-14} +} + +@misc{RIPEMD160, + author={Hans Dobbertin and Antoon Bosselaers and Bart Preneel}, + title={{RIPEMD}-160, a strengthened version of {RIPEMD}}, + url={http://homes.esat.kuleuven.be/~bosselae/ripemd160.html}, + urldate={2016-09-24} +} + +@misc{ANWW2013, + author={Jean-Philippe Aumasson and \;Samuel Neves and \;Zooko Wilcox-O'Hearn and +\;Christian Winnerlein}, + date={2013-01-29}, + title={{BLAKE2}: simpler, smaller, fast as {MD5}}, + url={https://blake2.net/#sp}, + urldate={2016-08-14} +} + +@misc{RFC-7693, + author={Markku-Juhani Saarinen (ed.)}, + title={Request for {C}omments 7693: {T}he {BLAKE2} {C}ryptographic {H}ash and +{M}essage {A}uthentication {C}ode ({MAC})}, + howpublished={Internet Engineering Task Force (IETF)}, + date={2015-11}, + url={https://tools.ietf.org/html/rfc7693}, + urldate={2016-08-31} +} + +@misc{RFC-2119, + author={Scott Bradner}, + title={Request for {C}omments 7693: {K}ey words for use in {RFC}s to {I}ndicate +{R}equirement {L}evels}, + howpublished={Internet Engineering Task Force (IETF)}, + date={1997-03}, + url={https://tools.ietf.org/html/rfc2119}, + urldate={2016-09-14} +} + +@misc{Cert2010, + author={Certicom Research}, + title={Standards for {E}fficient {C}ryptography 2 ({SEC} 2)}, + date={2010-01-27}, + addendum={Version 2.0.}, + url={http://www.secg.org/sec2-v2.pdf}, + urldate={2016-08-14} +} + +@inproceedings{MAEA2010, + author={V. Gayoso Mart{\'i}nez and F. Hern{\'a}ndez Alvarez and +L. Hern{\'a}ndez Encinas and C. S{\'a}nchez {\'A}vila}, + title={A {C}omparison of the {S}tandardized {V}ersions of {ECIES}}, + booktitle={Proceedings of Sixth International Conference on Information Assurance and Security, +23--25 August 2010, Atlanta, GA, USA. ISBN: 978-1-4244-7407-3}, + year={2010}, + pages={1-4}, + publisher={IEEE}, + doi={10.1109/ISIAS.2010.5604194}, + url={https://digital.csic.es/bitstream/10261/32674/1/Gayoso_A%20Comparison%20of%20the%20Standardized%20Versions%20of%20ECIES.pdf}, + urldate={2016-08-14} +} + +@misc{ABR1999, + author={Michel Abdalla and Mihir Bellare and Phillip Rogaway}, + title={{DHAES}: {A}n {E}ncryption {S}cheme {B}ased on the {D}iffie-{H}ellman {P}roblem}, + url={https://eprint.iacr.org/1999/007}, + urldate={2016-08-21}, + date={1998-09}, + howpublished={Cryptology ePrint Archive: Report 1999/007. Received \mbox{March 17,} 1999.} +} + +@misc{DGKM2011, + author={Dana Dachman-Soled and Rosario Gennaro and Hugo Krawczyk and Tal Malkin}, + title={Computational {E}xtractors and {P}seudorandomness}, + url={https://eprint.iacr.org/2011/708}, + urldate={2016-09-02}, + howpublished={Cryptology ePrint Archive: Report 2011/708. \mbox{December 28,} 2011.} +} + +@misc{BDEHR2011, + author={Johannes Buchmann and Erik Dahmen and Sarah Ereth and Andreas H{\"u}lsing and Markus R{\"u}ckert}, + title={On the {S}ecurity of the {W}internitz {O}ne-{T}ime {S}ignature {S}cheme (full version)}, + url={https://eprint.iacr.org/2011/191}, + urldate={2016-09-05}, + howpublished={Cryptology ePrint Archive: Report 2011/191. +Received \mbox{April 13,} 2011.} +} + +@misc{vanS2014, + author={Nicolas van Saberhagen}, + title={CryptoNote v 2.0}, + note={Date disputed.}, + url={https://cryptonote.org/whitepaper.pdf}, + urldate={2016-08-17}, +} + +@misc{Bitcoin-Base58, + title={Base58{C}heck encoding --- {B}itcoin {W}iki}, + url={https://en.bitcoin.it/wiki/Base58Check_encoding}, + urldate={2016-01-26} +} + +@misc{Bitcoin-secp256k1, + title={Secp256k1 --- {B}itcoin {W}iki}, + url={https://en.bitcoin.it/wiki/Secp256k1}, + urldate={2016-03-14} +} + +@misc{Bitcoin-CoinJoin, + title={Coin{J}oin --- {B}itcoin {W}iki}, + url={https://en.bitcoin.it/wiki/CoinJoin}, + urldate={2016-08-17} +} + +@misc{Bitcoin-Format, + title={Raw {T}ransaction {F}ormat --- {B}itcoin {D}eveloper {R}eference}, + url={https://bitcoin.org/en/developer-reference#raw-transaction-format}, + urldate={2016-03-15} +} + +@misc{Bitcoin-Block, + title={Block {H}eaders --- {B}itcoin {D}eveloper {R}eference}, + url={https://bitcoin.org/en/developer-reference#block-headers}, + urldate={2017-04-25} +} + +@misc{Bitcoin-nBits, + title={Target n{B}its --- {B}itcoin {D}eveloper {R}eference}, + url={https://bitcoin.org/en/developer-reference#target-nbits}, + urldate={2016-08-13} +} + +@misc{Bitcoin-Multisig, + title={P2SH multisig (definition) --- {B}itcoin {D}eveloper {R}eference}, + url={https://bitcoin.org/en/developer-guide#term-p2sh-multisig}, + urldate={2016-08-19} +} + +@misc{Bitcoin-P2SH, + title={P2SH (definition) --- {B}itcoin {D}eveloper {R}eference}, + url={https://bitcoin.org/en/developer-guide#term-p2sh}, + urldate={2016-08-24} +} + +@misc{Bitcoin-P2PKH, + title={P2PKH (definition) -- {B}itcoin {D}eveloper {R}eference}, + url={https://bitcoin.org/en/developer-guide#term-p2pkh}, + urldate={2016-08-24} +} + +@misc{Bitcoin-Protocol, + title={Protocol documentation --- {B}itcoin {W}iki}, + url={https://en.bitcoin.it/wiki/Protocol_documentation}, + urldate={2016-10-02} +} + +@misc{BIP-11, + author={Gavin Andresen}, + title={M-of-{N} {S}tandard {T}ransactions}, + howpublished={Bitcoin Improvement Proposal 11. Created October 18, 2011}, + url={https://github.com/bitcoin/bips/blob/master/bip-0011.mediawiki}, + urldate={2016-10-02} +} + +@misc{BIP-13, + author={Gavin Andresen}, + title={Address {F}ormat for pay-to-script-hash}, + howpublished={Bitcoin Improvement Proposal 13. Created October 18, 2011}, + url={https://github.com/bitcoin/bips/blob/master/bip-0013.mediawiki}, + urldate={2016-09-24} +} + +@misc{BIP-14, + author={Amir Taaki and Patrick Strateman}, + title={Protocol {V}ersion and {U}ser {A}gent}, + howpublished={Bitcoin Improvement Proposal 14. Created November 10, 2011}, + url={https://github.com/bitcoin/bips/blob/master/bip-0014.mediawiki}, + urldate={2016-10-02} +} + +@misc{BIP-16, + author={Gavin Andresen}, + title={Pay to {S}cript {H}ash}, + howpublished={Bitcoin Improvement Proposal 16. Created January 3, 2012}, + url={https://github.com/bitcoin/bips/blob/master/bip-0016.mediawiki}, + urldate={2016-10-02} +} + +@misc{BIP-30, + author={Pieter Wuille}, + title={Duplicate transactions}, + howpublished={Bitcoin Improvement Proposal 30. Created February 22, 2012}, + url={https://github.com/bitcoin/bips/blob/master/bip-0030.mediawiki}, + urldate={2016-10-02} +} + +@misc{BIP-31, + author={Mike Hearn}, + title={Pong message}, + howpublished={Bitcoin Improvement Proposal 31. Created April 11, 2012}, + url={https://github.com/bitcoin/bips/blob/master/bip-0031.mediawiki}, + urldate={2016-10-02} +} + +@misc{BIP-32, + author={Pieter Wuille}, + title={Hierarchical {D}eterministic {W}allets}, + howpublished={Bitcoin Improvement Proposal 32. Created February 11, 2012. Last updated January 15, 2014}, + url={https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki}, + urldate={2016-09-24} +} + +@misc{BIP-34, + author={Gavin Andresen}, + title={Block v2, {H}eight in {C}oinbase}, + howpublished={Bitcoin Improvement Proposal 34. Created July 6, 2012}, + url={https://github.com/bitcoin/bips/blob/master/bip-0034.mediawiki}, + urldate={2016-10-02} +} + +@misc{BIP-35, + author={Jeff Garzik}, + title={mempool message}, + howpublished={Bitcoin Improvement Proposal 35. Created August 16, 2012}, + url={https://github.com/bitcoin/bips/blob/master/bip-0035.mediawiki}, + urldate={2016-10-02} +} + +@misc{BIP-37, + author={Mike Hearn and Matt Corallo}, + title={Connection Bloom filtering}, + howpublished={Bitcoin Improvement Proposal 37. Created October 24, 2012}, + url={https://github.com/bitcoin/bips/blob/master/bip-0037.mediawiki}, + urldate={2016-10-02} +} + +@misc{BIP-61, + author={Gavin Andresen}, + title={Reject P2P message}, + howpublished={Bitcoin Improvement Proposal 61. Created June 18, 2014}, + url={https://github.com/bitcoin/bips/blob/master/bip-0061.mediawiki}, + urldate={2016-10-02} +} + +@misc{BIP-62, + author={Pieter Wuille}, + title={Dealing with malleability}, + howpublished={Bitcoin Improvement Proposal 62. Withdrawn Nov\-ember 17, 2015}, + url={https://github.com/bitcoin/bips/blob/master/bip-0062.mediawiki}, + urldate={2016-09-05} +} + +@misc{BIP-65, + author={Peter Todd}, + title={\ScriptOP{CHECKLOCKTIMEVERIFY}}, + howpublished={Bitcoin Improvement Proposal 65. Created October 10, 2014}, + url={https://github.com/bitcoin/bips/blob/master/bip-0065.mediawiki}, + urldate={2016-10-02} +} + +@misc{BIP-66, + author={Pieter Wuille}, + title={Strict {DER} signatures}, + howpublished={Bitcoin Improvement Proposal 66. Created January 10, 2015}, + url={https://github.com/bitcoin/bips/blob/master/bip-0066.mediawiki}, + urldate={2016-10-02} +} + +@misc{BIP-68, + author={Mark Friedenbach and BtcDrak and Nicolas Dorier and kinoshitajona}, + title={Relative lock-time using con\-sensus-enforced sequence numbers}, + howpublished={Bitcoin Improvement Proposal 68. Last revised November 21, 2015}, + url={https://github.com/bitcoin/bips/blob/master/bip-0068.mediawiki}, + urldate={2016-09-02} +} + +@misc{DigiByte-PoW, + author={DigiByte Core Developers}, + title={DigiSpeed 4.0.0 source code, functions GetNextWorkRequiredV3/4 in src/main.cpp as of commit 178e134}, + url={https://github.com/digibyte/digibyte/blob/178e1348a67d9624db328062397fde0de03fe388/src/main.cpp#L1587}, + urldate={2017-01-20} +} + +@misc{GitHub-mpc, + author={Sean Bowe and Ariel Gabizon and Matthew Green}, + title={GitHub repository `\hairspace zcash/mpc'\hairspace: zk-SNARK parameter multi-party computation protocol}, + url={https://github.com/zcash/mpc}, + urldate={2017-01-06} +} + +@misc{ZcashIssue-2113, + author={Simon Liu}, + title={GitHub repository `\hairspace zcash/zcash'\hairspace: Issue 2113}, + url={https://github.com/zcash/zcash/issues/2113}, + urldate={2017-02-20} +} + +@book{IEEE2000, + author={IEEE Computer Society}, + publisher={IEEE}, + date={2000-08-29}, + title={IEEE {S}td 1363-2000: {S}tandard {S}pecifications for {P}ublic-{K}ey {C}ryptography}, + url={http://ieeexplore.ieee.org/servlet/opac?punumber=7168}, + urldate={2016-08-03}, + doi={10.1109/IEEESTD.2000.92292} +} + +@book{IEEE2004, + author={IEEE Computer Society}, + publisher={IEEE}, + date={2004-09-02}, + title={IEEE {S}td 1363a-2004: {S}tandard {S}pecifications for {P}ublic-{K}ey {C}ryptography -- +{A}mendment 1: {A}dditional {T}echniques}, + url={http://ieeexplore.ieee.org/servlet/opac?punumber=9276}, + urldate={2016-08-03}, + doi={10.1109/IEEESTD.2004.94612} +} + +@misc{libsnark-fork, + title={libsnark: {C}++ library for {zkSNARK} proofs (Zcash fork)}, + url={https://github.com/zcash/libsnark}, + urldate={2016-08-14} +} + +@misc{RFC-7539, + author={Yoav Nir and Adam Langley}, + title={Request for {C}omments 7539: Cha{C}ha20 and {P}oly1305 for {IETF} {P}rotocols}, + howpublished={Internet Research Task Force (IRTF)}, + date={2015-05}, + url={https://tools.ietf.org/html/rfc7539}, + urldate={2016-09-02}, + addendum={As modified by verified errata at \url{https://www.rfc-editor.org/errata_search.php?rfc=7539} +(visited on 2016-09-02).} +} + +@misc{BN2007, + author={Mihir Bellare and Chanathip Namprempre}, + title={Authenticated {E}ncryption: {R}elations among notions and analysis of the +generic composition paradigm}, + url={https://eprint.iacr.org/2000/025}, + urldate={2016-09-02}, + howpublished={Cryptology ePrint Archive: Report 2000/025. Last revised \mbox{July 14,} 2007.} +} + +@misc{BBDP2001, + author={Mihir Bellare and Alexandra Boldyreva and Anand Desai and David Pointcheval}, + title={Key-{P}rivacy in {P}ublic-{K}ey {E}ncryption}, + addendum={Full version.}, + month={September}, + year={2001}, + url={https://cseweb.ucsd.edu/~mihir/papers/anonenc.html}, + urldate={2016-08-14} +} + +@book{LG2004, + author={Eddie Lenihan and Carolyn Eve Green}, + title={Meeting the {O}ther {C}rowd: {T}he {F}airy {S}tories of {H}idden {I}reland}, + month={February}, + year={2004}, + publisher={TarcherPerigee}, + pages={109-110}, + isbn={1-58542-206-1} +} + +@misc{GGM2016, + author={Christina Garman\; and \;Matthew Green\; and \;Ian Miers}, + title={Accountable\, {P}rivacy\, for\, {D}ecentralized\, {A}nonymous\, {P}ayments}, + howpublished={Cryptology ePrint Archive: Report 2016/061. Last revised \mbox{January 24,} 2016}, + url={https://eprint.iacr.org/2016/061}, + urldate={2016-09-02} +} + +@misc{WG2016, + author={Zooko Wilcox and Jack Grigg}, + title={Why {E}quihash?}, + howpublished={Zcash blog}, + date={2016-04-15}, + url={https://z.cash/blog/why-equihash.html}, + urldate={2016-08-05} +} + +@misc{HW2016, + author={Taylor Hornby\; and \;Zooko Wilcox}, + title={Fixing\, {V}ulnerabilities\, in\, the\, {Z}cash\, {P}rotocol}, + howpublished={Zcash blog}, + date={2016-04-25}, + url={https://z.cash/blog/fixing-zcash-vulns.html}, + urldate={2016-06-22} +} + +@misc{EWD-831, + author={Edsger W. Dijkstra}, + title={Why\, numbering\, should\, start\, at\, zero}, + howpublished={\;Manuscript}, + date={1982-08-11}, + url={https://www.cs.utexas.edu/users/EWD/transcriptions/EWD08xx/EWD831.html}, + urldate={2016-08-09} +} diff --git a/sietch.tex b/sietch.tex new file mode 100644 index 0000000..f71a127 --- /dev/null +++ b/sietch.tex @@ -0,0 +1,501 @@ +% Dedicated to Craig Leto +\documentclass{article} +\RequirePackage{amsmath} +\RequirePackage{bytefield} +\RequirePackage{graphicx} +\RequirePackage{newtxmath} +\RequirePackage{mathtools} +\RequirePackage{xspace} +\RequirePackage{url} +\RequirePackage{changepage} +\RequirePackage{enumitem} +\RequirePackage{tabularx} +\RequirePackage{hhline} +\RequirePackage[usestackEOL]{stackengine} +\RequirePackage{comment} +\RequirePackage{needspace} +\RequirePackage[nobottomtitles]{titlesec} +\RequirePackage[hang]{footmisc} +\RequirePackage{xstring} +\RequirePackage[unicode,bookmarksnumbered,bookmarksopen,pdfview=Fit]{hyperref} +\RequirePackage{cleveref} +\RequirePackage{nameref} + +\RequirePackage[style=alphabetic,maxbibnames=99,dateabbrev=false,urldate=iso8601,backref=true,backrefstyle=none,backend=biber]{biblatex} +\addbibresource{hush.bib} + +% Fonts +\RequirePackage{lmodern} +\RequirePackage{quattrocento} +\RequirePackage[bb=ams]{mathalfa} + +% Quattrocento is beautiful but doesn't have an italic face. So we scale +% New Century Schoolbook italic to fit in with slanted Quattrocento and +% match its x height. +\renewcommand{\emph}[1]{\hspace{0.15em}{\fontfamily{pnc}\selectfont\scalebox{1.02}[0.999]{\textit{#1}}}\hspace{0.02em}} + +% While we're at it, let's match the tt x height to Quattrocento as well. +\let\oldtexttt\texttt +\let\oldmathtt\mathtt +\renewcommand{\texttt}[1]{\scalebox{1.02}[1.07]{\oldtexttt{#1}}} +\renewcommand{\mathtt}[1]{\scalebox{1.02}[1.07]{$\oldmathtt{#1}$}} + +\newcommand{\zsendmany}{\textbf{z\_sendmany}} + +% bold but not extended +\newcommand{\textbnx}[1]{{\fontseries{b}\selectfont #1}} + + +\crefformat{footnote}{#2\footnotemark[#1]#3} + +\DeclareLabelalphaTemplate{ + \labelelement{\field{citekey}} +} + +\DefineBibliographyStrings{english}{ + page = {page}, + pages = {pages}, + backrefpage = {\mbox{$\uparrow$ p\!}}, + backrefpages = {\mbox{$\uparrow$ p\!}} +} + +\setlength{\oddsidemargin}{-0.25in} +\setlength{\textwidth}{7in} +\setlength{\topmargin}{-0.75in} +\setlength{\textheight}{9.2in} +\setlength{\parindent}{0ex} +\renewcommand{\arraystretch}{1.4} +\overfullrule=2cm + +\setlength{\footnotemargin}{0.6em} +\setlength{\footnotesep}{2ex} +\addtolength{\skip\footins}{3ex} + +\renewcommand{\bottomtitlespace}{8ex} + +% Use rubber lengths between paragraphs to improve default pagination. +% https://tex.stackexchange.com/questions/17178/vertical-spacing-pagination-and-ideal-results +\setlength{\parskip}{1.5ex plus 1pt minus 1pt} + +\setlist[enumerate]{before=\vspace{-1ex}} +\setlist[itemize]{itemsep=0.5ex,topsep=0.2ex,before=\vspace{-1ex},after=\vspace{1.5ex}} + +\newlist{formulae}{itemize}{3} +\setlist[formulae]{itemsep=0.2ex,topsep=0ex,leftmargin=1.5em,label=,after=\vspace{1.5ex}} + +\newcommand{\docversion}{Whitepaper Version 1.0} +\newcommand{\termbf}[1]{\textbf{#1}\xspace} +\newcommand{\Hushlist}{\termbf{HushList}} +\newcommand{\HushList}{\termbf{HushList}} +\newcommand{\Hushlists}{\termbf{HushLists}} +\newcommand{\HushLists}{\termbf{HushLists}} + +\newcommand{\doctitle}{New Attacks and Defenses for Zcash Protocol} +\newcommand{\leadauthor}{Duke Leto} + +\newcommand{\keywords}{anonymity, freedom of speech, cryptographic protocols,\ +electronic commerce and payment, financial privacy, proof of work, zero knowledge\ +zk-SNARKs } + +\hypersetup{ + pdfborderstyle={/S/U/W 0.7}, + pdfinfo={ + Title={\doctitle, \docversion}, + Author={\leadauthor}, + Keywords={\keywords} + } +} + +\makeatletter +\renewcommand*{\@fnsymbol}[1]{\ensuremath{\ifcase#1\or \dagger\or \ddagger\or + \mathsection\or \mathparagraph\else\@ctrerr\fi}} +\makeatother + +\renewcommand{\sectionautorefname}{\S\!} +\renewcommand{\subsectionautorefname}{\S\!} +\renewcommand{\subsubsectionautorefname}{\S\!} +\renewcommand{\subparagraphautorefname}{\S\!} +\newcommand{\crossref}[1]{\autoref{#1}\, \emph{`\nameref*{#1}\kern -0.05em'} on p.\,\pageref*{#1}} + +\newcommand{\nstrut}[1]{\texorpdfstring{#1\rule[-.2\baselineskip]{0pt}{\baselineskip}}{#1}} +\newcommand{\nsection}[1]{\section{\nstrut{#1}}} +\newcommand{\nsubsection}[1]{\subsection{\nstrut{#1}}} +\newcommand{\nsubsubsection}[1]{\subsubsection{\nstrut{#1}}} + +\newcommand{\introlist}{\needspace{15ex}} +\newcommand{\introsection}{\needspace{30ex}} + +\mathchardef\mhyphen="2D + +% http://tex.stackexchange.com/a/309445/78411 +\DeclareFontFamily{U}{FdSymbolA}{} +\DeclareFontShape{U}{FdSymbolA}{m}{n}{ + <-> s*[.4] FdSymbolA-Regular +}{} +\DeclareSymbolFont{fdsymbol}{U}{FdSymbolA}{m}{n} +\DeclareMathSymbol{\smallcirc}{\mathord}{fdsymbol}{"60} + +\makeatletter +\newcommand{\hollowcolon}{\mathpalette\hollow@colon\relax} +\newcommand{\hollow@colon}[2]{ + \mspace{0.7mu} + \vbox{\hbox{$\m@th#1\smallcirc$}\nointerlineskip\kern.45ex \hbox{$\m@th#1\smallcirc$}\kern-.06ex} + \mspace{1mu} +} +\makeatother +\newcommand{\typecolon}{\;\hollowcolon\;} + +% We just want one ampersand symbol from boisik. +\DeclareSymbolFont{bskadd}{U}{bskma}{m}{n} +\DeclareFontFamily{U}{bskma}{\skewchar\font130 } +\DeclareFontShape{U}{bskma}{m}{n}{<->bskma10}{} +\DeclareMathSymbol{\binampersand}{\mathbin}{bskadd}{"EE} + +\newcommand{\hairspace}{~\!} +\newcommand{\hparen}{\hphantom{(}} + +\newcommand{\hfrac}[2]{\scalebox{0.8}{$\genfrac{}{}{0.5pt}{0}{#1}{#2}$}} + + +\RequirePackage[usenames,dvipsnames]{xcolor} +% https://en.wikibooks.org/wiki/LaTeX/Colors#The_68_standard_colors_known_to_dvips +\newcommand{\todo}[1]{{\color{Sepia}\sf{TODO: #1}}} + +\newcommand{\changedcolor}{magenta} +\newcommand{\setchanged}{\color{\changedcolor}} +\newcommand{\changed}[1]{\texorpdfstring{{\setchanged{#1}}}{#1}} + +% terminology + +\newcommand{\term}[1]{\textsl{#1}\kern 0.05em\xspace} +\newcommand{\titleterm}[1]{#1} +\newcommand{\quotedterm}[1]{``~\!\!\term{#1}''} +\newcommand{\conformance}[1]{\textbnx{#1}\xspace} + +\newcommand{\Zcash}{\termbf{Zcash}} +\newcommand{\Hush}{\termbf{Hush}} +\newcommand{\Zerocash}{\termbf{Zerocash}} +\newcommand{\Bitcoin}{\termbf{Bitcoin}} +\newcommand{\CryptoNote}{\termbf{CryptoNote}} +\newcommand{\ZEC}{\termbf{ZEC}} +\newcommand{\ZEN}{\termbf{ZEN}} +\newcommand{\ZCL}{\termbf{ZCL}} +\newcommand{\KMD}{\termbf{KMD}} +\newcommand{\BTCH}{\termbf{BTCH}} +\newcommand{\BTCP}{\termbf{BTCP}} +\newcommand{\ZAU}{\termbf{ZAU}} +\newcommand{\VOT}{\termbf{VOT}} +\newcommand{\BTCZ}{\termbf{BTCZ}} +\newcommand{\LTZ}{\termbf{LTZ}} +\newcommand{\HUSH}{\termbf{HUSH}} +\newcommand{\zatoshi}{\term{zatoshi}} +\newcommand{\puposhi}{\term{puposhi}} +\newcommand{\zcashd}{\textsf{zcashd}\,} +\newcommand{\hushd}{\textsf{hushd}\,} + +\newcommand{\MUST}{\conformance{MUST}} +\newcommand{\MUSTNOT}{\conformance{MUST NOT}} +\newcommand{\SHOULD}{\conformance{SHOULD}} +\newcommand{\SHOULDNOT}{\conformance{SHOULD NOT}} +\newcommand{\ALLCAPS}{\conformance{ALL CAPS}} + +\newcommand{\note}{\term{note}} +\newcommand{\notes}{\term{notes}} +\newcommand{\Note}{\titleterm{Note}} +\newcommand{\Notes}{\titleterm{Notes}} +\newcommand{\dummy}{\term{dummy}} +\newcommand{\dummyNotes}{\term{dummy notes}} +\newcommand{\DummyNotes}{\titleterm{Dummy Notes}} +\newcommand{\commitmentScheme}{\term{commitment scheme}} +\newcommand{\commitmentTrapdoor}{\term{commitment trapdoor}} +\newcommand{\commitmentTrapdoors}{\term{commitment trapdoors}} +\newcommand{\trapdoor}{\term{trapdoor}} +\newcommand{\noteCommitment}{\term{note commitment}} +\newcommand{\noteCommitments}{\term{note commitments}} +\newcommand{\NoteCommitment}{\titleterm{Note Commitment}} +\newcommand{\NoteCommitments}{\titleterm{Note Commitments}} +\newcommand{\noteCommitmentTree}{\term{note commitment tree}} +\newcommand{\NoteCommitmentTree}{\titleterm{Note Commitment Tree}} +\newcommand{\noteTraceabilitySet}{\term{note traceability set}} +\newcommand{\noteTraceabilitySets}{\term{note traceability sets}} +\newcommand{\joinSplitDescription}{\term{JoinSplit description}} +\newcommand{\joinSplitDescriptions}{\term{JoinSplit descriptions}} +\newcommand{\JoinSplitDescriptions}{\titleterm{JoinSplit Descriptions}} +\newcommand{\sequenceOfJoinSplitDescriptions}{\changed{sequence of} \joinSplitDescription\changed{\term{s}}\xspace} +\newcommand{\joinSplitTransfer}{\term{JoinSplit transfer}} +\newcommand{\joinSplitTransfers}{\term{JoinSplit transfers}} +\newcommand{\JoinSplitTransfer}{\titleterm{JoinSplit Transfer}} +\newcommand{\JoinSplitTransfers}{\titleterm{JoinSplit Transfers}} +\newcommand{\joinSplitSignature}{\term{JoinSplit signature}} +\newcommand{\joinSplitSignatures}{\term{JoinSplit signatures}} +\newcommand{\joinSplitSigningKey}{\term{JoinSplit signing key}} +\newcommand{\joinSplitVerifyingKey}{\term{JoinSplit verifying key}} +\newcommand{\joinSplitStatement}{\term{JoinSplit statement}} +\newcommand{\joinSplitStatements}{\term{JoinSplit statements}} +\newcommand{\JoinSplitStatement}{\titleterm{JoinSplit Statement}} +\newcommand{\joinSplitProof}{\term{JoinSplit proof}} +\newcommand{\statement}{\term{statement}} +\newcommand{\zeroKnowledgeProof}{\term{zero-knowledge proof}} +\newcommand{\ZeroKnowledgeProofs}{\titleterm{Zero-Knowledge Proofs}} +\newcommand{\provingSystem}{\term{proving system}} +\newcommand{\zeroKnowledgeProvingSystem}{\term{zero-knowledge proving system}} +\newcommand{\ZeroKnowledgeProvingSystem}{\titleterm{Zero-Knowledge Proving System}} +\newcommand{\ppzkSNARK}{\term{preprocessing zk-SNARK}} +\newcommand{\provingKey}{\term{proving key}} +\newcommand{\zkProvingKeys}{\term{zero-knowledge proving keys}} +\newcommand{\verifyingKey}{\term{verifying key}} +\newcommand{\zkVerifyingKeys}{\term{zero-knowledge verifying keys}} +\newcommand{\joinSplitParameters}{\term{JoinSplit parameters}} +\newcommand{\JoinSplitParameters}{\titleterm{JoinSplit Parameters}} +\newcommand{\arithmeticCircuit}{\term{arithmetic circuit}} +\newcommand{\rankOneConstraintSystem}{\term{Rank 1 Constraint System}} +\newcommand{\primary}{\term{primary}} +\newcommand{\primaryInput}{\term{primary input}} +\newcommand{\primaryInputs}{\term{primary inputs}} +\newcommand{\auxiliaryInput}{\term{auxiliary input}} +\newcommand{\auxiliaryInputs}{\term{auxiliary inputs}} +\newcommand{\fullnode}{\term{full node}} +\newcommand{\fullnodes}{\term{full nodes}} +\newcommand{\anchor}{\term{anchor}} +\newcommand{\anchors}{\term{anchors}} +\newcommand{\UTXO}{\term{UTXO}} +\newcommand{\UTXOs}{\term{UTXOs}} +\newcommand{\block}{\term{block}} +\newcommand{\blocks}{\term{blocks}} +\newcommand{\header}{\term{header}} +\newcommand{\headers}{\term{headers}} +\newcommand{\blockHeader}{\term{block header}} +\newcommand{\blockHeaders}{\term{block headers}} +\newcommand{\Blockheader}{\term{Block header}} +\newcommand{\BlockHeader}{\titleterm{Block Header}} +\newcommand{\blockVersionNumber}{\term{block version number}} +\newcommand{\blockVersionNumbers}{\term{block version numbers}} +\newcommand{\Blockversions}{\term{Block versions}} +\newcommand{\blockTime}{\term{block time}} +\newcommand{\blockHeight}{\term{block height}} +\newcommand{\blockHeights}{\term{block heights}} +\newcommand{\genesisBlock}{\term{genesis block}} +\newcommand{\transaction}{\term{transaction}} +\newcommand{\transactions}{\term{transactions}} +\newcommand{\Transactions}{\titleterm{Transactions}} +\newcommand{\transactionFee}{\term{transaction fee}} +\newcommand{\transactionFees}{\term{transaction fees}} +\newcommand{\transactionVersionNumber}{\term{transaction version number}} +\newcommand{\transactionVersionNumbers}{\term{transaction version numbers}} +\newcommand{\Transactionversion}{\term{Transaction version}} +\newcommand{\coinbaseTransaction}{\term{coinbase transaction}} +\newcommand{\coinbaseTransactions}{\term{coinbase transactions}} +\newcommand{\CoinbaseTransactions}{\titleterm{Coinbase Transactions}} +\newcommand{\transparent}{\term{transparent}} +\newcommand{\xTransparent}{\term{Transparent}} +\newcommand{\Transparent}{\titleterm{Transparent}} +\newcommand{\transparentValuePool}{\term{transparent value pool}} +\newcommand{\deshielding}{\term{deshielding}} +\newcommand{\shielding}{\term{shielding}} +\newcommand{\shielded}{\term{shielded}} +\newcommand{\shieldedXTN}{\term{shielded} $ t \rightarrow z $ transaction} +\newcommand{\shieldedXTNs}{\term{shielded} $ t \rightarrow z $ transactions} +\newcommand{\shieldedNote}{\term{shielded note}} +\newcommand{\shieldedNotes}{\term{shielded notes}} +\newcommand{\xShielded}{\term{Shielded}} +\newcommand{\Shielded}{\titleterm{Shielded}} +\newcommand{\blockchain}{\term{block chain}} +\newcommand{\blockchains}{\term{block chains}} +\newcommand{\mempool}{\term{mempool}} +\newcommand{\treestate}{\term{treestate}} +\newcommand{\treestates}{\term{treestates}} +\newcommand{\nullifier}{\term{nullifier}} +\newcommand{\nullifiers}{\term{nullifiers}} +\newcommand{\xNullifiers}{\term{Nullifiers}} +\newcommand{\Nullifier}{\titleterm{Nullifier}} +\newcommand{\Nullifiers}{\titleterm{Nullifiers}} +\newcommand{\nullifierSet}{\term{nullifier set}} +\newcommand{\NullifierSet}{\titleterm{Nullifier Set}} +% Daira: This doesn't adequately distinguish between zk stuff and transparent stuff +\newcommand{\paymentAddress}{\term{payment address}} +\newcommand{\paymentAddresses}{\term{payment addresses}} +\newcommand{\viewingKey}{\term{viewing key}} +\newcommand{\viewingKeys}{\term{viewing keys}} +\newcommand{\spendingKey}{\term{spending key}} +\newcommand{\spendingKeys}{\term{spending keys}} +\newcommand{\payingKey}{\term{paying key}} +\newcommand{\transmissionKey}{\term{transmission key}} +\newcommand{\transmissionKeys}{\term{transmission keys}} +\newcommand{\keyTuple}{\term{key tuple}} +\newcommand{\notePlaintext}{\term{note plaintext}} +\newcommand{\notePlaintexts}{\term{note plaintexts}} +\newcommand{\NotePlaintexts}{\titleterm{Note Plaintexts}} +\newcommand{\notesCiphertext}{\term{transmitted notes ciphertext}} +\newcommand{\incrementalMerkleTree}{\term{incremental Merkle tree}} +\newcommand{\merkleRoot}{\term{root}} +\newcommand{\merkleNode}{\term{node}} +\newcommand{\merkleNodes}{\term{nodes}} +\newcommand{\merkleHash}{\term{hash value}} +\newcommand{\merkleHashes}{\term{hash values}} +\newcommand{\merkleLeafNode}{\term{leaf node}} +\newcommand{\merkleLeafNodes}{\term{leaf nodes}} +\newcommand{\merkleInternalNode}{\term{internal node}} +\newcommand{\merkleInternalNodes}{\term{internal nodes}} +\newcommand{\MerkleInternalNodes}{\term{Internal nodes}} +\newcommand{\merklePath}{\term{path}} +\newcommand{\merkleLayer}{\term{layer}} +\newcommand{\merkleLayers}{\term{layers}} +\newcommand{\merkleIndex}{\term{index}} +\newcommand{\merkleIndices}{\term{indices}} +\newcommand{\zkSNARK}{\term{zk-SNARK}} +\newcommand{\zkSNARKs}{\term{zk-SNARKs}} +\newcommand{\libsnark}{\term{libsnark}} +\newcommand{\memo}{\term{memo field}} +\newcommand{\memos}{\term{memo fields}} +\newcommand{\Memos}{\titleterm{Memo Fields}} +\newcommand{\keyAgreementScheme}{\term{key agreement scheme}} +\newcommand{\KeyAgreement}{\titleterm{Key Agreement}} +\newcommand{\keyDerivationFunction}{\term{Key Derivation Function}} +\newcommand{\KeyDerivation}{\titleterm{Key Derivation}} +\newcommand{\encryptionScheme}{\term{encryption scheme}} +\newcommand{\symmetricEncryptionScheme}{\term{authenticated one-time symmetric encryption scheme}} +\newcommand{\SymmetricEncryption}{\titleterm{Authenticated One-Time Symmetric Encryption}} +\newcommand{\signatureScheme}{\term{signature scheme}} +\newcommand{\pseudoRandomFunction}{\term{Pseudo Random Function}} +\newcommand{\pseudoRandomFunctions}{\term{Pseudo Random Functions}} +\newcommand{\PseudoRandomFunctions}{\titleterm{Pseudo Random Functions}} + +% conventions +\newcommand{\bytes}[1]{\underline{\raisebox{-0.22ex}{}\smash{#1}}} +\newcommand{\zeros}[1]{[0]^{#1}} +\newcommand{\bit}{\mathbb{B}} +\newcommand{\Nat}{\mathbb{N}} +\newcommand{\PosInt}{\mathbb{N}^+} +\newcommand{\Rat}{\mathbb{Q}} +\newcommand{\typeexp}[2]{{#1}\vphantom{)}^{[{#2}]}} +\newcommand{\bitseq}[1]{\typeexp{\bit}{#1}} +\newcommand{\byteseqs}{\typeexp{\bit}{8\mult\Nat}} +\newcommand{\concatbits}{\mathsf{concat}_\bit} +\newcommand{\listcomp}[1]{[~{#1}~]} +\newcommand{\for}{\text{ for }} +\newcommand{\from}{\text{ from }} +\newcommand{\upto}{\text{ up to }} +\newcommand{\downto}{\text{ down to }} +\newcommand{\squash}{\!\!\!} +\newcommand{\caseif}{\squash\text{if }} +\newcommand{\caseotherwise}{\squash\text{otherwise}} +\newcommand{\sorted}{\mathsf{sorted}} +\newcommand{\length}{\mathsf{length}} +\newcommand{\mean}{\mathsf{mean}} +\newcommand{\median}{\mathsf{median}} +\newcommand{\clamp}[2]{\mathsf{clamp\,}_{#1}^{#2}} +\newcommand{\Lower}{\mathsf{lower}} +\newcommand{\Upper}{\mathsf{upper}} +\newcommand{\bitlength}{\mathsf{bitlength}} +\newcommand{\size}{\mathsf{size}} +\newcommand{\mantissa}{\mathsf{mantissa}} +\newcommand{\ToCompact}{\mathsf{ToCompact}} +\newcommand{\ToTarget}{\mathsf{ToTarget}} +\newcommand{\hexint}[1]{\mathbf{0x{#1}}} +\newcommand{\dontcare}{\kern -0.06em\raisebox{0.1ex}{\footnotesize{$\times$}}} +\newcommand{\ascii}[1]{\textbf{``\texttt{#1}"}} +\newcommand{\Justthebox}[2][-1.3ex]{\;\raisebox{#1}{\usebox{#2}}\;} +\newcommand{\hSigCRH}{\mathsf{hSigCRH}} +\newcommand{\hSigLength}{\mathsf{\ell_{hSig}}} +\newcommand{\hSigType}{\bitseq{\hSigLength}} +\newcommand{\EquihashGen}[1]{\mathsf{EquihashGen}_{#1}} +\newcommand{\CRH}{\mathsf{CRH}} +\newcommand{\CRHbox}[1]{\SHA\left(\Justthebox{#1}\right)} +\newcommand{\SHA}{\mathtt{SHA256Compress}} +\newcommand{\SHAName}{\term{SHA-256 compression}} +\newcommand{\FullHash}{\mathtt{SHA256}} +\newcommand{\FullHashName}{\mathsf{SHA\mhyphen256}} +\newcommand{\Blake}[1]{\mathsf{BLAKE2b\kern 0.05em\mhyphen{#1}}} +\newcommand{\BlakeGeneric}{\mathsf{BLAKE2b}} +\newcommand{\FullHashbox}[1]{\FullHash\left(\Justthebox{#1}\right)} +\newcommand{\setof}[1]{\{{#1}\}} +\newcommand{\range}[2]{\{{#1}\,..\,{#2}\}} +\newcommand{\minimum}{\mathsf{min}} +\newcommand{\maximum}{\mathsf{max}} +\newcommand{\floor}[1]{\mathsf{floor}\!\left({#1}\right)} +\newcommand{\trunc}[1]{\mathsf{trunc}\!\left({#1}\right)} +\newcommand{\ceiling}[1]{\mathsf{ceiling}\left({#1}\right)} +\newcommand{\vsum}[2]{\smashoperator[r]{\sum_{#1}^{#2}}} +\newcommand{\vxor}[2]{\smashoperator[r]{\bigoplus_{#1}^{#2}}} +\newcommand{\xor}{\oplus} +\newcommand{\band}{\binampersand} +\newcommand{\mult}{\cdot} +\newcommand{\rightarrowR}{\buildrel{\scriptstyle\mathrm{R}}\over\rightarrow} +\newcommand{\leftarrowR}{\buildrel{\scriptstyle\mathrm{R}}\over\leftarrow} + +\newcommand{\JoinSplit}{\text{\footnotesize\texttt{JoinSplit}}} + +\newcommand{\affiliation}{\hairspace$^\dagger$\;} +\newcommand{\affiliationDuke}{\hairspace$^\ddagger$\;} + +\begin{document} + +\title{\doctitle \\ +\Large \docversion} +\author{ +\Large \leadauthor\hairspace\thanks{\;duke@leto.net , duke.leto.net, @dukeleto, 8DFC BF8E 5A4D 8019 , https://keybase.io/dukeleto} +} +\date{\today} +\maketitle + +\renewcommand{\abstractname}{} +\vspace{-8ex} +\begin{abstract} +\normalsize \noindent \textbf{Abstract.} + +This paper will outline, for the first time, exactly how the "ITM Metadata Attack" +works against Zcash Protocol and how Hush is the first cryptocoin with a defensive +mitigation against it, called "Sietch". Sietch is already running live in production +and undergoing it's first improvement from a round a feedback. This is not an academic +paper about pipedreams, it will describe production code and networks. + +\begin{quote} +If dust can attack us, dust can protect us. + + -- Sietch Motto +\end{quote} + +\vspace{2.5ex} +\noindent \textbf{Keywords:}~ \StrSubstitute[0]{\keywords}{,}{, }. +\end{abstract} + +\vspace{-10ex} +\phantomsection +\addcontentsline{toc}{section}{\Large\nstrut{Contents}} + +\renewcommand{\contentsname}{} +% http://tex.stackexchange.com/a/182744/78411 +\renewcommand{\baselinestretch}{0.85}\normalsize +\tableofcontents +\renewcommand{\baselinestretch}{1.0}\normalsize +\newpage + +\nsection{Introduction} +\nsection{Things Staying The Same} + +\begin{itemize} +\item Hush v3.3.0 has Sietch V0 +\item Two fixed pools of zaddrs +\item SDL uses two fixed pools of 5000 zaddrs +\end{itemize} + +\begin{quote} +A quote +\end{quote} + +\nsection{Stuff} + +\nsection{Special Thanks} + +Special thanks to jl777, ITM and denioD for their feedback. + +\nsection{References} + +\begingroup +\hfuzz=2pt +\renewcommand{\section}[2]{} +\renewcommand{\emph}[1]{\textit{#1}} +\printbibliography +\endgroup + +\end{document}