WIP: RFC 1 : Abstract Syntax Tree-based output script locks

Update 2 : Rewriting with way better format to fix flaws of the first draft.

In the current Duniter protocol input and output conditions are stored in machine-readable BNF text format. This is good for human readability, but it requires parsing and takes place due to its textual format.

To lower blocksize and transactions weights; or to allow more complex conditions, it could be preferable to use a more simple binary format which need little or no parsing, close to memory and that can be converted back to text format. It can also allow to add new features without hard-forking the protocol.

added 1 commit

• 1d1c0029 - More details on MAST; Better local values

Compare with previous version

added 1 commit

• 2b97a831 - Script corrections

Compare with previous version

added 1 commit

• a127a565 - Corrected data sizes

Compare with previous version

added 1 commit

• 937c720f - Corrections

Compare with previous version

assigned to @Insoleet

assigned to @c-geek

assigned to @nanocryk

added 1 commit

• 22228848 - Corrected LOC -> U8

Compare with previous version

added 1 commit

• 0d71c303 - OR and AND operator can accept any number of arguments

Compare with previous version

added 1 commit

• 35b73839 - Size of parameters

Compare with previous version

added 1 commit

• ad51609a - More sizes and LOC -> U8

Compare with previous version

assigned to @librelois

assigned to @nanocryk

added 1 commit

• f1d6bed8 - Children count size; More precise HASH specification

Compare with previous version