Block #407,579

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/17/2014, 1:53:52 AM · Difficulty 10.4291 · 6,407,273 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
19524e96873d17f60780544bc65c1ed3e8471df21bb922397016d1a96b25cdc8

Height

#407,579

Difficulty

10.429113

Transactions

4

Size

1.00 KB

Version

2

Bits

0a6dda52

Nonce

4,849

Timestamp

2/17/2014, 1:53:52 AM

Confirmations

6,407,273

Merkle Root

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

2.439 × 10⁹⁹(100-digit number)
24397090310662572414…74308003854859194759
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
2.439 × 10⁹⁹(100-digit number)
24397090310662572414…74308003854859194759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.879 × 10⁹⁹(100-digit number)
48794180621325144829…48616007709718389519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.758 × 10⁹⁹(100-digit number)
97588361242650289658…97232015419436779039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.951 × 10¹⁰⁰(101-digit number)
19517672248530057931…94464030838873558079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.903 × 10¹⁰⁰(101-digit number)
39035344497060115863…88928061677747116159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.807 × 10¹⁰⁰(101-digit number)
78070688994120231726…77856123355494232319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.561 × 10¹⁰¹(102-digit number)
15614137798824046345…55712246710988464639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.122 × 10¹⁰¹(102-digit number)
31228275597648092690…11424493421976929279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.245 × 10¹⁰¹(102-digit number)
62456551195296185381…22848986843953858559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.249 × 10¹⁰²(103-digit number)
12491310239059237076…45697973687907717119
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,762,899 XPM·at block #6,814,851 · 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