How's the software going you ask

Multi-graphs
I order to handle the multiple conflent stream, I added a small scheduler that run the ready graphs from a list.
do {
g = f;
if(g->status == G_UNREADY)
set_ready_graph(g);
g = g->prev;}
while(g);

Match
So all the code now boils down to one routine, match, 35 lines of code tht look at the state of the recent match between two nodes and returns select, rejected of pass. The amtch funsion, all 35 lines, is where TE syntax get contained.
Tables
We can refer to table by their name, and reference any table within the domain of the DB
Null operator,keyword:
_(proprietary triples)
The system will pass any arbitrary set of triples identified by the bounded pointer of the null ope/keyword.

Table operators
The tables come installed with insert,update, read and select SQL operators, the defaults. So the machine comes up in a working state.
Square tables:
An adapter was installed to make them look like triple stores.
All of which now needs to be debugged. But tha t basic machine works, so I wil mainly be debugging the 35 lines of code.

Apple may be ready to patent my ideas, so it won't be long before my patent free code is illegal.