Auto translated rows in italics
- Timestamp network and NTP servers obtained, transaction IDs will UUID + public key
- Nodes need be connected to 60% of all the nodes registered in the latest signed blocks
- customers to be connected only require 10% of those nodes
- Los blocks are linked to timestamp. Transactions placed by customers that are out of time nodes are rejected by those who try to
- send.Transfers of nodes that are out of season are rejected
- As the end of a minute (55 seconds) new transactions are sent to the next block
- A block is closed permanently when 60% of recent nodes have signed
- to approve spending the sender signs his private key and then the operation sends
- nodes always sign not detect double spending. If you reject the entire block detected sending a signed rejection operation. If 60% of the nodes reject what is considered totally rejected.
- Serious duplication is detected an address that has spent more than it has, for this reason requires connection to 60% of the nodes, to distribute any operation quickly sign and either approved orrejected.
- Nodes earn their right to sign if they collaborate with computing power. This power is measured by the solutions to such problems boinc. They must be working at least average minus one standard deviation of units produced.
- Distributed storage also collaborate with.
- Storage blocks must have gone through three random points and all three must have indicated that if they did the operation to the node that gave the block receives a point.
- Among more have more percentage points receives
- prize.Prize is divided between all nodes that signed based on the points they have. When a node reaches no sign, then subtract 10% of your
- points.Prize of 50CLC per block will
- be a maximum of 1000 million CLC, divisible to 8 decimal places starting
- public and private keys will be the same type as bitcoin or 4096-bit RSA with GPG.
- A node anyone can place a block to store data on the network at no cost. Consuming this chunk has a cost.
- The cost of consuming data blocks must be paid to CLC, and the node must be paid upon request. If the node has the block on your own hardware then it must pay to consume, encouraging nodes have much storage.
- A node anyone can place a block of data to solve and the "kernel" to solve it. It should offer a commission for solving your data block. The data block must be decided by at least 60% of recent nodes. This data block should take about 1 minute to be resolved by 60% of the nodes. If any difficulty is rejected by the network and must resubmit your respective commission. The commission collects the first block until a block with sufficient difficulty. If the block takes too long to resolve, it is rejected and must resubmit the same way that if it takes little.
- "Kernel" must be compiled specifically for a sandbox machine nodes, similar to boinc, to prevent install virus or something.
- calculation results are not published on the network until it reaches the 60% rule. Meanwhile each node publish a hash of the result and its public key. When it reaches the 60% rule calculation results will be posted on the network, signed by the nodes they solved. The result is not encrypted, so that all nodes can check the other nodes that the correct result obtained by comparing the public key hash and published.
- If no data blocks are sent to solve similar to hash and litecoin bitcoin work to the cpu and Sending
- gpu.results computation blocks or data nodes must attach signatures for transactions that block.
- There can be a block of monetary transactions not bring proof of employment, and hash is requested calculations or data blocks or served as a source.
- The storage is designed to provide video-streaming. To open the option to have customized PVRs that brings TV, series and movies, open and for pay (with CLCs), to remove the monopoly of the TV companies.