Block #242,634

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/3/2013, 8:38:14 PM · Difficulty 9.9602 · 6,571,407 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
582dda77af6d85b410e76d3e687ebe3940b428e17f502e371ac3806da00a9a46

Height

#242,634

Difficulty

9.960196

Transactions

2

Size

386 B

Version

2

Bits

09f5cf6e

Nonce

12,939

Timestamp

11/3/2013, 8:38:14 PM

Confirmations

6,571,407

Merkle Root

8cf91970e86ca67131f0064df486dee4ed52c4d2d13649e8256c0d5e8e89c09e
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.

3.456 × 10⁹⁷(98-digit number)
34564132787900394645…17112309212430643411
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.456 × 10⁹⁷(98-digit number)
34564132787900394645…17112309212430643411
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.912 × 10⁹⁷(98-digit number)
69128265575800789291…34224618424861286821
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.382 × 10⁹⁸(99-digit number)
13825653115160157858…68449236849722573641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.765 × 10⁹⁸(99-digit number)
27651306230320315716…36898473699445147281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.530 × 10⁹⁸(99-digit number)
55302612460640631432…73796947398890294561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.106 × 10⁹⁹(100-digit number)
11060522492128126286…47593894797780589121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.212 × 10⁹⁹(100-digit number)
22121044984256252573…95187789595561178241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.424 × 10⁹⁹(100-digit number)
44242089968512505146…90375579191122356481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.848 × 10⁹⁹(100-digit number)
88484179937025010292…80751158382244712961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.769 × 10¹⁰⁰(101-digit number)
17696835987405002058…61502316764489425921
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,756,403 XPM·at block #6,814,040 · 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