Block #1,427,897

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/25/2016, 7:09:21 PM · Difficulty 10.7442 · 5,388,862 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f2e5e2df14100bf62f4c8a109f5f5b19bde08378186484031292308d7833e03a

Height

#1,427,897

Difficulty

10.744203

Transactions

6

Size

5.00 KB

Version

2

Bits

0abe841a

Nonce

691,230,835

Timestamp

1/25/2016, 7:09:21 PM

Confirmations

5,388,862

Merkle Root

dddd3452f8f9a77162d1fb83756b7ba62a55cdadc277433044272e3641a864fa
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.215 × 10⁹⁵(96-digit number)
42151507500493725878…67293891112396570879
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.215 × 10⁹⁵(96-digit number)
42151507500493725878…67293891112396570879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.430 × 10⁹⁵(96-digit number)
84303015000987451757…34587782224793141759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.686 × 10⁹⁶(97-digit number)
16860603000197490351…69175564449586283519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.372 × 10⁹⁶(97-digit number)
33721206000394980702…38351128899172567039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.744 × 10⁹⁶(97-digit number)
67442412000789961405…76702257798345134079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.348 × 10⁹⁷(98-digit number)
13488482400157992281…53404515596690268159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.697 × 10⁹⁷(98-digit number)
26976964800315984562…06809031193380536319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.395 × 10⁹⁷(98-digit number)
53953929600631969124…13618062386761072639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.079 × 10⁹⁸(99-digit number)
10790785920126393824…27236124773522145279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.158 × 10⁹⁸(99-digit number)
21581571840252787649…54472249547044290559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.316 × 10⁹⁸(99-digit number)
43163143680505575299…08944499094088581119
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,778,103 XPM·at block #6,816,758 · 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