Block #457,546

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/23/2014, 11:39:36 PM · Difficulty 10.4202 · 6,359,262 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
65251cc0a30ada620d6ba39a79d3c338b3782899b52dfc5cf47342085068d692

Height

#457,546

Difficulty

10.420154

Transactions

2

Size

424 B

Version

2

Bits

0a6b8f3b

Nonce

1,372

Timestamp

3/23/2014, 11:39:36 PM

Confirmations

6,359,262

Merkle Root

2fb945e796998e25cc2ceb7ebeb4c5779064bcc93ce392bd8a57fe33c6f9db21
Transactions (2)
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.776 × 10⁹²(93-digit number)
67767503633305758663…44125846754251494399
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.776 × 10⁹²(93-digit number)
67767503633305758663…44125846754251494399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.355 × 10⁹³(94-digit number)
13553500726661151732…88251693508502988799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.710 × 10⁹³(94-digit number)
27107001453322303465…76503387017005977599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.421 × 10⁹³(94-digit number)
54214002906644606931…53006774034011955199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.084 × 10⁹⁴(95-digit number)
10842800581328921386…06013548068023910399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.168 × 10⁹⁴(95-digit number)
21685601162657842772…12027096136047820799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.337 × 10⁹⁴(95-digit number)
43371202325315685544…24054192272095641599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.674 × 10⁹⁴(95-digit number)
86742404650631371089…48108384544191283199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.734 × 10⁹⁵(96-digit number)
17348480930126274217…96216769088382566399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.469 × 10⁹⁵(96-digit number)
34696961860252548435…92433538176765132799
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,778,501 XPM·at block #6,816,807 · 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