Provable, not hoped
Personal AI agents negotiate for owners with conflicting, private interests. Parley makes it provable that none of them was betrayed, without any owner exposing a single private preference.
Five delegates, five private sheets. One shared decision,verified, none of the sheets revealed.
Most agent tooling solves transport (A2A, MCP), one-to-one agentic commerce, or cooperative debate between agents that already share one owner.
Parley solves a different gap: delegates of different, conflicting, private owners reaching a decisionnone of them can rig, and proving it.
Hard constraints written as code predicates. A crossed red line rejects an option outright. It is never negotiated away as soft utility.
preferences.pyThe coordinator sees only an acceptable or red-line verdict and a soft score. Never the private sheet, and never which constraint was crossed.
agent.pyAmong options feasible for everyone, lift the least-happy participant, tie-broken by total welfare. No feasible option means an honest deadlock, never a forced decision.
consensus.pyA SHA-256 hash over the canonical, masked record. Each owner replays their own private sheet locally to confirm no red line was crossed, without revealing it.
transcript.pyThe tape below is the real transcript format the engine produces, replayed from a sample run. Every verdict is recorded masked, hashed, and independently replayable by each owner against their own private sheet.
sample transcript · replayed from meeting-042 · hover to pause
Multilateral (more than two owners),no cryptocurrency,self-hosted,auditable. Not single-owner orchestration like AutoGen or CrewAI. Not bilateral on-chain commerce like Fetch.ai or Olas.