Algorithms

Algorithms in TIG are specialized pieces of code (currently written in Rust and compiled to WebAssembly) that solve computational problems like boolean satisfiability, vehicle routing, and knapsack problems. These algorithms are contributed by Innovators who can either optimize existing algorithms or create entirely new ones to improve solution efficiency for TIG's proof-of-work challenges. Benchmarkers then select and execute these algorithms to compute solutions, with their choice typically based on the algorithm's performance and their strategy to minimize imbalance across different challenges.

The adoption rate of an algorithm (how frequently it's used by Benchmarkers) determines the rewards its creator (Innovator) receives, creating a direct incentive for algorithmic innovation. Algorithms must implement a 'solve_challenge' function and operate within TIG's deterministic execution environment, which tracks fuel consumption and ensures consistent behavior across different systems. Through this mechanism, TIG effectively creates a competitive marketplace for algorithmic innovation, where better-performing algorithms naturally gain more adoption and generate more rewards for their creators.