PrivyCal

Screenshots

Problem Statement

Consider two parties who want to meet in the near future. The traditional procedures to book a common timeslot involves sharing your entire calendar to either Google or the other party. PrivyCal solves this problem by allowing you to blindly compute the common time slots, without needing to share calendars with anyone!

Solution

PrivyCal uses Nillion's blind computation to compute the intersection of the available slots of the two parties and reveals the result to both of them. We use Chakra-UI for the frontend, a simple node signalling server to allow parties to discover each other, and write the computation logic in Nillion's Nada language.