Block #282,480

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/29/2013, 9:50:55 AM · Difficulty 9.9792 · 6,526,914 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
705cc215f17dafac63bf346ecf2a9a4c9d249806497a3abdb54256e82ccc6387

Height

#282,480

Difficulty

9.979207

Transactions

3

Size

1.38 KB

Version

2

Bits

09faad4f

Nonce

59,412

Timestamp

11/29/2013, 9:50:55 AM

Confirmations

6,526,914

Merkle Root

247875931bf58e8b63a667f9bf6c21f7c750741f0f7ff2656a4ab1b0d8250240
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.908 × 10⁹³(94-digit number)
79082130049654283623…17765182018853737201
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.908 × 10⁹³(94-digit number)
79082130049654283623…17765182018853737201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.581 × 10⁹⁴(95-digit number)
15816426009930856724…35530364037707474401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.163 × 10⁹⁴(95-digit number)
31632852019861713449…71060728075414948801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.326 × 10⁹⁴(95-digit number)
63265704039723426898…42121456150829897601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.265 × 10⁹⁵(96-digit number)
12653140807944685379…84242912301659795201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.530 × 10⁹⁵(96-digit number)
25306281615889370759…68485824603319590401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.061 × 10⁹⁵(96-digit number)
50612563231778741518…36971649206639180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.012 × 10⁹⁶(97-digit number)
10122512646355748303…73943298413278361601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.024 × 10⁹⁶(97-digit number)
20245025292711496607…47886596826556723201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.049 × 10⁹⁶(97-digit number)
40490050585422993215…95773193653113446401
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,719,225 XPM·at block #6,809,393 · 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.

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