Block #453,700

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/21/2014, 11:42:37 AM · Difficulty 10.3883 · 6,361,440 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
378a654f5c440eb0f377bff3909436dd6c169a0b4cd7a49cf35f5bee8a158569

Height

#453,700

Difficulty

10.388283

Transactions

5

Size

1.37 KB

Version

2

Bits

0a636686

Nonce

35,831

Timestamp

3/21/2014, 11:42:37 AM

Confirmations

6,361,440

Merkle Root

dc62deb776435c69b81a02d5a48b124732201144ad45f7477114c8811a1c7334
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.

9.447 × 10¹⁰⁰(101-digit number)
94474997492549205976…21237572424493503279
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
9.447 × 10¹⁰⁰(101-digit number)
94474997492549205976…21237572424493503279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.889 × 10¹⁰¹(102-digit number)
18894999498509841195…42475144848987006559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.778 × 10¹⁰¹(102-digit number)
37789998997019682390…84950289697974013119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.557 × 10¹⁰¹(102-digit number)
75579997994039364781…69900579395948026239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.511 × 10¹⁰²(103-digit number)
15115999598807872956…39801158791896052479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.023 × 10¹⁰²(103-digit number)
30231999197615745912…79602317583792104959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.046 × 10¹⁰²(103-digit number)
60463998395231491824…59204635167584209919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.209 × 10¹⁰³(104-digit number)
12092799679046298364…18409270335168419839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.418 × 10¹⁰³(104-digit number)
24185599358092596729…36818540670336839679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.837 × 10¹⁰³(104-digit number)
48371198716185193459…73637081340673679359
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,765,214 XPM·at block #6,815,139 · 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