Transcend Vault #62
Envoy-VC
started this conversation in
Show and tell
Replies: 1 comment 2 replies
-
Congratulations @Envoy-VC!!! You won one of our tinybio bounties. Can you confirm that the ETH address you provided is correct so we can send your prize: 0xBF4979305B43B0eB5Bb6a5C67ffB89408803d3e1 tinydemo winners announcement tweet: https://x.com/nillionnetwork/status/1820606184895947087 |
Beta Was this translation helpful? Give feedback.
2 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Show and tell project type
Builder Bounty Submission
Github Repo Link
https://github.com/Envoy-VC/transcend-nillion
Video Walkthough Link
https://www.youtube.com/watch?v=m1_AWJ8iMpY
Project Description
Transcend Vault is a Multi-Peer Secrets Vault which is gated by a secure Multi-Party Computation (MPC) based Biometric Authentication System.
It uses Nillion for Blind Computation of matching and finding Euclidean Similarity between Face Descriptors.
Peer to Peer Network is established using libp2p and OrbitDB for storing the data over a P2P Database.
What problems does your project solve? How does it preserve privacy for users?
Secure Vault Storage
The projects acts as a secure multi-peer vault, so it can be used by organizations for secrets storage and retrieval in workflows. Multi-peer is possible using
Libp2p
andOrbitDB
which help in P2P Communication and Database Syncing.Multi-party Biometric Authentication
The entire Vault is gated by a secure MPC based Biometric Authentication carried out by computing similarity between Face Descriptors blindly.
How does the project use Nillion? Describe and link to any Nada programs
euclidean_distance
between two sets of face descriptors.Here is the basic Logic for the program that calculates
euclidean_distance
Also
sqrt
is calculated using Iterative Newton's Method for Square Root till 12 Iterations.When we calculate Face Descriptor we get a
128
sizeFloatArray
, but as floats are not supported in nada we multiply each value by 1000 and round it off. so now all values are in range(0,1000]
.Entire Nada Program can be found at: https://github.com/Envoy-VC/transcend-nillion/blob/main/packages/programs/src/main.py
Is there anything else you want to share?
For
sqrt
function if I increase the iterations to above 14, it takes long time to build the program, not sure why?Optional - Link your project and team members' social handles
https://twitter.com/Envoy_1084
Optional - Team ETH Address(es)
0xBF4979305B43B0eB5Bb6a5C67ffB89408803d3e1
Beta Was this translation helpful? Give feedback.
All reactions