Block #457,685

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/24/2014, 2:15:50 AM · Difficulty 10.4180 · 6,359,460 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b052ed84a8ab5e5fdc34873601da198e77fb6330f0d359be80f75e8491f11065

Height

#457,685

Difficulty

10.418012

Transactions

3

Size

5.56 KB

Version

2

Bits

0a6b02d5

Nonce

1,683,090,816

Timestamp

3/24/2014, 2:15:50 AM

Confirmations

6,359,460

Merkle Root

a76d161cac5c73a1a2db7014cbfc7c17a1c0324b358b9c08297bcc6bba2abf73
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.669 × 10¹⁰⁷(108-digit number)
16698637364387283701…27241327709449873279
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.669 × 10¹⁰⁷(108-digit number)
16698637364387283701…27241327709449873279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.339 × 10¹⁰⁷(108-digit number)
33397274728774567403…54482655418899746559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.679 × 10¹⁰⁷(108-digit number)
66794549457549134806…08965310837799493119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.335 × 10¹⁰⁸(109-digit number)
13358909891509826961…17930621675598986239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.671 × 10¹⁰⁸(109-digit number)
26717819783019653922…35861243351197972479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.343 × 10¹⁰⁸(109-digit number)
53435639566039307844…71722486702395944959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.068 × 10¹⁰⁹(110-digit number)
10687127913207861568…43444973404791889919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.137 × 10¹⁰⁹(110-digit number)
21374255826415723137…86889946809583779839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.274 × 10¹⁰⁹(110-digit number)
42748511652831446275…73779893619167559679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.549 × 10¹⁰⁹(110-digit number)
85497023305662892551…47559787238335119359
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,781,195 XPM·at block #6,817,144 · 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