Block #259,584

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/13/2013, 5:11:31 PM · Difficulty 9.9774 · 6,554,628 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4154877395b6480c8f8d2fa6d2bafff5b8281097e72ea18ee9a54cf9290da6d2

Height

#259,584

Difficulty

9.977426

Transactions

2

Size

453 B

Version

2

Bits

09fa3898

Nonce

20,914

Timestamp

11/13/2013, 5:11:31 PM

Confirmations

6,554,628

Merkle Root

497bfa042b020e79b422d7dc59a89ded2099fb2185628e4bed3fec02b7f391bc
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.

1.254 × 10⁹⁶(97-digit number)
12546365804766876788…12905628688081935679
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
1.254 × 10⁹⁶(97-digit number)
12546365804766876788…12905628688081935679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.509 × 10⁹⁶(97-digit number)
25092731609533753577…25811257376163871359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.018 × 10⁹⁶(97-digit number)
50185463219067507154…51622514752327742719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.003 × 10⁹⁷(98-digit number)
10037092643813501430…03245029504655485439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.007 × 10⁹⁷(98-digit number)
20074185287627002861…06490059009310970879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.014 × 10⁹⁷(98-digit number)
40148370575254005723…12980118018621941759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.029 × 10⁹⁷(98-digit number)
80296741150508011446…25960236037243883519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.605 × 10⁹⁸(99-digit number)
16059348230101602289…51920472074487767039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.211 × 10⁹⁸(99-digit number)
32118696460203204578…03840944148975534079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.423 × 10⁹⁸(99-digit number)
64237392920406409157…07681888297951068159
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,757,764 XPM·at block #6,814,211 · 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