Block #572,003

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/1/2014, 7:58:32 PM · Difficulty 10.9658 · 6,242,296 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2b67104850a728d03ae4fbe736a419c9fa857bb8845e0ebf1144c041a047d158

Height

#572,003

Difficulty

10.965811

Transactions

7

Size

3.69 KB

Version

2

Bits

0af73f6b

Nonce

6,572,413

Timestamp

6/1/2014, 7:58:32 PM

Confirmations

6,242,296

Merkle Root

a706b324e3476fbf93cddeba152180e2a2a3caf85886914a942ba006677ec68c
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.311 × 10⁹⁷(98-digit number)
43119219913498499616…60125860981820366001
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.311 × 10⁹⁷(98-digit number)
43119219913498499616…60125860981820366001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.623 × 10⁹⁷(98-digit number)
86238439826996999233…20251721963640732001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.724 × 10⁹⁸(99-digit number)
17247687965399399846…40503443927281464001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.449 × 10⁹⁸(99-digit number)
34495375930798799693…81006887854562928001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.899 × 10⁹⁸(99-digit number)
68990751861597599386…62013775709125856001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.379 × 10⁹⁹(100-digit number)
13798150372319519877…24027551418251712001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.759 × 10⁹⁹(100-digit number)
27596300744639039754…48055102836503424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.519 × 10⁹⁹(100-digit number)
55192601489278079509…96110205673006848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.103 × 10¹⁰⁰(101-digit number)
11038520297855615901…92220411346013696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.207 × 10¹⁰⁰(101-digit number)
22077040595711231803…84440822692027392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.415 × 10¹⁰⁰(101-digit number)
44154081191422463607…68881645384054784001
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,758,456 XPM·at block #6,814,298 · 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