Block #367,642

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/20/2014, 5:47:18 AM · Difficulty 10.4331 · 6,439,952 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
504053647804452ab578a93b203cdf0a8495e5617f7abe5e66a2a19471d30bca

Height

#367,642

Difficulty

10.433069

Transactions

4

Size

2.10 KB

Version

2

Bits

0a6edda2

Nonce

171,456

Timestamp

1/20/2014, 5:47:18 AM

Confirmations

6,439,952

Merkle Root

17290b74867fac6d5e5dd18a18fb368189b34b4f323441206e058aed19dadb6b
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.

4.910 × 10⁹⁴(95-digit number)
49105138710685112792…63829495484853253121
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
4.910 × 10⁹⁴(95-digit number)
49105138710685112792…63829495484853253121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.821 × 10⁹⁴(95-digit number)
98210277421370225585…27658990969706506241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.964 × 10⁹⁵(96-digit number)
19642055484274045117…55317981939413012481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.928 × 10⁹⁵(96-digit number)
39284110968548090234…10635963878826024961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.856 × 10⁹⁵(96-digit number)
78568221937096180468…21271927757652049921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.571 × 10⁹⁶(97-digit number)
15713644387419236093…42543855515304099841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.142 × 10⁹⁶(97-digit number)
31427288774838472187…85087711030608199681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.285 × 10⁹⁶(97-digit number)
62854577549676944374…70175422061216399361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.257 × 10⁹⁷(98-digit number)
12570915509935388874…40350844122432798721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.514 × 10⁹⁷(98-digit number)
25141831019870777749…80701688244865597441
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,704,780 XPM·at block #6,807,593 · 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