Block #549,110

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/17/2014, 9:28:31 AM · Difficulty 10.9602 · 6,277,554 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8cabae01e8e5afd205da598a3ea56131afc608257753d5306696006442aa15a6

Height

#549,110

Difficulty

10.960188

Transactions

1

Size

802 B

Version

2

Bits

0af5cede

Nonce

22,927

Timestamp

5/17/2014, 9:28:31 AM

Confirmations

6,277,554

Merkle Root

5fe9f61f8ff87da7eeb1f482ba1f733154bb9186d36546f8f31021f5575cc664
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.370 × 10¹⁰⁰(101-digit number)
73708441228100258567…59077114099721681921
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.370 × 10¹⁰⁰(101-digit number)
73708441228100258567…59077114099721681921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.474 × 10¹⁰¹(102-digit number)
14741688245620051713…18154228199443363841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.948 × 10¹⁰¹(102-digit number)
29483376491240103427…36308456398886727681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.896 × 10¹⁰¹(102-digit number)
58966752982480206854…72616912797773455361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.179 × 10¹⁰²(103-digit number)
11793350596496041370…45233825595546910721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.358 × 10¹⁰²(103-digit number)
23586701192992082741…90467651191093821441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.717 × 10¹⁰²(103-digit number)
47173402385984165483…80935302382187642881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.434 × 10¹⁰²(103-digit number)
94346804771968330966…61870604764375285761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.886 × 10¹⁰³(104-digit number)
18869360954393666193…23741209528750571521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.773 × 10¹⁰³(104-digit number)
37738721908787332386…47482419057501143041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.547 × 10¹⁰³(104-digit number)
75477443817574664773…94964838115002286081
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,857,460 XPM·at block #6,826,663 · 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