Block #477,912

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/6/2014, 6:10:24 PM · Difficulty 10.4884 · 6,339,334 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3b40e3470bf415aa442258db0186c015860582761b6299bd46871fadae176e7e

Height

#477,912

Difficulty

10.488383

Transactions

5

Size

1.34 KB

Version

2

Bits

0a7d06b1

Nonce

280,369

Timestamp

4/6/2014, 6:10:24 PM

Confirmations

6,339,334

Merkle Root

801c73a1cce46f70b647a2950e1e31e299a4e9385863576314af25e4cfb5dee5
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.

2.890 × 10⁹⁵(96-digit number)
28900777089064635675…61475021617304696001
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
2.890 × 10⁹⁵(96-digit number)
28900777089064635675…61475021617304696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.780 × 10⁹⁵(96-digit number)
57801554178129271350…22950043234609392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.156 × 10⁹⁶(97-digit number)
11560310835625854270…45900086469218784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.312 × 10⁹⁶(97-digit number)
23120621671251708540…91800172938437568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.624 × 10⁹⁶(97-digit number)
46241243342503417080…83600345876875136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.248 × 10⁹⁶(97-digit number)
92482486685006834160…67200691753750272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.849 × 10⁹⁷(98-digit number)
18496497337001366832…34401383507500544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.699 × 10⁹⁷(98-digit number)
36992994674002733664…68802767015001088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.398 × 10⁹⁷(98-digit number)
73985989348005467328…37605534030002176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.479 × 10⁹⁸(99-digit number)
14797197869601093465…75211068060004352001
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,782,001 XPM·at block #6,817,245 · 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