Block #239,401

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/2/2013, 2:06:39 AM · Difficulty 9.9543 · 6,587,707 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
27b9ccb3a25d0f08f168a4e3be7d3a0038094311b7cc26fc22d7a6f980ea4878

Height

#239,401

Difficulty

9.954307

Transactions

8

Size

5.57 KB

Version

2

Bits

09f44d71

Nonce

117,201

Timestamp

11/2/2013, 2:06:39 AM

Confirmations

6,587,707

Merkle Root

bc73fb21803c79217bb8b0a7a379d53057127230641d3137939179f1af4e5fd9
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.914 × 10⁹³(94-digit number)
19144100998210544961…39539375669430092799
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.914 × 10⁹³(94-digit number)
19144100998210544961…39539375669430092799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.828 × 10⁹³(94-digit number)
38288201996421089922…79078751338860185599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.657 × 10⁹³(94-digit number)
76576403992842179844…58157502677720371199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.531 × 10⁹⁴(95-digit number)
15315280798568435968…16315005355440742399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.063 × 10⁹⁴(95-digit number)
30630561597136871937…32630010710881484799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.126 × 10⁹⁴(95-digit number)
61261123194273743875…65260021421762969599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.225 × 10⁹⁵(96-digit number)
12252224638854748775…30520042843525939199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.450 × 10⁹⁵(96-digit number)
24504449277709497550…61040085687051878399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.900 × 10⁹⁵(96-digit number)
49008898555418995100…22080171374103756799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.801 × 10⁹⁵(96-digit number)
98017797110837990201…44160342748207513599
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,861,042 XPM·at block #6,827,107 · 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