Graphite is a decentralized network for solving graph optimization problems, currently specializing in the Traveling Salesman Problem (TSP)—a classic challenge where complexity grows exponentially with nodes. Miners compete to find optimal routes using their own algorithms while validators generate synthetic problems and score solutions. The platform supports both coordinate inputs for undirected graphs and edge inputs for directed graphs.
This subnet is currently safe from deregistration.
Yuma Pulse™
Graph Optimization
Decentralized solving of NP-hard graph problems starting with TSP, with plans to expand to broader optimization
Flexible Input Methods
Support for coordinate-based undirected graphs and edge-based directed graphs to match different problem types
Algorithm Competition
Miners develop and compete with their own optimization algorithms to find shortest routes and best solutions
Synthetic Validation
Validators generate diverse graph problems and evaluate solution quality against known optimums