Indeed Bitcointalk is not in our focus, because we only have shareholders and they will get informed directly by us.

The MVP Milestone was achieved in October, but with limited scope so far. The coding of the ARES token prototype, P2P infrastructure backbone (or layer-1 protocol), simulations and the development of our cryptographic engine have progressed markedly and we now have our proposition on solid foundations. In addition, some features of the GenS Stablecoin (particularly its algorithmic stability) have been tested.
The MVP just released is the first iteration of a technological demonstrator that will be evolving to a fullyfledged MVP by the end of February 2020 (and product suite afterwards) as we continue to integrate, test and deploy several features.

So we are on track and quite happy with the progress so far. 

The approach for the price building of GenS is based at monetarism economics. That means increasing the amount when price is high, freezing amounts when price is lower.
The base level has yet to defined, Special Drawing Rights (SDR) are more likely to be used instead of USD.

Nicht ganz, beim Budget sind wir unter den Planungen, wir haben weniger Cash benötigt als ursprünglich vorgesehen.
Unter anderem auch daher, da die Vergütung an den Aufsichtsrat exakt 0 CHF betrug.

Anbei noch unsere heutige Presseerklärung zu den bisher gemachten Fortschritten (sorry für English):

We are very pleased to publicly announce the successful completion of the initial testing phase of a very powerful symmetric encryption algorithm designed by Forctis AG.

One of the core facets of our R&D program was the development of a new pseudorandom generator displaying outstanding mathematical properties, for its subsequent application in a One-time Pad (OTP) encryption scheme.
Concerning the OTP method, in 1949 the renowned mathematician and electronic engineer Claude Shannon demonstrated that one-time pads can achieve “perfect secrecy” if the sequence of keys used can be neither forecast nor used more than once. It is proven to be a desirable property every cryptographic algorithm should have. To this aim, our pseudorandom method generates as many unpredictable bits as required by the OTP implementation.

A fundamental problem nevertheless remains, and that is how to share the keys between entities looking to exchange information in an unbreakable way. Nowadays, the standard approach is to adopt the Diffie-Hellman key exchange algorithm, but it presents two basic problems:
1. It could be attacked by quantum computers; and
2. It is highly vulnerable to “man-in-the-middle” attacks.
To tackle those shortcomings, we have implemented a post-quantum (PQC) key exchange algorithm. Despite its underlying complexity, during this first (yet exhaustive) testing phase our protocol has displayed consistently fast processing speeds.

Summing up: our pseudorandom generator provides the bits required by our key exchange algorithm, which allows two entities to arrive at a shared secret key that  is used as a seed for generating the bits needed by the OTP, and doing so at great speed.
By using this combined approach, our protocol attains a complexity of 24783. Furthermore, this degree of complexity is feasible at high speed even using average personal computers. Thinking of a simple benchmark, the NIST-standard AES protocol, although fast, has a complexity of at most 2256. 

We therefore consider our strategy to be much more efficient than adopting a Public Key Infrastructure, for at least three reasons:
a. It provides a significantly higher degree of security than known military grade encryption protocols currently in operation;
b. It has fast processing speed, despite its complexity; and
c. It avoids the cumbersome use of digital certificates and a centralized Certification Authority.
                                                     
Noting that asymmetric methods such as RSA or elliptic curves are quite slow, for the most part they are limited to exchanging keys to be used with symmetric algorithms, such as AES. In addition, there is also a reasonable expectation that RSA will be successfully attacked using quantum computing in a foreseeable future.
Besides the specific implementation of this protocol in Forctis’ own infrastructure, our plan is to release in the next couple of months versions of this method tailored for application in the financial, government and military sectors.

Concerning Forctis’ infrastructure and ARES token, our MVP will be rolled-out in phases, from August 2019.
An initial public presentation will take place in Zurich, Switzerland, on September 12, 2019.
 
 
Contact details:
If you wish to receive further information concerning this Press Release, please direct your queries to info@forctis.io