Re: [ANN] AEON [2017-04-23: update to 0.9.12.0]

Hi I recently built a rig with an NVIDIA1080ti card and i7 processor. I am staking coins but am also trying to figure out how to solo mine. I currently mine with NiceHash but I want to at least solo mine even if it's just to learn a few things. So far I downloaded the server and client for AEON. This coin is my first attempt to solo. My server node is running and my wallet is open.
...

You can't solo mine on cryptonotes like you can with bitcoin clones if you want to use a GPU. You basically have to run your own pool.

So let me see if I understand this. CCMiner is basically just another NiceHash? I say that because no matter what, I have to use a pool to mine a coin?

Funny - I find it amazing how i'm smart enough to figure out how to solo mine. Why would you say I need to run my own pool?

Wallet says:
[wallet WmsJVr]: start_mining 1
Mining started in daemon
[wallet WmsJVr]:

Server says:
Mining has started with 1 threads, good luck!

Thanks for your help, I'm gonna make some adjustments now and rock this!

ccminer only pool mines for aeon or other cryptonotes. When the wallet says you're mining that means CPU mining.

Thank you for that last reply.

In concluding I understand this coin is a CPU/RAM coin of which I built my system around this same idea. I hope this coin sticks to the whitepaper ...

By now scrypt has already been applied in Litecoin [14] and some other Bitcoin forks. How-
ever, its implementation is not really memory-bound: the ratio memory access time / overall
time is not large enough because each instance uses only 128 KB. This permits GPU miners
to be roughly 10 times more effective and continues to leave the possibility of creating relatively
cheap but highly-efficient mining devices.

Moreover, the scrypt construction itself allows a linear trade-off between memory size and
CPU speed due to the fact that every block in the scratchpad is derived only from the previous.
For example, you can store every second block and recalculate the others in a lazy way, i.e. only
when it becomes necessary.

This in turn implies that a machine with a CPU
200 times faster than the modern chips can store only 320 bytes of the scratchpad.

5.2 The proposed algorithm
We propose a new memory-bound algorithm for the proof-of-work pricing function. It relies on
random access to a slow memory and emphasizes latency dependence. As opposed to scrypt every
new block (64 bytes in length) depends on all the previous blocks. As a result a hypothetical
memory-saver should increase his calculation speed exponentially.
Our algorithm requires about 2 Mb per instance for the following reasons:
1. It fits in the L3 cache (per core) of modern processors, which should become mainstream
in a few years;

Summary
Block time: 240 seconds (Every 4 minutes)
Difficulty: re-targets at every block