Block #255,698

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/11/2013, 9:56:54 AM · Difficulty 9.9746 · 6,560,478 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3a1c637c77ac757367f0a12eeee473a3d559487b347c5d789d5c01e09f99084b

Height

#255,698

Difficulty

9.974588

Transactions

4

Size

4.04 KB

Version

2

Bits

09f97e95

Nonce

1,566

Timestamp

11/11/2013, 9:56:54 AM

Confirmations

6,560,478

Merkle Root

86ce574c68a321b839cde0f76be5883e6b8781982a61217b20bfc11307871025
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.315 × 10⁹⁵(96-digit number)
43154880329331164704…24553573053582315201
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.315 × 10⁹⁵(96-digit number)
43154880329331164704…24553573053582315201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.630 × 10⁹⁵(96-digit number)
86309760658662329409…49107146107164630401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.726 × 10⁹⁶(97-digit number)
17261952131732465881…98214292214329260801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.452 × 10⁹⁶(97-digit number)
34523904263464931763…96428584428658521601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.904 × 10⁹⁶(97-digit number)
69047808526929863527…92857168857317043201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.380 × 10⁹⁷(98-digit number)
13809561705385972705…85714337714634086401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.761 × 10⁹⁷(98-digit number)
27619123410771945411…71428675429268172801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.523 × 10⁹⁷(98-digit number)
55238246821543890822…42857350858536345601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.104 × 10⁹⁸(99-digit number)
11047649364308778164…85714701717072691201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.209 × 10⁹⁸(99-digit number)
22095298728617556328…71429403434145382401
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,773,532 XPM·at block #6,816,175 · 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