Reading Privacy Preserving Computation White Pater - how many THREEs

PlatON Global General
#1

Three years: [2021 - 2018 = 3] THREE years passed when first version of white paper published

Three main problems to solve: [Privacy, storage, key management] another THREE ( I had a feeling… the third one has relationship with first one :wink:

this article covers [ algorithm, On-Chain Capabilities, Off-Chain service], THREE again

The privacy of [transfer amount, anonymity of payer and payee, business logic], THREE again :wink:

How many THREEs you can find ( i can tell u there are more) ? give a shot :slight_smile:

PlatON Privacy-Preserving Computation White Paper | Part 1. Overall Framework

6 个赞
#2

A three-layer network is considered in PlatON 2.0

  1. Consensus Layer
  2. Privacy-Preserving Computation Network
  3. Collaborative AI Network
1 个赞
#3

In part II, the Primitives

THREE primitives surrounding ZKP

  1. Elliptic-curve
  2. Hash Functions - arithmetic circuits based ZKP friendly Hash Functions
  3. polynomial commitment - KZG polynomial commitment recommended

https://platon-network.medium.com/platon-privacy-preserving-computation-white-paper-part-2-algorithms-b6370b506389

1 个赞
#4

in part II Verifible computation - ZK-SNARKs

THREE consideration dimensions

  1. proving time (resources, duration)
  2. proof size
  3. verification time
1 个赞
#5

in part II, THREE typical algorithms of ZK-SNARKs

  1. Plonk
  2. Marlin (samiliar familiy like Plonk)
  3. GKR-based algorithms
1 个赞
#6

in part II, Performance - Recursive ZKPs

  1. ZKP Composition
  2. Incrementally-Verifiable Computation
  3. Proof-Carrying Data
1 个赞
#7

in part II, Accumulators - one-way membership hash function

  1. Vector commitment - heavily rely on polynomial commitment
  2. pointproofs - a new and efficient candidate for vector commitment
  3. Merkle/verkle tree - combination of vector commitment and Merkle tree
1 个赞