Block #453,657

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/21/2014, 10:57:01 AM · Difficulty 10.3885 · 6,370,996 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6b5c4a60e7307aa8b8f5a2c39c05fed9090d91bc6195ac44069a58156a514df5

Height

#453,657

Difficulty

10.388512

Transactions

6

Size

2.50 KB

Version

2

Bits

0a63757f

Nonce

46,137

Timestamp

3/21/2014, 10:57:01 AM

Confirmations

6,370,996

Merkle Root

42014e8207ce7fdec5d9190df62efa49fc752c4547dcab34deab0a2cde082fbf
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.515 × 10⁹⁷(98-digit number)
15151017714041777574…00620445334465727999
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.515 × 10⁹⁷(98-digit number)
15151017714041777574…00620445334465727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.030 × 10⁹⁷(98-digit number)
30302035428083555148…01240890668931455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.060 × 10⁹⁷(98-digit number)
60604070856167110297…02481781337862911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.212 × 10⁹⁸(99-digit number)
12120814171233422059…04963562675725823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.424 × 10⁹⁸(99-digit number)
24241628342466844118…09927125351451647999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.848 × 10⁹⁸(99-digit number)
48483256684933688237…19854250702903295999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.696 × 10⁹⁸(99-digit number)
96966513369867376475…39708501405806591999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.939 × 10⁹⁹(100-digit number)
19393302673973475295…79417002811613183999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.878 × 10⁹⁹(100-digit number)
38786605347946950590…58834005623226367999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.757 × 10⁹⁹(100-digit number)
77573210695893901180…17668011246452735999
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,841,288 XPM·at block #6,824,652 · 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