Block #250,354

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/8/2013, 11:16:18 AM · Difficulty 9.9682 · 6,575,261 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
35b833a3fd4c923c20ac5401b630893cb1a50364f0a58bda14e75c70528658ca

Height

#250,354

Difficulty

9.968173

Transactions

2

Size

752 B

Version

2

Bits

09f7da2f

Nonce

4,659

Timestamp

11/8/2013, 11:16:18 AM

Confirmations

6,575,261

Merkle Root

95d578126c388bced2fa2163e806c78b2dbbce3d2f03829b90541f63ccf211d8
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.

2.132 × 10⁹⁵(96-digit number)
21328581930340129756…26280758121509227759
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.132 × 10⁹⁵(96-digit number)
21328581930340129756…26280758121509227759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.265 × 10⁹⁵(96-digit number)
42657163860680259513…52561516243018455519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.531 × 10⁹⁵(96-digit number)
85314327721360519026…05123032486036911039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.706 × 10⁹⁶(97-digit number)
17062865544272103805…10246064972073822079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.412 × 10⁹⁶(97-digit number)
34125731088544207610…20492129944147644159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.825 × 10⁹⁶(97-digit number)
68251462177088415221…40984259888295288319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.365 × 10⁹⁷(98-digit number)
13650292435417683044…81968519776590576639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.730 × 10⁹⁷(98-digit number)
27300584870835366088…63937039553181153279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.460 × 10⁹⁷(98-digit number)
54601169741670732177…27874079106362306559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.092 × 10⁹⁸(99-digit number)
10920233948334146435…55748158212724613119
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,849,023 XPM·at block #6,825,614 · 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