Block #210,720

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/15/2013, 8:00:13 AM · Difficulty 9.9133 · 6,599,697 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
deff64417c6412667d493d71a957f6060d8193387856097a0fb8210c4a4d7f0c

Height

#210,720

Difficulty

9.913344

Transactions

2

Size

424 B

Version

2

Bits

09e9d0e9

Nonce

37,068

Timestamp

10/15/2013, 8:00:13 AM

Confirmations

6,599,697

Merkle Root

ff7b71fe3eb16d1670f849c340307307d3a150a8fb038bfc809352546a32a344
Transactions (2)
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.100 × 10⁹²(93-digit number)
11005361909829642461…03115717715539046399
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.100 × 10⁹²(93-digit number)
11005361909829642461…03115717715539046399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.201 × 10⁹²(93-digit number)
22010723819659284922…06231435431078092799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.402 × 10⁹²(93-digit number)
44021447639318569845…12462870862156185599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.804 × 10⁹²(93-digit number)
88042895278637139690…24925741724312371199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.760 × 10⁹³(94-digit number)
17608579055727427938…49851483448624742399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.521 × 10⁹³(94-digit number)
35217158111454855876…99702966897249484799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.043 × 10⁹³(94-digit number)
70434316222909711752…99405933794498969599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.408 × 10⁹⁴(95-digit number)
14086863244581942350…98811867588997939199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.817 × 10⁹⁴(95-digit number)
28173726489163884700…97623735177995878399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.634 × 10⁹⁴(95-digit number)
56347452978327769401…95247470355991756799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.126 × 10⁹⁵(96-digit number)
11269490595665553880…90494940711983513599
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,727,417 XPM·at block #6,810,416 · 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