Block #567,744

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/29/2014, 10:24:43 PM · Difficulty 10.9651 · 6,240,627 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6b97eb829b8cc28e09e3f53ff043a7acc6ce1ee34a6fe0aee14f0f040d15e7f8

Height

#567,744

Difficulty

10.965072

Transactions

2

Size

1.00 KB

Version

2

Bits

0af70efb

Nonce

19,887,626

Timestamp

5/29/2014, 10:24:43 PM

Confirmations

6,240,627

Merkle Root

15997bddbb260547df4b4c56d4dacc93a592b8b2be44d2fa16bbaa513884afb9
Transactions (2)
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.450 × 10⁹⁷(98-digit number)
24502385790828391520…72417879759324851041
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.450 × 10⁹⁷(98-digit number)
24502385790828391520…72417879759324851041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.900 × 10⁹⁷(98-digit number)
49004771581656783040…44835759518649702081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.800 × 10⁹⁷(98-digit number)
98009543163313566080…89671519037299404161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.960 × 10⁹⁸(99-digit number)
19601908632662713216…79343038074598808321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.920 × 10⁹⁸(99-digit number)
39203817265325426432…58686076149197616641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.840 × 10⁹⁸(99-digit number)
78407634530650852864…17372152298395233281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.568 × 10⁹⁹(100-digit number)
15681526906130170572…34744304596790466561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.136 × 10⁹⁹(100-digit number)
31363053812260341145…69488609193580933121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.272 × 10⁹⁹(100-digit number)
62726107624520682291…38977218387161866241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.254 × 10¹⁰⁰(101-digit number)
12545221524904136458…77954436774323732481
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 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
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 2CC formula:

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