{"component":{"type":17,"accent_color":10660273,"components":[{"type":10,"content":"-# WikiRNG · Roll of 11/20/2026 · by [Marovic](https://wikirng.com/u/Marovic)"},{"type":10,"content":"## [Parity benchmark](https://wikirng.com/roll/AEO4S8)"},{"type":10,"content":">>> Parity problems are widely used as benchmark problems in genetic programming but inherited from the artificial neural network community. Parity is calculated by summing all the binary inputs and reporting if the sum is odd or even. This is considered…"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"### ⬜ Basic · 33,469 SP\n-# Bottom 39%"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"🟦 🤷 **Notability?** · Obscure · +12,927 SP\n-# Tagged as maybe not notable.\n🟩 🧯 **Multiple Issues** · Notable · +5,495 SP\n-# Has the multiple issues box.\n🟩 🪜 **Part of a Series** · Notable · +3,604 SP\n-# Has a series sidebar.\n🟩 🕶️ **Anonymous** · Notable · +3,128 SP\n-# Created by someone who wasn't logged in.\n🟩 😏 **Nice ID** · Notable · +1,514 SP\n-# Page ID contains \"69\".\n🟩 🐣 **Stub-Sized** · Notable · +1,199 SP\n-# Under 1,000 bytes.\n-# +13 more badges"},{"type":14,"divider":true,"spacing":1},{"type":1,"components":[{"type":2,"style":5,"label":"View roll","url":"https://wikirng.com/roll/AEO4S8"},{"type":2,"style":5,"label":"Read on Wikipedia","url":"https://en.wikipedia.org/wiki/Parity_benchmark"}]},{"type":10,"content":"-# Article text from Wikipedia, CC BY-SA 4.0"}]}}