Kogarashi Network

凩

Kogarashi Network is a A Next-Generation Composable Hybrid Smart Contract and (De)Centralized Merged Application Platform

Features

■ Real World Hybrid Smart Contract

Fetch the Internet data through TLS verification protocol with trustless and use it for smart contract executions.

■ Crypto-Centric Scalable and Private Blockchain

Recompose blockchain runtime, storage and functions as crypto-friendly, and achieve advanced features with high performance simple usage.

Motivation

There are two motivations for this platform.

Increase data type that can deal with Dapp
Manage both advanced features and simple usability

Firstly, typical blockchains can deal with only cryptocurrency balance and crypto-assets. We innovate the data-getting process and bring off-chain data with trustless and low cost. Dapp on our platform can deal with various types of data from off-chain and realize a completely new use case.

Secondly, typical blockchains are inefficient to process the latest cryptography scheme like zero-knowledge proof and homomorphic encryption. We innovate blockchain runtime and realize simple usage and fast process. Users can use various simple-to-use and a little gas cost functionalities.

Activities

We have been working on cryptography schemes relevant to privacy, scaling, and off-chain Oracle issues. Our approach involves creating cryptographic libraries from the ground up and ensuring their ability to adapt to changes.

Core Thought

Replace with latest algorithms easily
Avoid code duplication
Compatible with no_std and Parity SCALE Codec.

Pallets

Pallet	Description
confidential_transfer	Confidential transfer pallet which allows us to transfer assets by hiding the exact amount.
encrypted_balance	Encrypted balance pallet which allows us to use encrypted balance by additive homomorphic encryption.
plonk	plonk pallet which allows us to use plonk verification in the runtime environment.

Library

Name	Crates.io	Documentation	Description
zkstd			`Crypto primitives` of zero knowledge proof and homomorphic encryption. This includes Field, Curve, ExtensionField and Pairing, Fft. This allows us to easily setup cryptography implementation and test without implementing actual algorithms.
jub-jub			`Jubjub curve` implementation used for zero knowledge proof circuit domain. This includes finite field operations and point arithmetic interface of twisted Edwards curve.
bls-12-381			`Bls12 381 curve` implementation used for zero knowledge proof polynomial operation domain. This includes finite field operations, point arithmetic interface of the Weierstrass curve, and pairing interface.
ec-pairing			`Tate Pairing` implementation. This includes the Miller loop algorithm and pairing construction with pairing-friendly curve.
she-elgamal			`ElGamal Encryption` implementation. This includes a public key encryption interface that supports additive homomorphism.
poly-commit			`Kate Polynomial Commitment` implementation. This includes polynomial commitment and operations used for zero knowledge proof plonk.
red-jubjub			`Redjubjub` implementation. This includes RedDSA interfact and public key encryption algorithm.