Technical Architecture
* Total Coin Supply - 2 BILLION
* PoW & POS hybrid (with a CRYPTONOTE code).
* Block time - 2 minutes
WALLETS
WEB WALLET
ANDROID WALLET
IOS WALLET
GITHUB :https://github.com/daikicoin/coin
EXPLORER :
http://explorer.daikicoin.infoWEBSITE :
WWW.DAIKICOIN.ORGEXCHANGES
1. OSAKAEX.IO
2. YOBIT.NET
3. TRADE SATOSHI
4. HITBTC
What Hybrid Blockchain is?
The DAIKICOIN unique hybrid blockchain uses a proof of work (PoW) algorithm creation cycle followed by transition into full proof of stake (PoS) algorithm instead. But what?s really the difference between these two types of algorithm and why is it beneficial for DAIKICOIN to use PoS?
Let us start by what they have in common: they are both algorithms for reaching consensus on the blockchain.
Without going into too much detail, we need consensus because as we only want a unique chain, so we want a way to decide which block we should trust. The goal of a consensus algorithm in a public blockchain network is to let many different users agree on the current state of the blockchain even though they don?t trust each other or without any central authority for validation. While both PoW and PoS are algorithms for reaching consensus on the blockchain, they go about it in different ways.
Proof-of-Work Explained
Proof-of-Work happens through miners trying to solve exceptionally difficult math problems. Finding a solution is basically a guessing game, but checking if a solution is correct is easy. Miners aren?t able to cheat the system because it takes real-world resources to work out these solutions, you can use Bayes? Theorem and the laws of Thermodynamics to prove that a given block has indeed required a certain amount of work to be mined and this way, users can simply pick the longest valid chain with the highest amount of work as the correct chain.
But this also implies that Proof of Work is extremely inefficient in term of energy, these real-world resources used to ?mine? are computers and electricity and It takes a lot of power to run the computers, or clusters of computers, that calculate different potential solutions to solve the blocks and therefore also very expensive, obviously not desirable for a network whose goal is to minimise the need to trust third parties.
[/img]C:\Users\Kriptonix\Desktop\daiki details/proof-of-work[/img]
Proof-of-Stake Explained
Proof of Stake isn?t about mining, it?s about validating, it happens by a miner putting up a stake, or locking up an amount of their coins, to verify a block of transactions. Each validator owns some stake in the network, ether in the case of Ethereum, SIC in the case of SWISSCOIN, that they bond. Bonding stake means you keep you coins in the network, and in some sense use it as collateral to vouch for a block.
[/img]C:\Users\Kriptonix\Desktop\daiki details/proof-of-stake-1[/img]
Final Verdict
In this new algorithm (PoS), agreement within the blockchain will be measured not on the basis of how much computing power agrees with the current state, but instead on the basis of how much digital currency agrees with the current state. The owners of this digital currency hold a financial stake in the success of the blockchain that tracks it.
Proof-of-Stake protocol isn?t just better for the environment; it helps to level the playing field for miners, and increases community participation. All of which is good for the DAIKICOIN network.
CryptoNote FUNCTIONS
CryptoNote is an application layer protocol that powers several decentralized privacy oriented digital currencies. It aims to be an evolution of the ideas behind bitcoin.
The main difference between the two technologies is that Bitcoin (and most digital currencies) is less opaque than CryptoNote-based currencies due to the latter's blockchain being almost anonymous, contrary to non-Cryptonote blockchains. CryptoNote currencies use a distributed public ledger that records all balances and transactions of its in-built currency like Bitcoin. Unlike Bitcoin, CryptoNote's transactions cannot be followed through the blockchain in a way that reveals who sent or received coins. The approximate amount of a transaction can be known, but the origin, destination, or actual amount cannot be learned. The only information available is that the actual amount was lower than the displayed amount. The only people with access to the whole set of data about a transaction are the sender or receiver of the transaction and the person who possesses one or both secret keys.
Another significant difference is CryptoNote's hash-based proof-of-work algorithm. Bitcoin uses SHA256, which is CPU-bound function. That means that participants (miners) are only limited by their calculation speeds, and it is relatively cheap to create an application-specific integrated circuit (ASIC) device, which will surpass an ordinary computer in hashes per unit of money. CryptoNote uses memory bound function CryptoNight, which cannot be easily pipelined.
CryptoNote code was not forked from Bitcoin's, so it also has other different inner algorithms, for things such as recalculating new difficulty level or new block size.
Anonymous transactions and ring signatures
Like Bitcoin, CryptoNote currencies use a public address consisting of pseudorandom numbers and letters that is derived from user's public keys. Addresses serve as public IDs of the users. However, unlike Bitcoin, CryptoNote transactions hide the connection between the sender's and the receiver's addresses.
[/img]C:\Users\Kriptonix\Desktop\daiki details/cn details[/img]
Sender privacy
To prevent sender identification, CryptoNote groups the sender's public key with several other keys (more precisely, it groups the sender's output with several other's outputs), making it impossible to tell who actually sent the transaction. If ring signatures are used, all possible senders referenced in the transaction are equiprobable and there is no way to determine the exact private key used while signing. This approach does not require dedicated master nodesfor mixing coins and does not need other users to actively participate in transaction generation . It still assures the network that the original sender has the funds in his or her account to send the transaction like an ordinary signature scheme does. Instead of proving in zero knowledge manner the fact "I possess the private key which corresponds to this particular public key" the signer proves "I possess at least one of the private keys which correspond to this set of public keys".
Receiver privacy
On the receiver's end, the technology generates a new public key for each money transfer, even for the same sender and receiver. With sender's random data and receiver public address it is possible to create a pair of unique private and public keys via Diffie?Hellman key exchange. Sender generates one-time ephemeral key for each transfer and only the receiver can recover the corresponding private key (to redeem the funds). No third party can determine if two different transactions were sent to the same recipient.
Double spending protection
Anonymous transactions have a potential problem. Bitcoin and similar currencies use a public ledger to verify that each person sending funds actually has such funds in their account and have not sent it to another user previously. Since CryptoNote currencies are anonymous, the network must confirm the validity of transactions in another way.
CryptoNote solved this problem by using more sophisticated scheme instead of usual ring signature: traceable ring signature. The algorithm originally proposed by Fujisaki and Suzuki in 2007 allows to trace the sender of two different messages if they contain the same tag and signed by the same private key.
CryptoNote authors slightly simplified the scheme, replacing tag with key image and discarding the traceability property. They called their algorithm one-time ring signature, "stressing the user?s capability to produce only one valid signature under his private key". Two different signatures under the same key (a double spend attempt) can be easily linked together, and only one will be stored in the blockchain.
