commit 5cf44c62acfb942e4a3942087487f511d42265de Author: Evgeniy Kulikov Date: Sat Dec 29 16:04:17 2018 +0300 Initial diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..ba7ea82 --- /dev/null +++ b/.gitignore @@ -0,0 +1,12 @@ +# Binaries for programs and plugins +*.exe +*.exe~ +*.dll +*.so +*.dylib + +# Test binary, build with `go test -c` +*.test + +# Output of the go coverage tool, specifically when used with LiteIDE +*.out \ No newline at end of file diff --git a/Dockerfile b/Dockerfile new file mode 100644 index 0000000..92b6036 --- /dev/null +++ b/Dockerfile @@ -0,0 +1,36 @@ +FROM golang:1.11-alpine3.8 as builder + +RUN set -x \ + && apk add --no-cache \ + git \ + curl \ + && mkdir -p /tmp \ + && mkdir -p /fixtures \ + && curl -s https://loripsum.net/api/1/verylong/plaintext | awk 'NF' - | cat > /fixtures/01.txt \ + && curl -s https://loripsum.net/api/1/verylong/plaintext | awk 'NF' - | cat > /fixtures/02.txt \ + && curl -s https://loripsum.net/api/1/verylong/plaintext | awk 'NF' - | cat > /fixtures/03.txt \ + && curl -s https://loripsum.net/api/1/verylong/plaintext | awk 'NF' - | cat > /fixtures/04.txt \ + && curl -s https://loripsum.net/api/1/verylong/plaintext | awk 'NF' - | cat > /fixtures/05.txt \ + && curl -s https://loripsum.net/api/1/verylong/plaintext | awk 'NF' - | cat > /fixtures/06.txt \ + && curl -s https://loripsum.net/api/1/verylong/plaintext | awk 'NF' - | cat > /fixtures/07.txt \ + && curl -s https://loripsum.net/api/1/verylong/plaintext | awk 'NF' - | cat > /fixtures/08.txt \ + && curl -s https://loripsum.net/api/1/verylong/plaintext | awk 'NF' - | cat > /fixtures/09.txt \ + && curl -s https://loripsum.net/api/1/verylong/plaintext | awk 'NF' - | cat > /fixtures/10.txt + +COPY . /tzhash + +WORKDIR /tzhash + +# https://github.com/golang/go/wiki/Modules#how-do-i-use-vendoring-with-modules-is-vendoring-going-away +# go build -mod=vendor +RUN set -x \ + && export CGO_ENABLED=0 \ + && go build -mod=vendor -o /go/bin/homo ./cmd/homo/main.go + +# Executable image +FROM alpine:3.8 + +WORKDIR /fixtures + +COPY --from=builder /fixtures /fixtures +COPY --from=builder /go/bin/homo /usr/local/sbin/homo 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..b5a6677 --- /dev/null +++ b/Makefile @@ -0,0 +1,42 @@ +B=\033[0;1m +G=\033[0;92m +R=\033[0m + +NAME ?= homo + +.PHONY: help attach auto up down +# Show this help prompt +help: + @echo ' Usage:' + @echo '' + @echo ' make ' + @echo '' + @echo ' Targets:' + @echo '' + @awk '/^#/{ comment = substr($$0,3) } comment && /^[a-zA-Z][a-zA-Z0-9_-]+ ?:/{ print " ", $$1, comment }' $(MAKEFILE_LIST) | column -t -s ':' | grep -v 'IGNORE' | sort | uniq + +# Auto Tillich-Zémor hasher demo +auto: down + @echo "\n${B}${G}build container${R}\n" + @time docker build -t poc-demo . + @echo "\n${B}${G}Bootup container:${R}\n" + @time docker run -d --rm -it --name hash-demo poc-demo:latest sh + @bash ./auto.sh + +# Stop demo container +down: + @echo "\n${B}${G}Stop container${R}\n" + @docker stop hash-demo || true + @docker rm hash-demo || true + +# Run Tillich-Zémor hasher demo +up: down + @echo "\n${B}${G}build container${R}\n" + @time docker build -t poc-demo . + @echo "\n${B}${G}enter inside container:${R}\n" + @time docker run --rm -it --name hash-demo poc-demo:latest sh + +# Attach to existing container +attach: + @echo "\n${B}${G} attach to hash-container ${R}\n" + @time docker exec -it --name hash-demo /bin/sh diff --git a/README.md b/README.md new file mode 100644 index 0000000..58b0b03 --- /dev/null +++ b/README.md @@ -0,0 +1,54 @@ +# Demo + +[![asciicast](https://asciinema.org/a/IArEDLTrQyabI3agSSpINoqNu.svg)](https://asciinema.org/a/IArEDLTrQyabI3agSSpINoqNu) + +**In project root:** + +```bash +# show help +make +# run auto demo +make auto +``` + +# Homomorphic hashing in golang + +Package **tz** containts pure-Go implementation of hashing function described by Tillich and Źemor in [1] . + +There are existing implementations already (e.g. [2]), however it is written in C. + +Package **gf127** contains arithmetic in GF(2^127) with _x^127+x^63+1_ as reduction polynomial. + +# Description + +It can be used instead of Merkle-tree for data-validation, because homomorphic hashes +are concatable: hash sum of data can be calculated based on hashes of chunks. + +The example of how it works can be seen in tests. + +# Contributing + +At this moment, we do not accept contributions. Follow us. + +# Makefile + +``` +→ make + Usage: + + make + + Targets: + + attach Attach to existing container + auto Auto Tillich-Zémor hasher demo + down Stop demo container + help Show this help prompt + up Run Tillich-Zémor hasher demo +``` + +# Links + +[1] https://link.springer.com/content/pdf/10.1007/3-540-48658-5_5.pdf + +[2] https://github.com/srijs/hwsl2-core \ No newline at end of file diff --git a/auto.sh b/auto.sh new file mode 100755 index 0000000..f4bf9ac --- /dev/null +++ b/auto.sh @@ -0,0 +1,35 @@ +#!/usr/bin/env bash + +B="\033[0;1m" +G="\033[0;92m" +R="\033[0m" + +echo -e "${B}${G}Let's make some hash${R}" + +echo -e "\n${B}${G} - cleanup environment${R}" +echo -e "remove files: small.hash, large.hash, large.txt" +docker exec -it hash-demo sh -c "rm -rf small.hash" +docker exec -it hash-demo sh -c "rm -rf large.hash" +docker exec -it hash-demo sh -c "rm -rf large.txt" + +echo -e "\n${B}${G} - make large file (concat small files)${R}" +for i in $(seq -f "%02g" 10) +do + echo " #> cat $i.txt >> large.txt" + docker exec -it hash-demo sh -c "cat $i.txt >> large.txt" +done + +echo -e "\n${B}${G} - make hash of small files${R}" +for i in $(seq -f "%02g" 10) +do + echo -e " #> homo -file $i.txt | tee -a small.hash" + docker exec -it hash-demo sh -c "homo -file $i.txt | tee -a small.hash" +done + +echo -e "\n${B}${G} - make hash of large${R}" +echo -e " #> homo -file large.txt | homo -concat" +docker exec -it hash-demo sh -c 'homo -file large.txt | homo -concat' + +echo -e "\n${B}${G} - make hash of pieces${R}" +echo -e " #> cat small.hash | homo -concat" +docker exec -it hash-demo sh -c 'cat small.hash | homo -concat ' \ No newline at end of file diff --git a/benchmark b/benchmark new file mode 100755 index 0000000..57fef3d --- /dev/null +++ b/benchmark @@ -0,0 +1,13 @@ +#!/bin/bash +#tmpfile=$(mktemp /tmp/random-file.XXXXXX) +#size=$1 +#dd if=/dev/urandom of=$tmpfile bs=$size count=1 + +tmpfile=$1 + +go build ./cmd/tzsum && \ +for c in tzC tz tzbits; do + ./tzsum -cpuprofile cpu.prof -name $tmpfile -hash $c + echo top | go tool pprof cpu.prof + echo +done diff --git a/cmd/homo/main.go b/cmd/homo/main.go new file mode 100644 index 0000000..e51f08f --- /dev/null +++ b/cmd/homo/main.go @@ -0,0 +1,63 @@ +package main + +import ( + "bufio" + "encoding/hex" + "flag" + "fmt" + "os" + + "github.com/nspcc-dev/tzhash/tz" +) + +var ( + concat = flag.Bool("concat", false, "Concatenate hashes") + filename = flag.String("file", "", "File to read from") +) + +func main() { + var ( + err error + file = os.Stdin + lines = make([]string, 0, 10) + ) + + flag.Parse() + if *filename != "" { + if file, err = os.Open(*filename); err != nil { + fatal("error while opening file: %v", err) + } + } + + for f := bufio.NewScanner(file); f.Scan(); { + lines = append(lines, f.Text()) + } + + if *concat { + var ( + h []byte + hashes = make([][]byte, len(lines)) + ) + for i := range lines { + if hashes[i], err = hex.DecodeString(lines[i]); err != nil { + fatal("error while decoding hex-string: %v", err) + } + } + h, err := tz.Concat(hashes) + if err != nil { + fatal("error while concatenating hashes: %v", err) + } + fmt.Println(hex.EncodeToString(h)) + return + } + + for i := range lines { + h := tz.Sum([]byte(lines[i])) + fmt.Println(hex.EncodeToString(h[:])) + } +} + +func fatal(msg string, args ...interface{}) { + fmt.Printf(msg+"\n", args...) + os.Exit(1) +} diff --git a/cmd/tzsum/main.go b/cmd/tzsum/main.go new file mode 100644 index 0000000..1663165 --- /dev/null +++ b/cmd/tzsum/main.go @@ -0,0 +1,64 @@ +package main + +import ( + "flag" + "fmt" + "io" + "log" + "os" + "runtime" + "runtime/pprof" + + "github.com/nspcc-dev/tzhash/tz" +) + +var ( + cpuprofile = flag.String("cpuprofile", "", "write cpu profile to `file`") + memprofile = flag.String("memprofile", "", "write memory profile to `file`") + filename = flag.String("name", "-", "file to use") +) + +func main() { + var ( + f io.Reader + err error + h = tz.New() + ) + + flag.Parse() + if *cpuprofile != "" { + f, err := os.Create(*cpuprofile) + if err != nil { + log.Fatal("could not create CPU profile: ", err) + } + if err := pprof.StartCPUProfile(f); err != nil { + log.Fatal("could not start CPU profile: ", err) + } + defer pprof.StopCPUProfile() + } + + if *filename != "-" { + if f, err = os.Open(*filename); err != nil { + log.Fatal("could not open file: ", err) + } + } else { + f = os.Stdin + } + + if _, err := io.Copy(h, f); err != nil { + log.Fatal("error while reading file: ", err) + } + fmt.Printf("%x\t%s\n", h.Sum(nil), *filename) + + if *memprofile != "" { + f, err := os.Create(*memprofile) + if err != nil { + log.Fatal("could not create memory profile: ", err) + } + runtime.GC() // get up-to-date statistics + if err := pprof.WriteHeapProfile(f); err != nil { + log.Fatal("could not write memory profile: ", err) + } + f.Close() + } +} diff --git a/gf127/gf127.go b/gf127/gf127.go new file mode 100644 index 0000000..5d2cf0a --- /dev/null +++ b/gf127/gf127.go @@ -0,0 +1,103 @@ +// Copyright 2018 (c) NSPCC +// +// Package gf127 implements the GF(2^127) arithmetic +// modulo reduction polynomial x^127 + x^63 + 1 . +// This is rather straight-forward re-implementation of C library +// available here https://github.com/srijs/hwsl2-core . +// Interfaces are highly influenced by math/big . +package gf127 + +import ( + "encoding/binary" + "encoding/hex" + "errors" +) + +// GF127 represents element of GF(2^127) +type GF127 [2]uint64 + +const msb64 = 0x8000000000000000 +const byteSize = 16 + +// x127x64 represents x^127 + x^63. Used in assembly file. +var x127x63 = GF127{msb64, msb64} + +// New constructs new element of GF(2^127) as hi*x^64 + lo. +// It is assumed that hi has zero MSB. +func New(lo, hi uint64) *GF127 { + return &GF127{lo, hi} +} + +// String returns hex-encoded representation, starting with MSB. +func (c *GF127) String() string { + return hex.EncodeToString(c.ByteArray()) +} + +// Equals checks if two reduced (zero MSB) elements of GF(2^127) are equal +func (c *GF127) Equals(b *GF127) bool { + return c[0] == b[0] && c[1] == b[1] +} + +// ByteArray represents element of GF(2^127) as byte array of length 16. +func (c *GF127) ByteArray() (buf []byte) { + buf = make([]byte, 16) + binary.BigEndian.PutUint64(buf[:8], c[1]) + binary.BigEndian.PutUint64(buf[8:], c[0]) + return +} + +// MarshalBinary implements encoding.BinaryMarshaler. +func (c *GF127) MarshalBinary() (data []byte, err error) { + return c.ByteArray(), nil +} + +// UnmarshalBinary implements encoding.BinaryUnmarshaler. +func (c *GF127) UnmarshalBinary(data []byte) error { + if len(data) != byteSize { + return errors.New("data must be 16-bytes long") + } + + c[0] = binary.BigEndian.Uint64(data[8:]) + c[1] = binary.BigEndian.Uint64(data[:8]) + if c[1]&msb64 != 0 { + return errors.New("MSB must be zero") + } + + return nil +} + +// Mul sets c to the product a*b and returns c. +func (c *GF127) Mul(a, b *GF127) *GF127 { + Mul(a, b, c) + return c +} + +// Add sets c to the sum a+b and returns c. +func (c *GF127) Add(a, b *GF127) *GF127 { + Add(a, b, c) + return c +} + +// Mul1 copies a to b. +func Mul1(a, b *GF127) { + b[0] = a[0] + b[1] = a[1] +} + +// And sets c to a & b (bitwise-and). +func And(a, b, c *GF127) { + c[0] = a[0] & b[0] + c[1] = a[1] & b[1] +} + +// Add sets c to a+b. +func Add(a, b, c *GF127) + +// Mul sets c to a*b. +func Mul(a, b, c *GF127) + +// Mul10 sets y to a*x. +func Mul10(a, b *GF127) + +// Mul11 sets y to a*(x+1). +func Mul11(a, b *GF127) diff --git a/gf127/gf127_amd64.s b/gf127/gf127_amd64.s new file mode 100644 index 0000000..6a4ace4 --- /dev/null +++ b/gf127/gf127_amd64.s @@ -0,0 +1,81 @@ +#include "textflag.h" + +// func Add(a, b, c *[2]uint64) +TEXT ·Add(SB),NOSPLIT,$0 + MOVQ a+0(FP), AX + MOVUPD (AX), X0 + MOVQ b+8(FP), BX + MOVUPD (BX), X1 + XORPD X1, X0 + MOVQ c+16(FP), CX + MOVUPD X0, (CX) + RET + +// func Mul10(a, b *[2]uint64) +TEXT ·Mul10(SB),NOSPLIT,$0 + MOVQ a+0(FP), AX + MOVUPD (AX), X0 + VPSLLQ $1, X0, X1 + VPALIGNR $8, X1, X0, X2 + PSRLQ $63, X2 + MOVUPD ·x127x63(SB), X3 + ANDPD X1, X3 + VPUNPCKHQDQ X3, X3, X3 + XORPD X2, X1 + XORPD X3, X1 + MOVQ b+8(FP), AX + MOVUPD X1, (AX) + RET + +// func Mul11(a, b *[2]uint64) +TEXT ·Mul11(SB),NOSPLIT,$0 + MOVQ a+0(FP), AX + MOVUPD (AX), X0 + VPSLLQ $1, X0, X1 + VPALIGNR $8, X1, X0, X2 + PSRLQ $63, X2 + MOVUPD ·x127x63(SB), X3 + ANDPD X1, X3 + VPUNPCKHQDQ X3, X3, X3 + XORPD X2, X1 + XORPD X3, X1 + XORPD X0, X1 + MOVQ b+8(FP), AX + MOVUPD X1, (AX) + RET + +// func Mul(a, b, c *[2]uint64) +TEXT ·Mul(SB),NOSPLIT,$0 + MOVQ a+0(FP), AX // X0 = a0 . a1 + MOVUPD (AX), X0 // X0 = a0 . a1 + MOVQ b+8(FP), BX // X1 = b0 . b1 + MOVUPD (BX), X1 // X1 = b0 . b1 + VPUNPCKLQDQ X1, X0, X2 // X2 = a0 . b0 + VPUNPCKHQDQ X1, X0, X3 // X3 = a1 . b1 + XORPD X2, X3 // X3 = (a0 + a1) . (b0 + b1) + PCLMULQDQ $0x10, X3, X3 // X3 = (a0 + a1) * (b0 + b1) + VPCLMULQDQ $0x00, X0, X1, X4 // X4 = a0 * b0 + VPCLMULQDQ $0x11, X0, X1, X5 // X5 = a1 * b1 + XORPD X4, X3 // + XORPD X5, X3 // X3 = a0 * b1 + a1 * b0 + VPSLLDQ $8, X3, X2 // + XORPD X2, X4 // X4 = a0 * b0 + lo(X3) + VPSRLDQ $8, X3, X6 // + XORPD X6, X5 // X5 = a1 * b1 + hi(X3) + + // at this point, a * b = X4 . X5 (as 256-bit number) + // reduction modulo x^127 + x^63 + 1 + VPALIGNR $8, X4, X5, X3 + XORPD X5, X3 + PSLLQ $1, X5 + XORPD X5, X4 + VPUNPCKHQDQ X3, X5, X5 + XORPD X5, X4 + PSRLQ $63, X3 + XORPD X3, X4 + VPUNPCKLQDQ X3, X3, X5 + PSLLQ $63, X5 + XORPD X5, X4 + MOVQ c+16(FP), CX + MOVUPD X4, (CX) + RET diff --git a/gf127/gf127_test.go b/gf127/gf127_test.go new file mode 100644 index 0000000..1304e6e --- /dev/null +++ b/gf127/gf127_test.go @@ -0,0 +1,69 @@ +package gf127 + +import ( + "math/rand" + "testing" +) + +const maxUint64 = ^uint64(0) + +func TestAdd(t *testing.T) { + a := &GF127{rand.Uint64(), rand.Uint64() >> 1} + b := &GF127{rand.Uint64(), rand.Uint64() >> 1} + e := &GF127{a[0] ^ b[0], a[1] ^ b[1]} + c := &GF127{0, 0} + c.Add(a, b) + if e[0] != c[0] || e[1] != c[1] { + t.Errorf("expected (%s), got (%s)", e.String(), c.String()) + } +} + +var testCasesMul = [][3]*GF127{ + // (x+1)*(x^63+x^62+...+1) == x^64+1 + {&GF127{3, 0}, &GF127{maxUint64, 0}, &GF127{1, 1}}, + + // x^126 * x^2 == x^128 == x^64 + x + {&GF127{0, 1 << 62}, &GF127{4, 0}, &GF127{2, 1}}, + + // (x^64+x^63+1) * (x^64+x) == x^128+x^65+x^127+x^64+x^64+x == x^65+x^64+x^63+1 + {&GF127{1 + 1<<63, 1}, &GF127{2, 1}, &GF127{0x8000000000000001, 3}}, +} + +func TestMul(t *testing.T) { + c := &GF127{0, 0} + for _, tc := range testCasesMul { + if Mul(tc[0], tc[1], c); !c.Equals(tc[2]) { + t.Errorf("expected (%s), got (%s)", c.String(), tc[2].String()) + } + } +} + +var testCasesMul10 = [][2]*GF127{ + {&GF127{123, 0}, &GF127{246, 0}}, + {&GF127{maxUint64, 2}, &GF127{maxUint64 - 1, 5}}, + {&GF127{0, maxUint64 >> 1}, &GF127{1 + 1<<63, maxUint64>>1 - 1}}, +} + +func TestMul10(t *testing.T) { + c := &GF127{0, 0} + for _, tc := range testCasesMul10 { + if Mul10(tc[0], c); !c.Equals(tc[1]) { + t.Errorf("expected (%s), got (%s)", tc[1].String(), c.String()) + } + } +} + +var testCasesMul11 = [][2]*GF127{ + {&GF127{123, 0}, &GF127{141, 0}}, + {&GF127{maxUint64, 2}, &GF127{1, 7}}, + {&GF127{0, maxUint64 >> 1}, &GF127{1 + 1<<63, 1}}, +} + +func TestMul11(t *testing.T) { + c := &GF127{0, 0} + for _, tc := range testCasesMul11 { + if Mul11(tc[0], c); !c.Equals(tc[1]) { + t.Errorf("expected (%s), got (%s)", tc[1].String(), c.String()) + } + } +} diff --git a/go.mod b/go.mod new file mode 100644 index 0000000..dbb154f --- /dev/null +++ b/go.mod @@ -0,0 +1,3 @@ +module github.com/nspcc-dev/tzhash + +require github.com/onsi/gomega v1.4.2 diff --git a/go.sum b/go.sum new file mode 100644 index 0000000..ef412df --- /dev/null +++ b/go.sum @@ -0,0 +1,26 @@ +github.com/fsnotify/fsnotify v1.4.7 h1:IXs+QLmnXW2CcXuY+8Mzv/fWEsPGWxqefPtCP5CnV9I= +github.com/fsnotify/fsnotify v1.4.7/go.mod h1:jwhsz4b93w/PPRr/qN1Yymfu8t87LnFCMoQvtojpjFo= +github.com/golang/protobuf v1.2.0 h1:P3YflyNX/ehuJFLhxviNdFxQPkGK5cDcApsge1SqnvM= +github.com/golang/protobuf v1.2.0/go.mod h1:6lQm79b+lXiMfvg/cZm0SGofjICqVBUtrP5yJMmIC1U= +github.com/hpcloud/tail v1.0.0 h1:nfCOvKYfkgYP8hkirhJocXT2+zOD8yUNjXaWfTlyFKI= +github.com/hpcloud/tail v1.0.0/go.mod h1:ab1qPbhIpdTxEkNHXyeSf5vhxWSCs/tWer42PpOxQnU= +github.com/onsi/ginkgo v1.6.0 h1:Ix8l273rp3QzYgXSR+c8d1fTG7UPgYkOSELPhiY/YGw= +github.com/onsi/ginkgo v1.6.0/go.mod h1:lLunBs/Ym6LB5Z9jYTR76FiuTmxDTDusOGeTQH+WWjE= +github.com/onsi/gomega v1.4.2 h1:3mYCb7aPxS/RU7TI1y4rkEn1oKmPRjNJLNEXgw7MH2I= +github.com/onsi/gomega v1.4.2/go.mod h1:ex+gbHU/CVuBBDIJjb2X0qEXbFg53c61hWP/1CpauHY= +golang.org/x/net v0.0.0-20180906233101-161cd47e91fd h1:nTDtHvHSdCn1m6ITfMRqtOd/9+7a3s8RBNOZ3eYZzJA= +golang.org/x/net v0.0.0-20180906233101-161cd47e91fd/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4= +golang.org/x/sync v0.0.0-20180314180146-1d60e4601c6f h1:wMNYb4v58l5UBM7MYRLPG6ZhfOqbKu7X5eyFl8ZhKvA= +golang.org/x/sync v0.0.0-20180314180146-1d60e4601c6f/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= +golang.org/x/sys v0.0.0-20180909124046-d0be0721c37e h1:o3PsSEY8E4eXWkXrIP9YJALUkVZqzHJT5DOasTyn8Vs= +golang.org/x/sys v0.0.0-20180909124046-d0be0721c37e/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY= +golang.org/x/text v0.3.0 h1:g61tztE5qeGQ89tm6NTjjM9VPIm088od1l6aSorWRWg= +golang.org/x/text v0.3.0/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ= +gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405 h1:yhCVgyC4o1eVCa2tZl7eS0r+SDo693bJlVdllGtEeKM= +gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0= +gopkg.in/fsnotify.v1 v1.4.7 h1:xOHLXZwVvI9hhs+cLKq5+I5onOuwQLhQwiu63xxlHs4= +gopkg.in/fsnotify.v1 v1.4.7/go.mod h1:Tz8NjZHkW78fSQdbUxIjBTcgA1z1m8ZHf0WmKUhAMys= +gopkg.in/tomb.v1 v1.0.0-20141024135613-dd632973f1e7 h1:uRGJdciOHaEIrze2W8Q3AKkepLTh2hOroT7a+7czfdQ= +gopkg.in/tomb.v1 v1.0.0-20141024135613-dd632973f1e7/go.mod h1:dt/ZhP58zS4L8KSrWDmTeBkI65Dw0HsyUHuEVlX15mw= +gopkg.in/yaml.v2 v2.2.1 h1:mUhvW9EsL+naU5Q3cakzfE91YhliOondGd6ZrsDBHQE= +gopkg.in/yaml.v2 v2.2.1/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI= diff --git a/tz/hash.go b/tz/hash.go new file mode 100644 index 0000000..ac43932 --- /dev/null +++ b/tz/hash.go @@ -0,0 +1,136 @@ +// Copyright 2018 (c) NSPCC +// +// Package tz implements general Tillich-Zemo +package tz + +import ( + "errors" + "hash" + "math" + + "github.com/nspcc-dev/tzhash/gf127" +) + +const ( + hashSize = 64 + hashBlockSize = 128 +) + +type digest struct { + x [4]gf127.GF127 +} + +// type assertion +var _ hash.Hash = new(digest) + +var ( + minmax = [2]gf127.GF127{{0, 0}, {math.MaxUint64, math.MaxUint64}} + x127x63 = gf127.GF127{1 << 63, 1 << 63} +) + +// New returns a new hash.Hash computing the Tillich-Zémor checksum. +func New() hash.Hash { + d := new(digest) + d.Reset() + return d +} + +func (d *digest) Sum(in []byte) []byte { + // Make a copy of d so that caller can keep writing and summing. + d0 := *d + h := d0.checkSum() + return append(in, h[:]...) +} + +func (d *digest) checkSum() [hashSize]byte { + return d.byteArray() +} + +func (d *digest) byteArray() (b [hashSize]byte) { + var t []byte + for i := 0; i < 4; i++ { + t = d.x[i].ByteArray() + copy(b[i*16:], t) + } + return +} + +func (d *digest) Reset() { + d.x[0] = gf127.GF127{1, 0} + d.x[1] = gf127.GF127{0, 0} + d.x[2] = gf127.GF127{0, 0} + d.x[3] = gf127.GF127{1, 0} +} + +func (d *digest) Write(data []byte) (n int, err error) { + n = len(data) + for _, b := range data { + mulBitRight(&d.x[0], &d.x[1], &d.x[2], &d.x[3], &minmax[(b>>7)&1]) + mulBitRight(&d.x[0], &d.x[1], &d.x[2], &d.x[3], &minmax[(b>>6)&1]) + mulBitRight(&d.x[0], &d.x[1], &d.x[2], &d.x[3], &minmax[(b>>5)&1]) + mulBitRight(&d.x[0], &d.x[1], &d.x[2], &d.x[3], &minmax[(b>>4)&1]) + mulBitRight(&d.x[0], &d.x[1], &d.x[2], &d.x[3], &minmax[(b>>3)&1]) + mulBitRight(&d.x[0], &d.x[1], &d.x[2], &d.x[3], &minmax[(b>>2)&1]) + mulBitRight(&d.x[0], &d.x[1], &d.x[2], &d.x[3], &minmax[(b>>1)&1]) + mulBitRight(&d.x[0], &d.x[1], &d.x[2], &d.x[3], &minmax[(b>>0)&1]) + } + return +} + +func (d *digest) Size() int { + return hashSize +} + +func (d *digest) BlockSize() int { + return hashBlockSize +} + +// Sum returnz Tillich-Zémor checksum of data +func Sum(data []byte) [hashSize]byte { + d := new(digest) + d.Reset() + d.Write(data) + return d.checkSum() +} + +// Concat performs combining of hashes based on homomorphic property. +func Concat(hs [][]byte) ([]byte, error) { + var b, c sl2 + + b = id + for i := range hs { + if err := c.UnmarshalBinary(hs[i]); err != nil { + return nil, err + } + b.Mul(&b, &c) + } + return b.MarshalBinary() +} + +// Validate checks if hashes in hs combined are equal to h. +func Validate(h []byte, hs [][]byte) (bool, error) { + var ( + b []byte + got, expected [hashSize]byte + err error + ) + + if len(h) != hashSize { + return false, errors.New("invalid hash") + } else if len(hs) == 0 { + return false, errors.New("empty slice") + } + + copy(expected[:], h) + + b, err = Concat(hs) + if err != nil { + return false, errors.New("cant concatenate hashes") + } + + copy(got[:], b) + + return expected == got, nil +} + +func mulBitRight(c00, c01, c10, c11, e *gf127.GF127) diff --git a/tz/hash_test.go b/tz/hash_test.go new file mode 100644 index 0000000..109e54b --- /dev/null +++ b/tz/hash_test.go @@ -0,0 +1,109 @@ +package tz + +import ( + "encoding/hex" + "math/rand" + "testing" + + . "github.com/onsi/gomega" +) + +func TestHash(t *testing.T) { + var ( + c1, c2 sl2 + n int + err error + h, h1, h2 [hashSize]byte + b []byte + ) + + g := NewGomegaWithT(t) + + b = make([]byte, 64) + n, err = rand.Read(b) + g.Expect(n).To(Equal(64)) + g.Expect(err).NotTo(HaveOccurred()) + + // Test if our hashing is really homomorphic + h = Sum(b) + h1 = Sum(b[:32]) + h2 = Sum(b[32:]) + + err = c1.UnmarshalBinary(h1[:]) + g.Expect(err).NotTo(HaveOccurred()) + err = c2.UnmarshalBinary(h2[:]) + g.Expect(err).NotTo(HaveOccurred()) + + c1.Mul(&c1, &c2) + g.Expect(c1.ByteArray()).To(Equal(h)) +} + +var testCases = []struct { + Hash string + Parts []string +}{{ + Hash: "7f5c9280352a8debea738a74abd4ec787f2c5e556800525692f651087442f9883bb97a2c1bc72d12ba26e3df8dc0f670564292ebc984976a8e353ff69a5fb3cb", + Parts: []string{ + "4275945919296224acd268456be23b8b2df931787a46716477e32cd991e98074029d4f03a0fedc09125ee4640d228d7d40d430659a0b2b70e9cd4d4c5361865a", + "2828661d1b1e77f21788d3b365f140a2395d57dc2083c33e60d9a80e69017d5016a249c7adfe1718a10ba887dedbdaec5c4c1fbecdb1f98776b43f1142c26a88", + "02310598b45dfa77db9f00eed6ab60773dd8bed7bdac431b42e441fae463f64c6e2688402cfdcec5def47a299b0651fb20878cf4410991bd57056d7b4b31635a", + "1ed7e0b065c060d915e7355cdcb4edc752c06d2a4b39d90c8985aeb58e08cb9e5bbe4b2b45524efbd68cd7e4081a1b8362941200a4c9f76a0a9f9ac9b7868c03", + "6f11e3dc4fff99ffa45e36e4655cfc657c29e950e598a90f426bf5710de9171323523db7636643b23892783f4fb3cf8e583d584c82d29558a105a615a668fc9e", + "1865dbdb4c849620fb2c4809d75d62490f83c11f2145abaabbdc9a66ae58ce1f2e42c34d3b380e5dea1b45217750b42d130f995b162afbd2e412b0d41ec8871b", + "5102dd1bd1f08f44dbf3f27ac895020d63f96044ce3b491aed3efbc7bbe363bc5d800101d63890f89a532427812c30c9674f37476ba44daf758afa88d4f91063", + "70cab735dad90164cc61f7411396221c4e549f12392c0d77728c89a9754f606c7d961169d4fa88133a1ba954bad616656c86f8fd1335a2f3428fd4dca3a3f5a5", + "430f3e92536ff9a50cbcdf08d8810a59786ca37e31d54293646117a93469f61c6cdd67933128407d77f3235293293ee86dbc759d12dfe470969eba1b4a373bd0", + "46e1d97912ca2cf92e6a9a63667676835d900cdb2fff062136a64d8d60a8e5aa644ccee3558900af8e77d56b013ed5da12d9d0b7de0f56976e040b3d01345c0d", + }, +}} + +func TestConcat(t *testing.T) { + var ( + got, expected []byte + ps [][]byte + err error + ) + + g := NewGomegaWithT(t) + + for _, tc := range testCases { + expected, err = hex.DecodeString(tc.Hash) + g.Expect(err).NotTo(HaveOccurred()) + + ps = make([][]byte, len(tc.Parts)) + for j := 0; j < len(tc.Parts); j++ { + ps[j], err = hex.DecodeString(tc.Parts[j]) + g.Expect(err).NotTo(HaveOccurred()) + } + + got, err = Concat(ps) + g.Expect(err).NotTo(HaveOccurred()) + g.Expect(got).To(Equal(expected)) + } +} + +func TestValidate(t *testing.T) { + var ( + hash []byte + ps [][]byte + got bool + err error + ) + + g := NewGomegaWithT(t) + + for _, tc := range testCases { + hash, _ = hex.DecodeString(tc.Hash) + g.Expect(err).NotTo(HaveOccurred()) + + ps = make([][]byte, len(tc.Parts)) + for j := 0; j < len(tc.Parts); j++ { + ps[j], _ = hex.DecodeString(tc.Parts[j]) + g.Expect(err).NotTo(HaveOccurred()) + } + + got, err = Validate(hash, ps) + g.Expect(err).NotTo(HaveOccurred()) + g.Expect(got).To(Equal(true)) + } +} diff --git a/tz/sl2.go b/tz/sl2.go new file mode 100644 index 0000000..caf56cc --- /dev/null +++ b/tz/sl2.go @@ -0,0 +1,154 @@ +package tz + +import ( + "errors" + + "github.com/nspcc-dev/tzhash/gf127" +) + +type sl2 [2][2]gf127.GF127 + +var id = sl2{ + {gf127.GF127{1, 0}, gf127.GF127{0, 0}}, + {gf127.GF127{0, 0}, gf127.GF127{1, 0}}, +} + +func (c *sl2) MarshalBinary() (data []byte, err error) { + s := c.ByteArray() + return s[:], nil +} + +func (c *sl2) UnmarshalBinary(data []byte) (err error) { + if len(data) != 64 { + return errors.New("data must be 64-bytes long") + } + + if err = c[0][0].UnmarshalBinary(data[:16]); err != nil { + return + } + if err = c[0][1].UnmarshalBinary(data[16:32]); err != nil { + return + } + if err = c[1][0].UnmarshalBinary(data[32:48]); err != nil { + return + } + if err = c[1][1].UnmarshalBinary(data[48:64]); err != nil { + return + } + + return +} + +func (c *sl2) mulStrassen(a, b *sl2, x *[8]gf127.GF127) *sl2 { + // strassen algorithm + gf127.Add(&a[0][0], &a[1][1], &x[0]) + gf127.Add(&b[0][0], &b[1][1], &x[1]) + gf127.Mul(&x[0], &x[1], &x[0]) + + gf127.Add(&a[1][0], &a[1][1], &x[1]) + gf127.Mul(&x[1], &b[0][0], &x[1]) + + gf127.Add(&b[0][1], &b[1][1], &x[2]) + gf127.Mul(&x[2], &a[0][0], &x[2]) + + gf127.Add(&b[1][0], &b[0][0], &x[3]) + gf127.Mul(&x[3], &a[1][1], &x[3]) + + gf127.Add(&a[0][0], &a[0][1], &x[4]) + gf127.Mul(&x[4], &b[1][1], &x[4]) + + gf127.Add(&a[1][0], &a[0][0], &x[5]) + gf127.Add(&b[0][0], &b[0][1], &x[6]) + gf127.Mul(&x[5], &x[6], &x[5]) + + gf127.Add(&a[0][1], &a[1][1], &x[6]) + gf127.Add(&b[1][0], &b[1][1], &x[7]) + gf127.Mul(&x[6], &x[7], &x[6]) + + gf127.Add(&x[2], &x[4], &c[0][1]) + gf127.Add(&x[1], &x[3], &c[1][0]) + + gf127.Add(&x[4], &x[6], &x[4]) + gf127.Add(&x[0], &x[3], &c[0][0]) + gf127.Add(&c[0][0], &x[4], &c[0][0]) + + gf127.Add(&x[0], &x[1], &x[0]) + gf127.Add(&x[2], &x[5], &c[1][1]) + gf127.Add(&c[1][1], &x[0], &c[1][1]) + + return c +} + +func (c *sl2) mul(a, b *sl2, x *[4]gf127.GF127) *sl2 { + // naive implementation + gf127.Mul(&a[0][0], &b[0][0], &x[0]) + gf127.Mul(&a[0][0], &b[0][1], &x[1]) + gf127.Mul(&a[1][0], &b[0][0], &x[2]) + gf127.Mul(&a[1][0], &b[0][1], &x[3]) + + gf127.Mul(&a[0][1], &b[1][0], &c[0][0]) + gf127.Add(&c[0][0], &x[0], &c[0][0]) + gf127.Mul(&a[0][1], &b[1][1], &c[0][1]) + gf127.Add(&c[0][1], &x[1], &c[0][1]) + gf127.Mul(&a[1][1], &b[1][0], &c[1][0]) + gf127.Add(&c[1][0], &x[2], &c[1][0]) + gf127.Mul(&a[1][1], &b[1][1], &c[1][1]) + gf127.Add(&c[1][1], &x[3], &c[1][1]) + + return c +} + +func (c *sl2) MulA() *sl2 { + var a gf127.GF127 + + gf127.Mul10(&c[0][0], &a) + gf127.Mul1(&c[0][0], &c[0][1]) + gf127.Add(&a, &c[0][1], &c[0][0]) + + gf127.Mul10(&c[1][0], &a) + gf127.Mul1(&c[1][0], &c[1][1]) + gf127.Add(&a, &c[1][1], &c[1][0]) + + return c +} + +func (c *sl2) MulB() *sl2 { + var a gf127.GF127 + + gf127.Mul1(&c[0][0], &a) + gf127.Mul10(&c[0][0], &c[0][0]) + gf127.Add(&c[0][1], &c[0][0], &c[0][0]) + gf127.Add(&c[0][0], &a, &c[0][1]) + + gf127.Mul1(&c[1][0], &a) + gf127.Mul10(&c[1][0], &c[1][0]) + gf127.Add(&c[1][1], &c[1][0], &c[1][0]) + gf127.Add(&c[1][0], &a, &c[1][1]) + + return c +} + +func (c *sl2) Mul(a, b *sl2) *sl2 { + return c.mul(a, b, new([4]gf127.GF127)) +} + +func (c *sl2) String() string { + return c[0][0].String() + c[0][1].String() + + c[1][0].String() + c[1][1].String() +} + +func (c *sl2) ByteArray() (b [hashSize]byte) { + t := c[0][0].ByteArray() + copy(b[:], t) + + t = c[0][1].ByteArray() + copy(b[16:], t) + + t = c[1][0].ByteArray() + copy(b[32:], t) + + t = c[1][1].ByteArray() + copy(b[48:], t) + + return +} diff --git a/tz/sl2_test.go b/tz/sl2_test.go new file mode 100644 index 0000000..ad6d18d --- /dev/null +++ b/tz/sl2_test.go @@ -0,0 +1,38 @@ +package tz + +import ( + "math" + "math/rand" + "testing" + "time" + + "github.com/nspcc-dev/tzhash/gf127" + . "github.com/onsi/gomega" +) + +func init() { + rand.Seed(time.Now().UnixNano()) +} + +func u64() uint64 { + return rand.Uint64() & (math.MaxUint64 >> 1) +} + +func TestSL2_MarshalBinary(t *testing.T) { + g := NewGomegaWithT(t) + + a := new(sl2) + a[0][0] = *gf127.New(u64(), u64()) + a[0][1] = *gf127.New(u64(), u64()) + a[1][0] = *gf127.New(u64(), u64()) + a[1][1] = *gf127.New(u64(), u64()) + + data, err := a.MarshalBinary() + g.Expect(err).NotTo(HaveOccurred()) + + b := new(sl2) + err = b.UnmarshalBinary(data) + g.Expect(err).NotTo(HaveOccurred()) + + g.Expect(a).To(Equal(b)) +} diff --git a/tz/tzbits_amd64.s b/tz/tzbits_amd64.s new file mode 100644 index 0000000..b6921a3 --- /dev/null +++ b/tz/tzbits_amd64.s @@ -0,0 +1,62 @@ +#include "textflag.h" + +// func mulBitRight(c00, c01, c10, c11, e *[2]uint64) +TEXT ·mulBitRight(SB),NOSPLIT,$0 + MOVQ c00+0(FP), AX + MOVUPD (AX), X0 + MOVUPD X0, X8 // remember c00 value + MOVQ c01+8(FP), BX + MOVUPD (BX), X1 + MOVQ c10+16(FP), CX + MOVUPD (CX), X2 + MOVUPD X2, X9 // remember c10 value + MOVQ c11+24(FP), DX + MOVUPD (DX), X3 + + // c00 *= 2 + VPSLLQ $1, X0, X5 + VPALIGNR $8, X5, X0, X6 + PSRLQ $63, X6 + MOVUPD ·x127x63(SB), X7 + ANDPD X5, X7 + VPUNPCKHQDQ X7, X7, X7 + XORPD X6, X5 + XORPD X7, X5 + MOVUPD X5, X0 + + // c00 += c01 + XORPD X1, X0 + MOVUPD X0, (AX) + + // c10 *= 2 + VPSLLQ $1, X2, X5 + VPALIGNR $8, X5, X2, X6 + PSRLQ $63, X6 + MOVUPD ·x127x63(SB), X7 + ANDPD X5, X7 + VPUNPCKHQDQ X7, X7, X7 + XORPD X6, X5 + XORPD X7, X5 + MOVUPD X5, X2 + + // c10 += c11 + XORPD X3, X2 + MOVUPD X2, (CX) + + MOVQ e+32(FP), AX + MOVUPD (AX), X5 + + // c01 = c00 + e + VANDPD X0, X5, X1 + + // c01 += X8 (old c00) + XORPD X8, X1 + MOVUPD X1, (BX) + + // c11 = c10 + e + VANDPD X2, X5, X3 + + // c11 += X9 (old c10) + XORPD X9, X3 + MOVUPD X3, (DX) + RET