Metaheuristic search strategies have proven their effectiveness against man-made solutions in various contexts. They are generally effective in local search area exploitation, and their overall performance is largely impacted by the balance between exploration and exploitation. Recent developments in parallel local search explore methods to take advantage of the efficient local exploitation of searches and reach impressive results. This however restricts the scaling potential to nodes within a private, trusted computer cluster. In this research we propose a novel blockchain protocol that allows parallel local search to scale to untrusted and anonymous computational nodes. The protocol introduces publicly verifiable performance evaluation of the local optima reported by each node, creating a competitive environment between the local searches. That is strengthened with economical stimuli for producing good solutions, that provide coordination between the nodes, as every node tries to explore different sections of the search space to beat their competition.

中文翻译：

---

用于有效分布式算法发现的去信任并行本地搜索

元启发式搜索策略已经证明了它们在各种情况下对人为解决方案的有效性。它们在局部搜索区域开发中通常是有效的，其整体性能在很大程度上受探索和开发之间的平衡影响。并行本地搜索的最新发展探索了利用搜索的有效本地开发并获得令人印象深刻的结果的方法。然而，这将扩展潜力限制在私有的、受信任的计算机集群中的节点上。在这项研究中，我们提出了一种新的区块链协议，允许并行本地搜索扩展到不受信任和匿名的计算节点。该协议引入了对每个节点报告的局部最优的可公开验证的性能评估，在局部搜索之间创造了一个竞争环境。