Block #422,154

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/27/2014, 12:46:31 PM · Difficulty 10.3796 · 6,388,951 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0a8b054fb21d7d4b704163eb9bba2d0759ed63f4d034e0024c503aa3eca86647

Height

#422,154

Difficulty

10.379592

Transactions

5

Size

9.64 KB

Version

2

Bits

0a612cef

Nonce

256,871

Timestamp

2/27/2014, 12:46:31 PM

Confirmations

6,388,951

Merkle Root

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

1.674 × 10⁹⁹(100-digit number)
16748118226552167451…07470819599886991359
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
1.674 × 10⁹⁹(100-digit number)
16748118226552167451…07470819599886991359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.349 × 10⁹⁹(100-digit number)
33496236453104334902…14941639199773982719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.699 × 10⁹⁹(100-digit number)
66992472906208669804…29883278399547965439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.339 × 10¹⁰⁰(101-digit number)
13398494581241733960…59766556799095930879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.679 × 10¹⁰⁰(101-digit number)
26796989162483467921…19533113598191861759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.359 × 10¹⁰⁰(101-digit number)
53593978324966935843…39066227196383723519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.071 × 10¹⁰¹(102-digit number)
10718795664993387168…78132454392767447039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.143 × 10¹⁰¹(102-digit number)
21437591329986774337…56264908785534894079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.287 × 10¹⁰¹(102-digit number)
42875182659973548674…12529817571069788159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.575 × 10¹⁰¹(102-digit number)
85750365319947097349…25059635142139576319
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,732,947 XPM·at block #6,811,104 · 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