# Few Thoughts about Summa
## Summa - Proof of solvency with Halo2.

Hope these help you to preparing your presentation

### Common Things We discussed before
- We named the project as ‘Summa’ in [https://github.com/summa-dev](https://github.com/summa-dev?type=source)
- 'Summa' originated the name of the person who invented the double-bookkeeping system
- There are two approaches in PSE PoS
- Merkle Sum Tree with using Halo2 <- currently focusing
- Look up table with using polynomial commitment, also base on Halo2
- We are building proof-of-solvency systems that consist of modulized components. At least we should make it easier to integrate with Exhcnages system.
- The project must prioritize the privacy of user data and data of centralized exchanges.
- this is also to be scalable for a large number of users.

### Few Thoughts
- this project is not type that is ready-to-use for Exchanges, but we have to design it to fit their needs at least.
- Each circuit in PoS should be designed to be modular, which means that a developer can easily integrate it into their system(on Exchange) or replace it as needed.
- (personally) the overflow check circuit should be for both the Merkle sum tree approach and the polynomial commitment approach.(the second approache)