Block #436,540

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/9/2014, 4:13:26 PM · Difficulty 10.3592 · 6,373,020 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
de47e5d9071951e1d09b83479390fcc0d0d99ff88317a2f28421b64fb8598a45

Height

#436,540

Difficulty

10.359157

Transactions

3

Size

22.62 KB

Version

2

Bits

0a5bf1bb

Nonce

26,643

Timestamp

3/9/2014, 4:13:26 PM

Confirmations

6,373,020

Merkle Root

cca2e9e6e608c363351988e17c7fdff00a3dfb271bf49d6f328165675a9ac123
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.244 × 10¹⁰⁰(101-digit number)
32444543325588121128…50004926776175040879
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.244 × 10¹⁰⁰(101-digit number)
32444543325588121128…50004926776175040879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.488 × 10¹⁰⁰(101-digit number)
64889086651176242256…00009853552350081759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.297 × 10¹⁰¹(102-digit number)
12977817330235248451…00019707104700163519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.595 × 10¹⁰¹(102-digit number)
25955634660470496902…00039414209400327039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.191 × 10¹⁰¹(102-digit number)
51911269320940993805…00078828418800654079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.038 × 10¹⁰²(103-digit number)
10382253864188198761…00157656837601308159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.076 × 10¹⁰²(103-digit number)
20764507728376397522…00315313675202616319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.152 × 10¹⁰²(103-digit number)
41529015456752795044…00630627350405232639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.305 × 10¹⁰²(103-digit number)
83058030913505590088…01261254700810465279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.661 × 10¹⁰³(104-digit number)
16611606182701118017…02522509401620930559
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,720,554 XPM·at block #6,809,559 · 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