HOW DOES KAKLAB REALIZE PERMANENT STORAGE？
KAKLAB is created for digital content and cultural market, aiming to achieve a fair, safe, high-performance, scalable and versatile blockchain infrastructure. KAKLAB will be realized in two stages: building a distributed file storage system KAK File, and creating an NFT asset protocol through smart contract. In the first stage, KAKLAB will realize permanent storage of digital content achieved by IPFS underlying protocol; in the second stage, KAKLAB will realize multiple NFT-related protocols, cross-chain transfer, DApp development, etc. achieved by smart contracts.
KAK FILE is based on IPFS as the underlying technology, applying KAK as node incentive to achieve permanent storage of file data.
Like IPFS, KAKLAB stores and retrieves files based on content rather than address, any file resources stored in which will be generated with a unique hash value through an encryption algorithm. Since hash value of each file is unique, KAKLAB will delete duplicate files to ensure the uniqueness.
When requesting a file:
Only ask “Who owns this file” can you request a file from KAK File and then the node where the file is stored in the system will provide this file.
When verifying a file：
If you want to verify the file, you only need to compare the hash value of the file we got with the hash value we requested from KAK File. If the hash values are the same, then we get the correct and complete file.
KAKLAB implements KAK incentive and punishment mechanism to ensure nodes completely store files within specified time. Nodes need to deposit KAK first, after fulfilling their storage obligations, they will be rewarded and refunded.
Nodes in KAK File get reward from the following ways:
Storage reward: Storage service providers deposit KAK to become a storage service provider, and provide storage service within specific time to obtain rewards from customers;
Block generation reward: Storage service providers become validators through competition, and obtain rewards and fees through packaging blocks.
When the following rules are triggered, they will be punished or even emptied:
Consensus attack punishment: if a qualified node does not generate a new block required by the consensus mechanism, it will be regarded as a network attack;
Failure to submit the storage proof within specified time: if the delay time exceeds the generation attack threshold value, it will be considered as malicious offline that affects the security of the stored file.
Error in submitted storage proof: when a node has disk damage or data loss, it shall try to recover the data. If the proof submitted by the node deviates from the hash value of the customer’s source file, and the data is not recovered within specified time, it will be considered as malicious destruction.
Arnav Reddy was an iconic writer known for his science-fiction and high fantasy short stories. He was raised in a household in which the exploration of article ideas and fact-finding was encouraged. He became one of the most decorated writers in the publishing fraternity, winning multiple prizes for his excellent writing.
Disclaimer: The views, suggestions, and opinions expressed here are the sole responsibility of the experts. No Times of Chennai journalist was involved in the writing and production of this article.