Block #2,471,629

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2018, 8:50:15 PM · Difficulty 10.9621 · 4,371,912 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
acb0499d93f49026632c10604a00a55de8acd3353f27c139b6c6d5091269a7cc

Height

#2,471,629

Difficulty

10.962150

Transactions

20

Size

10.00 KB

Version

2

Bits

0af64f73

Nonce

14,522,156

Timestamp

1/13/2018, 8:50:15 PM

Confirmations

4,371,912

Merkle Root

9de5572ac4335981257086b680a44da98126b9fccdc98ea86610c0bee3e7dbb3
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.

2.772 × 10⁹⁵(96-digit number)
27722931876599554940…37942082405693034239
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
2.772 × 10⁹⁵(96-digit number)
27722931876599554940…37942082405693034239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.544 × 10⁹⁵(96-digit number)
55445863753199109881…75884164811386068479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.108 × 10⁹⁶(97-digit number)
11089172750639821976…51768329622772136959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.217 × 10⁹⁶(97-digit number)
22178345501279643952…03536659245544273919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.435 × 10⁹⁶(97-digit number)
44356691002559287905…07073318491088547839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.871 × 10⁹⁶(97-digit number)
88713382005118575810…14146636982177095679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.774 × 10⁹⁷(98-digit number)
17742676401023715162…28293273964354191359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.548 × 10⁹⁷(98-digit number)
35485352802047430324…56586547928708382719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.097 × 10⁹⁷(98-digit number)
70970705604094860648…13173095857416765439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.419 × 10⁹⁸(99-digit number)
14194141120818972129…26346191714833530879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.838 × 10⁹⁸(99-digit number)
28388282241637944259…52692383429667061759
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the First 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,992,703 XPM·at block #6,843,540 · 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.
Privacy Policy·

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