# Notes on private solving using MPC

**URL:** <https://forum.anoma.net/t/notes-on-private-solving-using-mpc/770>\
**Category:** Protocol Design\
**Created:** [September 17, 2024, 7:14pm UTC](https://forum.anoma.net/t/notes-on-private-solving-using-mpc/770 "2024-09-17T19:14:00Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![burcuyy](https://avatars.discourse-cdn.com/v4/letter/b/46a35a/32.png) [@burcuyy](https://forum.anoma.net/u/burcuyy)\
**Post date:** [September 17, 2024, 7:14pm UTC](https://forum.anoma.net/t/notes-on-private-solving-using-mpc/770/1 "2024-09-17T19:14:01Z")

</div>

Since privacy of users shouldn’t be compromised for solving purposes, we need a way of performing private solving. MPC offers a potential solution to this with guarantees relying on cryptography. I investigated how we can do this during my internship. I wanted to collect some of related discussion and ideas I had about private solving using MPC in a report. The report is available [here](https://www.overleaf.com/read/ggccswgrmdwz#01059d). It didn’t receive any reviews. Any feedback or further ideas are welcome.

Some of related discussion started in the [forum discussion](https://forum.anoma.net/t/private-solving-using-mpc/599). I ended up focusing hash function choice of Taiga. I compared Poseidon and another hash function Hydra for their MPC and ZK efficiencies. It is now available as an [ART report](https://zenodo.org/records/13739511).