Block #506,885

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/23/2014, 9:03:09 AM · Difficulty 10.8154 · 6,307,149 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c20ca9ecf4df01fe566fde096fffb5d64c1872d41b2b4390325fe47d461da74d

Height

#506,885

Difficulty

10.815385

Transactions

9

Size

3.85 KB

Version

2

Bits

0ad0bd1a

Nonce

3,960,613

Timestamp

4/23/2014, 9:03:09 AM

Confirmations

6,307,149

Merkle Root

7ff3576bbc11b3652be90e51877435c437484518ae7bd76530a76b255fc64b13
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.191 × 10¹⁰¹(102-digit number)
21916711969252336614…08891941928855633921
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.191 × 10¹⁰¹(102-digit number)
21916711969252336614…08891941928855633921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.383 × 10¹⁰¹(102-digit number)
43833423938504673228…17783883857711267841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.766 × 10¹⁰¹(102-digit number)
87666847877009346456…35567767715422535681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.753 × 10¹⁰²(103-digit number)
17533369575401869291…71135535430845071361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.506 × 10¹⁰²(103-digit number)
35066739150803738582…42271070861690142721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.013 × 10¹⁰²(103-digit number)
70133478301607477165…84542141723380285441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.402 × 10¹⁰³(104-digit number)
14026695660321495433…69084283446760570881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.805 × 10¹⁰³(104-digit number)
28053391320642990866…38168566893521141761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.610 × 10¹⁰³(104-digit number)
56106782641285981732…76337133787042283521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.122 × 10¹⁰⁴(105-digit number)
11221356528257196346…52674267574084567041
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,756,347 XPM·at block #6,814,033 · 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