Block #445,575

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/15/2014, 11:56:54 PM · Difficulty 10.3566 · 6,370,822 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ebd8053faf5963606aeb999bd0f2ec818af1cdc40100341ae916d01891a3d6ac

Height

#445,575

Difficulty

10.356556

Transactions

4

Size

2.45 KB

Version

2

Bits

0a5b473a

Nonce

344,198

Timestamp

3/15/2014, 11:56:54 PM

Confirmations

6,370,822

Merkle Root

0e45567a566bcf7f6bbfc1a018f6a3fc16266d0cf2572c7f09536db1fa9957b0
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.959 × 10⁹⁰(91-digit number)
19594656172934173376…60726806107525590389
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.959 × 10⁹⁰(91-digit number)
19594656172934173376…60726806107525590389
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.918 × 10⁹⁰(91-digit number)
39189312345868346753…21453612215051180779
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.837 × 10⁹⁰(91-digit number)
78378624691736693506…42907224430102361559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.567 × 10⁹¹(92-digit number)
15675724938347338701…85814448860204723119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.135 × 10⁹¹(92-digit number)
31351449876694677402…71628897720409446239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.270 × 10⁹¹(92-digit number)
62702899753389354805…43257795440818892479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.254 × 10⁹²(93-digit number)
12540579950677870961…86515590881637784959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.508 × 10⁹²(93-digit number)
25081159901355741922…73031181763275569919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.016 × 10⁹²(93-digit number)
50162319802711483844…46062363526551139839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.003 × 10⁹³(94-digit number)
10032463960542296768…92124727053102279679
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,775,299 XPM·at block #6,816,396 · 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