[ANN][ARG] Argentum | Fast. Optimized. Unique Innovation. | 0% Orphans - page 27.

FiiNALiZE

hero member

Activity: 868

Merit: 500

CryptoTalk.Org - Get Paid for every Post!

Quote from: cryptohunter on June 11, 2013, 10:07:26 PM

there isn't much hype around or enthusiasm for this coin?

is it

1. the insanely monster premine?
2. just that there have been way too many coins released?
3. the rather mad time of day that it is being released?

Where did you find that this was premined?

The first 500 blocks have no reward.

forsetifox

sr. member

Activity: 266

Merit: 250

I'm going to try it only due to the block size increase.

cryptohunter

legendary

Activity: 2100

Merit: 1167

MY RED TRUST LEFT BY SCUMBAGS - READ MY SIG

there isn't much hype around or enthusiasm for this coin?

is it

1. the insanely monster premine?
2. just that there have been way too many coins released?
3. the rather mad time of day that it is being released?

AlphaC

newbie

Activity: 28

Merit: 0

Wait til you see the surprises.

dreamhouse

hero member

Activity: 1073

Merit: 666

Quote from: eddyfitz on June 11, 2013, 06:26:50 PM

IT WON'T WORK!
if you'll make "random" block rewards - all other clients won't be able to verify block and chain will be split.

say on block 1500 we have 100 "nodes" in network:

node 1 calculates next block to be 2 coins
node 2 calculates next block to be 3 coins

node 3 finds a block but calculated it to be 5 coins.
this way node 1 and node 2 won't ever "confirm" block found by node 3.
only nodes that calculated this block to be 5 coins will confirm.
Same thing will happen with all other blocks.... and coin will die.

heard "deterministic randomness", lol

dreamhouse

hero member

Activity: 1073

Merit: 666

Quote from: stdset on June 11, 2013, 07:22:31 PM

facepalm 1:

why not calculate nSubsidy in a simpler way?

int64 nSubsidy = 5 * COIN;
      if(rand < 20000)
           nSubsidy = 1 * COIN;
      else if(rand < 40000)
           nSubsidy = 2 * COIN;
      else if(rand < 60000)
           nSubsidy = 3 * COIN;
      else if(rand < 80000)
          nSubsidy = 4 * COIN;
//or is it possible, that generateMTRandom returns something greater than 100000, and the subsidy remains 0, lol

facepalm 2:

why not calculate it even simpler?

int64 nSubsidy = generateMTRandom(seed, 100000) / 20000 + 1;
//i suppose generateMTRandom returns a pseudorandom integer from 0 to it's second argument - 1, inclusive

facepalm 3:

why not calculate it even simpler?

int64 nSubsidy = generateMTRandom(seed, 5) + 1;

facepalm 4:

subsidy of a block is known, once the previous block is found. What could be better for forkhoppers?

generateMTRandom function is created by the JKC, make sure you guys when using it put the proper copyright there.

m3ta

sr. member

Activity: 435

Merit: 250

Quote from: BrainShutdown on June 11, 2013, 07:33:12 AM

Some innovation -> absurd premine -> fail? Cool

+1
Definitely.
Add the absurd time - 3am forum time is 4am gmt, or 11pm est.
So, a coin for americans, as most euros will not give a rat's ass about this to stay awake until so late.

Hazard

legendary

Activity: 980

Merit: 1000

AlphaC

newbie

Activity: 28

Merit: 0

He didn't have anything to do with any of the code other than testing it.

Charles999

full member

Activity: 224

Merit: 100

Quote from: baritus on June 10, 2013, 11:05:36 PM

Well it's not my business what he does to be honest. I'm not the police, I'll help anyone.

You shouldn't pay Baritus now, he screwed up his help. Keep your money and don't pay him. He can't do a damn thing right so it seems.

AlphaC

newbie

Activity: 28

Merit: 0

Having no idea about programming? You must be God himself to just know everything about people you never met.

Does your code offer any performance improvement over simple loops?

stdset

hero member

Activity: 572

Merit: 506

Quote from: AlphaC on June 11, 2013, 07:43:41 PM

@stdset

Since none of your solutions actually serve to lower the order of operations or make any real contribution to the current code except for making it less readable, I will stay with this method. Your code is not better nor an improvement.

Good answer!

For a bot having no idea about programming.
It is funny. A complex bot which is written using all sorts of loops and recursive functions, has no idea what is a loop and what is recursion. When the bot doesn't know what to say, it says something random. Even if it means that 1 line of code is less readable than 11 lines.
It's a long time since I laughed so much. Grin

AlphaC

newbie

Activity: 28

Merit: 0

Hello,

I've tested setting it up myself on pools and didn't have any issues. I think you'll be surprised at how easy it is.

eddyfitz

full member

Activity: 238

Merit: 100

Okay, if it's deterministic random, that my suggestion not much different from your apporach.
since it just a little bit more deterministic :-)
But we all will have less problem porting it to other languages (such as python for p2pool)

AlphaC

newbie

Activity: 28

Merit: 0

It's not completely random but deterministic random. It uses the last block hash as a seed to generate a "random" number. The same number always results from a given seed so the network will stay synced.

@stdset

Since none of your solutions actually serve to lower the order of operations or make any real contribution to the current code except for making it less readable, I will stay with this method. Your code is not better nor an improvement.

eddyfitz

full member

Activity: 238

Merit: 100

I guess following approach will be better:

Code:

if (nHeight % 100 == 0)
   nSubsidy = 5 * COIN;
if( nHeight % 80 == 0)
   nSubsidy = 4* COIN;

...

and so on

stdset

hero member

Activity: 572

Merit: 506

facepalm 1:

why not calculate nSubsidy in a simpler way?

int64 nSubsidy = 5 * COIN;
      if(rand < 20000)
           nSubsidy = 1 * COIN;
      else if(rand < 40000)
           nSubsidy = 2 * COIN;
      else if(rand < 60000)
           nSubsidy = 3 * COIN;
      else if(rand < 80000)
          nSubsidy = 4 * COIN;
//or is it possible, that generateMTRandom returns something greater than 100000, and the subsidy remains 0, lol

facepalm 2:

why not calculate it even simpler?

int64 nSubsidy = generateMTRandom(seed, 100000) / 20000 + 1;
//i suppose generateMTRandom returns a pseudorandom integer from 0 to it's second argument - 1, inclusive

facepalm 3:

why not calculate it even simpler?

int64 nSubsidy = generateMTRandom(seed, 5) + 1;

facepalm 4:

subsidy of a block is known, once the previous block is found. What could be better for forkhoppers?

eddyfitz

full member

Activity: 238

Merit: 100

IT WON'T WORK!
if you'll make "random" block rewards - all other clients won't be able to verify block and chain will be split.

say on block 1500 we have 100 "nodes" in network:

node 1 calculates next block to be 2 coins
node 2 calculates next block to be 3 coins

node 3 finds a block but calculated it to be 5 coins.
this way node 1 and node 2 won't ever "confirm" block found by node 3.
only nodes that calculated this block to be 5 coins will confirm.
Same thing will happen with all other blocks.... and coin will die.

AlphaC

newbie

Activity: 28

Merit: 0

Quote from: 96redformula on June 11, 2013, 06:03:58 PM

What time zone is the forum time?

UTC Time

96redformula

full member

Activity: 224

Merit: 100

What time zone is the forum time?

Topic: [ANN][ARG] Argentum | Fast. Optimized. Unique Innovation. | 0% Orphans - page 27. (Read 55767 times)