Block #209,085

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/14/2013, 9:24:49 AM · Difficulty 9.9084 · 6,608,733 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ce6d6f2dfd5c39551b1d47b634fe62edea6cbdbd0b8cdf795efb32a522cd6836

Height

#209,085

Difficulty

9.908405

Transactions

3

Size

1.07 KB

Version

2

Bits

09e88d33

Nonce

82,307

Timestamp

10/14/2013, 9:24:49 AM

Confirmations

6,608,733

Merkle Root

a30f8128015a87d9898bd1a96ba7fbcbe6649a654d5ef8dcd06cd296d1324c95
Transactions (3)
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.

4.600 × 10⁹¹(92-digit number)
46004172256952484767…07419306851708840319
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
4.600 × 10⁹¹(92-digit number)
46004172256952484767…07419306851708840319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.200 × 10⁹¹(92-digit number)
92008344513904969535…14838613703417680639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.840 × 10⁹²(93-digit number)
18401668902780993907…29677227406835361279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.680 × 10⁹²(93-digit number)
36803337805561987814…59354454813670722559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.360 × 10⁹²(93-digit number)
73606675611123975628…18708909627341445119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.472 × 10⁹³(94-digit number)
14721335122224795125…37417819254682890239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.944 × 10⁹³(94-digit number)
29442670244449590251…74835638509365780479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.888 × 10⁹³(94-digit number)
58885340488899180502…49671277018731560959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.177 × 10⁹⁴(95-digit number)
11777068097779836100…99342554037463121919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.355 × 10⁹⁴(95-digit number)
23554136195559672201…98685108074926243839
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 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
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 1CC formula:

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