Block #245,963

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/5/2013, 7:10:20 PM · Difficulty 9.9643 · 6,584,638 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
110d98bbb06c17cb78e20ed880b5298f8c526d804b2836e87231301706818199

Height

#245,963

Difficulty

9.964318

Transactions

4

Size

2.58 KB

Version

2

Bits

09f6dd92

Nonce

21,242

Timestamp

11/5/2013, 7:10:20 PM

Confirmations

6,584,638

Merkle Root

f14afd055d13a2600d53f82976aaac3845c53282dbd427659f372fa64f1fc0ec
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.

7.628 × 10⁹³(94-digit number)
76285794187241388717…96579959844866803519
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
7.628 × 10⁹³(94-digit number)
76285794187241388717…96579959844866803519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.525 × 10⁹⁴(95-digit number)
15257158837448277743…93159919689733607039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.051 × 10⁹⁴(95-digit number)
30514317674896555487…86319839379467214079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.102 × 10⁹⁴(95-digit number)
61028635349793110974…72639678758934428159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.220 × 10⁹⁵(96-digit number)
12205727069958622194…45279357517868856319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.441 × 10⁹⁵(96-digit number)
24411454139917244389…90558715035737712639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.882 × 10⁹⁵(96-digit number)
48822908279834488779…81117430071475425279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.764 × 10⁹⁵(96-digit number)
97645816559668977558…62234860142950850559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.952 × 10⁹⁶(97-digit number)
19529163311933795511…24469720285901701119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.905 × 10⁹⁶(97-digit number)
39058326623867591023…48939440571803402239
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,888,930 XPM·at block #6,830,600 · 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