Block #289,812

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/2/2013, 9:33:19 AM · Difficulty 9.9888 · 6,520,042 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6eb3eb6696baf323cf5cd41e0f5280b48de4090401a9e8a7ac303d5d3fa7c9ad

Height

#289,812

Difficulty

9.988786

Transactions

9

Size

2.30 KB

Version

2

Bits

09fd2115

Nonce

269,359

Timestamp

12/2/2013, 9:33:19 AM

Confirmations

6,520,042

Merkle Root

80b0432feab717d0f439b5df6f71d2d2ea49c6e3be17fa6472b6ec4f4758ad10
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.

2.936 × 10¹⁰²(103-digit number)
29362954376131335467…95227685419309158401
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
2.936 × 10¹⁰²(103-digit number)
29362954376131335467…95227685419309158401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.872 × 10¹⁰²(103-digit number)
58725908752262670934…90455370838618316801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.174 × 10¹⁰³(104-digit number)
11745181750452534186…80910741677236633601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.349 × 10¹⁰³(104-digit number)
23490363500905068373…61821483354473267201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.698 × 10¹⁰³(104-digit number)
46980727001810136747…23642966708946534401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.396 × 10¹⁰³(104-digit number)
93961454003620273495…47285933417893068801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.879 × 10¹⁰⁴(105-digit number)
18792290800724054699…94571866835786137601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.758 × 10¹⁰⁴(105-digit number)
37584581601448109398…89143733671572275201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.516 × 10¹⁰⁴(105-digit number)
75169163202896218796…78287467343144550401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.503 × 10¹⁰⁵(106-digit number)
15033832640579243759…56574934686289100801
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,722,919 XPM·at block #6,809,853 · 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