This is the new DijkstraCoin thread
DijkstraCoin
DijkstraCoin (Dijkstra) is a new digitally encrypted currency, which adopts a typical algorithm of shortest path, to calculate the shortest path from node to node.
The characteristics of the network expands from the centre outwards, layer by layer, until it reaches the end.
CPU + GPU mining model ensures equal distribution of benefits of the miners, and to bring in recognition algorithms will effectively prevent automated mining pool access, Combining POW + POS technologies, and utilising the method of acquired stake in the equity allocation will ensure sustainable earnings. Dijkstra algorithm, with its efficient calculating ability, expedites P2P transactions, and achieves instant money transfer. That said, it brings more benefits when it’s for the commercial use.
Specifications
Total coins: 840 million
PoW Algorithm: Scrypt+Dijkstra
CPU/GPU mining
PoW Total blocks: 60,000
PoW Max coins: 0-30,000block 8,000DKC
30,000-50,000block 5,000DKC
50,000-60,000block 3,000DKC
Block Target: 30 seconds
Difficulty Retar2etting: 10 Every blo5PoW ends 21 days from launch.
PoW + PoS
PoS variable interests: 1 year: 30% 2 year: 20% 3 year: 10% 4~ year: 5%
NO IPO
RPC 22515
P2P 22516
ABOUT 1.2% Premine
we're sincerely sorry for our late response since we were stepping up the latest beta test of DijKstra algorithm!
Though our post wasn't finished, we're still appreciative of the concerns from our community.
The preserved coins are going to be spent on the promotions, advertising and application development of Dijkstracoin, and we'll make every spend transparent when a viewable link is available.
We'll begin to recruit community members to join us after our official release, and will found a DKC Foundation,
to mutually manage for the further development of Dijkstracoin officially released will recruit community members to join us, the establishment of DKC Foundation, co-management, in order to promote the further development DijKstracoin.
Thank you for all the attention, and we'll keep up the good work!
ABOUT DIJKSTRA
Dijkstra's algorithm, conceived by computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the single-source shortest path problem for a graph with non-negative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms.
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra's algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path algorithm is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
Dijkstra's original algorithm does not use a min-priority queue and runs in time
http://upload.wikimedia.org/math/1/7/5/17589e5af2a8e3d48c486d30939c1268.png (where
http://upload.wikimedia.org/math/7/4/f/74fcb594bdd93c0f956682ae1ea013e6.png is the number of vertices). The idea of this algorithm is also given in (Leyzorek et al. 1957). The implementation based on a min-priority queue implemented by a Fibonacci heap and running in
http://upload.wikimedia.org/math/8/a/f/8afcf9cf1e69f85b094063fd7b9e15cb.png (where
http://upload.wikimedia.org/math/c/b/d/cbdcf0e203060323ebcd0079f280f4b8.png is the number of edges) is due to (Fredman & Tarjan 1984). This is asymptotically the fastest known single-source shortest-path algorithm for arbitrary directed graphs with unbounded non-negative weights.
http://upload.wikimedia.org/wikipedia/commons/5/57/Dijkstra_Animation.gifWebsitesWebsite:
http://www.dijkstracoin.comTwitter:
https://twitter.com/DijKstraCoinDownloads★ Github:
https://github.com/Dijkstracoin/dijkstracoin ★ Windows Wallet:
https://mega.co.nz/#!ctl0WT7Y!61Vm1lmXmq_N-dMIl2YCA8i-bz7YildrXGRq-Fs-PGM★ Mac Wallet:https://mega.co.nz/#!s5sz2AjZ!6C-v0F5xcGncB31WDUelzR785OVwbfNjELw_IW1WH2A
★ Linux Wallet:
https://mega.co.nz/#!t1syAaRT!ajqODSzlhvL3CKFzpzN3oJ2q_HBPXQGF1QdIFX4DSak★ Android wallet
★ ios wallet
★ Source Code:
Block ExplorersMining PoolsExchangesUpdate July 16：Mac Wallet:https://mega.co.nz/#!s5sz2AjZ!6C-v0F5xcGncB31WDUelzR785OVwbfNjELw_IW1WH2A
Recent working plan arrangement:
1, MAC wallet is under development, it will release soon
2, Android wallet development is in schedule
3, Develop the common transaction API
4, Post a reward for IOS wallet development
5, Contact with Mintpal, bittrex, cryptsy, poloniex, hope to provide transaction of DKC
About the Dijkstra Algorithm:
Recently we have been working on the latest wallet and application of Dijkstracoin and failed to respond to community questions, we feel very sorry! A lot of friends put forward their questions on Algorithm of POW part in the DKC, Dijkstracoin Scrypt algorithm is used in the POW part of Dijkstracoin, recently POW allocation will come to an end.We are positively testing the convenience in transaction of Dijkstra to improve the transfer speed, it will be beneficial to the development of the late application!If there is any question, you can download the wallet to test Dijkstracoin transfer speed, thank you for your support.
DKC:DTzL7c4fbVJ8hq7yWgzWgUonTcc5GUdB3R Email:dijkstracoin@gmail.com
