Block #569,302

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/31/2014, 1:53:04 AM · Difficulty 10.9645 · 6,239,626 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4c0053d50d880dfba001c0d4b0291d00272279418116316986f42dc7c58e838c

Height

#569,302

Difficulty

10.964504

Transactions

5

Size

1.23 KB

Version

2

Bits

0af6e9b8

Nonce

248,631,392

Timestamp

5/31/2014, 1:53:04 AM

Confirmations

6,239,626

Merkle Root

8f3083d866b2f82d8203d5b1f83f38a6bbd60bd2b84c16c6f6805860c6741943
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.009 × 10⁹⁷(98-digit number)
20093493108012574043…22319763578096465731
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.009 × 10⁹⁷(98-digit number)
20093493108012574043…22319763578096465731
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.018 × 10⁹⁷(98-digit number)
40186986216025148086…44639527156192931461
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.037 × 10⁹⁷(98-digit number)
80373972432050296173…89279054312385862921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.607 × 10⁹⁸(99-digit number)
16074794486410059234…78558108624771725841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.214 × 10⁹⁸(99-digit number)
32149588972820118469…57116217249543451681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.429 × 10⁹⁸(99-digit number)
64299177945640236938…14232434499086903361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.285 × 10⁹⁹(100-digit number)
12859835589128047387…28464868998173806721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.571 × 10⁹⁹(100-digit number)
25719671178256094775…56929737996347613441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.143 × 10⁹⁹(100-digit number)
51439342356512189550…13859475992695226881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.028 × 10¹⁰⁰(101-digit number)
10287868471302437910…27718951985390453761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.057 × 10¹⁰⁰(101-digit number)
20575736942604875820…55437903970780907521
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,715,480 XPM·at block #6,808,927 · 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