Block #422,750

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/28/2014, 12:38:20 AM · Difficulty 10.3652 · 6,393,697 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5fe6286bc2ffa9eb23563770ad81398eac1a926d9591ca057bdd2c5f6649b7ac

Height

#422,750

Difficulty

10.365235

Transactions

4

Size

2.48 KB

Version

2

Bits

0a5d8008

Nonce

24,128

Timestamp

2/28/2014, 12:38:20 AM

Confirmations

6,393,697

Merkle Root

6965fbd9b3736ac7d413e10d4acc4e832a531c6c27e7c5b0aba81794443c7c95
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.437 × 10⁹⁶(97-digit number)
14371357472942088998…57314331631196775999
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.437 × 10⁹⁶(97-digit number)
14371357472942088998…57314331631196775999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.874 × 10⁹⁶(97-digit number)
28742714945884177997…14628663262393551999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.748 × 10⁹⁶(97-digit number)
57485429891768355995…29257326524787103999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.149 × 10⁹⁷(98-digit number)
11497085978353671199…58514653049574207999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.299 × 10⁹⁷(98-digit number)
22994171956707342398…17029306099148415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.598 × 10⁹⁷(98-digit number)
45988343913414684796…34058612198296831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.197 × 10⁹⁷(98-digit number)
91976687826829369593…68117224396593663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.839 × 10⁹⁸(99-digit number)
18395337565365873918…36234448793187327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.679 × 10⁹⁸(99-digit number)
36790675130731747837…72468897586374655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.358 × 10⁹⁸(99-digit number)
73581350261463495674…44937795172749311999
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,775,702 XPM·at block #6,816,446 · 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