Block #455,539

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/22/2014, 3:06:33 PM · Difficulty 10.4122 · 6,362,018 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
55797538913853c8ae5ffea7461a6fb1f3fa377f694ae361dc8e5df47df55cf1

Height

#455,539

Difficulty

10.412245

Transactions

5

Size

1.52 KB

Version

2

Bits

0a6988e4

Nonce

108,115

Timestamp

3/22/2014, 3:06:33 PM

Confirmations

6,362,018

Merkle Root

6aee22b55343a6264955b303e90c7989bf8e638bcc320506186dbd6ce6f45c1a
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.

5.284 × 10⁹⁵(96-digit number)
52841835835855373718…64618175899290299999
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
5.284 × 10⁹⁵(96-digit number)
52841835835855373718…64618175899290299999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.056 × 10⁹⁶(97-digit number)
10568367167171074743…29236351798580599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.113 × 10⁹⁶(97-digit number)
21136734334342149487…58472703597161199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.227 × 10⁹⁶(97-digit number)
42273468668684298974…16945407194322399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.454 × 10⁹⁶(97-digit number)
84546937337368597949…33890814388644799999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.690 × 10⁹⁷(98-digit number)
16909387467473719589…67781628777289599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.381 × 10⁹⁷(98-digit number)
33818774934947439179…35563257554579199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.763 × 10⁹⁷(98-digit number)
67637549869894878359…71126515109158399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.352 × 10⁹⁸(99-digit number)
13527509973978975671…42253030218316799999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.705 × 10⁹⁸(99-digit number)
27055019947957951343…84506060436633599999
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,784,505 XPM·at block #6,817,556 · 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