Block #2,471,120

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/13/2018, 1:22:26 PM · Difficulty 10.9617 · 4,370,567 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
aef2a28ffdff48f7b18f1f23335b89ae0400ee51bc4909cfa261d857fe486287

Height

#2,471,120

Difficulty

10.961664

Transactions

17

Size

6.60 KB

Version

2

Bits

0af62fa0

Nonce

1,108,179,790

Timestamp

1/13/2018, 1:22:26 PM

Confirmations

4,370,567

Merkle Root

a70bb2ee00d985de7f97806cd298ff1abfb740c6720143354a5b6a802e82110c
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.

4.478 × 10⁹³(94-digit number)
44780294855278288053…24395612116274796381
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
4.478 × 10⁹³(94-digit number)
44780294855278288053…24395612116274796381
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.956 × 10⁹³(94-digit number)
89560589710556576106…48791224232549592761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.791 × 10⁹⁴(95-digit number)
17912117942111315221…97582448465099185521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.582 × 10⁹⁴(95-digit number)
35824235884222630442…95164896930198371041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.164 × 10⁹⁴(95-digit number)
71648471768445260885…90329793860396742081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.432 × 10⁹⁵(96-digit number)
14329694353689052177…80659587720793484161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.865 × 10⁹⁵(96-digit number)
28659388707378104354…61319175441586968321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.731 × 10⁹⁵(96-digit number)
57318777414756208708…22638350883173936641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.146 × 10⁹⁶(97-digit number)
11463755482951241741…45276701766347873281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.292 × 10⁹⁶(97-digit number)
22927510965902483483…90553403532695746561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.585 × 10⁹⁶(97-digit number)
45855021931804966966…81106807065391493121
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 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
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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,977,884 XPM·at block #6,841,686 · 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