https://github.com/CodeShark/RippleGen

A simple multithreaded vanity generator for the ripple p2p network
https://github.com/CodeShark/RippleGen

Last synced: 3 months ago
JSON representation

A simple multithreaded vanity generator for the ripple p2p network

• Host: GitHub
• URL: https://github.com/CodeShark/RippleGen
• Owner: CodeShark
• License: other
• Created: 2013-04-09T23:20:35.000Z (over 11 years ago)
• Default Branch: master
• Last Pushed: 2013-04-11T03:19:37.000Z (over 11 years ago)
• Last Synced: 2024-05-22T07:57:54.934Z (6 months ago)
• Language: C++
• Size: 155 KB
• Stars: 26
• Watchers: 8
• Forks: 12
• Open Issues: 3
• Metadata Files:
  • Readme: README
  • License: LICENSE

Awesome Lists containing this project

• awesome-xrpl - CodeShark/RippleGen - C++/Boost over 8 years old, need to test it! (Code/Other/Vanity Generators / Libs/Deprecated)

README

        

                          R I P P L E G E N

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

A multithreaded vanity account generating tool for the Ripple p2p network.

Requires Boost and OpenSSL.

Build: ./make

Run:   ./ripplegen [pattern] [threads]

The threads parameter is optional. If omitted, the optimal value is selected

depending on your hardware.

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

TODO:

    - Validate patterns correctly, make sure the user doesn't end

      up waiting forever for a pattern that will never occur.

    

      user tip: Try r?? and r??? and make sure they are found within a

        reasonable amount of time before trying the full pattern and

        make sure you only use characters from the base58 alphabet:

        123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz

    - Provide a better indication of current speed (not just average speed)

      and a speed breakdown per thread.

    - Make it easier to plug in different alphabets and rules.

    - Remove unused portions of source code.

    - Improve performance by removing unnecessary branching,

      excessive calls, unnecessary memory allocations and copies,

      and replacing the elliptic curve library with something faster.

    - Allow user to specify the seed and then search accounts for that

      seed (right now uses a hardcoded index of 0 for each seed).

    - The search space is sufficiently ample so that it is highly

      unlikely that two threads will end up overlapping in their

      search range, or that running the program multiple times with

      the same pattern will result in an overlap. But it's very cheap

      to guarantee this won't happen. Moreover, the user could be

      allowed to provide an initial search value either directly or as a

      passphrase hash (although this can compromise security).

    - Support for wider pattern formats. Wildcards, ranges, or even

      regexes.

    - Support for coordinated searches across many machines.

- Eric Lombrozo

(Tip Jar: rEric5Q6297byt1PyM5EMx2X3qm9x9RrEb)

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

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR

IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,

FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE

AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER

LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,

OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN

THE SOFTWARE.

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