Block #389,252

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/4/2014, 9:15:26 AM · Difficulty 10.4177 · 6,426,806 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f273b3c691179567467f39afb1ca80eef073d59c6bb95df2689dfb1066760b65

Height

#389,252

Difficulty

10.417692

Transactions

1

Size

764 B

Version

2

Bits

0a6aedda

Nonce

297,422

Timestamp

2/4/2014, 9:15:26 AM

Confirmations

6,426,806

Merkle Root

6f5adac378a04d09c1b9a75fcf6a0c7f20f85cf9d0777240e3d0bc3ded578b01
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.

6.215 × 10⁹¹(92-digit number)
62158886259326362954…14533752007310097001
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
6.215 × 10⁹¹(92-digit number)
62158886259326362954…14533752007310097001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.243 × 10⁹²(93-digit number)
12431777251865272590…29067504014620194001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.486 × 10⁹²(93-digit number)
24863554503730545181…58135008029240388001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.972 × 10⁹²(93-digit number)
49727109007461090363…16270016058480776001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.945 × 10⁹²(93-digit number)
99454218014922180726…32540032116961552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.989 × 10⁹³(94-digit number)
19890843602984436145…65080064233923104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.978 × 10⁹³(94-digit number)
39781687205968872290…30160128467846208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.956 × 10⁹³(94-digit number)
79563374411937744581…60320256935692416001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.591 × 10⁹⁴(95-digit number)
15912674882387548916…20640513871384832001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.182 × 10⁹⁴(95-digit number)
31825349764775097832…41281027742769664001
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,772,580 XPM·at block #6,816,057 · 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.
Privacy Policy·

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