Block #416,834

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/23/2014, 5:01:18 PM · Difficulty 10.3999 · 6,391,800 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8aa65a2afbe850fa14e7d86338cf572f2eae5152ca54a73134cccbe8a70a4501

Height

#416,834

Difficulty

10.399870

Transactions

5

Size

1.22 KB

Version

2

Bits

0a665de4

Nonce

538,384

Timestamp

2/23/2014, 5:01:18 PM

Confirmations

6,391,800

Merkle Root

a19c9570b902dab167f4a9a96b1ed10bb962afcd87eb34e6031fa56e8c2aefb5
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.537 × 10¹⁰⁰(101-digit number)
25373329468046498405…48911260571895053499
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.537 × 10¹⁰⁰(101-digit number)
25373329468046498405…48911260571895053499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.074 × 10¹⁰⁰(101-digit number)
50746658936092996811…97822521143790106999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.014 × 10¹⁰¹(102-digit number)
10149331787218599362…95645042287580213999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.029 × 10¹⁰¹(102-digit number)
20298663574437198724…91290084575160427999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.059 × 10¹⁰¹(102-digit number)
40597327148874397449…82580169150320855999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.119 × 10¹⁰¹(102-digit number)
81194654297748794898…65160338300641711999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.623 × 10¹⁰²(103-digit number)
16238930859549758979…30320676601283423999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.247 × 10¹⁰²(103-digit number)
32477861719099517959…60641353202566847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.495 × 10¹⁰²(103-digit number)
64955723438199035918…21282706405133695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.299 × 10¹⁰³(104-digit number)
12991144687639807183…42565412810267391999
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,713,123 XPM·at block #6,808,633 · 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