Cycle TØ – Cycle Transaction




There are several ways that can be created Cycle TØ – Cycle Transaction

1º  Consider this:

TØ => {
(a)-[st:NEEDS_TO_PAY]->(b) => st(a,b) ;
(b)-[st:NEEDS_TO_PAY]->(n) => st(b,n) ;

(n’)-[st:NEEDS_TO_PAY]->(a) => st(n’,a)
}

The TØ.Value = min(
st(a,b).value = 100;
st(b,n).value = 10;

st(n’,a).value = 30
)

We can see that a Submission to a need to pay can be total satisfied if is value is the TØ.Value or partially, remaining in the graph as a “NEEDS_TO_PAY”.

2º Also a “quantum effect” or “multiple effect” can occur:
Consider this:

TØ => {
(a)-[st:NEEDS_TO_PAY]->(b) => st(a,b) ;
(b)-[st:NEEDS_TO_PAY]->(n) => st(b,n) ;

(n’)-[st:NEEDS_TO_PAY]->(a) => st(n’,a);
(a)-[st:NEEDS_TO_PAY]->(n’’) => st(a,n’’) ;
(n’’)-[st:NEEDS_TO_PAY]->(n’’’) => st(n’’,n’’’) ;

(n’’’’)-[st:NEEDS_TO_PAY]->(a) => st(n’’’’,a)

}

The TØ.Value = min(
st(a,b).value = 100;
st(b,n).value = 40;

st(n’,a).value = 10
st(a,n’’).value = 10;
st(n’’,n’’’).value = 50;

st(n’’’’,a).value = 30

)  = 10

We can see that a Submission to a need to pay can be totally satisfied if is value is the TØ. Value or partially, remaining in the graph as a “NEEDS_TO_PAY”.

This happens when st(n’,a).value and st(a,n’’).value equals to TØ.Value.
In this case, each entity receive the GUIDs of the simple transactions that are intervening in various clearing cycle, but who will be the same TØ

For now in a simplified way is how it works!

More ideas are coming!

Thanks!

Samuel França