The ledger explorer in Proxima woudl implement common functions of the equivalents in other blockchains. It will be implements as a Web browser which access endpoint of the node. Functions retrieve and display transaction by its transaction ID. According to its syntactical structure. Transaction is implemented here highlight and/or provide links from elements of the transaction to other transactions in the UTXO tangle (this can be implemented gradually):to transction level properties (timestamp, signature, sequencer tx properties, number of inputs, outputs etc) to inputs (consumed output IDs) of the transaction. The hyperlinks must point to other transaction to produced outputs as arrays of constraintsto constrains as their bytecode and decompiled source codes chain and chainLock constraints could provide hyperlinks to chainIDs and addresses (advanced) interpretation of stem and sequencer outputs (advanced) in the future you could retrieve the EasyFL code from the database, but that will require modification of the multi-state database

Evaldas Drąsutis IOTA Foundation Summary This post describes an experimental implementation of polynomial KZG commitments, aka Kate commitments. The implementation uses the trusted setup completely in Lagrange basis calculated upon secret $s$, non-secret value $\omega$ and its powers. All computations are performed in the evaluation form. The powers of a secret on the curve $[s^i]_1$ nor any FFT operations are not needed in any stage. The math mostly follows articles on KZG by Dankrad Feist, specifically this and this. We assume the reader is familiar with the content of it. The implemented experimental Go package is based on DEDIS Advanced Crypto Library for Go Kyber v3 and uses $bn256$ BLS suite. It can be found here: https://github.com/lunfardo314/verkle