Challenges
Challenges in TIG are carefully selected computational problems that form the foundation of its optimizable proof-of-work (OPoW) system. Each challenge represents an "asymmetric" problem – computationally intensive to solve but straightforward to verify – drawn from critical scientific and technological domains like boolean satisfiability, vehicle routing, and knapsack optimization. Challenges serve as the backbone of TIG's incentive structure, where Benchmarkers compete to find solutions at various difficulty levels while balancing their computational efforts across multiple challenges. Each challenge generates deterministic instances based on seeds and difficulty parameters, with solutions being verified through both complete and probabilistic mechanisms to ensure network efficiency. The system employs innovative mechanisms like Pareto frontiers to dynamically value solutions of different difficulties, and solution signature thresholds to regulate network verification load. Through a planned scientific committee, TIG will progressively introduce new challenges from diverse fields including artificial intelligence, biology, medicine, and climate science, ultimately directing computational resources toward solving real-world scientific problems. This structured approach to challenge selection and management ensures that TIG's proof-of-work system remains both computationally meaningful and economically sustainable, while maintaining decentralization through mechanisms that prevent any single challenge from dominating the network's resources toward solving real-world scientific problems. This structured approach to challenge selection and management ensures that TIG's proof-of-work system remains both computationally meaningful and economically sustainable, while maintaining decentralization through mechanisms that prevent any single challenge from dominating the network's resources.
c001: Boolean Satisfiability
Boolean satisfiability (SAT) is a fundamental problem in computer science and mathematics. It involves determining whether a given logical expression can be satisfied, meaning there exists an assignment of truth values to the variables that makes the expression true. SAT is a key problem in the field of computational complexity and has numerous applications in areas such as artificial intelligence, cryptography, and operations research.
c002: Vehicle Routing
Vehicle routing is a problem in combinatorial optimization that involves finding the shortest route for a fleet of vehicles to deliver goods or services to multiple locations. It is a classic optimization problem that has applications in logistics, transportation, and supply chain management.
c003: Knapsack Optimization
The knapsack problem is a classic optimization problem in computer science and mathematics. It involves selecting a subset of items from a given set of items, each with a weight and a value, such that the total weight of the selected items is less than or equal to a given capacity, while maximizing the total value of the selected items. The knapsack problem has applications in various fields, including resource allocation, logistics, and economics.
c004: Vector Search
Vector search is a problem in computer science that involves finding the closest match to a query vector in a large dataset of vectors. It is a key problem in the field of information retrieval and has applications in areas such as natural language processing, computer vision, and recommendation systems.