Block #257,636

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/12/2013, 2:12:28 PM · Difficulty 9.9758 · 6,559,287 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5651dc042b71031f0c8e298013aaea24fb97673be14531de7b48cf0adc53fcc2

Height

#257,636

Difficulty

9.975847

Transactions

3

Size

1.10 KB

Version

2

Bits

09f9d11f

Nonce

66,326

Timestamp

11/12/2013, 2:12:28 PM

Confirmations

6,559,287

Merkle Root

0682d7edb708061615c636ef9bb0e5a52bd7382ef6147027c7e9a09db9e41e88
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.

3.110 × 10⁹⁴(95-digit number)
31108253397925837533…01443842161332383939
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
3.110 × 10⁹⁴(95-digit number)
31108253397925837533…01443842161332383939
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.221 × 10⁹⁴(95-digit number)
62216506795851675067…02887684322664767879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.244 × 10⁹⁵(96-digit number)
12443301359170335013…05775368645329535759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.488 × 10⁹⁵(96-digit number)
24886602718340670027…11550737290659071519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.977 × 10⁹⁵(96-digit number)
49773205436681340054…23101474581318143039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.954 × 10⁹⁵(96-digit number)
99546410873362680108…46202949162636286079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.990 × 10⁹⁶(97-digit number)
19909282174672536021…92405898325272572159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.981 × 10⁹⁶(97-digit number)
39818564349345072043…84811796650545144319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.963 × 10⁹⁶(97-digit number)
79637128698690144086…69623593301090288639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.592 × 10⁹⁷(98-digit number)
15927425739738028817…39247186602180577279
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,779,425 XPM·at block #6,816,922 · 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