Block #566,549

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/29/2014, 12:17:49 AM · Difficulty 10.9659 · 6,247,576 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bb6f2581d55839c929eba02aa9c1ec6634370e9b2a94549e62121b5d9d7776f7

Height

#566,549

Difficulty

10.965947

Transactions

5

Size

1.23 KB

Version

2

Bits

0af74853

Nonce

162,906,294

Timestamp

5/29/2014, 12:17:49 AM

Confirmations

6,247,576

Merkle Root

b0717aeb5de35f70248b09f7baecc5a0d6ee2cac7f38850b6e39a664984e816c
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.

8.851 × 10⁹⁹(100-digit number)
88510138504632967983…28171643002365696001
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
8.851 × 10⁹⁹(100-digit number)
88510138504632967983…28171643002365696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.770 × 10¹⁰⁰(101-digit number)
17702027700926593596…56343286004731392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.540 × 10¹⁰⁰(101-digit number)
35404055401853187193…12686572009462784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.080 × 10¹⁰⁰(101-digit number)
70808110803706374386…25373144018925568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.416 × 10¹⁰¹(102-digit number)
14161622160741274877…50746288037851136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.832 × 10¹⁰¹(102-digit number)
28323244321482549754…01492576075702272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.664 × 10¹⁰¹(102-digit number)
56646488642965099509…02985152151404544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.132 × 10¹⁰²(103-digit number)
11329297728593019901…05970304302809088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.265 × 10¹⁰²(103-digit number)
22658595457186039803…11940608605618176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.531 × 10¹⁰²(103-digit number)
45317190914372079607…23881217211236352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.063 × 10¹⁰²(103-digit number)
90634381828744159215…47762434422472704001
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,757,084 XPM·at block #6,814,124 · 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