Block #457,660

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/24/2014, 1:42:04 AM · Difficulty 10.4193 · 6,356,467 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c448cf3c031a4bb0000890da97bafad6675730d144f72a6ca399a5d0303c1219

Height

#457,660

Difficulty

10.419268

Transactions

1

Size

1004 B

Version

2

Bits

0a6b5528

Nonce

127,606

Timestamp

3/24/2014, 1:42:04 AM

Confirmations

6,356,467

Merkle Root

531b3e743a81cb81b4e58bb11ebf4ba97fa6a745e7661c346c9739269b706cd8
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.

1.088 × 10⁹⁶(97-digit number)
10887646975375274968…90415681852383884799
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
1.088 × 10⁹⁶(97-digit number)
10887646975375274968…90415681852383884799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.177 × 10⁹⁶(97-digit number)
21775293950750549936…80831363704767769599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.355 × 10⁹⁶(97-digit number)
43550587901501099873…61662727409535539199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.710 × 10⁹⁶(97-digit number)
87101175803002199746…23325454819071078399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.742 × 10⁹⁷(98-digit number)
17420235160600439949…46650909638142156799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.484 × 10⁹⁷(98-digit number)
34840470321200879898…93301819276284313599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.968 × 10⁹⁷(98-digit number)
69680940642401759797…86603638552568627199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.393 × 10⁹⁸(99-digit number)
13936188128480351959…73207277105137254399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.787 × 10⁹⁸(99-digit number)
27872376256960703918…46414554210274508799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.574 × 10⁹⁸(99-digit number)
55744752513921407837…92829108420549017599
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,757,101 XPM·at block #6,814,126 · 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