Block #1,053,754

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/10/2015, 7:31:03 PM · Difficulty 10.7332 · 5,754,500 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
29f9071ec4c1a0026a460032b68155ecd736060a605917fe6c0bbad716559652

Height

#1,053,754

Difficulty

10.733151

Transactions

2

Size

581 B

Version

2

Bits

0abbafc9

Nonce

918,354,130

Timestamp

5/10/2015, 7:31:03 PM

Confirmations

5,754,500

Merkle Root

a2e34521d5cc9022e7f8c25feefd5c6176b28b6cb9197cbe9d63cc5d70a6d796
Transactions (2)
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

1.606 × 10⁹⁶(97-digit number)
16063630989455892870…46682922271706070721
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
1.606 × 10⁹⁶(97-digit number)
16063630989455892870…46682922271706070721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.212 × 10⁹⁶(97-digit number)
32127261978911785740…93365844543412141441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.425 × 10⁹⁶(97-digit number)
64254523957823571481…86731689086824282881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.285 × 10⁹⁷(98-digit number)
12850904791564714296…73463378173648565761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.570 × 10⁹⁷(98-digit number)
25701809583129428592…46926756347297131521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.140 × 10⁹⁷(98-digit number)
51403619166258857185…93853512694594263041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.028 × 10⁹⁸(99-digit number)
10280723833251771437…87707025389188526081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.056 × 10⁹⁸(99-digit number)
20561447666503542874…75414050778377052161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.112 × 10⁹⁸(99-digit number)
41122895333007085748…50828101556754104321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.224 × 10⁹⁸(99-digit number)
82245790666014171496…01656203113508208641
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,710,078 XPM·at block #6,808,253 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy