diff --git a/CMakeLists.txt b/CMakeLists.txt new file mode 100644 index 0000000..aa3459f --- /dev/null +++ b/CMakeLists.txt @@ -0,0 +1,27 @@ +cmake_minimum_required(VERSION 3.5) +find_package(CUDA) +find_package(PythonLibs 3.5 REQUIRED) + +include_directories(${PYTHON_INCLUDE_DIRS}) + +if(UNIX) + SET(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wall -std=c++11 -O3") +endif() + +set(CUDA_NVCC_FLAGS ${CUDA_NVCC_FLAGS};--disable-warnings;--ptxas-options=-v;-use_fast_math;-lineinfo) + +# Set the architecture of your CUDA card +set(CUDA_NVCC_FLAGS ${CUDA_NVCC_FLAGS};-gencode=arch=compute_61,code=sm_61) + + +list(APPEND CUDA_NVCC_FLAGS_RELEASE) + +cuda_add_library(bis SHARED + bisWrapper.cpp + bis.cu) + +target_link_libraries(bis + ${PYTHON_LIBRARIES} + ${CUDA_LIBRARIES}) + +set_target_properties(bis PROPERTIES PREFIX "") diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..37fb5c3 --- /dev/null +++ b/LICENSE @@ -0,0 +1,675 @@ + GNU AFFERO GENERAL PUBLIC LICENSE + Version 3, 19 November 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 Affero General Public License is a free, copyleft license for +software and other kinds of works, specifically designed to ensure +cooperation with the community in the case of network server software. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +our General Public Licenses are 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. + + 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. + + Developers that use our General Public Licenses protect your rights +with two steps: (1) assert copyright on the software, and (2) offer +you this License which gives you legal permission to copy, distribute +and/or modify the software. + + A secondary benefit of defending all users' freedom is that +improvements made in alternate versions of the program, if they +receive widespread use, become available for other developers to +incorporate. Many developers of free software are heartened and +encouraged by the resulting cooperation. However, in the case of +software used on network servers, this result may fail to come about. +The GNU General Public License permits making a modified version and +letting the public access it on a server without ever releasing its +source code to the public. + + The GNU Affero General Public License is designed specifically to +ensure that, in such cases, the modified source code becomes available +to the community. It requires the operator of a network server to +provide the source code of the modified version running there to the +users of that server. Therefore, public use of a modified version, on +a publicly accessible server, gives the public access to the source +code of the modified version. + + An older license, called the Affero General Public License and +published by Affero, was designed to accomplish similar goals. This is +a different license, not a version of the Affero GPL, but Affero has +released a new version of the Affero GPL which permits relicensing under +this license. + + 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 Affero 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. Remote Network Interaction; Use with the GNU General Public License. + + Notwithstanding any other provision of this License, if you modify the +Program, your modified version must prominently offer all users +interacting with it remotely through a computer network (if your version +supports such interaction) an opportunity to receive the Corresponding +Source of your version by providing access to the Corresponding Source +from a network server at no charge, through some standard or customary +means of facilitating copying of software. This Corresponding Source +shall include the Corresponding Source for any work covered by version 3 +of the GNU General Public License that is incorporated pursuant to the +following paragraph. + + 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 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 work with which it is combined will remain governed by version +3 of the GNU General Public License. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU Affero 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 Affero 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 Affero 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 Affero 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 Affero 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 Affero General Public License for more details. + + You should have received a copy of the GNU Affero General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If your software can interact with users remotely through a computer +network, you should also make sure that it provides a way for users to +get its source. For example, if your program is a web application, its +interface could display a "Source" link that leads users to an archive +of the code. There are many ways you could offer source, and different +solutions will be better for different programs; see section 13 for the +specific requirements. + + 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 AGPL, see +. + +Copy license text to clipboard +Suggest this license + +Make a pull request to suggest this license for a project that is not licensed. Please be polite: see if a license has already been suggested, try to suggest a license fitting for the project’s community, and keep your communication with project maintainers friendly. +How to apply this license + +Create a text file (typically named LICENSE or LICENSE.txt) in the root of your source code and copy the text of the license into the file. +Optional steps + +The Free Software Foundation recommends taking the additional step of adding a boilerplate notice to the top of each file. The boilerplate can be found at the end of the license. + +Add AGPL-3.0-or-later (or AGPL-3.0-only to disallow future versions) to your project’s package description, if applicable (e.g., Node.js, Ruby, and Rust). This will ensure the license is displayed in package directories. +Source diff --git a/README.md b/README.md new file mode 100644 index 0000000..834e84c --- /dev/null +++ b/README.md @@ -0,0 +1,30 @@ +# kbkminer +GPU CUDA Miner for Bismuth. + +Install instructions (Linux): +* Install Ubuntu 20.04 server on a PC with at least one Nvidia GPU, memory requirement on GPU at least 1075MiB. +* Boot into the new server and do the following +```sudo apt update``` +```sudo apt upgrade``` +```sudo reboot``` +* Write ```apt search nvidia-driver``` and find a suitable driver for your system. +* In this example we choose the following: ```sudo apt install nvidia-headless-470-server``` When finished, reboot +* ```sudo apt install nvidia-utils-470-server``` followed by ```nvidia-smi -q | grep "Product Name"``` Make sure that at least one GPU is detected. +* ```git clone https://github.com/Bismuthfoundation/Bismuth.git``` followed by ```cd Bismuth``` +* ```sudo apt install python3-pip``` followed by ```pip3 install -r requirements-node.txt``` +* ```screen -mS node python3 node.py``` You need to wait a while for the Junction Noise file to be created and the ledger bootstrapped and synced. While you wait you can press ```Ctrl-A d```to detach from the screen session, and ```screen -r node``` to go back. +* ```cd ~``` ```git clone https://github.com/Bismuthfoundation/Optipoolware.git``` +* ```cd Optipoolware``` ```pip3 install -r requirements.txt``` +* ```cp optipoolware.py ../Bismuth``` ```cp pool.txt ../Bismuth``` +* ```cd ~/Bismuth``` ```screen -mS pool python3 optipoolware.py``` You can press ```Ctrl-A d```to detach from the pool session, and ```screen -r pool``` to go back. +* ```sudo apt install nvidia-cuda-toolkit``` followed by ```nvcc --version``` to check the version. In this example V10.1.243 was used. +* ```cd ~``` ```git clone https://github.com/Bismuthfoundation/kbkminer.git``` +* ```sudo apt install cmake``` ```sudo apt install python3-pybind11``` +* ```cd kbkminer``` ```chmod u+x mycompile.sh``` ```./mycompile.sh``` +* Edit miner.txt to use your own miner_address +* ```cp optihash.py ../Bismuth``` ```cp miner.txt ../Bismuth``` ```cp bis.so ../Bismuth``` +* Do not start the miner before the ledger is fully synced. The variable last_block_ago should be less than 300 seconds. Check with ```cd ~/Bismuth``` ```python3 commands.py statusget``` +* ```cd ~/Bismuth``` ```screen -mS miner python3 optihash.py``` You can press ```Ctrl-A d```to detach from the miner session, and ```screen -r miner``` to go back. + + +Note that the pool will use the Bismuth address in the node wallet, found in the file wallet.der. If you want to solo mine, you can mine directly to this address by editing the file miner.txt and make the miner_address equal to the address in wallet.der. In this case, you can also edit min_payout in pool.txt to a large number to prevent payout transactions from the pool. diff --git a/bis.cu b/bis.cu new file mode 100644 index 0000000..3528ce4 --- /dev/null +++ b/bis.cu @@ -0,0 +1,565 @@ +#include "bis.h" + +#define SHA2_SHFR(x, n) (x >> n) +#define SHA2_ROTR(x, n) ((x >> n) | (x << ((sizeof(x) << 3) - n))) +#define SHA2_ROTL(x, n) ((x << n) | (x >> ((sizeof(x) << 3) - n))) +#define SHA2_CH(x, y, z) ((x & (y ^ z)) ^ z) //form https://github.com/leocalm/Lyra/blob/master/GPU_attacks/yescryptCUDA/sha256.cu +#define SHA2_MAJ(x, y, z) ((x & (y | z)) | (y & z)) //form https://github.com/leocalm/Lyra/blob/master/GPU_attacks/yescryptCUDA/sha256.cu + +char const hex_chars_small_h[] = { '0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f' }; + +__device__ __host__ __forceinline__ uint32_t rotr(uint32_t x, uint32_t n) { +#ifdef __CUDA_ARCH__ + uint32_t result; + asm("shf.r.wrap.b32 %0, %1, %2, %3;" : "=r"(result) : "r"(x), "r"(x), "r"(n)); + return result; +#else + return SHA2_ROTR(x, n); +#endif +} + +#define SHA256_F1(x) (rotr(x, 2) ^ rotr(x, 13) ^ rotr(x, 22)) +#define SHA256_F2(x) (rotr(x, 6) ^ rotr(x, 11) ^ rotr(x, 25)) +#define SHA256_F3(x) (rotr(x, 7) ^ rotr(x, 18) ^ SHA2_SHFR(x, 3)) +#define SHA256_F4(x) (rotr(x, 17) ^ rotr(x, 19) ^ SHA2_SHFR(x, 10)) + +#define SHA2_PACK32(str, x) \ +{ \ + *(x) = ((uint32_t) *((str) + 3) ) \ + | ((uint32_t) *((str) + 2) << 8) \ + | ((uint32_t) *((str) + 1) << 16) \ + | ((uint32_t) *((str) + 0) << 24); \ +} + +__device__ __constant__ uint32_t const sha256_k[64] = { + 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, + 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, + 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, + 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, + 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, + 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, + 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, + 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, + 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, + 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, + 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, + 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, + 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, + 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, + 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, + 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2 +}; + +uint32_t const sha256_k_cpu[64] = { + 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, + 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, + 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, + 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, + 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, + 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, + 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, + 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, + 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, + 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, + 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, + 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, + 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, + 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, + 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, + 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2 +}; + +template +__device__ __host__ __forceinline__ void memset_simple12(T* arr, T2 val) { +#pragma unroll 12 + for (uint32_t i = 0; i < 12; i++) { + arr[i] = val; + } +} + +__device__ __host__ __forceinline__ void sha224_init(uint32_t* m_h) { + m_h[0] = 0xc1059ed8; + m_h[1] = 0x367cd507; + m_h[2] = 0x3070dd17; + m_h[3] = 0xf70e5939; + m_h[4] = 0xffc00b31; + m_h[5] = 0x68581511; + m_h[6] = 0x64f98fa7; + m_h[7] = 0xbefa4fa4; +} + +__device__ __forceinline__ void transform(const uint32_t* message_int, uint32_t* m_h) { + uint32_t w[64]; + uint32_t wv[8]; + uint32_t t1, t2; + +#pragma unroll 16 + for (uint32_t j = 0; j < 16; j++) { + w[j] = message_int[j]; + } + +#pragma unroll 48 + for (uint32_t j = 16; j < 64; j++) { + w[j] = SHA256_F4(w[j - 2]) + w[j - 7] + SHA256_F3(w[j - 15]) + w[j - 16]; + } +#pragma unroll 8 + for (uint32_t j = 0; j < 8; j++) { + wv[j] = m_h[j]; + } +#pragma unroll 64 + for (uint32_t j = 0; j < 64; j++) { + t1 = wv[7] + SHA256_F2(wv[4]) + SHA2_CH(wv[4], wv[5], wv[6]) + + sha256_k[j] + w[j]; + t2 = SHA256_F1(wv[0]) + SHA2_MAJ(wv[0], wv[1], wv[2]); + wv[7] = wv[6]; + wv[6] = wv[5]; + wv[5] = wv[4]; + wv[4] = wv[3] + t1; + wv[3] = wv[2]; + wv[2] = wv[1]; + wv[1] = wv[0]; + wv[0] = t1 + t2; + } +#pragma unroll 8 + for (uint32_t j = 0; j < 8; j++) { + m_h[j] += wv[j]; + } +} + +void transform_cpu(const uint32_t* message_int, uint32_t* m_h) { + uint32_t w[64]; + uint32_t wv[8]; + uint32_t t1, t2; + + for (uint32_t j = 0; j < 16; j++) { + w[j] = message_int[j]; + } + + for (uint32_t j = 16; j < 64; j++) { + w[j] = SHA256_F4(w[j - 2]) + w[j - 7] + SHA256_F3(w[j - 15]) + w[j - 16]; + } + + for (uint32_t j = 0; j < 8; j++) { + wv[j] = m_h[j]; + } + + for (uint32_t j = 0; j < 64; j++) { + t1 = wv[7] + SHA256_F2(wv[4]) + SHA2_CH(wv[4], wv[5], wv[6]) + + sha256_k_cpu[j] + w[j]; + t2 = SHA256_F1(wv[0]) + SHA2_MAJ(wv[0], wv[1], wv[2]); + wv[7] = wv[6]; + wv[6] = wv[5]; + wv[5] = wv[4]; + wv[4] = wv[3] + t1; + wv[3] = wv[2]; + wv[2] = wv[1]; + wv[1] = wv[0]; + wv[0] = t1 + t2; + } + + for (uint32_t j = 0; j < 8; j++) { + m_h[j] += wv[j]; + } +} + +__device__ __forceinline__ void transform_sep_nonce(const uint32_t* message_int, const uint32_t* nonce, uint32_t* m_h) { + uint32_t w[64]; + uint32_t wv[8]; + uint32_t t1, t2; + +#pragma unroll 4 + for (int j = 0; j < 4; j++) { + w[j] = message_int[j]; + } +#pragma unroll 10 + for (int j = 6; j < 16; j++) { + w[j] = message_int[j]; + } + + w[4] = nonce[0]; + w[5] = nonce[1]; + +#pragma unroll 48 + for (int j = 16; j < 64; j++) { + w[j] = SHA256_F4(w[j - 2]) + w[j - 7] + SHA256_F3(w[j - 15]) + w[j - 16]; + } +#pragma unroll 8 + for (int j = 0; j < 8; j++) { + wv[j] = m_h[j]; + } +#pragma unroll 64 + for (int j = 0; j < 64; j++) { + t1 = wv[7] + SHA256_F2(wv[4]) + SHA2_CH(wv[4], wv[5], wv[6]) + + sha256_k[j] + w[j]; + t2 = SHA256_F1(wv[0]) + SHA2_MAJ(wv[0], wv[1], wv[2]); + wv[7] = wv[6]; + wv[6] = wv[5]; + wv[5] = wv[4]; + wv[4] = wv[3] + t1; + wv[3] = wv[2]; + wv[2] = wv[1]; + wv[1] = wv[0]; + wv[0] = t1 + t2; + } +#pragma unroll 8 + for (int j = 0; j < 8; j++) { + m_h[j] += wv[j]; + } +} + +__device__ __forceinline__ void sha224_final(uint32_t* m_block, uint32_t* m_h) { + memset_simple12(m_block + 16 / 4, 0); + m_block[16 / 4] = m_block[16 / 4] | 0x80000000; + m_block[60 / 4] = 1152; + transform(m_block, m_h); +} + +__device__ __forceinline__ void modNonce(const uint32_t* nonce, uint32_t* new_nonce, uint32_t const th_id) { + char const hex_chars_small[] = { '0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f' }; + new_nonce[0] = 0; + + uint8_t chIdx = (uint8_t)(th_id & 0xF); + uint32_t val = (uint32_t)hex_chars_small[chIdx]; + new_nonce[0] = new_nonce[0] | (val << 24); // 0xXX000000 + + chIdx = (uint8_t)((th_id >> 4) & 0xF); + val = (uint32_t)hex_chars_small[chIdx]; + new_nonce[0] = new_nonce[0] | (val << 16); // 0xXXXX0000 + + chIdx = (uint8_t)((th_id >> 8) & 0xF); + val = (uint32_t)hex_chars_small[chIdx]; + new_nonce[0] = new_nonce[0] | (val << 8); // 0xXXXXXX00 + + chIdx = (uint8_t)((th_id >> 12) & 0xF); + val = (uint32_t)hex_chars_small[chIdx]; + new_nonce[0] = new_nonce[0] | val; // 0xXXXXXXXX + + + new_nonce[1] = nonce[5] & 0x0000FFFF; + chIdx = (uint8_t)((th_id >> 16) & 0xF); + val = (uint32_t)hex_chars_small[chIdx]; + new_nonce[1] = new_nonce[1] | (val << 24); // 0xXX00???? + + chIdx = (uint8_t)((th_id >> 20) & 0xF); + val = (uint32_t)hex_chars_small[chIdx]; + new_nonce[1] = new_nonce[1] | (val << 16); // 0xXXXX???? +} + +void modNonceCpu(unsigned char* nonce, uint32_t const th_id) { + unsigned char chIdx = (th_id & 0xF); + uint8_t i = 24; + + chIdx = (uint8_t)(th_id & 0xF); + nonce[i] = hex_chars_small_h[chIdx]; // 0xXX000000 + + chIdx = (uint8_t)((th_id >> 4) & 0xF); + i++; + nonce[i] = hex_chars_small_h[chIdx]; // 0xXXXX0000 + + chIdx = (uint8_t)((th_id >> 8) & 0xF); + i++; + nonce[i] = hex_chars_small_h[chIdx]; // 0xXXXXXX00 + + chIdx = (uint8_t)((th_id >> 12) & 0xF); + i++; + nonce[i] = hex_chars_small_h[chIdx]; // 0xXXXXXXXX + + chIdx = (uint8_t)((th_id >> 16) & 0xF); + i++; + nonce[i] = hex_chars_small_h[chIdx]; // 0xXX00???? + + chIdx = (uint8_t)((th_id >> 20) & 0xF); + i++; + nonce[i] = hex_chars_small_h[chIdx]; // 0xXXXX???? +} + +__device__ __forceinline__ void shiftLeft4Bytes7Ints(uint32_t* uintArr) { +#pragma unroll 6 + for (int i = 0; i < 6; i++) { + uintArr[i] = uintArr[i] << 4; + + uintArr[i] = uintArr[i] | (uintArr[i + 1] >> 28); + } + uintArr[6] = uintArr[6] << 4; +} + +__device__ __forceinline__ void anneal3(const uint32_t* map, uint32_t* hash) { + int index = ((hash[6] & ~0x7) % RND_LEN) + 6; +#pragma unroll + for (int i = 0; i < 7; ++i) { + hash[i] ^= map[index - i]; + } +} + +__global__ void sha224_find(const uint32_t* message_int, uint32_t* hash, uint32_t* mining_cond, const int32_t tail_length_in_chars, uint32_t* map, uint32_t* nonce_found_on_th_id) { + uint32_t const one_pad_x_chars_lsb_constants_loc[] = { 0x0, 0xF, 0xFF, 0xFFF, 0xFFFF, 0xFFFFF, 0xFFFFFF, 0xFFFFFFF, 0xFFFFFFFF }; + uint32_t const th_id = blockIdx.x * blockDim.x + threadIdx.x; + + uint32_t nonce_local[2]; + __shared__ uint32_t message_int_16_to_36[20]; + uint32_t m_block[SHA224_256_BLOCK_SIZE / 4]; + uint32_t hash_local[8]; + uint32_t sum = 0; + uint32_t rightPadOfHashForLastCondition = one_pad_x_chars_lsb_constants_loc[tail_length_in_chars]; + uint32_t mining_cond_local[N_32BITS_IN_MINING_CONDITION]; + + + if ((threadIdx.x > 15) && (threadIdx.x < 36)) { + message_int_16_to_36[threadIdx.x - 16] = message_int[threadIdx.x]; + } + __syncthreads(); + + //Local copy of message +#pragma unroll 8 + for (int i = 0; i < 8; i++) { hash_local[i] = hash[i]; } + + //Randomize message by editing nonce + modNonce((const uint32_t*)&message_int_16_to_36[0], nonce_local, th_id); + + //Update + transform_sep_nonce((const uint32_t*)message_int_16_to_36, nonce_local, hash_local); + +#pragma unroll 4 + for (int i = 0; i < 4; i++) { + m_block[i] = message_int_16_to_36[16 + i]; + } + //EO UPDATE + + //Final + sha224_final(m_block, hash_local); + + + //Anneal3 + anneal3(map, hash_local); + //Eo anneal3 + + //copy mining condition local +#pragma unroll 2 + for (uint32_t i = 0; i < 2; i++) { mining_cond_local[i] = mining_cond[i]; } + +#pragma unroll 8 + for (int shifts = 0; shifts < 8; shifts++) { +#pragma unroll 6 + for (int h_i = 0; h_i < 6; h_i++) { + sum = 0; + sum = sum | (hash_local[h_i] ^ mining_cond_local[0]); + int h1 = (hash_local[h_i + 1] | rightPadOfHashForLastCondition); + sum = sum | (h1 ^ mining_cond_local[1]); + if (sum == 0) { + *nonce_found_on_th_id = th_id; + } + } + shiftLeft4Bytes7Ints(hash_local); + } +} + +std::string nonceFromThreadId(std::string nonce, uint32_t th_id) { + unsigned char nonce_buf[32]; + for (int ii = 0; ii < 32; ii++) { nonce_buf[ii] = nonce[ii]; } + modNonceCpu(nonce_buf, th_id); + for (int ii = 0; ii < 32; ii++) { nonce[ii] = nonce_buf[ii]; } + return nonce; +} + +uint32_t StringToInts(std::string hex_str, uint32_t* ret, bool onePad = true) { + //pad with 0's + while (hex_str.length() % 8 != 0) { + if (onePad) { + hex_str = hex_str + "f"; + } + else { + hex_str = hex_str + "0"; + } + } + + int len = 0; + for (unsigned i = 0; i < hex_str.length(); i += 8) { + std::string hex32_numb = hex_str.substr(i, 8); + unsigned int x = std::stoul(hex32_numb, nullptr, 16); + ret[len] = x; + len++; + } + return len; +} + +void cur(cudaError_t error) { + if (error != cudaSuccess) { + std::cout << cudaGetErrorString(error); + throw std::runtime_error(cudaGetErrorString(error)); + } +} + +int32_t BisCuda::GetNumDevices() { + int32_t deviceCount = -1; + cudaError_t err = cudaGetDeviceCount(&deviceCount); + if (err == cudaSuccess) + return deviceCount; + + if (err == cudaErrorInsufficientDriver) { + int driverVersion = -1; + cudaDriverGetVersion(&driverVersion); + if (driverVersion == 0) + throw std::runtime_error{ "No CUDA driver found" }; + throw std::runtime_error{ "Insufficient CUDA driver: " + std::to_string(driverVersion) }; + } + + throw std::runtime_error{ cudaGetErrorString(err) }; +} + +void packMsg(const unsigned char* message, uint32_t* msg_int) { + for (int j = 0; j < 144 / 4; j++) { + SHA2_PACK32(&message[j << 2], &msg_int[j]); + } +} + +std::string BisCuda::GenerateNonce_DoNotCall() { + std::string nonce = ""; + for (int i = 0; i < 32; i++) { + + nonce += hex_chars_small_h[rand() % 16]; + } + return nonce; +} + +void BisCuda::ResetAllDevices() { + int nDev = GetNumDevices(); + for (int dev_id = 0; dev_id < nDev; dev_id++) { + cur(cudaSetDevice(dev_id)); + cur(cudaDeviceReset()); + } +} + +void BisCuda::Init() { + n_devices = GetNumDevices(); + + //Load MAP + cur(cudaMallocHost(&map_host, map_size)); + printf("Loading heavy3a.bin into memory\n"); + FILE* in_file = fopen("heavy3a.bin", "rb"); + if (in_file != NULL) { + fread(map_host, BIN_SIZE, 1, in_file); + fclose(in_file); + printf("Loaded heavy3a.bin"); + } + else { + printf("Could not load heavy3a.bin, exiting.."); + exit(0); + } + //EO load map + + //This is only first time "random" initial values, will be overwritten by the next call to Update + Update("ddf74f55fb386d29037b010966d2424268a5efc6c8be2b8c6c9c9de9", "25293edc281c3de8ecd41047ea01288603c5aafa13f8f73c15b7871", "7cd4ab66b1a"); + + for (uint32_t dev_id = 0; dev_id < n_devices; dev_id++) { + InitDevice(dev_id); + } +} + +void BisCuda::InitDevice(uint32_t dev_id) { + cur(cudaSetDevice(dev_id)); + + cur(cudaMalloc(&mining_cond_uint_dev[dev_id], mining_cond_uint_size)); + cur(cudaMalloc(&nonce_found_on_th_id_dev[dev_id], sizeof(uint32_t))); + cur(cudaMalloc(&hash_dev[dev_id], m_h_size)); + cur(cudaMalloc(&message_int_dev[dev_id], msg_int_size)); + + cur(cudaMallocHost((void**)&nonce_found_on_th_id_host[dev_id], sizeof(uint32_t))); + cur(cudaMallocHost((void**)&message_int_host[dev_id], msg_int_size)); + cur(cudaMallocHost((void**)&hash_host[dev_id], msg_int_size)); + + //Map + cur(cudaMalloc(&map_dev[dev_id], map_size)); + cur(cudaMemcpy(map_dev[dev_id], map_host, map_size, cudaMemcpyHostToDevice)); + +} + +void BisCuda::DeletePointers() { + for (uint32_t i = 0; i < n_devices; i++) { + // Device + cur(cudaFree(mining_cond_uint_dev[i])); + cur(cudaFree(message_int_dev[i])); + cur(cudaFree(hash_dev[i])); + cur(cudaFree(nonce_found_on_th_id_dev[i])); + + // Host + cur(cudaFreeHost(nonce_found_on_th_id_host[i])); + cur(cudaFreeHost(message_int_host[i])); + cur(cudaFreeHost(hash_host[i])); + } +} + +void BisCuda::Update(std::string address, std::string db_block_hash, std::string mining_condition_hex_string) { + address_h = address; + db_block_hash_h = db_block_hash; + GenerateNonces(); + + //Convert mining condition to int 32 + mining_cond_uint_host[0] = 0xFFFFFFFF; + mining_cond_uint_host[1] = 0xFFFFFFFF; + mining_condition_n_ints = StringToInts(mining_condition_hex_string, mining_cond_uint_host); + tail_length_in_chars_host = 8 - (mining_condition_hex_string.length() % 8); + if (tail_length_in_chars_host == 8) { tail_length_in_chars_host = 0; } + + for (uint32_t dev_id = 0; dev_id < n_devices; dev_id++) { + shouldUpdateDevices[dev_id] = true; + } +} + +void BisCuda::UpdateDevice(uint32_t dev_id, bool set_device = true) { + if (set_device) { + cur(cudaSetDevice(dev_id)); + } + + //Update message with new noce (this must be done each loop in order to find new solutions on a new message) + nonce_h[dev_id] = GetNonce(); + message_string[dev_id] = address_h + nonce_h[dev_id] + db_block_hash_h; + + if (shouldUpdateDevices[dev_id]) { + cur(cudaMemcpy(mining_cond_uint_dev[dev_id], mining_cond_uint_host, mining_cond_uint_size, cudaMemcpyHostToDevice)); + shouldUpdateDevices[dev_id] = false; + } + + packMsg((const unsigned char*)message_string[dev_id].c_str(), message_int_host[dev_id]); + sha224_init(hash_host[dev_id]); + transform_cpu(message_int_host[dev_id], hash_host[dev_id]); + cur(cudaMemcpy(message_int_dev[dev_id], message_int_host[dev_id], msg_int_size, cudaMemcpyHostToDevice)); + cur(cudaMemcpy(hash_dev[dev_id], hash_host[dev_id], m_h_size, cudaMemcpyHostToDevice)); +} + +void BisCuda::StartAllGPUs() { + run_threads = true; + for (uint32_t dev_id = 0; dev_id < n_devices; dev_id++) { + threads[dev_id] = std::thread(&BisCuda::LoopDeviceThread, this, dev_id); + } +} + +void BisCuda::LoopDeviceThread(uint32_t dev_id) { + cur(cudaSetDevice(dev_id)); + while (run_threads) { + //Update device each loop, in order to generate new nonces and messages + UpdateDevice(dev_id, false); + LoopDevice(dev_id, false); + n_hashes_executed += N_THREADS; + } +} + +void BisCuda::LoopDevice(uint32_t dev_id, bool set_device = true) { + if (set_device) { + cur(cudaSetDevice(dev_id)); + } + + *nonce_found_on_th_id_host[dev_id] = 0xFFFFFFFF; + cur(cudaMemcpy(nonce_found_on_th_id_dev[dev_id], nonce_found_on_th_id_host[dev_id], sizeof(uint32_t), cudaMemcpyHostToDevice)); + + sha224_find << > > (message_int_dev[dev_id], hash_dev[dev_id], mining_cond_uint_dev[dev_id], tail_length_in_chars_host, map_dev[dev_id], nonce_found_on_th_id_dev[dev_id]); + + cudaDeviceSynchronize(); + + cur(cudaMemcpy(nonce_found_on_th_id_host[dev_id], nonce_found_on_th_id_dev[dev_id], sizeof(uint32_t), cudaMemcpyDeviceToHost)); + + if (*nonce_found_on_th_id_host[dev_id] != 0xFFFFFFFF) { + std::string validNonce = nonceFromThreadId(nonce_h[dev_id], *nonce_found_on_th_id_host[dev_id]) + "\n"; + ValidNoncesAdd(validNonce); + std::cout << "\nNonce found!" << std::flush; + } +} diff --git a/bis.h b/bis.h new file mode 100644 index 0000000..130ee1e --- /dev/null +++ b/bis.h @@ -0,0 +1,191 @@ +#ifndef BIS_H +#define BIS_H +#include "cuda_runtime.h" +#include "device_launch_parameters.h" +#include "stdio.h" + +#ifndef _WIN32 +#include +#endif + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#define SHA224_256_BLOCK_SIZE 64 //512/8 +#define SHA224_DIGEST_SIZE 28 //(224/8) +#define MAX_GPUS 10 +#define N_32BITS_IN_MINING_CONDITION 2 //32bit*2 = 64bit max length on mining condition (This must be changed if difficulty if more that 128 bits) +#define N_THREADS_PER_BLOCK 512 +#define N_BLOCKS 32768 +#define N_THREADS (N_THREADS_PER_BLOCK * N_BLOCKS) + +#define BIN_SIZE 1073741824 +#define RND_LEN ( BIN_SIZE / 4 ) + +class BisCuda { +private: + + //Device + uint32_t* mining_cond_uint_dev[MAX_GPUS]; + uint32_t* nonce_found_on_th_id_dev[MAX_GPUS]; + uint32_t* message_int_dev[MAX_GPUS]; + + uint32_t* map_dev[MAX_GPUS]; + + //Host + uint32_t* map_host = NULL; // Only one map file is needed for host + uint32_t map_size = BIN_SIZE; + + uint32_t* nonce_found_on_th_id_host[MAX_GPUS]; //1 element + uint32_t* message_int_host[MAX_GPUS]; //36 elements + uint32_t msg_int_size = 36 * sizeof(uint32_t); + uint32_t* hash_host[MAX_GPUS]; //8 elements + uint32_t m_h_size = 8 * sizeof(uint32_t); + uint32_t* hash_dev[MAX_GPUS]; + + void SetPointersToNULL() { + for (int i = 0; i < MAX_GPUS; i++) { + mining_cond_uint_dev[i] = NULL; + nonce_found_on_th_id_dev[i] = NULL; + message_int_dev[i] = NULL; + hash_dev[i] = NULL; + + nonce_found_on_th_id_host[i] = NULL; + message_int_host[i] = NULL; + hash_host[i] = NULL; + } + } + + //Host variables + std::thread threads[MAX_GPUS]; + bool run_threads; + bool shouldUpdateDevices[MAX_GPUS]; + + + uint32_t n_devices; //Set in init + + std::string address_h; + std::string db_block_hash_h; + std::string nonce_h[MAX_GPUS]; + std::string message_string[MAX_GPUS]; + + uint32_t mining_cond_uint_host[N_32BITS_IN_MINING_CONDITION]; + uint32_t mining_cond_uint_size = sizeof(uint32_t) * N_32BITS_IN_MINING_CONDITION; + uint32_t mining_condition_n_ints; + uint32_t tail_length_in_chars_host; + + std::mutex mtx_nonce_valid; + std::mutex mtx_nonce; + std::string valid_nonces; //DO not call directly!! + + std::stack nonces_h_do_not_modify; + std::atomic n_hashes_executed{ 0 }; + + void GenNoncesOnlyMutexCall() { + if (nonces_h_do_not_modify.size() > MAX_GPUS * 200) { return; } + while (nonces_h_do_not_modify.size() < (MAX_GPUS * 500)) { + nonces_h_do_not_modify.push(GenerateNonce_DoNotCall()); + } + } + + void GenerateNonces() { + mtx_nonce.lock(); + GenNoncesOnlyMutexCall(); + mtx_nonce.unlock(); + } + + std::string GetNonce() { + mtx_nonce.lock(); + if (nonces_h_do_not_modify.size() == 0) { + GenNoncesOnlyMutexCall(); + } + std::string n = nonces_h_do_not_modify.top(); + nonces_h_do_not_modify.pop(); + mtx_nonce.unlock(); + return n; + } + + void ValidNoncesAdd(std::string nonces) { + mtx_nonce_valid.lock(); + //Do not keep adding indefinitely. It is cleared by calling ValidNoncesGet + if (valid_nonces.size() < 10000000) { + valid_nonces += nonces; + } + mtx_nonce_valid.unlock(); + } + + int32_t GetNumDevices(); + void InitDevice(uint32_t dev_id); //This is called from init for all devices + void UpdateDevice(uint32_t dev_id, bool use_device_id); //If use_device_id is false, device is not set in method + void LoopDevice(uint32_t dev_id, bool set_device); + void LoopDeviceThread(uint32_t dev_id); + void Init(); + void StartAllGPUs(); + void DeletePointers(); + + std::string GenerateNonce_DoNotCall(); //Shold only be called from GenerateNonces() due to thread safety + +public: + + BisCuda() { +#ifdef _WIN32 + srand((uint32_t)time(NULL)); //Psudo random generator to update seed +#else + + struct timeval tv1; + gettimeofday(&tv1, NULL); + int seed_val = (int)tv1.tv_usec; + srand(seed_val); + std::cout << "Seeding with value tv_usec: " << std::to_string(seed_val) << "\n" << std::flush; +#endif + + GenerateNonces(); + SetPointersToNULL(); + Init(); + StartAllGPUs(); + } + + ~BisCuda() { + run_threads = false; + for (uint32_t i = 0; i < n_devices; i++) { + if (&threads[i] != NULL) { + threads[i].join(); + } + } + DeletePointers(); + + std::cout << "\nBisCuda exited\n" << std::flush; + } + + void ResetAllDevices(); + void Update(std::string address, std::string db_block_hash, std::string mining_condition_hex_string); + + uint64_t GetNumerOfHashesSinceLastCall() { + uint64_t h = n_hashes_executed; + n_hashes_executed = 0; + return h; + } + + uint32_t ValidNoncesAvailable() { + return (uint32_t)valid_nonces.length(); + } + + std::string ValidNoncesGet() { + mtx_nonce_valid.lock(); + std::string valid_nonces_cpy = valid_nonces; + valid_nonces.clear(); + mtx_nonce_valid.unlock(); + return valid_nonces_cpy; + } +}; +#endif diff --git a/bisWrapper.cpp b/bisWrapper.cpp new file mode 100644 index 0000000..f2b98d7 --- /dev/null +++ b/bisWrapper.cpp @@ -0,0 +1,17 @@ +#include +#include +#include +#include +#include +#include +#include "bis.h" + +namespace py = pybind11; +PYBIND11_MODULE(bis, m) { + py::class_(m, "BisCuda") + .def(py::init()) + .def("ValidNoncesAvailable", &BisCuda::ValidNoncesAvailable) + .def("ValidNoncesGet", &BisCuda::ValidNoncesGet) + .def("Update", &BisCuda::Update) + .def("GetNumerOfHashesSinceLastCall", &BisCuda::GetNumerOfHashesSinceLastCall); +} diff --git a/miner.txt b/miner.txt new file mode 100644 index 0000000..00feb9f --- /dev/null +++ b/miner.txt @@ -0,0 +1,9 @@ +port=8525 +mining_ip=127.0.0.1 +mining_threads=1 +tor=0 +miner_address=0a83f9b7aa6dabf986ab2f81c857d036c47e367940dc49093873614d +max_diff=150 +miner_name=cuda_gpu +nonce_time=10 +hashcount=20000 diff --git a/mycompile.sh b/mycompile.sh new file mode 100644 index 0000000..c13f4bb --- /dev/null +++ b/mycompile.sh @@ -0,0 +1,7 @@ +#!/bin/bash +export CC=/usr/bin/gcc-8 +export CXX=/usr/bin/g++-8 +rm -rf CMakeFiles +rm CMakeCache.txt +cmake . +make diff --git a/optihash.py b/optihash.py new file mode 100644 index 0000000..e641426 --- /dev/null +++ b/optihash.py @@ -0,0 +1,203 @@ +# optihash.py v 0.31-cuda to be used with Python3.5 or better +# CUDA GPU-miner for Optipoolware based pool mining only +# Copyright Hclivess, Primedigger, Maccaspacca, SylvainDeaure 2017 +# kbk and geho2, 2021 +# . + +import time, socks, connections, sys, os, math +from multiprocessing import Process, freeze_support, Queue +from random import getrandbits +from hashlib import sha224 + +import mining_heavy3 as mining + +#Added by kbk +import bis # CUDA code +from datetime import datetime + +def cuda_to_nonce_arr(string): + elements = string.splitlines() + newEl = [] + for el in elements: + if len(el) > 30: + newEl.append(el) + return newEl +#eo added by kbk + +__version__ = '0.3.1-cuda' + +# load config +lines = [line.rstrip('\n') for line in open('miner.txt')] +for line in lines: + if "port=" in line: + port = line.split('=')[1] + if "mining_ip=" in line: + mining_ip_conf = line.split('=')[1] + if "mining_threads=" in line: + mining_threads_conf = line.strip('mining_threads=') + if "tor=" in line: + tor_conf = int(line.strip('tor=')) + if "miner_address=" in line: + self_address = line.split('=')[1] + if "nonce_time=" in line: + nonce_time = int(line.split('=')[1]) + if "miner_name=" in line: + mname = line.split('=')[1] + if "hashcount=" in line: + hashcount = int(line.split('=')[1]) + +# load config + +bin_format_dict = dict((x, format(ord(x), '8b').replace(' ', '0')) for x in '0123456789abcdef') + + +def bin_convert(string): + return ''.join(bin_format_dict[x] for x in string) + + +def bin_convert_orig(string): + return ''.join(format(ord(x), '8b').replace(' ', '0') for x in string) + + +def diffme(pool_address, nonce, db_block_hash): + # minimum possible diff + diff = 60 + # will return 0 for diff < 60 + diff_result = 0 + mining_hash = bin_convert(sha224((pool_address + nonce + db_block_hash).encode("utf-8")).hexdigest()) + mining_condition = bin_convert(db_block_hash) + while mining_condition[:diff] in mining_hash: + diff_result = diff + diff += 1 + return diff_result + + +def miner(q, pool_address, db_block_hash, diff, mining_condition, netdiff, hq, thr, dh, bisCuda): # Added by kbk + process_mmap = False + if not mining.RND_LEN: + mining.mining_open() + process_mmap = True + try: + tries = 0 + try_arr = [('%0x' % getrandbits(32)) for i in range(nonce_time*hashcount)] + address = pool_address + timeout = time.time() + nonce_time + while time.time() < timeout: + try: + t1 = time.time() + tries = tries + 1 + + # Added by kbk, wait for nonces + possibles=[] + time.sleep(0.25) + + nonces_cu = bisCuda.ValidNoncesGet() + possibles = cuda_to_nonce_arr(nonces_cu) + #eo added by kbk + + if possibles: + for nonce in possibles: + xdiffx = mining.diffme_heavy3(address, nonce, db_block_hash) + if xdiffx < diff: + print("---> Diff too low in nonce from GPU <----") + pass + else: + print("Thread {} solved work in {} cycles - YAY!".format(q, tries)) + wname = "{}{}".format(mname, str(q)) + block_send = [] + del block_send[:] # empty + block_timestamp = '%.2f' % time.time() + block_send.append((block_timestamp, nonce, db_block_hash, netdiff, xdiffx, dh, mname, thr, str(q))) + print("Sending solution: {}".format(block_send)) + tries = 0 + # submit mined nonce to pool + try: + s1 = socks.socksocket() + if tor_conf == 1: + s1.setproxy(socks.PROXY_TYPE_SOCKS5, "127.0.0.1", 9050) + s1.connect((mining_ip_conf, int(port))) # connect to pool + print("Miner: connected to pool, proceeding to submit solution") + connections.send(s1, "block", 10) + connections.send(s1, self_address, 10) + connections.send(s1, block_send, 10) + print("Miner: solution submitted to pool") + time.sleep(0.2) + s1.close() + + except Exception as e: + print("Miner: Could not submit solution to pool") + pass + except Exception as e: + print(e) + time.sleep(0.1) + raise + finally: + if process_mmap: + mining.mining_close() + + +def runit(): + connected = 0 + dh = 0 + hq = Queue() + + #Added by kbk + bisCuda = bis.BisCuda() + db_block_hash_previous = " " + thr = 1 + #Eo added by kbk + + while True: + try: + # Added by kbk + start_time = datetime.now() #Timing hashrate + # Eo added by kbk + + s = socks.socksocket() + if tor_conf == 1: + s.setproxy(socks.PROXY_TYPE_SOCKS5, "127.0.0.1", 9050) + s.connect((mining_ip_conf, int(port))) # connect to pool + connections.send(s, "getwork", 10) + work_pack = connections.receive(s, 10) + db_block_hash = (work_pack[-1][0]) + diff = int((work_pack[-1][1])) + paddress = (work_pack[-1][2]) + netdiff = int((work_pack[-1][3])) + s.close() + + diff_hex = math.floor((diff / 8) - 1) + mining_condition = db_block_hash[0:diff_hex] + + print("{} miners searching for solutions at difficulty {} and condition {}".format(mining_threads_conf,str(diff),str(mining_condition))) + + #Added by kbk + if db_block_hash != db_block_hash_previous: + bisCuda.Update(paddress, db_block_hash, mining_condition) + bisCuda.ValidNoncesGet() #Clear buffer + db_block_hash_previous = db_block_hash + print("Updated CUDA block hash") + + miner(1, paddress, db_block_hash, diff, mining_condition, netdiff, hq, thr, dh, bisCuda) + stop_time = datetime.now() + elapsed_time = stop_time - start_time + nHashes = bisCuda.GetNumerOfHashesSinceLastCall() + hPerSec = nHashes/elapsed_time.total_seconds() + print("\n************************\n") + print(hPerSec/1e6, "Mh/s") + print("\n************************\n") + #Eo added by kbk + + except Exception as e: + print(e) + print("Miner: Unable to connect to pool check your connection or IP settings.") + time.sleep(1) + + +if __name__ == '__main__': + freeze_support() # must be this line, don't move ahead + + mining.mining_open() + try: + runit() + finally: + mining.mining_close()