Block #373,853

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/24/2014, 2:37:32 PM · Difficulty 10.4254 · 6,432,486 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
56107fc598d3bb82b2ccc545f734c2b23d6a142af53a77a4783af50d25fb7aa4

Height

#373,853

Difficulty

10.425409

Transactions

4

Size

2.16 KB

Version

2

Bits

0a6ce79d

Nonce

12,142

Timestamp

1/24/2014, 2:37:32 PM

Confirmations

6,432,486

Merkle Root

527819a2e788653fcca28ada7cb95dbf92632e2895e09ec19645e37e68f777b4
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.951 × 10⁹⁴(95-digit number)
19514706669344327469…15578595632003359871
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.951 × 10⁹⁴(95-digit number)
19514706669344327469…15578595632003359871
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.902 × 10⁹⁴(95-digit number)
39029413338688654939…31157191264006719741
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.805 × 10⁹⁴(95-digit number)
78058826677377309879…62314382528013439481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.561 × 10⁹⁵(96-digit number)
15611765335475461975…24628765056026878961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.122 × 10⁹⁵(96-digit number)
31223530670950923951…49257530112053757921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.244 × 10⁹⁵(96-digit number)
62447061341901847903…98515060224107515841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.248 × 10⁹⁶(97-digit number)
12489412268380369580…97030120448215031681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.497 × 10⁹⁶(97-digit number)
24978824536760739161…94060240896430063361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.995 × 10⁹⁶(97-digit number)
49957649073521478322…88120481792860126721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.991 × 10⁹⁶(97-digit number)
99915298147042956645…76240963585720253441
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,694,796 XPM·at block #6,806,338 · 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