Block #334,451

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/29/2013, 12:30:46 PM · Difficulty 10.1575 · 6,478,104 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
84d1c9e0422b0975c719504cdf38bacd92d4011869bb67e4dc90b4e62558534b

Height

#334,451

Difficulty

10.157478

Transactions

8

Size

2.18 KB

Version

2

Bits

0a285080

Nonce

33,247

Timestamp

12/29/2013, 12:30:46 PM

Confirmations

6,478,104

Merkle Root

b5ad7b9ce09d1347e389bc7eee6198f1c36b71050af18b8d6ecbb42bf8d97dad
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.073 × 10¹⁰²(103-digit number)
60732311299720374355…72154245713474121041
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.073 × 10¹⁰²(103-digit number)
60732311299720374355…72154245713474121041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.214 × 10¹⁰³(104-digit number)
12146462259944074871…44308491426948242081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.429 × 10¹⁰³(104-digit number)
24292924519888149742…88616982853896484161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.858 × 10¹⁰³(104-digit number)
48585849039776299484…77233965707792968321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.717 × 10¹⁰³(104-digit number)
97171698079552598968…54467931415585936641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.943 × 10¹⁰⁴(105-digit number)
19434339615910519793…08935862831171873281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.886 × 10¹⁰⁴(105-digit number)
38868679231821039587…17871725662343746561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.773 × 10¹⁰⁴(105-digit number)
77737358463642079175…35743451324687493121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.554 × 10¹⁰⁵(106-digit number)
15547471692728415835…71486902649374986241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.109 × 10¹⁰⁵(106-digit number)
31094943385456831670…42973805298749972481
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,744,473 XPM·at block #6,812,554 · 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