- Problem
- Goal
- Options to get there
- Back of the envelop estimations
- Potential Users
- Exploration
- Change CommR hash/MT/VC
- Meetings

# Problem

We want to express computation over data in Filecoin in a veriable manner. However, data is encoded in a merkle tree using SHA256 which is not convenient to work inside a verifiable computation framework.

# Goal

Express verifiable computations over data in Filecoin in an efficient way.

→ Expressing the data using a new hash function or vector commitment over which we can easily run some computation over in a verifiable way.

Example: Anemoi or Poseidon hash function.

# Options to get there

‣

‣

‣

**Option 3: Create a new CommD’ separate from commD**

Option 3 wins.

### Back of the envelop estimations

```
Cost of 2-1 SHA256: 40k
Cost of 1 MT opening: 400k
Cost of 3k openings: 1.2B
-> With Snarkpack: 512 proofs each of 2.3M constraints
-> n
```

# Potential Users

Lurk Usage of Easy CommD# Exploration

## Change CommR hash/MT/VC

Create new types of proof that create (& update existing) commR using new hash/MT/VC**Idea:**Get way faster snark proving for porep and wpost (and winning post)**Pros:****Cons:**because requires change in proofs / Filecoin core (wpost have to use this new proof system now)**Hard**