Block #281,317

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/28/2013, 11:48:08 PM · Difficulty 9.9767 · 6,536,549 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0cbd12af7c08d554ebf4e98cff5c467a0471726bb5ffe54d547973c5e440cc84

Height

#281,317

Difficulty

9.976732

Transactions

8

Size

2.59 KB

Version

2

Bits

09fa0b18

Nonce

108,100

Timestamp

11/28/2013, 11:48:08 PM

Confirmations

6,536,549

Merkle Root

f80724c608183d8fb107fd2a40fbf3fdbde3dfc1030ff2735ff66c24dc9e682a
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.680 × 10⁹⁶(97-digit number)
16806440672470952540…52911303752491151361
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.680 × 10⁹⁶(97-digit number)
16806440672470952540…52911303752491151361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.361 × 10⁹⁶(97-digit number)
33612881344941905080…05822607504982302721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.722 × 10⁹⁶(97-digit number)
67225762689883810161…11645215009964605441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.344 × 10⁹⁷(98-digit number)
13445152537976762032…23290430019929210881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.689 × 10⁹⁷(98-digit number)
26890305075953524064…46580860039858421761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.378 × 10⁹⁷(98-digit number)
53780610151907048129…93161720079716843521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.075 × 10⁹⁸(99-digit number)
10756122030381409625…86323440159433687041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.151 × 10⁹⁸(99-digit number)
21512244060762819251…72646880318867374081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.302 × 10⁹⁸(99-digit number)
43024488121525638503…45293760637734748161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.604 × 10⁹⁸(99-digit number)
86048976243051277007…90587521275469496321
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,786,995 XPM·at block #6,817,865 · 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