Block #452,199

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/20/2014, 10:26:15 AM · Difficulty 10.3888 · 6,356,149 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7c85600cafc1b3217f598a15a7479fc97e1145a2147d35fcfc18e9585007dbf8

Height

#452,199

Difficulty

10.388840

Transactions

3

Size

1.24 KB

Version

2

Bits

0a638b00

Nonce

30,343

Timestamp

3/20/2014, 10:26:15 AM

Confirmations

6,356,149

Merkle Root

fdb1cb9ae823d886d9b7a9099aafd88cf69a64ee55ebcbed93147407e9319faa
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.313 × 10⁹⁹(100-digit number)
13130692542982523000…63613677483122450139
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.313 × 10⁹⁹(100-digit number)
13130692542982523000…63613677483122450139
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.626 × 10⁹⁹(100-digit number)
26261385085965046001…27227354966244900279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.252 × 10⁹⁹(100-digit number)
52522770171930092002…54454709932489800559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.050 × 10¹⁰⁰(101-digit number)
10504554034386018400…08909419864979601119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.100 × 10¹⁰⁰(101-digit number)
21009108068772036800…17818839729959202239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.201 × 10¹⁰⁰(101-digit number)
42018216137544073601…35637679459918404479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.403 × 10¹⁰⁰(101-digit number)
84036432275088147203…71275358919836808959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.680 × 10¹⁰¹(102-digit number)
16807286455017629440…42550717839673617919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.361 × 10¹⁰¹(102-digit number)
33614572910035258881…85101435679347235839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.722 × 10¹⁰¹(102-digit number)
67229145820070517762…70202871358694471679
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,710,842 XPM·at block #6,808,347 · 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.

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