Block #571,626

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/1/2014, 2:33:05 PM · Difficulty 10.9654 · 6,244,965 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eb7e9c4772384bb33230cc4d2fb53995b501c4ef0dd1c5c06ea4322207f16821

Height

#571,626

Difficulty

10.965437

Transactions

1

Size

529 B

Version

2

Bits

0af726de

Nonce

146,949

Timestamp

6/1/2014, 2:33:05 PM

Confirmations

6,244,965

Merkle Root

839e48e45d758ddb3dd021183fa2a347f3fd5a2c8447e0fc98a5660f7bcd19e7
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.404 × 10⁹⁹(100-digit number)
14049006042440134036…71006621588721213441
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.404 × 10⁹⁹(100-digit number)
14049006042440134036…71006621588721213441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.809 × 10⁹⁹(100-digit number)
28098012084880268072…42013243177442426881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.619 × 10⁹⁹(100-digit number)
56196024169760536145…84026486354884853761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.123 × 10¹⁰⁰(101-digit number)
11239204833952107229…68052972709769707521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.247 × 10¹⁰⁰(101-digit number)
22478409667904214458…36105945419539415041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.495 × 10¹⁰⁰(101-digit number)
44956819335808428916…72211890839078830081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.991 × 10¹⁰⁰(101-digit number)
89913638671616857832…44423781678157660161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.798 × 10¹⁰¹(102-digit number)
17982727734323371566…88847563356315320321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.596 × 10¹⁰¹(102-digit number)
35965455468646743132…77695126712630640641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.193 × 10¹⁰¹(102-digit number)
71930910937293486265…55390253425261281281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.438 × 10¹⁰²(103-digit number)
14386182187458697253…10780506850522562561
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,776,852 XPM·at block #6,816,590 · 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