From 387649d66fa40b69dfb4e5ed1aada5fc4a65ec31 Mon Sep 17 00:00:00 2001
From: fria <138676274+friadev@users.noreply.github.com>
Date: Sun, 29 Jun 2025 07:31:16 -0500
Subject: [PATCH] add fairplay

---
 blog/posts/multi-party-computation.md | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/blog/posts/multi-party-computation.md b/blog/posts/multi-party-computation.md
index 1c88bb43..02a3d937 100644
--- a/blog/posts/multi-party-computation.md
+++ b/blog/posts/multi-party-computation.md
@@ -94,6 +94,14 @@ The BGW protocol doesn't require as much communication between parties, partly t
 
 Additionally, it doesn't require Oblivious Transfer or zero-knowledge proofs. Its use of Shamir's secret sharing and error correction codes instead provides the same properties in a more efficient way.
 
+### Fairplay
+
+The field was further advanced by the introduction of the [Fairplay](https://www.cs.huji.ac.il/w~noam/FairplayMP.pdf) system.
+
+Up until this paper, MPC was limited to boolean circuits or arithmetic circuits: not exactly friendly if you're a programmer that's used to using higher level languages. Fairplay introduces a compiler, SFDL, which can compile higher level languages to boolean circuits and then securely computes the circuit.
+
+Fairplay also brings some advancements in efficiency. It utilizes constant rounds, with a fixed 8 rounds, reducing the communication overhead. It also uses the free XOR technique so that encryption operations don't have to be performed on XOR gates, improving efficiency.
+
 ### Real-World Usage
 
 As MPC saw gradual optimizations and improvements, it grew from an interesting thought experiment to something that could have real-world uses.