Block #1,378,671

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/21/2015, 1:05:15 PM · Difficulty 10.8099 · 5,432,302 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bbb0e4001f0fb7071cd886be354d92c5a38499caa52f5219139ed32c3cbbc9b9

Height

#1,378,671

Difficulty

10.809915

Transactions

2

Size

10.35 KB

Version

2

Bits

0acf569d

Nonce

65,028,454

Timestamp

12/21/2015, 1:05:15 PM

Confirmations

5,432,302

Merkle Root

669654ceea5d41cdb7ba5a385f0e4845adbb53d750c4b5c1a74d64a689ed7b48
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.

3.960 × 10⁹⁷(98-digit number)
39602279758895127411…78824444031601694721
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
3.960 × 10⁹⁷(98-digit number)
39602279758895127411…78824444031601694721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.920 × 10⁹⁷(98-digit number)
79204559517790254822…57648888063203389441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.584 × 10⁹⁸(99-digit number)
15840911903558050964…15297776126406778881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.168 × 10⁹⁸(99-digit number)
31681823807116101929…30595552252813557761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.336 × 10⁹⁸(99-digit number)
63363647614232203858…61191104505627115521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.267 × 10⁹⁹(100-digit number)
12672729522846440771…22382209011254231041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.534 × 10⁹⁹(100-digit number)
25345459045692881543…44764418022508462081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.069 × 10⁹⁹(100-digit number)
50690918091385763086…89528836045016924161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.013 × 10¹⁰⁰(101-digit number)
10138183618277152617…79057672090033848321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.027 × 10¹⁰⁰(101-digit number)
20276367236554305234…58115344180067696641
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,731,886 XPM·at block #6,810,972 · 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