Block #491,211

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/14/2014, 9:06:34 AM · Difficulty 10.6803 · 6,323,267 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
efad7adab8c2ce97a121f818cf6e15c511c0e2e19f5cb6d25051f688d2a69ee8

Height

#491,211

Difficulty

10.680339

Transactions

2

Size

2.58 KB

Version

2

Bits

0aae2aaa

Nonce

765,481

Timestamp

4/14/2014, 9:06:34 AM

Confirmations

6,323,267

Merkle Root

9d0199ebd9f1fcd1f764734b5cf3c9f0a59779c8022237ea6790d12ca6fb8eae
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.107 × 10⁹⁷(98-digit number)
11073946891770350094…38494121497740824001
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.107 × 10⁹⁷(98-digit number)
11073946891770350094…38494121497740824001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.214 × 10⁹⁷(98-digit number)
22147893783540700188…76988242995481648001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.429 × 10⁹⁷(98-digit number)
44295787567081400377…53976485990963296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.859 × 10⁹⁷(98-digit number)
88591575134162800755…07952971981926592001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.771 × 10⁹⁸(99-digit number)
17718315026832560151…15905943963853184001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.543 × 10⁹⁸(99-digit number)
35436630053665120302…31811887927706368001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.087 × 10⁹⁸(99-digit number)
70873260107330240604…63623775855412736001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.417 × 10⁹⁹(100-digit number)
14174652021466048120…27247551710825472001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.834 × 10⁹⁹(100-digit number)
28349304042932096241…54495103421650944001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.669 × 10⁹⁹(100-digit number)
56698608085864192483…08990206843301888001
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,759,899 XPM·at block #6,814,477 · 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