Block #212,483

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/16/2013, 7:53:02 AM · Difficulty 9.9189 · 6,595,097 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
27481a0659940638c3a59a153a5921f636ae055d05bda5476d9647221c3a6795

Height

#212,483

Difficulty

9.918947

Transactions

1

Size

5.86 KB

Version

2

Bits

09eb401f

Nonce

1,164,899,197

Timestamp

10/16/2013, 7:53:02 AM

Confirmations

6,595,097

Merkle Root

45c1c36c456122c6c507517144468511ad2d0486ae9117f742a2102ca8239801
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.098 × 10⁹³(94-digit number)
10987179249303368870…67552789688639401751
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.098 × 10⁹³(94-digit number)
10987179249303368870…67552789688639401751
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.197 × 10⁹³(94-digit number)
21974358498606737740…35105579377278803501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.394 × 10⁹³(94-digit number)
43948716997213475480…70211158754557607001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.789 × 10⁹³(94-digit number)
87897433994426950960…40422317509115214001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.757 × 10⁹⁴(95-digit number)
17579486798885390192…80844635018230428001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.515 × 10⁹⁴(95-digit number)
35158973597770780384…61689270036460856001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.031 × 10⁹⁴(95-digit number)
70317947195541560768…23378540072921712001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.406 × 10⁹⁵(96-digit number)
14063589439108312153…46757080145843424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.812 × 10⁹⁵(96-digit number)
28127178878216624307…93514160291686848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.625 × 10⁹⁵(96-digit number)
56254357756433248614…87028320583373696001
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,704,669 XPM·at block #6,807,579 · 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