Quote
you understand the other way around...
btw: what "nature" has this algo which would make it resistant to attacks ?
it is on the first page of this forum...
"A: JHA has designed using Random Hashing Method and Random Variable Hashing Round using SHA3, Blake, Grøstl, JH, Skein"
good luck building FGPA for it I dare you
(don't want to enter into the details sorry... )Don't understand why you are bringing FGPA into the discussion though...
first step from GPU to the next level, design reprogrammable chip arrays, (not ASIC) so they can be reprogrammed if a change in the algorithm has been made, ASIC chips are hardwired with the algorithm.. there is whole area of research level material that discusses why random variable hashing algorithm is impossible to design fPGA for... what Jackpot has done (but different) closely parallels X11 (but with less rounds) while X11 worries about anonymity, jackpot just wants large and sparse distribution of coins in the hands of people , and I agree!
only fPGA has chance or 51% attack, not CPU and GPU, I just got off a coin where massive among of hashing power was assembled on the order of 300 GHS.. no indication of a problem.. this is also mathematically possible to prove, using statistics..
good luck to you
Actually the 3 rounds are not enough to ensure a protection at that level.
not qualified , only cryptologist would know for certain, once you see n Tera Hash range cornering the coin , maybe to worry (we are at let me see aaaaat..2.89 GHS thats nothing you will feel it if there was a breakthrough ... and even then quick add of additional rounds and hard fork
"you can easily bypass the slower groestl chains " really ? how would that pass block hash validation, you mean ccminer has skipped that round and succeeds ?
something ain't right with that statementopening ccminer git source code... would be something if that is true.. but how ?
I see, my apology for my ignorance, will search bitcointalk with combination of keywords: ccminer jackpot and groestl
if you have a link to a topic at hand, greatly appreciate it, it would be a major breakthrough in cryptology if a chain like groestl would be to bypassed (unlikely) optimized (moderately likely)
thank you for you patience with me
This algo does that: sha3 + 3x ((groestl OR Skein) + (Blake OR JH512))
The main problem actually is groestl in this algo, it is very slow compared to the other algo even skein.
So it is faster for ccminer to run only on chain which contain only one groestl or none (if I remember well).
you can search on cudaminer thread (or even on this thread)
does ccminer have a "patch" or some other patched version does exist giving that person(s) advantage ? I cant really derive from a source code any unusual level groestl optimization, cudaminer does not offer jackpot algo (or X11 or many others for the matter) thx
