Block #277,581

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/27/2013, 3:24:45 PM · Difficulty 9.9666 · 6,528,805 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
635c42128627c6d4a1cfadeaf542c89629a71c41873ba68f9bc1d7a463623435

Height

#277,581

Difficulty

9.966645

Transactions

4

Size

4.57 KB

Version

2

Bits

09f7760d

Nonce

212,454

Timestamp

11/27/2013, 3:24:45 PM

Confirmations

6,528,805

Merkle Root

c3de96a1151ddc37fe7fbcbaea1f66264da800728736f275a3e696eca83c44e0
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.169 × 10⁹⁸(99-digit number)
11691065336066470474…42962176231449593601
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.169 × 10⁹⁸(99-digit number)
11691065336066470474…42962176231449593601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.338 × 10⁹⁸(99-digit number)
23382130672132940948…85924352462899187201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.676 × 10⁹⁸(99-digit number)
46764261344265881897…71848704925798374401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.352 × 10⁹⁸(99-digit number)
93528522688531763795…43697409851596748801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.870 × 10⁹⁹(100-digit number)
18705704537706352759…87394819703193497601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.741 × 10⁹⁹(100-digit number)
37411409075412705518…74789639406386995201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.482 × 10⁹⁹(100-digit number)
74822818150825411036…49579278812773990401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.496 × 10¹⁰⁰(101-digit number)
14964563630165082207…99158557625547980801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.992 × 10¹⁰⁰(101-digit number)
29929127260330164414…98317115251095961601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.985 × 10¹⁰⁰(101-digit number)
59858254520660328829…96634230502191923201
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,695,178 XPM·at block #6,806,385 · 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