COINjecture/v5

COINjecture NP Solutions v5数据集包含从COINjecture Network B区块链实时挖掘的NP-hard问题的解决方案。不同于传统的工作量证明（Proof-of-Work）浪费计算能源，COINjecture实现了有用工作量证明（Proof-of-Useful-Work, PoUW），每个哈希计算都用于解决具有计算意义的问题。数据集涵盖了多种NP-hard问题类型，包括子集和问题（Subset Sum）、布尔可满足性问题（Boolean Satisfiability, SAT）、旅行商问题（Traveling Salesman Problem, TSP）以及用户提交的自定义问题。数据集还包含了详细的解决方案数据、区块信息、计算复杂度、奖励金额、解决和验证时间、能源效率比等字段。此外，数据集支持实时更新，适用于机器学习、密码学和分布式系统等领域的研究。

The COINjecture NP Solutions v5 dataset contains real-time solutions to NP-hard problems mined from the COINjecture Network B blockchain. Unlike traditional Proof-of-Work that wastes computational energy, COINjecture implements Proof-of-Useful-Work (PoUW) — every hash contributes to solving computationally significant problems. The dataset includes various NP-hard problem types such as Subset Sum, Boolean Satisfiability (SAT), Traveling Salesman Problem (TSP), and Custom Problems submitted by users. It also provides detailed solution data, block information, computational complexity, bounty amounts, solve and verify times, energy efficiency ratios, and more. The dataset is updated in real-time and is suitable for research in machine learning, cryptography, and distributed systems.