+<li>see: <a href="#sec-4-1">Geometrical computation</a>
+</li>
+
+<li>Computation unit has local CPU and RAM.
+</li>
+
+<li>Data is pre-distributed across computation units.
+</li>
+
+<li>Machine's internal 12-dimensional hypercube network allows to
+efficiently simulate arbitrary dimensional network topology between
+computational units. So that when we are solving/simulating for
+example 5 dimensional problem, we can arrange computational units
+into virtual 5D network. See:
+<a href="http://www.mission-base.com/tamiko/theory/cm_txts/di-ch2.html">http://www.mission-base.com/tamiko/theory/cm_txts/di-ch2.html</a>
+</li>
+</ul>
+</div>
+</div>
+</div>
+
+<div id="outline-container-sec-4" class="outline-2">
+<h2 id="sec-4"><span class="section-number-2">4</span> Ideas</h2>
+<div class="outline-text-2" id="text-4">
+</div><div id="outline-container-sec-4-1" class="outline-3">
+<h3 id="sec-4-1"><a id="ID-171fe375-c737-41e6-b429-a414f6abc5d8" name="ID-171fe375-c737-41e6-b429-a414f6abc5d8"></a><span class="section-number-3">4.1</span> Geometrical computation</h3>
+<div class="outline-text-3" id="text-4-1">
+<ul class="org-ul">
+<li>Inspired by <a href="#sec-3-1">Brain</a>.
+</li>
+<li>Wits nicely with <a href="#sec-3-2">CM-1 Connection Machine</a> properties.
+</li>
+</ul>
+</div>
+
+<div id="outline-container-sec-4-1-1" class="outline-4">
+<h4 id="sec-4-1-1"><a id="ID-5d287158-53ea-44a2-a754-dd862366066a" name="ID-5d287158-53ea-44a2-a754-dd862366066a"></a><span class="section-number-4">4.1.1</span> Distributed computation and data storage</h4>
+<div class="outline-text-4" id="text-4-1-1">
+<p>
+Maybe every problem can be translated to geometry (use any shapes and
+as many dimensions as you need). Solution(s) to such problems would
+then appear as relatively simple search/comparison/lookup results. As
+a bonus, such geometrical *data storage* AND *computation* can be
+naturally made in *parallel* and *distributed*. That's what neurons in
+the brain appear to be doing ! :) . Learning means building/updating
+the model (the hard part). Question answering is making (relatively
+simple) lookups (geometrical queries) against the model.
+</p>
+</div>
+</div>
+<div id="outline-container-sec-4-1-2" class="outline-4">
+<h4 id="sec-4-1-2"><a id="ID-a117c11e-97c1-4822-88b2-9fc10f96caec" name="ID-a117c11e-97c1-4822-88b2-9fc10f96caec"></a><span class="section-number-4">4.1.2</span> Mapping of hyperspace to traditional object-oriented model</h4>
+<div class="outline-text-4" id="text-4-1-2">
+<p>
+Object oriented programming is inspired by the way human mind
+operates. It allows programmer to express ideas to computer in a more
+human-like terms.
+</p>
+
+<p>
+It is possible to map object model to geometrical hyperspace:
+</p>
+
+<ul class="org-ul">
+<li>Object is a point in space (universe). Each object member variable
+translates to its own dimension. That is: if class declares 4
+variables for an object, then corresponding object can be stored as
+a single point inside 4 dimensional space. Variable values translate
+to point coordinates in space. That is: Integer, floating point
+number and even boolean and string can be translated to linear value
+that can be used as a coordinate along particular dimension.
+</li>
+
+<li>Each class declares its own space (universe). All class instances
+(objects) are points inside that particular universe. References
+between objects of different types are hyperlinks (portals) between
+different universes.
+</li>
+</ul>
+</div>
+</div>
+<div id="outline-container-sec-4-1-3" class="outline-4">
+<h4 id="sec-4-1-3"><a id="ID-b6b15bd2-c78b-4c51-a343-72843a515c29" name="ID-b6b15bd2-c78b-4c51-a343-72843a515c29"></a><span class="section-number-4">4.1.3</span> Handling of relations</h4>
+<div class="outline-text-4" id="text-4-1-3">
+<p>
+Consider we want to create database of books and authors. Book can
+have multiple authors, and single person can be author for multiple
+books. It is possible to store how many hours of work each author has
+contributed to every book, using hyperspace as follows:
+</p>
+
+<ul class="org-ul">
+<li>Every dimension corresponds to one particular book author. (10
+authors in the database, would require 10 dimensional space)
+<ul class="org-ul">
+<li>Point in space corresponds to one particular book.
+<ul class="org-ul">
+<li>Point location along particular (author) dimension corresponds
+to amount of work contributed by particular author for given
+book.
+</li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
+
+<p>
+Alternatively:
+</p>
+
+<ul class="org-ul">
+<li>Every dimension corresponds to one particular book.
+<ul class="org-ul">
+<li>Point in space corresponds to one particular author in the entire
+database.
+<ul class="org-ul">
+<li>Point location along particular (book) dimension corresponds to
+amount of work contributed for book by given author (point).
+</li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
+</div>
+</div>
+</div>
+
+<div id="outline-container-sec-4-2" class="outline-3">
+<h3 id="sec-4-2"><span class="section-number-3">4.2</span> Layered architecture</h3>
+<div class="outline-text-3" id="text-4-2">
+<dl class="org-dl">
+<dt> layer 1 </dt><dd>disk / block storage / partition
+</dd>
+
+<dt> layer 2 </dt><dd>key/value storage. Keys are unique and are dictated by
+storage engine. Value is arbitrary but limited size byte
+array. This layer is responsible for handling disk
+defragmentation and consistency in case of crash
+recovery.
+</dd>
+
+<dt> layer 3 </dt><dd>key/value storage. Keys are content hashes. Values are
+arbitrary but limited size content byte arrays. This
+layer effectively implements content addressable
+storage. Content addressible storage enables GIT-like
+behavior (possibility for competing branches, retaining
+history, transparent deduplication)
+</dd>
+
+<dt> layer 4 </dt><dd>Implements arbitrary dimensional multiverse.
+</dd>
+
+<dt> layer 5 </dt><dd>Distributed computation engine.
+</dd>
+</dl>
+</div>
+</div>
+</div>
+<div id="outline-container-sec-5" class="outline-2">
+<h2 id="sec-5"><span class="section-number-2">5</span> Current status</h2>
+<div class="outline-text-2" id="text-5">
+<ul class="org-ul">
+<li>More or less defined <a href="#sec-2">Vision / goal</a>.
+</li>
+
+<li>Collected some <a href="#sec-3-1">ideas</a>.
+</li>
+
+<li>Implemented very simple persistent key-value map.
+<ul class="org-ul">
+<li>Long term goal is to use it as a backing storage engine and
+implement more advanced features on top of this.
+</li>
+</ul>
+</li>