minor layout

display_wallet.cpp

@@ -102,7 +102,7 @@ void display_wallet::OnClose(wxCloseEvent& event) {
 	//	and to object to the closing in a "file not saved" type situation.
 	//	https://docs.wxwidgets.org/trunk/classwx_close_event.html
 	DestroyChildren();
-	Destroy(); 	//Default handler will destroy the window.  This is our handler for the user calling close, 
+	Destroy();	//Default handler will destroy the window.  This is our handler for the user calling close,
 	//	replacing the default handler.'
 	if (singletonFrame->m_panel ==this)singletonFrame->m_panel = nullptr;
 

docs/blockdag_consensus.md

@@ -81,7 +81,7 @@ its total.
 
 On each block of the chain, a peer’s rank is the bit position of the highest
 bit of the running total that rolled over when its stake was added for that
-block.  
+block.
 
 So if Bob has a third of the stake of Carol, and $N$ is a rank that
 corresponds to bit position higher than the stake of either of them, then

docs/libraries.md

@@ -145,7 +145,7 @@ It has become painfully apparent that building a blockchain is a very large proj
 
 Polkadot is a blockchain ecosystem, and substack a family of libraries for
 constructing blockchains.  It is a lot a easier to refactor an existing
-blockchain than to start entirely from scratch.  [Near] is way ahead of me, 
+blockchain than to start entirely from scratch.  [Near] is way ahead of me,
 because not suffering from not invented here syndrome.
 
 Polkadot is designed to make its ecosystem subordinate to the primary
@@ -553,7 +553,7 @@ generate proofs that prove something about the results of hashes and
 elliptic point operations, making very difficult to produce a proof that a
 pile of proofs in the pre-image of a merkle tree have been verified.  I
 suspect that a prover might take a very very long time to produce such a
-proof. 
+proof.
 
 The proofs are succinct, in that you can prove something about a gigantic
 pile of data  and the size of the proof and the time taken to verify scarcely

docs/merkle_patricia_dag.md

@@ -123,7 +123,7 @@ The resulting patricia tree with infix keys is:
 	style="background-color:#FF9" stroke-width="1.5"
 		stroke-linecap="round" >
 	<g font-family="'Times New Roman'" font-size="10" font-weight="400"
-	  	fill-rule="evenodd" fill="black" >
+		fill-rule="evenodd" fill="black" >
 		<path stroke="#000000"    fill="none" d="
 			M 156,18 c10,60 -121,149 -111,209
 			M 156,18 c-8,55 70,20 60,69
@@ -263,7 +263,7 @@ information from the peer that has the node with more children.
 	stroke-width="1"
 	stroke-linecap="round" >
 	<g font-family="'Times New Roman'" font-size="10"
-		font-weight="400"  fill-rule="evenodd" fill="black" >
+		font-weight="400" fill-rule="evenodd" fill="black" >
 		<g  id="blockchain_id" >
 			<ellipse cx="10" cy="240" fill="#0D0"  rx="8" ry="5"/>
 			<text  fill="black">

docs/number_encoding.md

@@ -1,7 +1,7 @@
 ---
 # katex
 title: Number encoding
-...
+---
 # The problem to be solved
 
 As computers and networks grow, any fixed length fields
@@ -90,7 +90,7 @@ are similarly represented by four base 58 characters.
 
 And so on, for arbitrarily large values.  A truly enormous number is going to start with `zzzz....`, `z` being the representation of $58-1$ in base 58.
 
-This amounts to shifting the underlying value to the appropriate range, then displaying it as the shifted base 58 value. 
+This amounts to shifting the underlying value to the appropriate range, then displaying it as the shifted base 58 value.
 
 We display a value in the range  $0\le n \lt 58/2$ as itself,
 

docs/replacing_TCP.md

@@ -428,7 +428,7 @@ his private network address space, nor his subnet of the globally routable
 address space, gets sent to the internet facing network interface.
 
 Further, he would like every computer on his network to be automatically
-assigned a globally routable address if it uses a name in the global system, 
+assigned a globally routable address if it uses a name in the global system,
 or a private fd:: address if it is using a name not in the global system, so
 that the first time his computer tries to access the network with the domain
 name he just assigned, it gets a unique network address which will never

docs/scale_clients_trust.md

@@ -279,7 +279,7 @@ which claims:
     setup, with the best of SNARKs, support for recursion and low
     verification cost ...
 
-    ... transpiled to ZK bytecode, which can be executed efficiently in our VM running inside a STARK. 
+    ... transpiled to ZK bytecode, which can be executed efficiently in our VM running inside a STARK.
 
 So, if you have their VM that can run inside a stark, and their ZK
 bytecode, you can write your own ZK language to support a friendly

docs/writing_and_editing_documentation.md

@@ -32,7 +32,7 @@ navigation at your fingertips.]
 
 This layout is in some way automatically generated on the server, which
 sucks.  Probably relies on server side include, which is the easiest way to
-do it.The documentation needs to be in every install and every repository. 
+do it.The documentation needs to be in every install and every repository.
 Thus wxWidgets documentation on the server has nice organizational
 style, but on each person's individual installed copy, disorganized crap.
 
@@ -55,7 +55,7 @@ and any subdirectories.
 On reflection, we will not use any cleverness to have a single header bar
 file that all html files use because each top bar of each html file will b
 different, having different items highlighted, and according to its depth in
-the tree, a different number of '../' prepended to the links in the top bar.  
+the tree, a different number of '../' prepended to the links in the top bar.
 
 Each markdown file and directory in a directory should have a short
 human friendly name, which will correspond to the name in the top bar,

frame.cpp

@@ -219,7 +219,7 @@ void Frame::OnDeleteConfiguration(wxCommandEvent&)
 using ro::bin2hex, ro::to_base64_string;
 void Frame::NewWallet(wxFileName& filename, ristretto255::hash<256>& secret) {
 	/*If creation fails, abort with exception.  If it succeeds, set LastUsed to default filename.
-		The exception in unit test should simply generate an error message, but if run during initialization, 
+		The exception in unit test should simply generate an error message, but if run during initialization,
 		should bring up the more complex UI for constructing or selecting your wallet file.*/
 	wxLogMessage(_wx("New wallet file %s"), filename.GetFullPath());
 	std::unique_ptr<ISqlite3> db{ nullptr };

frame.h

@@ -1,7 +1,7 @@
 #pragma once
 template  <typename T>
 //	This class exists to record the needed to unbind a drop down menu action and delete
-//	the corresponding item from the drop down menu when the handler is destroyed. 
+//	the corresponding item from the drop down menu when the handler is destroyed.
 //	(Because the handler is a method of an object that is about to be destroyed.)
 //	Also avoids the need for manually creating a new windowid to link each additional bind
 //	to each menu item, thus avoids the likelihood of mismatching binds and menu entries.
@@ -91,4 +91,3 @@ public:
 };
 
 extern Frame* singletonFrame;
-

introspection_of_standard_C_types.h

@@ -113,7 +113,7 @@ namespace ro {
 	* and whose members have the spaceship operator
 	* nonexistent arithemetic values of the shorter array
 	* are considered zero
-	* Existent non arithmetic values are considered greater than 
+	* Existent non arithmetic values are considered greater than
 	* nonexistent non arithemetic values */
 template<class T, class U >
 std::enable_if_t<!ro::has_spaceship_v<T, U>, decltype(std::span(declval<T>())[0] <=> std::span(declval<U>())[0]) >operator <=>(

localization.h

@@ -43,7 +43,7 @@ extern const char sz_existing_secret[];
 extern const char sz_open_existing_wallet[];
 extern const char sz_existing_wallet[];
 extern const char sz_text_buffer_overflow[];
-extern const char sz_unknown_error[]; 
+extern const char sz_unknown_error[];
 
 extern const char szAboutWallet[];
 extern const char szAboutTitle[];

ristretto255.cpp

@@ -143,4 +143,3 @@ template<> CompileSizedString < (sizeof(scalar) * 8 + 5) / 6>
 	);
 	return sz;
 }
-

ristretto255.h

@@ -597,7 +597,7 @@ namespace ristretto255 {
 		//	After loading a point as a blog from the network, from the database,
 		//	or from user data typed as text, have to check for validity.
 		bool valid(void) const { return 0 != crypto_core_ristretto255_is_valid_point(&blob[0]); }
-		explicit constexpr point(std::array<uint8_t, crypto_core_ristretto255_BYTES>&& in) : 
+		explicit constexpr point(std::array<uint8_t, crypto_core_ristretto255_BYTES>&& in) :
 			blob{ std::forward<std::array<uint8_t, crypto_core_ristretto255_BYTES>>(in) } {  };
 		static_assert(crypto_core_ristretto255_BYTES == 32, "256 bit points expected");
 		~point() = default;

testbed.cpp

@@ -42,7 +42,7 @@ No mechanism for input is available.  You generally do not need it because you
 Uncaught exceptions result in unit test failure, but not in an error
 	message in the main program UI.
 
-If using a dialog, exceptions within the dialog will result in an error message in the 
+If using a dialog, exceptions within the dialog will result in an error message in the
 	main program UI, rather than in the unit test result, since the unit test
 	is over before the dialog runs.
 	*/