Vote for ChainX’s First Referendum and Share 1000 USDT

4 min readJan 6, 2021

The ChainX 2.0 main net launch consists of four stages, which have gone through a chain suspension period, a POA period, and a stable period. At present, the 2.0 network is very stable and will enter the final stage of removing the Sudo super authority.

Removal of Sudo permissions requires the PolkaX development team to initiate a proposal, and all people participate in a referendum. After the final proposal is passed, Sudo will be removed.

This is the first referendum on the ChainX chain, and it is also the first time that ChainX users participate in 2.0 on-chain governance in the true sense. In order to encourage more people to participate in on-chain governance, and to popularize the on-chain governance process in the community, we will randomly select 10 users participating in on-chain governance will share 1,000 USDT equivalent PCX.

Sudo is a super authority, which can temporarily control part of the functions of the network by the development team, which can effectively prevent any security issues during network upgrades and enable quick response to operations. At present, the ChainX 2.0 network has been running smoothly for more than one month, so the development team decided to remove Sudo, and ChainX 2.0 will be fully upgraded afterward.

Participation rules:

1) Follow @chainx_org

2) RT& TAG 3 of your friends

3) Participate in the referendum and 10 users will be drawn to share the PCX equivalent of 1000 USDT.

Lucky draw plan:

condition

1）Let the height of the end block of the activity be H;

2）Suppose that 10 users to be drawn for the lottery has been clearly sorted as the sequence Seq = [C1, C2, C3, … C10];

3）We want to randomly select 10 lucky users.

Proposal:

Step 1

1）Take the block with height H+1 as the source of randomness, and its block hash is: BH(H+1),

2）For example: when H=601895,

3）BH(601895+1) = BH(601896) = 0x0b595c9311e3beca7de4d6d33645e48d01e577fc3af77ef65effed9dffa1e94e

Step 2

The hash value consists of 32 bytes IndexSeq = [b0, b1, … b31];

Step 3

1）Each byte in IndexSeq is used as an index to determine a lucky user:

k0 = b0 mod n => Seq[k0] winning;

2）Remove the k0 user from Seq; k1 = b1 mod (n-1) => Seq[k1] won;

Remove k1 user from Seq;

3）Continue until the number of lucky draws is satisfied or 10 lucky users are reached.

Step 4

Select the next random source block as appropriate and repeat the above steps.

How to Participate

This removal of sudo is carried out by the method of initiating a democratic proposal on the chain. The entire removal process includes 4 stages of initiating a national proposal and a seconding period, a referendum period, an execution waiting period, and a proposal execution period.

The proposal to remove sudo this time, the technical committee initiated and seconded the proposal of “remove sudo”. It will enter the voting stage on January 6, 2021 at 15:30, and it is expected to end voting on January 13, 2021, 15:30. After the proposal is passed successfully, 15:30 on January 13, 2021–15:30 on January 21, 2021 will be the waiting period for the implementation of this proposal. If there is no objection from the technical committee during the waiting period, the sudo removal operation will be automatically executed around 15:30 on 1/21/2021. The proposal to remove Sudo is currently in the referendum period