Block #443,494

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/14/2014, 2:21:15 PM · Difficulty 10.3458 · 6,370,925 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c18cc255655723c58829226157aaf52329870fb4657244ef3fdac705049fbaf5

Height

#443,494

Difficulty

10.345814

Transactions

2

Size

2.85 KB

Version

2

Bits

0a588742

Nonce

357

Timestamp

3/14/2014, 2:21:15 PM

Confirmations

6,370,925

Merkle Root

5272d7a645aaf67fc265f280a98b502d787c35997eef105eec5917e9e52ff589
Transactions (2)
1 in → 1 out9.3681 XPM116 B
18 in → 1 out26.3000 XPM2.65 KB
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.088 × 10⁹⁸(99-digit number)
10889876588627914703…58338641125742541359
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.088 × 10⁹⁸(99-digit number)
10889876588627914703…58338641125742541359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.177 × 10⁹⁸(99-digit number)
21779753177255829406…16677282251485082719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.355 × 10⁹⁸(99-digit number)
43559506354511658813…33354564502970165439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.711 × 10⁹⁸(99-digit number)
87119012709023317626…66709129005940330879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.742 × 10⁹⁹(100-digit number)
17423802541804663525…33418258011880661759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.484 × 10⁹⁹(100-digit number)
34847605083609327050…66836516023761323519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.969 × 10⁹⁹(100-digit number)
69695210167218654101…33673032047522647039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.393 × 10¹⁰⁰(101-digit number)
13939042033443730820…67346064095045294079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.787 × 10¹⁰⁰(101-digit number)
27878084066887461640…34692128190090588159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.575 × 10¹⁰⁰(101-digit number)
55756168133774923280…69384256380181176319
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,759,417 XPM·at block #6,814,418 · 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