Block #427,223

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/3/2014, 5:52:57 AM · Difficulty 10.3446 · 6,380,893 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8aaf59749ca1177ee603fa734d2b7728818f22559b91d8a89481bf46fad7cbb3

Height

#427,223

Difficulty

10.344605

Transactions

3

Size

2.49 KB

Version

2

Bits

0a583809

Nonce

116,870

Timestamp

3/3/2014, 5:52:57 AM

Confirmations

6,380,893

Merkle Root

ed808448bab587a11649e5af04d6de0ddbc54a69a9f1bc152c5a35beff5e01d0
Transactions (3)
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.

4.409 × 10¹⁰⁰(101-digit number)
44097845220568027721…27874428331177882239
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
4.409 × 10¹⁰⁰(101-digit number)
44097845220568027721…27874428331177882239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.819 × 10¹⁰⁰(101-digit number)
88195690441136055442…55748856662355764479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.763 × 10¹⁰¹(102-digit number)
17639138088227211088…11497713324711528959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.527 × 10¹⁰¹(102-digit number)
35278276176454422176…22995426649423057919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.055 × 10¹⁰¹(102-digit number)
70556552352908844353…45990853298846115839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.411 × 10¹⁰²(103-digit number)
14111310470581768870…91981706597692231679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.822 × 10¹⁰²(103-digit number)
28222620941163537741…83963413195384463359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.644 × 10¹⁰²(103-digit number)
56445241882327075483…67926826390768926719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.128 × 10¹⁰³(104-digit number)
11289048376465415096…35853652781537853439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.257 × 10¹⁰³(104-digit number)
22578096752930830193…71707305563075706879
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,708,976 XPM·at block #6,808,115 · 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