The algorithmically minded will have noticed that paging requires associative array (like Java Map of Python dict()) abstract data structure where:
  • the keys are linear pages addresses, thus of integer type
  • the values are physical page addresses, also of integer type
The single level paging scheme uses a simple array implementation of the associative array:
  • the keys are the array index
  • this implementation is very fast in time
  • but it is too inefficient in memory
and in C pseudo-code it looks like this:
linear_address[0]      = physical_address_0
linear_address[1]      = physical_address_1
linear_address[2]      = physical_address_2
...
linear_address[2^20-1] = physical_address_N
But there another simple associative array implementation that overcomes the memory problem: an (unbalanced) k-ary tree.
A K-ary tree, is just like a binary tree, but with K children instead of 2.
Using a K-ary tree instead of an array implementation has the following trade-offs:
  • it uses way less memory
  • it is slower since we have to de-reference extra pointers
In C-pseudo code, a 2-level K-ary tree with K = 2^10 looks like this:
level0[0] = &level1_0[0]
    level1_0[0]      = physical_address_0_0
    level1_0[1]      = physical_address_0_1
    ...
    level1_0[2^10-1] = physical_address_0_N
level0[1] = &level1_1[0]
    level1_1[0]      = physical_address_1_0
    level1_1[1]      = physical_address_1_1
    ...
    level1_1[2^10-1] = physical_address_1_N
...
level0[N] = &level1_N[0]
    level1_N[0]      = physical_address_N_0
    level1_N[1]      = physical_address_N_1
    ...
    level1_N[2^10-1] = physical_address_N_N
and we have the following arrays:
  • one directory, which has 2^10 elements. Each element contains a pointer to a page table array.
  • up to 2^10 pagetable arrays. Each one has 2^10 4 byte page entries.
and it still contains 2^10 * 2^10 = 2^20 possible keys.
K-ary trees can save up a lot of space, because if we only have one key, then we only need the following arrays:
  • one directory with 2^10 entries
  • one pagetable at directory[0] with 2^10 entries
  • all other directory[i] are marked as invalid, don't point to anything, and we don't allocate pagetable for them at all
Selenocysteine by Ciro Santilli 40 Updated 2025-07-16
Like cysteine, but with selenium instead of sulfur.
The weird one, not directly coded in the genetic code.
CIDARLAB/cello by Ciro Santilli 40 Updated 2025-07-16
The input is in Verilog! Overkill?
Then it essentially maps to a standard cell library of biological primitives!
Allen Mouse Brain by Ciro Santilli 40 Updated 2025-07-16
Grouping their mouse brain projcts here.
Video 1.
Tutorial: Allen Developing Mouse Brain by Allen Institute (2014)
Source.
De novo DNA synthesis by Ciro Santilli 40 Updated 2025-07-16
As of 2018, Ciro Santilli believes that this could be the next big thing in biology technology.
"De novo" means "starting from scratch", that is: you type the desired sequence into a computer, and the synthesize it.
The "de novo" part is important, because it distinguishes this from the already well solved problem of duplicating DNA from an existing DNA template, which is what all our cells do daily, and which can already be done very efficiently in vitro with polymerase chain reaction.
Notably, the dream of most of those companies is to have a machine that sits on a lab bench, which synthesises whatever you want.
TODO current de novo synthesis costs/time to delivery after ordering a custom sequence.
The initial main applications are likely going to be:
but the real pipe dream is building and bootstraping entire artificial chromosomes
News coverage:
Video 1.
Nuclera eDNA enzymatic de novo DNA synthesis explanatory animation (2021)
Source. The video shows nicely how Nuclera's enzymatic DNA synthesis works:
Germline by Ciro Santilli 40 Updated 2025-07-16
It is quite mind blowing when you think about it, that the huge majority of your body's cells is essentially just there to support a tiny ammount of germline, which are the only cells that can actually pass on! It is fun to imagine the cell type tree for this, with a huge branching of somatic cells, and only a few germline going forward.
Video 1.
Phone Intercom by Make (2014)
Source. This video illustrates will the incredible simplicity of the connection of a telephone system. Compare that to the relative complexity of wireless communication, which requires modulation.
Video 2.
Making a Microphone Work with an Oscilloscope by Environmental Radiation LLC (2012)
Source. Not the most detailed setup, but good.
Amoeba by Ciro Santilli 40 Updated 2025-07-16
This group is a mess.
But one thing you should really know, as often mentioned in Power, Sex, Suicide by Nick Lane (2006): they are all eukaryotes.
Because prokaryotes are fundamentally unable to do phagocytosis, because they have a rigid cell wall. Changing cell shape at will requires a cytoskeleton.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 2.
    You can publish local OurBigBook lightweight markup files to either https://OurBigBook.com or as a static website
    .
    Figure 3.
    Visual Studio Code extension installation
    .
    Figure 4.
    Visual Studio Code extension tree navigation
    .
    Figure 5.
    Web editor
    . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
    Video 4.
    OurBigBook Visual Studio Code extension editing and navigation demo
    . Source.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact