Block #279,817

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/28/2013, 11:38:02 AM · Difficulty 9.9728 · 6,526,896 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3fd8ad3b19af42acdf0a246ee45814d3a9467818fea9944ea81157924003c9d0

Height

#279,817

Difficulty

9.972844

Transactions

10

Size

5.51 KB

Version

2

Bits

09f90c4f

Nonce

171,972

Timestamp

11/28/2013, 11:38:02 AM

Confirmations

6,526,896

Merkle Root

8087012183f4091161451ae8c8d90fcaa53f11b4fb930664af11b8b8f29fa51f
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.601 × 10⁹⁷(98-digit number)
76011541759347612469…36892452707392880641
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.601 × 10⁹⁷(98-digit number)
76011541759347612469…36892452707392880641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.520 × 10⁹⁸(99-digit number)
15202308351869522493…73784905414785761281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.040 × 10⁹⁸(99-digit number)
30404616703739044987…47569810829571522561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.080 × 10⁹⁸(99-digit number)
60809233407478089975…95139621659143045121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.216 × 10⁹⁹(100-digit number)
12161846681495617995…90279243318286090241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.432 × 10⁹⁹(100-digit number)
24323693362991235990…80558486636572180481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.864 × 10⁹⁹(100-digit number)
48647386725982471980…61116973273144360961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.729 × 10⁹⁹(100-digit number)
97294773451964943961…22233946546288721921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.945 × 10¹⁰⁰(101-digit number)
19458954690392988792…44467893092577443841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.891 × 10¹⁰⁰(101-digit number)
38917909380785977584…88935786185154887681
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,697,802 XPM·at block #6,806,712 · 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