 I'm happily visiting the Shanghai event to present two works during lunchtime sessions. So the first work we already have presented just one week ago in New York during the real world crypto event is a joint work with Leonid Reisen of Boston University and our another guy, Dmitry Meshkov named improving authenticated dynamic dictionaries with applications to crypto currents and this is about solving some hard problems in the area of scalability of the blockchain. So hopefully we can solve some issues with our improved authenticated data structures. Another work I will present during lunchtime tomorrow is about a hybrid proof of work proof of stake protocol named twins chain. This is the joint work with Professor Honkshenk of Virginia Commonwealth University and his student Leifan of Jantun University and Tuyet Donk of Virginia Commonwealth University. The main motivation of the work is to secure major blockchain against an adversarial majority of mining power by using proof of stake company. So first we have already major blockchain with a stake distribution, hopefully honest and then we use proof of stake component to secure the blockchain against majority of adversarial mining power. Just after this event I am hopefully releasing the new major release of SCOREX, SCOREX 2.0 so it's 95% ready so the code is mostly done and the documentation is also 90% ready so it will be released in coming weeks and this is like rewrite of the SCOREX so no much in common with the previous major version so it's completely new work and I would be happy to present it soon. So it's totally different architecture and now it supports a broad range of designs so not only blockchains but three structures and more complex structures of history in a well now not a blockchain but a block somewhat system and it is also about a better support of hybrid systems like proof of work proof of stake so our reference twins chain implementation is done on top of SCOREX 2.0 and well it was done very efficiently so hopefully it would be a good example of how SCOREX 2.0 is useful in fast port typing. The idea of our work on improving authenticated dynamic dictionaries is in the first place to develop data structure working in two-party model so usually most of work in authenticated data structures is using three-party model where we have some trusted broker and we don't have any trusted broker and cryptocurrency so we have only Prover and Verifier and Prover which is a miner is generating proofs and then Verifier is able to get a new root hash from just proofs so without holding the whole data structure and also we spend a lot of time counting each byte in our proofs so you know the space is very limited in the blockchain so we produced a lot of efforts to compress our proofs and we made a new kind of compression so batch compression when we are combining multiple proofs into a single batch proofs so this is about a significant improvement much better than you can do with just simple j-z-pink of proofs or well whatever compression. The main application we intended our work for is to authenticate the whole state of cryptocurrency because well other solutions are whether inefficient or just not suitable for cryptocurrency to authenticate the whole state so our solution is dynamic so authenticated data structure is modifiable and yeah it works in two-party model and proof length is optimal and also yeah we made further improvements with the help of batching compression so for a cryptocurrency setting well this is probably the best solution we can think about at the moment for example in bitcoin this is about a set of unspent outputs so a state is something enough to validate an arbitrary transaction and yeah nothing more so some nodes can store also some specific information but we are talking about some well minimal state every full node in a cryptocurrency network nodes in order to validate an arbitrary transaction.