Block #411,564

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/19/2014, 9:01:33 PM · Difficulty 10.4265 · 6,398,811 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
511b630a036443e42b88a2bd108ff748341b1f9c2268821716bc0dc13f164794

Height

#411,564

Difficulty

10.426493

Transactions

7

Size

1.52 KB

Version

2

Bits

0a6d2ea4

Nonce

603,477

Timestamp

2/19/2014, 9:01:33 PM

Confirmations

6,398,811

Merkle Root

165206420b4f646f91eefb70709045dc558ea9edd9e367dd4a7a7d37adaf83a1
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.696 × 10¹⁰²(103-digit number)
36968561991248860498…91524906996478105599
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.696 × 10¹⁰²(103-digit number)
36968561991248860498…91524906996478105599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.393 × 10¹⁰²(103-digit number)
73937123982497720996…83049813992956211199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.478 × 10¹⁰³(104-digit number)
14787424796499544199…66099627985912422399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.957 × 10¹⁰³(104-digit number)
29574849592999088398…32199255971824844799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.914 × 10¹⁰³(104-digit number)
59149699185998176797…64398511943649689599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.182 × 10¹⁰⁴(105-digit number)
11829939837199635359…28797023887299379199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.365 × 10¹⁰⁴(105-digit number)
23659879674399270719…57594047774598758399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.731 × 10¹⁰⁴(105-digit number)
47319759348798541438…15188095549197516799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.463 × 10¹⁰⁴(105-digit number)
94639518697597082876…30376191098395033599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.892 × 10¹⁰⁵(106-digit number)
18927903739519416575…60752382196790067199
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,727,076 XPM·at block #6,810,374 · 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