Block #619,445

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/6/2014, 9:19:14 AM · Difficulty 10.9474 · 6,190,977 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7e8940bde1bd60eb96e6682283fee4ddb438442e97dadb3204b04445fb90f127

Height

#619,445

Difficulty

10.947441

Transactions

2

Size

579 B

Version

2

Bits

0af28b84

Nonce

574,981,205

Timestamp

7/6/2014, 9:19:14 AM

Confirmations

6,190,977

Merkle Root

dd6ed18744b451020b80ba0ebde3cffa8bcaabf77af026892b0ccc4faef1eadb
Transactions (2)
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.618 × 10⁹⁷(98-digit number)
16189302775035644705…70447563666840555519
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.618 × 10⁹⁷(98-digit number)
16189302775035644705…70447563666840555519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.237 × 10⁹⁷(98-digit number)
32378605550071289411…40895127333681111039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.475 × 10⁹⁷(98-digit number)
64757211100142578823…81790254667362222079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.295 × 10⁹⁸(99-digit number)
12951442220028515764…63580509334724444159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.590 × 10⁹⁸(99-digit number)
25902884440057031529…27161018669448888319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.180 × 10⁹⁸(99-digit number)
51805768880114063058…54322037338897776639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.036 × 10⁹⁹(100-digit number)
10361153776022812611…08644074677795553279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.072 × 10⁹⁹(100-digit number)
20722307552045625223…17288149355591106559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.144 × 10⁹⁹(100-digit number)
41444615104091250446…34576298711182213119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.288 × 10⁹⁹(100-digit number)
82889230208182500893…69152597422364426239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.657 × 10¹⁰⁰(101-digit number)
16577846041636500178…38305194844728852479
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,727,457 XPM·at block #6,810,421 · 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