Into:CliqueAI

//What is CliqueAI

CliqueAI is a Bittensor subnet (SN83) that distributes maximum clique problems across a network of AI-powered miners. The maximum clique problem asks: given a graph (a network of connected nodes), what is the largest group of nodes where every pair is directly connected? It's a classic NP-hard problem with applications in drug discovery, network analysis, and social network mapping.

The simple version: It's like a decentralized competition where miners race to find the densest connected cluster in a complex network of relationships. Harder and larger graphs are worth more.

Centralized equivalent: No direct single-platform equivalent. Similar compute problems are typically solved by academic supercomputers or specialized research tools.

How it works:

• Miners receive graph problems, apply AI algorithms to find the maximum clique, and submit solutions with both the result and the methodology
• Validators score submissions using a dual-metric system that rewards both solution optimality and algorithmic diversity

//Why This Matters

• The problem it solves: Maximum clique and related graph optimization problems are computationally expensive and difficult to parallelize on centralized infrastructure. A distributed network of specialized miners can tackle more variety simultaneously.
• The opportunity: Applications span bioinformatics (identifying protein interaction clusters), fraud detection (finding tightly connected fraud rings), and social network analysis.
• The Bittensor advantage: Rewarding both optimality and diversity of approach encourages genuinely different algorithmic strategies, rather than convergence on a single method.
• Traction signals: 245 active miners, making it one of the more populated subnets. Price is up 8.7% over 7 days and 34.6% over 90 days. Net buy volume of 30.6 TAO over 24 hours.