Author

Topic: Thinking of forking yacoin (Read 700 times)

hero member
Activity: 798
Merit: 1000
‘Try to be nice’
June 16, 2013, 01:47:02 PM
#6
i'm sorry but , was that just post of the year ?

ha ha ha ! - if not i want to see evidence ha ha ha !

lol - crying here sorry - i'm 10 years old. i'm using my mums computer - her boyfriends aren't home . ha ha .


{is this why nibble can't have nice things ? }

ha ha .
hero member
Activity: 798
Merit: 1000
‘Try to be nice’
June 16, 2013, 01:40:40 PM
#5
thinking of forking Yamum !

: D






sorry.
hero member
Activity: 546
Merit: 500
June 16, 2013, 01:23:48 PM
#4
I agree, put your efforts into doing something using the existing coins, see sig for examples.
legendary
Activity: 882
Merit: 1000
June 16, 2013, 12:26:43 PM
#3
modifying code is ok i guess but the main issue that is rendering all our efforts is that all these alts we've made are not getting any exposure and use in the real world. Maybe if you pick up an existing coin and try push it to the forefront and make it popular like bitcoin, that will increase it's value and uses. ergo you benefit big time... if we hadn't traded in our LTC for useless alts, it wouldn't be plunging like this.
hero member
Activity: 588
Merit: 500
June 16, 2013, 12:18:09 PM
#2
Please spare us from another useless fork.
full member
Activity: 194
Merit: 100
June 16, 2013, 12:12:20 PM
#1
I'm planning on having a high N-factor at the start, such as 22. This will use 1GB per thread

What do you think of that amount?

I think I found all the relevant code
Code:
unsigned char GetNfactor(int64 nTimestamp) {
    int l = 0;

    if (nTimestamp <= nChainStartTime)
        return 4;

    int64 s = nTimestamp - nChainStartTime;
    while ((s >> 1) > 3) {
      l += 1;
      s >>= 1;
    }

    s &= 3;

    int n = (l * 170 + s * 25 - 2320) / 100;

    if (n < 0) n = 0;

    if (n > 255)
        printf( "GetNfactor(%lld) - something wrong(n == %d)\n", nTimestamp, n );

    unsigned char N = (unsigned char) n;
    //printf("GetNfactor: %d -> %d %d : %d / %d\n", nTimestamp - nChainStartTime, l, s, n, min(max(N, minNfactor), maxNfactor));

    return min(max(N, minNfactor), maxNfactor);
}

Is the return 4 all I need to change?

Jump to: