From 320f5bd9628a836685f6b1f4b12b40601e76f0fa Mon Sep 17 00:00:00 2001
From: "reaction.la" <no_email@protonmail.com>
Date: Sun, 18 Sep 2022 22:17:36 +1000
Subject: [PATCH] new file:   docs/notes/merkle_patricia_dag.md new file:  
 docs/pandoc_templates/vscode.css modified:   libsodium modified:   wxWidgets

---
 docs/notes/merkle_patricia_dag.md | 23 +++++++++++++++++++++++
 docs/pandoc_templates/vscode.css  |  3 +++
 libsodium                         |  2 +-
 wxWidgets                         |  2 +-
 4 files changed, 28 insertions(+), 2 deletions(-)
 create mode 100644 docs/notes/merkle_patricia_dag.md
 create mode 100644 docs/pandoc_templates/vscode.css

diff --git a/docs/notes/merkle_patricia_dag.md b/docs/notes/merkle_patricia_dag.md
new file mode 100644
index 0000000..0765d02
--- /dev/null
+++ b/docs/notes/merkle_patricia_dag.md
@@ -0,0 +1,23 @@
+---
+title:
+Big Circ notation
+# katex
+...
+
+The definition of   $\bigcirc$ used by mathematicians is not convenient for engineers.
+
+So in practice we ignore that definition and use our own.
+
+The mathematical definition is, roughly, that if $f(n)=\bigcirc\big(g(n)\big)$ then $f(n)$ grows no faster than $g(n)$, that there exists some value K such that for values of $n$ of interest and larger than of interest $f(n)\le Kg(n)$
+
+Which is kind of stupid for engineers, because by that definition an algorithm that takes time $\bigcirc(n)$ also takes time $\bigcirc(n^2)$, $\bigcirc(n!)$, etcetera.
+
+So, Knuth defined $\large\Omega$, which means, roughly, that there exists some value K such that for values of $n$ of interest and larger than of interest $f(n)\ge Kg(n)$
+
+Which is also stupid for the same reason.
+
+So what all engineers do in practice is  use $\bigcirc$ to mean that the mathematical definition of $\bigcirc$ is true, *and*  Knuths definition of $\large\Omega$ is also largely true, so when we say that an operation take that much time, we mean that it takes no more than that much time, *and frequently takes something like that much time*.
+
+So, by the engineer's definition of  $\bigcirc$, if an algorithm takes  $\bigcirc(n)$ time it does *not* take  $\bigcirc(n^2)$ time. 
+
+Which is why we never need to use Knuth's $\large\Omega$
\ No newline at end of file
diff --git a/docs/pandoc_templates/vscode.css b/docs/pandoc_templates/vscode.css
new file mode 100644
index 0000000..6a78ac2
--- /dev/null
+++ b/docs/pandoc_templates/vscode.css
@@ -0,0 +1,3 @@
+body {
+	font-size: 85%;
+	}
diff --git a/libsodium b/libsodium
index 012e892..8cbcc3c 160000
--- a/libsodium
+++ b/libsodium
@@ -1 +1 @@
-Subproject commit 012e892841ed6edc521f88a23b55863c7afe4622
+Subproject commit 8cbcc3ccccb035b1a976c053ab4de47b7f0b9352
diff --git a/wxWidgets b/wxWidgets
index 8880bc8..2648eb4 160000
--- a/wxWidgets
+++ b/wxWidgets
@@ -1 +1 @@
-Subproject commit 8880bc88ff6c2cfcd72c3fcd3ef532b5470b2103
+Subproject commit 2648eb4da156a751a377cfe96b91faa03e535c10