---
# System prepended metadata

title: Paper plan and work schedule

---

# Paper plan and work schedule

- Task and overview: general polycommit and then application to polynomial relationships, so also polynomial evaluation. Assigned: AV
- Polynomial commitment scheme: formalization, no-ZK, threat model. Use previous paper, just formalize. Assigned: Akis
- Relaxed (list-decoding) polynomial commitment scheme (for witness polynomials). Assigned: Akis
- Polynomial evaluation scheme: 
    - Rationale (copy from overview, may be just skip). Assigned: KP
    - Threat model. Assigned: Akis
    - Correctness proof. Assigned: KP
    - Instantiation (decode all poly in the list or take a random point). Assigned: KP
    - Security proof if one takes a random point based on the root of committed LDE of the polynomial (non-interactive setup). Assigned: Akis
    - Change the "commitment" for polynomial evaluation from the original LDE of F(x) to the tree of (F(x) - F(z))/(x-z). (More an optimization) Assigned: ?
- Demonstration and soundness analysis for concrete proof system (PLONK). Assigned: KP
- Optimization techniques: batching, multipoint opening. Assigned: KP
- Describe instantiation: Blake2s + 252 bit field
- Benchmarks. Assigned: AV
    - Commitment (unique decoding), time + proof size
    - Relaxed commitment(list decoding), proof size  
    - Evaluation scheme, time + proof size
    - Batch openings, time + proof size
- Benchmark for PLONK. Assigned: AV
