Block #436,992

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/9/2014, 11:58:47 PM · Difficulty 10.3583 · 6,374,001 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c49b747444300f6e2cf85b9fd53276ac462f21a20a3351377340d054a97981a5

Height

#436,992

Difficulty

10.358272

Transactions

2

Size

393 B

Version

2

Bits

0a5bb7b5

Nonce

57,822

Timestamp

3/9/2014, 11:58:47 PM

Confirmations

6,374,001

Merkle Root

362e1cc01ecf8fd33dcc077764930b807defe30d9c39e1d3095f8ef77b683bcc
Transactions (2)
1 in → 1 out9.3200 XPM110 B
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.

3.644 × 10⁹⁷(98-digit number)
36447323691704190338…64611874310136432799
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
3.644 × 10⁹⁷(98-digit number)
36447323691704190338…64611874310136432799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.289 × 10⁹⁷(98-digit number)
72894647383408380676…29223748620272865599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.457 × 10⁹⁸(99-digit number)
14578929476681676135…58447497240545731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.915 × 10⁹⁸(99-digit number)
29157858953363352270…16894994481091462399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.831 × 10⁹⁸(99-digit number)
58315717906726704541…33789988962182924799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.166 × 10⁹⁹(100-digit number)
11663143581345340908…67579977924365849599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.332 × 10⁹⁹(100-digit number)
23326287162690681816…35159955848731699199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.665 × 10⁹⁹(100-digit number)
46652574325381363633…70319911697463398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.330 × 10⁹⁹(100-digit number)
93305148650762727266…40639823394926796799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.866 × 10¹⁰⁰(101-digit number)
18661029730152545453…81279646789853593599
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,732,048 XPM·at block #6,810,992 · 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