Dynamic Merkle B-tree with Efficient Proofs

We propose and define a recursive Merkle structure with q-mercurial commitments, in order to create a concise B-Merkle tree. This Merkle B-Tree builds on previous work of q-ary Merkle trees which use concise, constant size, q-mercurial commitments for intranode proofs. Although these q-ary trees reduce the branching factor and height, they still have their heights based on the key length, and are forced to fixed heights. Instead of basing nodes on q-ary prefix trees, the B Merkle Tree incorporates concise intranode commitments within a self-balancing tree. The tree is based on the ordering of elements, which requires extra information to determine element placement, but it enables significantly smaller proof sizes.

This allows for much lower tree heights (directed by the order of elements, not the size of the key), and therefore creates smaller and more efficient proofs and operations. Additionally, the B Merkle Tree is defined with subset queries that feature similar communication costs to non-membership proofs. Our scheme has the potential to benefit outsourced database models, like blockchain, which use authenticated data structures and database indices to ensure immutability and integrity of data. We present potential applications in key-value stores, relational databases, and, in part, Merkle forests.

ipfs://bafybeifhknwyco5dlxbss6unmxobxwir47aswwqgmh55y2uxsceyp3ucwm

@misc{SR20,
 archiveprefix = {arXiv},
 author = {Chase Smith and Alex Rusnak},
 ckdateadded = {2020-06-11 10:53:38},
 eprint = {2006.01994},
 primaryclass = {cs.CR},
 note = {\url{ipfs://bafybeifhknwyco5dlxbss6unmxobxwir47aswwqgmh55y2uxsceyp3ucwm}},
 title = {{Dynamic Merkle B-tree with Efficient Proofs}},
 year = {2020}
}

#Merkle #Authenticated #DataStructure #Accumulator

Monday 20 June 21:00 UTC+3

Ever Broadcast will conduct a technical review of the solution to one of the problems of the Everscale bounties program — Bounty#8: NFT Lootbox — NFT which mints on-chain random NFT's when destroyed — supported by Everscale Incubator and NFT and GameFi Alliance. At the meeting, the provided solution will be considered in detail, we will find out what problems we had to face, and we will also answer your questions.

Depending on the technical review of the solution, representatives of the DeFi Alliance will ship the bounty or there will be a slashing 😏 those. the situation can be dramatic.

Developer: Jason
Experts: Ilyar, Aleksandr Alekseev, Ivan Kotelnikov

The broadcast will be of interest to blockchain developers and those who want to understand how NFTs work. It will be interesting and, perhaps, in some places not everything is clear, and definitely what was incomprehensible before will become clear, this is the way to the crypto world.

Follow the link and click on 🔔

Evescale Devs on Cardano

Problem statement
Japanese developers of the Everscale Blockchain and Japanese Cardano community see Gimbalabs' Plutus PBL as a good tool to learn how to develop in Cardano. However, it is only available in English.

Background
For Everscale, the strategic importance of developing on "the most important blockchain in Japan" (quote from the Everscale representative) is indisputable. For the Community Manager of the Japanese Cardano community, it is imperative to find ways to consolidate the development skills of the growing community in his country, facilitating access to tools of proven efficiency at a practical level and a record of results (startups or projects created in Cardano).


more

Octus bridge

Это не официальный гайд. Написан путем изучения смарт контрактов и фронтенда моста. Данный гайд не рассматривает вопросы безопасности моста, и предназначен скорей чтобы дать вам общее понимание механик смарт контрактов моста. Используйте все на свой страх и риск, и перепроверяйте написанное.

https://everscale-university.notion.site/everscale-university/Octus-bridge-c2617ce061744655a6a52ac688d9a7e8

Let's say there TIP-3 — QUBE
0:9f20666ce123602fd7a995508aeaa0ece4f92133503c0dfbd609b3239f3901e2

QUBE is considered native — the case when the token comes from Everscale

Use the getNativeToken (spec) you can calculate in advance what the address will be in EVM-compatible networks, using the contract, the address of which is looking at the file broxus/bridge-assets/main.json

getNativeToken(0, 0x9f20666ce123602fd7a995508aeaa0ece4f92133503c0dfbd609b3239f3901e2)

BCH — octQUBE — 0x59caEAc900c11E48dFe1dd449De4947dEa2F9d28

*WEVER token is an exception

Math notation

AsciiMath | JLaTeXMath in PlantUML Maths + State Diagram

@startuml
state updateState {
  state dup #line.dashed
  state "(+1)" as inc
}

[*] -> dup: <math>n :: S</math>
dup --> inc
dup -> s1: <math>n :: S</math>
inc -> s2: <math>(n+1) :: S</math>
@enduml

📝edit

#Diagram #Arch

Few-shot Learning with Retrieval Augmented Language Models
arxiv.org/abs/2208.03299

Comments
Patrick Lewis: We’ve been working on better retrieval-augmented models & thrilled to present Atlas, led by Gautier Izacard, Edouard Grave & myself. Atlas is a end2end pretrained "RAG"-like model, beats models 50x its size on fewshot QA, sets numerous SotA on knowledge-intensive NLP

Sebastian Riedel: The future of language models is retrieval augmented. Atlas has better few-shot performance than PaLM, Gopher and GPT3 at a fraction of their parameter counts on tasks such as QA and fact checking that require background knowledge.

#ML #NLP

Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs
arxiv.org/abs/2210.12283

Comments
Albert Jiang: Large language models can write informal proofs, translate them into formal ones, and achieve SoTA performance in proving competition-level maths problems! LM-generated informal proofs are sometimes more useful than the human ground truth 🤯
Alexandre Défossez: LLMs are nice but how can we trust them? For maths, Albert Jiang, Guillaume Lample at al. show that they can work along formal provers to get the best of both world.

#Formal

Pass2Heaven whitepaper

DOI 10.51582/interconf.7-8.11.2021.037

#P2P #stealth #inheritance #IPFS

An atomic cross-chain swap is a distributed coordination task where
multiple parties exchange assets across multiple blockchains, for
example, trading bitcoin for ether

arxiv.org/pdf/1801.09515.pdf

Private Set Intersection from Homomorphic Encryption: A Python Implementation

Check out our Private Set Intersection (PSI) implementation in Python here!

In this blog post, we will first motivate our interest in PSI, by providing a list of applications: password checkup, private contact discovery for Whatsapp or Signal, measuring ads efficiency privately or DNA pattern matching. Secondly, we will show how to build a PSI protocol using a HE encryption scheme. Thirdly, we will describe our Python implementation of a specific PSI protocol.


What is PSI?
Suppose Alice has a list of friends A and Bob has a list of friends B. Alice is interested in finding out their mutual friends and Bob is ok to share this information with her. Of course, Alice would easily find this out if Bob gave her his list. Or, Alice could send her list to Bob and Bob could answer her back with the information that she is interested in. But both Alice and Bob value their privacy and neither of them wants to reveal his/her entire list of friends to the other.

- bit-ml.github.io/blog/post/private-set-intersection-an-implementation-in-python/
- eprint.iacr.org/2017/299
- github.com/bit-ml/Private-Set-Intersection

#PSI

everscale.guide

A new tutorial on how to get started with development on Everscale by @mnill. There are still some areas that can be improved, especially in terms of English wording, so if you have any feedback or suggestions, please send them to me in a private message.