Block #621,560

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/7/2014, 12:54:17 PM · Difficulty 10.9521 · 6,188,202 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
946daa53a81fb94b646c629bff2643900ed7393ab9763367b68cef1b2f3bfae5

Height

#621,560

Difficulty

10.952136

Transactions

2

Size

14.74 KB

Version

2

Bits

0af3bf37

Nonce

25,313,401

Timestamp

7/7/2014, 12:54:17 PM

Confirmations

6,188,202

Merkle Root

f4968053ae5a36aa9e828c03a1ce1030abb4f2000e2e96e405b4d63f03c4ec5a
Transactions (2)
1 in → 1 out8.4800 XPM116 B
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.

7.517 × 10⁹⁵(96-digit number)
75173636806739502824…20663270110935846399
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
7.517 × 10⁹⁵(96-digit number)
75173636806739502824…20663270110935846399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.503 × 10⁹⁶(97-digit number)
15034727361347900564…41326540221871692799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.006 × 10⁹⁶(97-digit number)
30069454722695801129…82653080443743385599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.013 × 10⁹⁶(97-digit number)
60138909445391602259…65306160887486771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.202 × 10⁹⁷(98-digit number)
12027781889078320451…30612321774973542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.405 × 10⁹⁷(98-digit number)
24055563778156640903…61224643549947084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.811 × 10⁹⁷(98-digit number)
48111127556313281807…22449287099894169599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.622 × 10⁹⁷(98-digit number)
96222255112626563615…44898574199788339199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.924 × 10⁹⁸(99-digit number)
19244451022525312723…89797148399576678399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.848 × 10⁹⁸(99-digit number)
38488902045050625446…79594296799153356799
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 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
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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,722,183 XPM·at block #6,809,761 · 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