Submit research

Every submit locks 2.5 HOOTi on-chain as bounty. Distributed nodes pick up branches and reveal results; the winning fork claims the escrow. No drafts — the form posts straight to the chain.

topic required · 0/500 What should the network research? Be specific — concrete prompts converge much faster than abstract ones. mode How the network attacks the problem. Default autoresearch runs N branches in parallel and picks the best — good for most tasks. research cost ⊙ HOOTi · computed 0.5 base + 0.1 × branches × iter. Pays the executor node 92%, platform 3%, burn 5%.

2.50 ⊙ HOOTi

branches 1–20 How many parallel branches explore the space simultaneously. More = better odds, more cost. iter / branch 1–200 How many refinement steps each branch performs. Higher = more polish per branch, proportionally more compute. dataset CID optional · IPFS CID for training data Optional. Pin a dataset on IPFS first, then paste its CID here. Skip to let the executor source its own.

allow serial branches when network has fewer active nodes than branches