KIRIK - Overview of the innovative project!
The KIRIK principle is not predicated on Blockchain since the distributed ledger, but on semantic smart agreements (ΣK) that aren't associated with any specific blockchain platform.
Semantic smart agreements allow to establish methods that could bind
operations and transactions manufactured in various Blockchain
programs and different additional systems, like banks or transactions,
in to one distributed transaction. From the Mathematical Logic's
formal standpoint a semantic smart agreement shows a conventional
principle that's home of constructivism, meaning that, as an
example,any appearance in the form of ∆0-formula may be approved
whether it is correct or fake in a particular constructive type of
KIRIK system is on the basis of the concept of declarative requirements, wherever plausible treatments with specific constraints (a.k.a. ∆0-formulas, see below) are utilized that also allow to call additional operates (so named oracles or foundation predicates).
Semantic agreement shows (as does a standard contract) declarative (expressed applying common logic) requirements of predicates and rules. Such oracles are often represented by some additional systems (like micro-services), or by semantic predicates described by several other semantic contract.
Particularly a semantic agreement can use additional oracles to establish the project reasoning for joining together transactions between various Blockchain programs to form just one transaction.
As an example, smart agreements predicated on Ethereum, NEO, and/or RSK/Bitcoin may may play a role of such additional oracles for KIRIK based semantic contracts. Two-step transaction subscription is useful for rushing up the process.
KIRIK transactions are attached onto IOTA distributed ledger and then onto KIRIK Blockchain (which is dependant on a pay of the Ethereum source code). This allows on the main one hand to remove barriers for scaling up a system of nodes performing semantic agreement calculations, and on another hand utilize the trusted and established protection methods of Ethereum! Furthermore, the KIRIK principle makes for creation of different domains of smart agreements and/or oracles with their own distributed ledgers for transaction anchor- ing.
This must enhance scalability. This also allows companies and
communities to use semantic agreements and at the same time frame
anchor transactions onto their own Blockchain, or other transaction
As an example, a banking association can create a distributed semantic agreement system of its own with an- choring onto their private, or permissioned Blockchain. Banks may start their solutions due to their clients in the form of oracles some of the semantic contracts.
Naturally, misinterpretation of data happens once the project actions from the prior point to the next, as various specialists are included at various stages. To mitigate this misinterpretations various particular techniques are utilized, such as for example Capacity Maturation Product, SCRUM, Realistic Single Process, etc. The notion of executable requirements may be the the cornerstone of semantic model- ing (programming).
A specialist of a topic domain may produce
requirements using the semantic specification language, and these requirements will au- tomatically be changed into executable code. It is essential to see that the semantic specification language supposes that the sense (semantics) of the spec- ifications is intelligible to the specialist of the subject domain.
This allows to decrease the risk connected with misinterpretation of
the information (because programmers, architects, and managers are
excluded from the process) and, which can be essential, considerably
expedite the procedure of effect achievement and reduce man-hours and
over all expenses.
The thought of semantic modeling (programming) was introduced and devel- oped in 1980's by earth known specialists of Mathematical Reasoning, academicians Sergey S. Goncharov, Yuri L. Yershov, and Dmitry I. Sviridenko in the Institute of Mathematics, the Siberian Branch of Academy of Science of the USSR (now European Academy of Sciences).
The thought of semantic modeling is based upon requirements created using plausible treatments with specific constraints (e.g. Σ-formulas, or ∆0-formulas). These constraints allow to apply automated translation of requirements in to com- puter executable code. Besides, semantic models are, in a few sense, not Turing total, meaning the theoretical possibility of the computerized proof (that is inferring from GES Theory).
From the practical standpoint, how- ever, a concept of semantic agreement verifier is proposed (see below) that may allow to present the semantics to the semantic agreement consumers in a far more clear sort, and successfully confirm it at the same time. In the overall event various semantic specification languages may be used for various problems/subject domains, each having its own syntax used to the particular school of problems.
The only real common requirement is equivalence and en- capsulation of such language to the language of Σ-formulas, or their part – the language of ∆0-formulas.
🔸🔹🔸🔹MORE INFORMATION 🔹🔸🔹🔸
✋🧒 Author: Сrypto888kenoby
Bitcointalk Username: crypto888kenoby
Bitcointalk URL: https://bitcointalk.org/index.php?action=profile;u=1973923
ETH Address: 0xA9523555c999B8C371f7C4f29d56DCFb7BeF73E2