CAMELINK - HIGH PERFORMANCE PROOF

OF STAKE BLOCKCHAIN
Bryan T. and team
Digital Unicorn

V0.0.1
December 2021

Abstract (IMPROVING)

In this paper, we present an overview of the architectural design of Camelink technology and
solutions. Camelink is a Proof-of-Stake (PoS) blockchain with the following advantages: low
transaction fee, fast confirmation time, double validation and randomization for security
guarantees. In particular, we propose a PoS-based blockchain protocol with a fair voting
mechanism, rigorous security guarantees and fast finality.
1. INTRODUCTION (UPDATING)

Legal Disclaimer

Nothing in this White Paper is an offer to sell, or the solicitation of an offer to buy, any tokens.
Camelink is publishing this White Paper solely to receive feedback and comments from the
public. Nothing in this White Paper should be treated or read as a guarantee or promise of
how Camelink business or the tokens will develop or of the utility or value of the tokens. This
White Paper outlines current plans, which could change at its discretion, and the success of
which will depend on many factors outside Camelink control, including market-based factors
and factors within the data and cryptocurrency industries, among others. Any statements
about future events are based solely on Camelink analysis of the issues described in this
White Paper. That analysis may prove to be incorrect.

1
2. MOTIVATION

The market for camel products has a huge potential. Unfortunately, there is a lack of public
awareness and much of the potential of the world’s herds remains and will remain untapped
without structural change, alliance, universal promotion and official recognition.

The Camelink team aims to create and develop a cryptocurrency (Camelcoin), design its own
information exchange network (CameLink Blockchain) and facilitate the democratisation and
recognition of camel products in the world. This triple solution will collectively help support the
economic development of all activities around camelids, stimulate innovation in all sectors of
these activities (food, cosmetics, tourism, textiles, sports, etc.) and improve the position of
these markets globally as well as create new income-generating activities in particular areas
in need.

In addition to exchanges, CameLink will also ensure the creation of a quality label and rapid
progress in research and innovation thanks to a reliable, updated and tamper-proof database.
CameLink will also be an international laboratory in collaboration with the African Agricultural
Research Centre that will make significant progress in the areas of camel milk preservation,
therapeutic use of camel urine against cancer and other autoimmune diseases in various
processes (capsules, powder, creams, etc.), research on the use of camel milk in the fight
against autism. The use of dheroua (camel hump fat) against all gastric diseases and skin
diseases, the effectiveness of camel products against diabetes, and cholesterol plagues.

The laboratory will become THE world reference. Every breeder or manufacturer of camel
products on the planet will be able to have their products analysed free of charge by DHL
within 48 hours; the credit will go to the CamelCoin development funds to facilitate their
commercial and international administrative procedures.

All results from international laboratories can be inserted, verified, validated and approved in
the CameLink blockchain to become irrefutable and absolute. The potential and virtues of
camel products have been known for thousands of years. Unfortunately, today, this ancient
knowledge is buried under a mass of data and, due to a lack of information and promotion,
has remained cloistered within the herding communities and has spread very little to the
informed Muslim community. We estimate that only 10% of camel milk production is used
today for food and commercial purposes, the rest has been lost forever. It is time for change.

CamelCoin and CameLink provide a platform where we will teach, educate and convey what
blockchain technology is, how it is revolutionary and how it will change the daily lives of millions
of people. Many projects, new ideas and valuable information can be correlated and thus
helped in their creation and launch to generate revenue generating activities while providing
medical, health and wellness solutions to a whole population that does not find its needs in
the main products on the markets.

2
3. CAMELINK
3.1. Overview
3.1.1. Blockchain networks

As illustrated in Fig.1, in the blockchain, transactions (data) are stored in blocks which form
an ever-growing sequence (chain) shared among participants in the network. Transactions
are the fundamental units of a blockchain. For example, when Alice wants to send money to
Bob, she creates a transaction which consists of her address as the input, her digital signature
to verify that this transaction is made by her, the amount of money to be sent, and Bob’s
address as the output. Alice then broadcasts this transaction to the network. A miner, i.e., a
consensus participant, after receiving the transaction, will validate and include Alice’s
transaction, along with other transactions received from other users, into a block. If the block
is mined successfully, the miner will broadcast the block to the network for other nodes to
verify the mined block. If this block is verified successfully and identified to be the first block
mined after the last block in the chain, it will be integrated into the chain and marked as the
latest block in the chain. Besides the transactions, a block also contains a hash pointer created
by hash functions to map all the block contents to the hash pointer. The main feature of the
hash functions is to ensure that the chain is tamper- evident. It means that any change in the
previous data will result in a different hash value in the next block, and it can be traced back
to the genesis block, i.e., the first block of the chain. A block can also contain additional data
depending on requirements of different consensus mechanisms. To reduce storage space,
the transactions in a block can be stored in the form of a Merkle tree.

3
 Figure 1: Blockchain networks

3.1.2. Benefits and applications

Although blockchain technology attracts a lot of attention due to the successful implementation
of cryptocurrencies, its benefits extend far beyond. The key benefits of blockchain technology
are as follow:

● Decentralisation: Blockchain networks are not con- trolled by a central controller. Thus,
they do not have any single point of failure. Instead, all the nodes reach the agreement
on the state of the network by participating in the distributed consensus mechanisms.
● Transparency: Data stored in a blockchain is visible to all network participants.
● Immutability: Once the data is stored in the blockchain, it is extremely difficult to be
altered. Moreover, thanks to the distributed consensus mechanisms, the network can
achieve consensus on the data even in a trustless environment.
● Security and Privacy: Using cryptographically secure mechanisms, the privacy and
security of the network participants can be significantly enhanced. Users in the network
use a pair of public and private keys for identification and verification. When a user

4
 makes a transaction, a digital signature is used, which can be easily verified but
impossible to forge.

As we now know, Blockchain technology has many applications in a number of areas. Many
companies from many industries are trying to apply the Blockchain in their current system
where Blockchain can bring many benefits for them. There are many forms of blockchain
implementation.

● Banking and Finance: Perhaps no industry stands to benefit from integrating

blockchain into its business operations more than banking. Financial institutions only
operate during business hours, five days a week. That means if you try to deposit a
check on Friday at 6 p.m., you will likely have to wait until Monday morning to see that
money hit your account. Even if you do make your deposit during business hours, the
transaction can still take one to three days to verify due to the sheer volume of
transactions that banks need to settle. Blockchain, on the other hand, never sleeps.
● Cryptocurrencies: Cryptocurrencies, e.g., Bitcoin, Ethereum, Cardano, are the most
famous applications of blockchain technologies. By spreading its operations across a
network of computers, blockchain allows Bitcoin and other cryptocurrencies to operate
without the need for a central authority. This not only reduces risk but also eliminates
many of the processing and transaction fees. It can also give those in countries with
unstable currencies or financial infrastructures a more stable currency with more
applications and a wider network of individuals and institutions they can do business
with, both domestically and internationally.
● Supply Chains: Supply chains are the most important sectors. Users can track the
origin of products you buy. Camelink and Camelcoin as a currency take advanced in
this industry

3.2. Protocol (IMPROVING)

5
 Figure 2 : Camelink consensus mechanism

3.3. Consensus mechanism

Nodes in a blockchain network can be faulty, performing arbitrary or malicious behaviours, or

possessing misinformation due to connection latency, i.e., Byzantine failures. The consensus
mechanism is thus the core component of a blockchain network, which ensures that every
participant agrees on the state of the network in such trustless environments. The consensus
mechanism also governs other operations of the network, such as transaction adding and
incentivizing the participants to behave properly.

6
 3.3.1. Proof of work

To implement a distributed timestamp server on a peer-to-peer basis, we will need to use a

proof-of-work system similar to Adam Back's Hashcash, rather than newspaper or Usenet
posts. The proof-of-work involves scanning for a value that when hashed, such as with SHA-
256, the hash begins with a number of zero bits. The average work required is exponential in
the number of zero bits required and can be verified by executing a single hash. For our
timestamp network, we implement the proof-of-work by incrementing a nonce in the block until
a value is found that gives the block's hash the required zero bits. Once the CPU effort has
been expended to make it satisfy the proof-of-work, the block cannot be changed without
redoing the work. As later blocks are chained after it, the work to change the block would
include redoing all the blocks after it. [7]

The proof-of-work also solves the problem of determining representation in majority decision
making. If the majority were based on one-IP-address-one-vote, it could be subverted by
anyone able to allocate many IPs. Proof-of-work is essentially one-CPU-one-vote. The
majority decision is represented by the longest chain, which has the greatest proof-of-work
effort invested in it. If a majority of CPU power is controlled by honest nodes, the honest chain
will grow the fastest and outpace any competing chains. To modify a past block, an attacker
would have to redo the proof-of-work of the block and all blocks after it and then catch up with
and surpass the work of the honest nodes. We will show later that the probability of a slower
attacker catching up diminishes exponentially as subsequent blocks are added. To
compensate for increasing hardware speed and varying interest in running nodes over time,
the proof-of-work difficulty is determined by a moving average targeting an average number
of blocks per hour. If they're generated too fast, the difficulty increases [7].

3.3.2. Proof Of Stake Consensus

The proof of stake (PoS) model is based on the idea that the more stake a user has invested
into the system, the more likely they will want the system to succeed, and the less likely they
will want to subvert it. Stake is often an amount of cryptocurrency that the blockchain network
user has invested into the system (through various means, such as by locking it via a special
transaction type, or by sending it to a specific address, or holding it within special wallet
software). Once staked, the cryptocurrency is generally no longer able to be spent. Proof of
stake blockchain networks use the amount of stake a user has as a determining factor for
publishing new blocks. Thus, the likelihood of a blockchain network user publishing a new

7
block is tied to the ratio of their stake to the overall blockchain network amount of staked
cryptocurrency.

With this consensus model, there is no need to perform resource intensive computations
(involving time, electricity, and processing power) as found in proof of work. Since this
consensus model utilises fewer resources, some blockchain networks have decided to forego
a block creation reward; these systems are designed so that all the cryptocurrency is already
distributed among users rather than new cryptocurrency being generated at a constant pace.
In such systems, the reward for block publication is then usually the earning of user provided
transaction fees.

The methods for how the blockchain network use the stake can vary. Here we discuss four
approaches: random selection of staked users, multi-round voting, coin ageing systems and
delegate systems. Regardless of the exact approach, users with more stake are more likely
to publish new blocks. When the choice of block publisher is a random choice (sometimes
referred to as chain-based proof of stake), the blockchain network will look at all users with
stake and choose amongst them based on their ratio of stake to the overall amount of
cryptocurrency staked. So, if a user had 42 % of the entire blockchain network stake they
would be chosen 42 % of the time; those with 1 % would be chosen 1 % of the time. When
the choice of block publisher is a multi-round voting system (sometimes referred to as
Byzantine fault tolerance proof of stake) there is added complexity. The blockchain network
will select several staked users to create proposed blocks. Then all staked users will cast a
vote for a proposed block. Several rounds of voting may occur before a new block is decided
upon. This method allows all staked users to have a voice in the block selection process for
every new block.

When the choice of block publisher is through a coin age system referred to as a coinage proof
of stake, staked cryptocurrency has an age property. After a certain amount of time (such as
30 days) the staked cryptocurrency can count towards the owning user being selected to
publish the next block. The staked cryptocurrency then has its age reset, and it cannot be
used again until after the requisite time has passed. This method allows for users with more
stake to publish more blocks, but to not dominate the system – since they have a cooldown
timer attached to every cryptocurrency coin counted towards creating blocks. Older coins and
larger groups of coins will increase the probability of being chosen to publish the next block.
To prevent stakeholders from hoarding aged cryptocurrencies, there is generally a built-in
maximum to the probability of winning.

When the choice of block publisher is through a delegate system, users vote for nodes to
become publishing nodes – therefore creating blocks on their behalf. Blockchain network
users’ voting power is tied to their stake so the larger the stake, the more weight the vote has.
Nodes who receive the most votes become publishing nodes and can validate and publish
blocks. Blockchain network users can also vote against an established publishing node, to try
to remove them from the set of publishing nodes. Voting for publishing nodes is continuous
and remaining a publishing node can be quite competitive. The threat of losing publishing node

8
status, and therefore rewards and reputation is constant so publishing nodes are incentivized
to not act maliciously. Additionally, blockchain network users vote for delegates, who
participate in the governance of the blockchain. Delegates will propose changes, and
improvements, which will be voted on by blockchain network users.

It is worth noting that a problem known as “nothing at stake” may arise from some proof of
stake algorithms. If multiple competing blockchains were to exist at some point, a staked user
could act on every such competing chain – since it is essentially free to do so. The staked user
may do this as a way of increasing their odds of earning a reward. This can cause multiple
blockchain branches to continue to grow without being reconciled into a singular branch for
extended periods of time.

Under proof of stake systems, the “rich” can more easily stake more of the digital assets,
earning themselves more digital assets; however, to obtain the majority of digital assets within
a system to “control” it is generally cost prohibitive. [8]

3.3.2.1. Fundamental background

Proof-of-Stake (PoS) protocols were developed as energy-saving alternatives to PoW. Instead

of computational power resources, leaders are selected based on their stakes, i.e.,
contributions to the blockchain network. Particularly in the PoS consensus mechanism, the
stake of a node is the number of digital tokens, e.g., coins in cryptocurrencies, that it holds or
deposits. Instead of consuming a lot of energy for the searching process as in the PoW, a
leader will be selected based on its stakes to perform the mining process and add a new block
to the chain as illustrated in Fig. 2. To sim- ulate the stake-based leader selection process,
the Follow- the-Satoshi (FTS) algorithm has been adopted in many PoS-based blockchain
networks such as Cardano, Sp8de, and Tezos. In these networks, all the tokens are indexed.
The FTS algorithm is a hash function that takes a seed (i.e., a string of arbitrary length such
as the previous block’s header or a random string created by some other selected nodes) as
the input. The FTS algorithm then outputs a token index. Using the index, the algorithm
searches the transaction history to find and select the current owner of that token to be the
leader. Therefore, the probability pi that node i is selected to be the leader in a network of N
participants is:

"
𝑝! = ∑# ! " ,
"$% "

where 𝑆& is the stake of participant i. This means that the more stake a node holds, the higher
chance it is selected to be the leader.

Besides the advantage of low energy consumption, the PoS mechanisms have faster
transaction confirmation speed than that of the PoW mechanisms. In a blockchain network,
the confirmation of a transaction depends on two main fac- tors, namely transaction throughput
and block confirmation time. The transaction throughput is the number of transac- tions per

9
second Tx/s a network can process, which is vital to the performance of the network especially
when there are many pending transactions. Tx/s can be calculated by:

𝐵𝑙𝑜𝑐𝑘'&()
𝑇𝑥/𝑠 =
𝑇𝑥*&() × 𝐵𝑙𝑜𝑐𝑘+&,)

3.3.2.2. Stake pools

Stake pools and stakeholders

In the PoS networks, the probability that an individual stake-holder with a small stake amount
is selected to be the leader is low. Moreover, to participate in the consensus process, a node
must always be connected to the network, which incurs an operational cost. Therefore, small
stakeholders often pool their stakes together to increase their opportunities to win blocks and
share operational costs, which results in the for- mation of stake pools. Similar to the mining
pools in PoW networks, a stake pool is considered to be a single node, and thus it poses a
threat of centralising the PoS networks. In par- ticular, the stakeholders, e.g., RSUs, in the IoV
networks often have to perform additional tasks, such as processing carpooling records and
vehicle trust rating inquiries. Thus, the RSUs in these networks might be more inclined to join
the stake pools to reduce their operational costs. In this section, we examine the stake pools
from a game theoretical perspective to determine the strategic decisions of the stake- holders,
and how these decisions affect the decentralisation of the PoS networks.

System Model

Consider N stakeholders with stakes S = (𝑠- , . . . , 𝑠. ) and M stake pools with costs c =
(𝑐- ,...,𝑐/ ) and fees α = (𝛼- , . . . , 𝛼/ ) in the network. The pool costs are charged for joining the
pool and maintaining its operations. The pool’s fee is the profit margin of the pool’s owner,
which is usually 3% in real-world stake pools, e.g Stakecube. When the stakeholder i invests
an amount smi in the pool m, the expected reward rim is given by:

"
𝑟&, = 𝜌, 𝜑&, (1 − 𝛼, )𝑅 − 𝑐, 𝑒 0*! ,

where 𝜌, is the proportion of pool m’s stake in the total net- work stake, 𝜑,
& is the proportion
of player i’s stake in the total stake of pool m, and R is the block reward. The pool charges a
"
fee of αm percentage from each stakeholder’s reward and a cost of 𝑐, 𝑒 0*! . It is worth noting
that the cost is inversely proportional to 𝑠&, , which incentivizes the stakeholders to invest more
stake into the pool. Let 𝑁0& denote the set of all the stakeholders except stakeholder i, the
stake proportion of pool m is:

𝑠&, + 𝜎, + ∑ 𝑘 𝜖 𝑁0& 𝑠2,

𝜌, =
𝜏

10
where 𝜏 = ∑𝑁 𝑀 𝑚
𝑖=1 ∑𝑚=1 𝑠𝑖 is the total stake of the network, ∑ 𝑘 𝜖 𝑁−𝑖 𝑠𝑚
𝑘 is the stakes invested
in pool m by all the other stakeholders except stakeholder i, and 𝜎, is the current stake of pool
m. Thus, 𝜌, is the chance that the pool m is selected to be the leader and can receive the
block reward R. When pool m receives the reward, it calculates each stakeholder’s share
based on how much the stakeholder invested in the pool, which is:

*!"
𝜑&, = ,
*!" ; <" ; ∑ 2 > .#! *%"

for stakeholder i. The cost and fee of the pool are then deducted from each stakeholder’s
share before it is finally delivered to each stakeholder.

3.3.2.3. Smart contract

The term smart contract dates to 1994, defined by Nick Szabo as “a computerised transaction
protocol that executes the terms of a contract. The general objectives of smart contract design
are to satisfy common contractual conditions (such as payment terms, liens, confidentiality,
and even enforcement), minimise exceptions both malicious and accidental, and minimise the
need for trusted intermediaries.”.

Smart contracts extend and leverage blockchain technology. A smart contract is a collection
of code and data (sometimes referred to as functions and state) that is deployed using
cryptographically signed transactions on the blockchain network (e.g., Ethereum’s smart
contracts, Hyperledger Fabric’s chaincode). The smart contract is executed by nodes within
the blockchain network; all nodes that execute the smart contract must derive the same results
from the execution, and the results of execution are recorded on the blockchain.

Blockchain network users can create transactions which send data to public functions offered
by a smart contract. The smart contract executes the appropriate method with the user
provided data to perform a service. The code, being on the blockchain, is also tamper evident
and tamper resistant and therefore can be used (among other purposes) as a trusted third
party. A smart contract can perform calculations, store information, expose properties to reflect
a publicly exposed state and, if appropriate, automatically send funds to other accounts. It
does not necessarily even have to perform a financial function. For example, the authors of
this document have created an Ethereum smart contract that publicly generates trustworthy
random numbers. It is important to note that not every blockchain can run smart contracts.

The smart contract code can represent a multi-party transaction, typically in the context of a
business process. In a multi-party scenario, the benefit is that this can provide attestable data
and transparency that can foster trust, provide insight that can enable better business
decisions, reduce costs from reconciliation that exists in traditional business to business
applications, and reduce the time to complete a transaction.

11
Smart contracts must be deterministic, in that given an input they will always produce the same
output based on that input. Additionally, all the nodes executing the smart contract must agree
on the new state that is obtained after the execution. To achieve this, smart contracts cannot
operate on data outside of what is directly passed into it (e.g., smart contracts cannot obtain
web services data from within the smart contract – it would need to be passed in as a
parameter). Any smart contract which uses data from outside the context of its own system is
said to use an ‘Oracle’.

For many blockchain implementations, the publishing nodes execute the smart contract code
simultaneously when publishing new blocks. There are some blockchain implementations in
which there are publishing nodes which do not execute smart contract code, but instead
validate the results of the nodes that do. For smart contract enabled permissionless blockchain
networks (such as Ethereum) the user issuing a transaction to a smart contract will have to
pay for the cost of the code execution. There is a limit on how much execution time can be
consumed by a call to a smart contract, based on the complexity of the code. If this limit is
exceeded, execution stops, and the transaction is discarded. This mechanism not only
rewards the publishers for executing the smart contract code, but also prevents malicious
users from deploying and then accessing smart contracts that will perform a denial of service
on the publishing nodes by consuming all resources (e.g., using infinite loops).

For smart contract enabled permissioned blockchain networks, such as those utilising
Hyperledger Fabric’s chaincode, there may not be a requirement for users to pay for smart
contract code execution. These networks are designed around having known participants, and
other methods of preventing bad behaviour can be employed (e.g., revoking access).

At launch Camelink supports standard Solidity-based smart contracts through the Ethereum
virtual machine (EVM).

Create a smart contract with Solidity on CameLink:

// SPDX-License-Identifier: GPL-3.0
pragma solidity >=0.4.22 <0.9.0;
contract TokenCreator {
function createToken(bytes32 name)
public
returns (OwnedToken tokenAddress)
{
// Create a new `Token` contract and return its address.
// From the JavaScript side, the return type
// of this function is `address`, as this is
// the closest type available in the ABI.
return new OwnedToken(name);
}

function changeName(OwnedToken tokenAddress, bytes32 name) public {

// Again, the external type of `tokenAddress` is
// simply `address`.

12
 tokenAddress.changeName(name);
}

// Perform checks to determine if transferring a token to the

// `OwnedToken` contract should proceed
function isTokenTransferOK(address currentOwner, address newOwner)
public
pure
returns (bool ok)
{
// Check an arbitrary condition to see if transfer should proceed
return keccak256(abi.encodePacked(currentOwner, newOwner))[0] == 0x7f;
}
}

Most developers are familiar with Solidity so Camelink supports this language as a standard
for smart contracts.

3.3.2.4. Security

Distributed ledgers are recognized for their exceptional security measures. Participating
agents utilise cryptography encryption to compose transactions. The public and private keys
associated with transacting agents ensure the integrity on top of validation procedures that
hinder manipulation. The building blocks of blockchain security are cryptographic hashing
functions which generate unique identifiers with regulated length independent of the input.
Each hash is associated as an identifier for a block and correlates with the hash value of the
former block. The hash function is further utilised in a consensus mechanism for verification
of ongoing transactions.

3.3.3. Comparison:

Table 1: Consensus Mechanism Comparisons

PoW PoS Hybrid

Leader selection Based on hash rate Based on stake Depends on

varant

Energy consumption Significant Negligible Medium to

negligible

Hardware requirement High None Medium to none

Block generation speed Slow Fast Medium to high

Transaction confirmation Slow Fast Medium to high

speed

13
 Applications Bitcoin, Ethereum, Cardano, Casper, Peercoin,
etc. Camelink, etc.
Algorand, etc.

The security of PoS protocols depends on various factors. Among them, network synchrony
is crucial to the security of many PoS protocols because the leader selection pro- cesses are
simulated by voting rounds, where the voters send their votes to other participants. Since the
network cannot guarantee that all the messages are properly sent in practice due to network
delay and connection complexity, network synchrony has to be taken into account when
considering the protocol’s security. Some PoS protocols are proven to be secure as long as
the network is partially synchronous, where messages sent will reach their destinations within
a certain time limit, or asynchronous, i.e., messages may not reach their destinations.

Apart from the network synchrony, the incentive mechanism is also vital to the security of a
PoS consensus mechanism. On the one hand, the reward scheme has to incentivize
consensus participation by rewarding block creators and validators. On the other hand, it also
has to penalise malicious behaviours and prevent various attacks that specifically target PoS,
such as the attacks that involve creating a large number of blocks because it is much easier
to create blocks in PoS.

Below, we discuss in more detail some emerging PoS-based protocols which have been
widely implemented in practice, namely Ouroboros, Chains-of-Activity, Casper, Algorand, and
Tendermint. Their core components, namely the consensus processes, and the protocols are
then compared in Table 1.

4. USE CASES

Decentralised Finance (DeFi)

DeFi is rapidly growing beyond the limits of one chain. Camelink is fully compatible with
Ethereum assets, apps, and tooling with faster speeds, higher throughput, and lower fees.

● Asset Issuance
● Automated Market Makers (AMMs)
● Borrowing & Lending
● Decentralised Exchanges (DEXs)
● Derivatives
● Insurance
● Peer-to-Peer Payments
● Prediction Markets
● Stablecoins

14
Institutions, Enterprises, and Governments

Camelink is the best verifiable platform for institutions, enterprises, and governments. Launch
assets, build applications, and create subnets with complete control over your implementation
with compliance, data security, and other rulesets built into the foundation.

● Asset Issuance & Trading

● Debt Financing
● Digital Identity
● Document Tracking
● Fund Management
● Insurance
● Intellectual Property
● Lending
● Real Estate
● Supply Chain
● Trade Finance

Non-Fungible Tokens (NFTs)

Mint your own NFTs in seconds for fees less than a cent. Digitally prove ownership, and
streamline value flow. Create and share art, collectibles, and more with all the benefits and
none of the downside.

● Art
● Certifications and Licences
● Collectibles
● Credentials
● In-game Items
● Music

As a need of Camel-ecosystem, we have different kind of products and projects building on

Camelink Blockchain such as Camelcoin which is rewards and use on Camel-ecosystem,
HUMP which is a track the origin of products and also staking application, CamelZone - a
ecommerce platform, etc.

5. DIVERSE ECOSYSTEM
5.1. Camelink explorer
Camelink explorer effectively serves as a search engine for data within a Camelink network.
In a cryptocurrency environment, tools like Bitcoin Blockchain Explorer or BTC Blockchain
Explorer enable users to access different details relating to transactions on specific wallet

15
addresses and blockchains. These may include amounts transacted, the sources and
destinations of funds, and the status of various transactions. Using Camelink explorer, users
can access virtually any data related to transactions, wallets, and blockchains, including rich
lists and hidden messages on Camelink Blockchain.

On a technical level, blockchain explorer software uses an application programming interface

(API) and blockchain node to draw various bits of information from a network. The software
then uses a database to arrange the extracted data and presents it to the user in a searchable
format. The explorer performs searches through an organised table on the database in
response to user input.

The basic functions of Camelink explorer allow users to search and explore data about
recently mined blocks or transactions that recently occurred on the blockchain. Some
programs provide a screen displaying a live feed of blocks as they are mined, as well as the
data relating to each block.

5.2. Validator

Proof of stake takes a different approach to security by ensuring trust in a more old-fashioned
currency: money.

To participate in the blockchain verification process in proof of stake, users create a node, that
node can be run by one person or by a pool of people working together. You can think of a
node as a computer. The node is required to prove its trustworthiness by locking away a
certain amount of crypto coins, the same type generated by the blockchain they are verifying.
Imagine putting a deposit in escrow or locking it in a security bond. This process of locking
away is called staking.

For each block of transactions that needs to be verified, one node is selected by an algorithm
that takes many factors into account to both reward those with more coins staked and prevent
one node from getting too much control over the process. That node is responsible for
checking and publishing or adding the block to the chain.

Then all the other nodes get some time to make sure that everything looks good. If there is a
mistake or fraud, the node that published the problematic block is punished by having some
or all of their stacked coins destroyed. But if everything looks good, that node is rewarded with
more coins. This is both the security mechanism for the blockchain and the motivator for
participation.

A validator is a crucial part of the Proof of Stake (POS) consensus mechanism whose
responsibility is to verify blocks to earn rewards.

The decentralised nature of blockchain technology makes it impressive and so promising that
more and more people are adopting it. Every blockchain has building blocks that are called

16
nodes. They are responsible for holding data but this data needs to be first validated or verified
on the blockchain network. That’s where a validator comes into play.

Much like a banker who is responsible for verifying a transaction before its processing, a
validator verifies each incoming transaction.

A transaction can only be completed and its record can be added to the blockchain once its
accuracy and legal authenticity are checked—that’s done by a validator.

In the Proof-of-Stake mechanism, a validator determines whether or not a transaction

conforms to the rules that deem it as valid. The entire process makes a blockchain network
secure and transparent.

6. SUSTAINABILITY

At any particular moment, thousands of computers around the world are humming away,
crunching complex maths problems that create and sustain bitcoin.

This network gives bitcoin its appeal: decentralised, always on and easily tradeable. But it also
means the network is constantly using energy — a sticking point for many of the
cryptocurrency's sceptics and critics. And it's not just a bitcoin problem. Other cryptocurrencies
and blockchains including Ethereum have similar challenges.

A POW model—which both Bitcoin and Ethereum currently use—employs a consensus

mechanism that requires massive amounts of computational power. To verify electronic
transactions on the blockchain, miners compete to solve complex maths problems using
computer components, such as Bitcoin mining’s use of ASICs (application specific integrated
circuits) and Ethereum’s use of graphics cards.

Miners are incentivized to stack up hardware and solve as many hash computations as
possible to reap rewards in the form of coins. Because it demands massive amounts of
computational power, cryptocurrency mining is most popular in countries where energy is
cheap and accessible.

PoS technology allows a circumvention of the energy-intensive cryptographic problem solving

needed to mine cryptocurrencies in Proof of Work (PoW) systems. It allows owners to stake
their tokens as collateral in order to validate transactions by consensus on the network in
exchange for rewards, this often takes place in large public pools.

In effect, this means that PoS doesn’t require extra energy to prove trustworthiness, reducing
the overall energy consumption of the network substantially.

17
7. CONCLUSION
In this paper, we discussed the architecture and the foundation of the Camelink Blockchain.
Compared to other platforms today, which either run classical-style consensus protocols and
therefore are inherently non-scalable, or make usage of Nakamoto-style consensus that is
inefficient and imposes high operating costs, the Camelink is lightweight, fast, scalable,
secure, and efficient.

To be honest, this is not the best whitepaper ever. But with the development team of Camelink
Blockchain, we can make Camelink to be the best Blockchain.

Beside the consensus introduction, Camelink also introduces applications that belong to the
Camelink such as Explorer, Staking, also smart contract using Solidity so developers can
easily build on the Camelink.

8. ACKNOWLEDGMENT (DOING)
Especially to thank …….

18
REFERENCES: (UPDATING)

[1] Proof of Stake:

https://www.investopedia.com/terms/p/proof-stake-pos.asp

[2] Consensus without minting

https://tendermint.com/static/docs/tendermint.pdf

[3] Proof-of-stake Algorithm

https://blog.ethereum.org/2014/01/15/slasher-a-punitive-proof-of-stake-algorithm/

[4] Blockchain technology overview

https://nvlpubs.nist.gov/nistpubs/ir/2018/NIST.IR.8202.pdf

[5] Wai Yan Maung Maung Thin, Naipeng Dong, Guangdong Bai, and Jin
Song Dong “Formal Analysis of a PoS Blockchain” Available:
https://www.researchgate.net/publication/330030317_Formal_Analysis_of_a_Proof-of-
Stake_Blockchain [Accessed: Dec, 2018]

[6] Smart contracts Copyright (c) 1994 by Nick Szabo

Available:
https://www.fon.hum.uva.nl/rob/Courses/InformationInSpeech/CDROM/Literature/LOTwinter
school2006/szabo.best.vwh.net/smart.contracts.html

[7] Satoshi Nakamoto “Bitcoin: A Peer-to-Peer Electronic Cash System”

Available: https://bitcoin.org/bitcoin.pdf

[8] Nguyen, C. T., Hoang, D. T., Nguyen, D. N., Niyato, D., Nguyen, H. T., & Dutkiewicz, E.
(2019). Proof-of-stake consensus mechanisms for future blockchain networks : fundamentals,
applications and opportunities. Available: https://dr.ntu.edu.sg/handle/10356/107496

[9] Ethereum Wiki

[10] BAHAREH LASHKARI AND PETR MUSILEK “A Comprehensive Review of Blockchain

Consensus Mechanisms” March 24, 2021.

[11] Mastering Blockchain Third Edition

19