Topic: âš’[CGA] Cryptographic Anomaly - The Elusive Coinâš’ - page 156. (Read 226290 times)
This coin is going to smash 42 coin on most expensive coin ever we should try to get this to a exchange sooner then later
something called a sybil attack: http://en.wikipedia.org/wiki/Sybil_attack. If you could solve that problem and make a secure currency system, then you probably will have a true next generate coin.
First idea I have is to give the agents (wallets) a history.
Deep trust only comes with long history.
Depending on the trust level, an agent can or cannot do certain things.
History is something that can be made to be expensive to fake.
Look at this forum here. Newbies can do a lot, but not everything.
Hard to fake 1000 accounts with high activity level.
What do you think?
I'm in!!!
You right, but I think that diff will never be higher than the block number. The higher diff, the lower probability of hitting anomaly. At diff < 1 the anomaly occurs almost every time. The key thing will be also diff retarget. It is scheduled for 3 blocks but with some restrictions? Say max +15% and -50% or something like that?
I changed the re-target to every 2 blocks... but I might change it to every block before the release.
You right, but I think that diff will never be higher than the block number. The higher diff, the lower probability of hitting anomaly. At diff < 1 the anomaly occurs almost every time. The key thing will be also diff retarget. It is scheduled for 3 blocks but with some restrictions? Say max +15% and -50% or something like that?
Literally the worst idea I've ever seen pitched on this forum.
So 1st february 8pm for GMT
Probably diff = GetDifficulty() is 0.
I don't think that is true because at block 4 ( fmod(4, diff) ) the code decided to make an anomaly and the diff never changed between blocks 1 - 10 (because of such a low hash rate). If diff = 0 then none of the blocks should of generated an anomaly.
I'll keep working on it... I just don't want this to happen when I change the code back to "< 1 && > 0.1" it could be a disaster.
tabjohn you were partially right! The first couple of blocks the difficulty must be near zero (or it is zero) but when you "getmininginfo" it says 0.00024414 (damn lairs!). I adjusted the refresh time to 80 secs (so every 2 blocks instead of 3) and my third block generated an anomaly
! So we are all good! Thank you so much for helping me out! The coin is back on schedule! Just some finishing touches and the coin should be released by Feb 1st at noon!Something else I realized about my formula tho is that if the difficulty ever goes higher than the current block number then the remainder is going to always be the block number! Example: 50 % 100 = 50; 50 % 345.342 = 50!
So to answer everyone's questions on is lower hash rate better than higher hash rate?
The answer is sometimes...
Because if you pump to much hashing power into this coin you would raise the difficulty too high thus making it literally impossible to generate an anomaly! This is something I did not expect to happen but I like it. It forces the miners to be smart about there hash rates instead of "brute forcing" the network.
This is great and got my gears turning a bit. But in the end you could calculate the odds of getting the remainder you are looking for and just using a random number generator (not as cool and wouldn't be as fun)? I hope to be available when you are ready to put this out, this is good stuff.
people in crypto are really creative...
Yeah, you right. So probably the condition itself has some problem with comparision double/float such small numbers 
Probably diff = GetDifficulty() is 0.
I don't think that is true because at block 4 ( fmod(4, diff) ) the code decided to make an anomaly and the diff never changed between blocks 1 - 10 (because of such a low hash rate). If diff = 0 then none of the blocks should of generated an anomaly.
I'll keep working on it... I just don't want this to happen when I change the code back to "< 1 && > 0.1" it could be a disaster.
Interested idea, going to keep my eyes here.
Try manualy check all values of:
diff = GetDifficulty();
fmod(nHeight, diff);
and condition fmod(nHeight, diff) > 0.0000001.
Then you should be able to find what is wrong...
Probably diff = GetDifficulty() is 0.
diff = GetDifficulty();
fmod(nHeight, diff);
and condition fmod(nHeight, diff) > 0.0000001.
Then you should be able to find what is wrong...
Probably diff = GetDifficulty() is 0.
Try to check manualy the value fmod(1,0.00024414) ? Maybe function fmod returns 0 if the true reminder is less than 0.00001. Sorry for multiply edits
Ok, I made program fmod with following code:
Code:
#include
#include
int main ()
{
float a, c;
a = 1;
c = 0.00024414;
printf("Remainder of %f / %f is %lf\n", a, c, fmod(a,c));
return(0);
}
which returned :
Code:
Remainder of 1.000000 / 0.000244 is 0.000003
Then realized that in my coins code I was using "double" instead of "float" to define the difficulty. So I proceeded to change my fmod code to:
Code:
#include
#include
int main ()
{
double a, c;
a = 1;
c = 0.00024414;
printf("Remainder of %f / %f is %lf\n", a, c, fmod(a,c));
return(0);
}
Which still gave me:
Code:
Remainder of 1.000000 / 0.000244 is 0.000003
Still don't understand why my coins code thinks that 0.000003 doesn't fall between 1 and 0.0000001...
very interesting. i think this can go far.
Please remind ppl before launching.
The concept of this coin is interesting. There is some difference.
It's neither Proof-of-Work, nor Proof-of-stake. It's Proof-of-Luck ??
The concept of this coin is interesting. There is some difference.
It's neither Proof-of-Work, nor Proof-of-stake. It's Proof-of-Luck ??
Try to check manualy the value fmod(1,0.00024414) ? Maybe function fmod returns 0 if the true reminder is less than 0.00001. Sorry for multiply edits
Hey! I'm a mathematician, what do you need to figure out?
Pretty much why my current code tells me that 1 % 0.00024414 and 2 % 0.00024414 and 3 % 0.00024414 doesn't fall between 1 and 0.0000001?
http://en.wikipedia.org/wiki/Modulo_operation
http://www.cplusplus.com/reference/cmath/fmod/
Code:
if(nHeight <= 10 )
{
if(fmod(nHeight, diff) < 1 && fmod(nHeight, diff) > 0.0000001)
{
nSubsidy = 1 * COIN;
}
}
{
if(fmod(nHeight, diff) < 1 && fmod(nHeight, diff) > 0.0000001)
{
nSubsidy = 1 * COIN;
}
}
Blocks 1 - 3 doesn't render an anomaly for some reason when they clearly should.
Hey! I'm a mathematician, what do you need to figure out?
Jump to: