Block #249,455

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/7/2013, 11:28:58 PM · Difficulty 9.9669 · 6,577,620 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fec3306b57975493b3e422d3b2552269f4b218c795679150217aa7ec17045232

Height

#249,455

Difficulty

9.966909

Transactions

5

Size

2.26 KB

Version

2

Bits

09f7875c

Nonce

6,913

Timestamp

11/7/2013, 11:28:58 PM

Confirmations

6,577,620

Merkle Root

f637cf747a6c0b075b2187296b859f2a5748b65b1e90c0e6fa76b471136fd3c7
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.598 × 10⁹⁶(97-digit number)
75980595647203543053…00477180327385876481
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.598 × 10⁹⁶(97-digit number)
75980595647203543053…00477180327385876481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.519 × 10⁹⁷(98-digit number)
15196119129440708610…00954360654771752961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.039 × 10⁹⁷(98-digit number)
30392238258881417221…01908721309543505921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.078 × 10⁹⁷(98-digit number)
60784476517762834443…03817442619087011841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.215 × 10⁹⁸(99-digit number)
12156895303552566888…07634885238174023681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.431 × 10⁹⁸(99-digit number)
24313790607105133777…15269770476348047361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.862 × 10⁹⁸(99-digit number)
48627581214210267554…30539540952696094721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.725 × 10⁹⁸(99-digit number)
97255162428420535109…61079081905392189441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.945 × 10⁹⁹(100-digit number)
19451032485684107021…22158163810784378881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.890 × 10⁹⁹(100-digit number)
38902064971368214043…44316327621568757761
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,860,784 XPM·at block #6,827,074 · 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