Block #548,719

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/17/2014, 4:05:44 AM · Difficulty 10.9596 · 6,268,371 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
32908781264a3ebb37eac45b2fa3a799b239881c019ed711285a4e3e6af7111b

Height

#548,719

Difficulty

10.959642

Transactions

11

Size

3.02 KB

Version

2

Bits

0af5ab15

Nonce

6,625,688

Timestamp

5/17/2014, 4:05:44 AM

Confirmations

6,268,371

Merkle Root

f0d34e6c78e783dc3c25513a880cc77f9b6d1cb5a0ad007745c8bba300f6190f
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.925 × 10⁹⁹(100-digit number)
19253393689264011048…84280429697358151041
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.925 × 10⁹⁹(100-digit number)
19253393689264011048…84280429697358151041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.850 × 10⁹⁹(100-digit number)
38506787378528022097…68560859394716302081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.701 × 10⁹⁹(100-digit number)
77013574757056044194…37121718789432604161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.540 × 10¹⁰⁰(101-digit number)
15402714951411208838…74243437578865208321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.080 × 10¹⁰⁰(101-digit number)
30805429902822417677…48486875157730416641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.161 × 10¹⁰⁰(101-digit number)
61610859805644835355…96973750315460833281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.232 × 10¹⁰¹(102-digit number)
12322171961128967071…93947500630921666561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.464 × 10¹⁰¹(102-digit number)
24644343922257934142…87895001261843333121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.928 × 10¹⁰¹(102-digit number)
49288687844515868284…75790002523686666241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.857 × 10¹⁰¹(102-digit number)
98577375689031736568…51580005047373332481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.971 × 10¹⁰²(103-digit number)
19715475137806347313…03160010094746664961
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,780,759 XPM·at block #6,817,089 · 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