fred/wallet
1
0
Fork 0
forked from cheng/wallet
Code Pull Requests Activity

attempting to doc append only merkle patricia

Browse Source
This commit is contained in:
reaction.la 2022-03-06 07:11:28 +10:00
parent 93df1f31f2
commit 01d20a8260
No known key found for this signature in database
GPG Key ID: 99914792148C8388
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
docs/merkle_patricia-dac.md
View File

@ -856,9 +856,9 @@ solve the problem of the number of items not being a power of two?
xmlns="http://www.w3.org/2000/svg" xmlns="http://www.w3.org/2000/svg"
xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xlink="http://www.w3.org/1999/xlink"
width="29em" height="17em" width="29em" height="17em"
viewBox="8 209 164 102" viewBox="0 209 360 102"
style="background-color:ivory" stroke-width=".6" stroke-linecap="round"> style="background-color:ivory" stroke-width=".6" stroke-linecap="round" >
<g font-family="'Times New Roman'" font-size="6" font-weight="400" fill-rule="evenodd"> <g font-family="'Times New Roman'" font-size="6" font-weight="400" fill-rule="evenodd" fill="black" >
<g id="height_3_tree" fill="none" > <g id="height_3_tree" fill="none" >
<path stroke="#b00000" <path stroke="#b00000"
d=" d="

2
docs/writing_and_editing_documentation.md
View File

@ -176,7 +176,7 @@ $$k \approx \frac{m\,l\!n(2)}{n}%uses\, to increase spacing, uses \! to merge le
$$k \approx\frac{m\>\ln(2)}{n}%uses\> for a marginally larger increase in spacing and uses \ln, the escape for the well known function ln $$ $$k \approx\frac{m\>\ln(2)}{n}%uses\> for a marginally larger increase in spacing and uses \ln, the escape for the well known function ln $$
$$ \exp\bigg(\frac{a+bt}{x}\bigg)=\huge e\normalsize^{\big(\frac{a+bt}{x}\big)}%use the escape for well known functions, use text size sets$$ $$ \exp\bigg(\frac{a+bt}{x}\bigg)=\huge e^{\bigg(\frac{a+bt}{x}\bigg)}%use the escape for well known functions, use text size sets$$
$$k\text{, the number of hashes} \approx \frac{m\ln(2)}{n}% \text{} for render as text$$ $$k\text{, the number of hashes} \approx \frac{m\ln(2)}{n}% \text{} for render as text$$