TERA smart money Decentralized Blockchain with a bandwidth of 250TPS at the moment in the work network. Until the end of the year, we will increase the network throughput to 1000TPS and further according to the Roadmap.
Mining only on the CPU. With protection from GPU and Asic.
The new algorithm uses precessor and memory without overloading them while maintaining the best balance.
At the moment, smart contracts are being developed and by the end of September we will see smart contracts for TERA smart money.
Next, the developer will start developing Dapps and we will see the first decentralized applications.
Join the project, to Mining, there is a place for everyone who believes in the decentralization and future of digital payments on the blockchain
Road mapSmart-contracts – September, 2018
Decentralized messenger – October, 2018
Decentralized stock exchange – Q4 2018
Android/iOS Wallets – Q1 2019
Internal voting system – Q1 2019
Sharding and increase in transaction speed to 1 million per second – Q2 2019
SpecificationName: TERA
Consensus: PoW
Algorithm: Terahash (sha3 + GPU resistent hashing)
Max emission: 1 Bln (TERA)
Reward for block: 1-20 coins, depends on miner power (one billionth of the remainder of undistributed amount of coins and multiplied by the hundredth part of the square of the logarithm of the network power)
Block size 120 KB
Premine: 5%
Development fund: 1% of the mining amount
Block generation time: 1 second
Block confirmation time: 8 seconds
Speed: from 1000 transactions per second
Commission: free of charge
Additional data:Cryptography: sha3, secp256k1
Protection against DDoS: PoW (hash calculation)
Platform: Node.JS
Wallets (src only): Windows, MacOS, Linux
Network launch: 01.07.2018 12:0:0 (UTC)
Mining launch: UTC "2018-07-24T15:33:20"
Type mining: CPU only
LINKSANN TERA smart money https://bitcointalk.org/index.php?topic=4573801.0GitHub:
https://github.com/terafoundation/walletTwitter:
https://twitter.com/terafoundationDiscord:
https://discord.gg/CvwrbeGTelegram:
https://t.me/TERA_Foundation
