<<  >> (p.2)
    Author Topic: Prefix Difficulty Calculator c# assistance please! Base code included in post.  (Read 596 times)
    n0nce
    Hero Member
    *****
    Offline Offline

    Activity: 938
    Merit: 6012


    not your keys, not your coins!


    View Profile WWW
    April 11, 2022, 02:51:55 AM
    Merited by vapourminer (2)
     #21

    I tried figuring out how PCRE does it but im not savvy in how it was wrote.
    Aside from Nonce , no ones even bothered or acknowledged me asking about pivots or admitted JLVS is wrong on calculations involving pivots.
    Honestly, I'm not sure the PCRE regex library is even used to calculate the difficulty. After looking at the code again, to my untrained eye it appears that get_prefix_ranges is invoked for getting the ranges that produce a certain prefix and then the result is used in vg_prefix_get_difficulty, both of which don't use PCRE.
    I'm not sure, but that regex stuff may not be related to difficulty and pivot calculations.

    I wish I could help more, but I'm getting openssl errors when trying to compile. If you have an up-to-date fork of vanitygen that compiles, I'd poke at it again.

    n0nce.eu
Page 1
Viewing Page: 2