资 源 简 介
State of the Project (Current Version: PRE ALPHA)
Package
jkadx.hashCollisionFinder.*
* Finished
* Create SHA-1 hash from input key.
* Find collisions (brute force)
* Works over LAN and WAN using DHT for communication
* Works within a distributed computing network
* Ability for the server node to also share the workload
* Unfinished
* Robust method to handle possible udp packet loss (without reinventing tcp)
* Utilize n-number of cores on each node (probelmatic)
jkadx.dht.*
* Finished
* Add new nodes in the correct K-Bucket
* Update existing contact"s position in its K-Bucket"s list
* Keep each K-Bucket"s list of nodes in order of most recently seen
* Handle a change in a node"s socket address due to changing dynamic IP addresses
* replace unresponsive contacts with new ones
* Find the closest `K` number of nodes to a target node
* 160-bit NodeIDs (represented internal
