Block #455,630

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/22/2014, 4:21:00 PM · Difficulty 10.4141 · 6,381,284 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
07b3c4c3d19840c7681d3fd040d1b75e0e5c5d30cf128f2fe428555737aae036

Height

#455,630

Difficulty

10.414064

Transactions

12

Size

3.06 KB

Version

2

Bits

0a6a0019

Nonce

28,138

Timestamp

3/22/2014, 4:21:00 PM

Confirmations

6,381,284

Merkle Root

63d42483116871a9035ca00a14703024d6331a3be7ad874fca2c1056f4414579
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.

4.174 × 10⁹⁸(99-digit number)
41741062708054753071…24019016972790234879
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
4.174 × 10⁹⁸(99-digit number)
41741062708054753071…24019016972790234879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.348 × 10⁹⁸(99-digit number)
83482125416109506143…48038033945580469759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.669 × 10⁹⁹(100-digit number)
16696425083221901228…96076067891160939519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.339 × 10⁹⁹(100-digit number)
33392850166443802457…92152135782321879039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.678 × 10⁹⁹(100-digit number)
66785700332887604914…84304271564643758079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.335 × 10¹⁰⁰(101-digit number)
13357140066577520982…68608543129287516159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.671 × 10¹⁰⁰(101-digit number)
26714280133155041965…37217086258575032319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.342 × 10¹⁰⁰(101-digit number)
53428560266310083931…74434172517150064639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.068 × 10¹⁰¹(102-digit number)
10685712053262016786…48868345034300129279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.137 × 10¹⁰¹(102-digit number)
21371424106524033572…97736690068600258559
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,939,606 XPM·at block #6,836,913 · 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