Block #441,531

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/13/2014, 5:14:51 AM · Difficulty 10.3482 · 6,369,118 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
771c4aeb3941a76fa61ba62f402bc2fcb355d7359934a6fd177105d57b1d2ac4

Height

#441,531

Difficulty

10.348160

Transactions

2

Size

1.43 KB

Version

2

Bits

0a592100

Nonce

22,226

Timestamp

3/13/2014, 5:14:51 AM

Confirmations

6,369,118

Merkle Root

c07dbc24ead81c380af642d12114fb28ba1e7786b4a7e224ca403157533003bd
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.978 × 10¹⁰¹(102-digit number)
19785050088289617411…69783669259216334719
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.978 × 10¹⁰¹(102-digit number)
19785050088289617411…69783669259216334719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.957 × 10¹⁰¹(102-digit number)
39570100176579234823…39567338518432669439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.914 × 10¹⁰¹(102-digit number)
79140200353158469646…79134677036865338879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.582 × 10¹⁰²(103-digit number)
15828040070631693929…58269354073730677759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.165 × 10¹⁰²(103-digit number)
31656080141263387858…16538708147461355519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.331 × 10¹⁰²(103-digit number)
63312160282526775716…33077416294922711039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.266 × 10¹⁰³(104-digit number)
12662432056505355143…66154832589845422079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.532 × 10¹⁰³(104-digit number)
25324864113010710286…32309665179690844159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.064 × 10¹⁰³(104-digit number)
50649728226021420573…64619330359381688319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.012 × 10¹⁰⁴(105-digit number)
10129945645204284114…29238660718763376639
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,729,281 XPM·at block #6,810,648 · 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