We introduce ClickMine, a proof of clickbased mining system which overlays an existing proof of work blockchain. ClickMine is an innovative proof mechanism, whereby participants prove they are sending a transaction by sending a transaction. We introduce our system, prove some desirable features, and show few defenses against long range revisions and catastrophic crashes. The ClickMine protocol provides almost no protections against anything at all.
Over the past six months there has been considerable research into the applications of blockchainbased tokens (erc30 tokens) for maximizing profit. In a PoC system, a contract mints tokens any participants who send transactions that call a its click method (0x7d55923d). The rate at which tokens are dispensed is proportional to the power ups (or “items”, denoted henceforth as λ) the user has purchased. This is a vastly more efficient alternative to conventional token sales, which require integrating with legacy fiat systems, attempting to vet users (KYC), and limiting access to tokens.
ClickMine is a graphical interface atop a smart contract — a contract which creates tokens. It simulates a visually satisfying interface, complete with grass, dirt, nostaligic trappings of computer eras past, and numbers that steadily and hypnotically increase. Indeed, glowing green incrementing numbers have been proven to be fascinating to humans by a factor of $$x = {\tau + \sqrt{x^82} \over \pi}.$$
The ClickMine protocol scales linearly with the number of transactions and is demonstrably collusion resistant. For example, one can mathematically prove that as long as >0 protocol participants are following the protocol honestly, then, regardless of network latency, the algorithm continues to create tokens at a rate of $$\delta $CLK = {2^256 + \sqrt{\lambda}}.$$ Thus the tendency of the ClickMineToken supply tends toward ∞.
The actions of apparently "dishonest" actors using the protocol (calling "click" via script and not mouse action, or triggering token balance overflow) is in fact highly desirable. As chaos in the system (denoted here as Φ) increases, isomorphisms from workspace and stakespace to clickspace accrue, causing $$\sum_{i=0}^\phi i^2 = \frac{(\lambda^2+\phi)(\sqrt{2})}{6}$$
Thus the proof of proof of click is as follows $$1 = 1$$
Under almost no circumstances would we recommend using this token as a utility or store or value.
Tipjar: 0xffA6516E4d75A100769230CdB5Eb66D4086A95c4
0 

0 
TRANSACTION HISTORY 
EFFICIENCY :  
SPEED : 
SHOP 

SHOVEL 
0 
PAN 
0 
SLUICE 
0 
SMELTER 
0 
SPIRAL PANNER 
0 
MECHASLUICE 
0 
REFINERY 
0 
BUCKETWHEEL 
0 
PROPAGANDA MACHINE 
0 
TAILINGS DOZER 
0 
HYDRAULIC SHOVEL 
0 
HAUL TRUCK BEHEMOTH 
0 