Block #249,386

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/7/2013, 10:37:54 PM · Difficulty 9.9668 · 6,559,729 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c849fbdeec782345f616197df36b14762e7177d2dc7da5ca7dabfa2a813a2c5b

Height

#249,386

Difficulty

9.966781

Transactions

2

Size

419 B

Version

2

Bits

09f77efc

Nonce

6,291

Timestamp

11/7/2013, 10:37:54 PM

Confirmations

6,559,729

Merkle Root

82f0097369da44843dbfa8c67e154f1a9660beb5795aa453fbfd2c655fb28081
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.738 × 10⁹⁵(96-digit number)
27384695934626107067…68412303065534430719
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.738 × 10⁹⁵(96-digit number)
27384695934626107067…68412303065534430719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.476 × 10⁹⁵(96-digit number)
54769391869252214134…36824606131068861439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.095 × 10⁹⁶(97-digit number)
10953878373850442826…73649212262137722879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.190 × 10⁹⁶(97-digit number)
21907756747700885653…47298424524275445759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.381 × 10⁹⁶(97-digit number)
43815513495401771307…94596849048550891519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.763 × 10⁹⁶(97-digit number)
87631026990803542615…89193698097101783039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.752 × 10⁹⁷(98-digit number)
17526205398160708523…78387396194203566079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.505 × 10⁹⁷(98-digit number)
35052410796321417046…56774792388407132159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.010 × 10⁹⁷(98-digit number)
70104821592642834092…13549584776814264319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.402 × 10⁹⁸(99-digit number)
14020964318528566818…27099169553628528639
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,716,977 XPM·at block #6,809,114 · 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