Block #2,830,468

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/8/2018, 4:15:06 PM · Difficulty 11.7166 · 4,001,842 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
76b2a40db589421f75a621f65a695ed9c73dc80cdde16b99a8661ad6c01e3a16

Height

#2,830,468

Difficulty

11.716576

Transactions

23

Size

6.18 KB

Version

2

Bits

0bb7717f

Nonce

240,980,747

Timestamp

9/8/2018, 4:15:06 PM

Confirmations

4,001,842

Merkle Root

604500446fa14c9b8f0a0217edec0d573de352bfb9bcbd1002498d4823561d2d
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.

2.398 × 10⁹²(93-digit number)
23988001794417071268…77532339930875065839
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
2.398 × 10⁹²(93-digit number)
23988001794417071268…77532339930875065839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.797 × 10⁹²(93-digit number)
47976003588834142536…55064679861750131679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.595 × 10⁹²(93-digit number)
95952007177668285073…10129359723500263359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.919 × 10⁹³(94-digit number)
19190401435533657014…20258719447000526719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.838 × 10⁹³(94-digit number)
38380802871067314029…40517438894001053439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.676 × 10⁹³(94-digit number)
76761605742134628058…81034877788002106879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.535 × 10⁹⁴(95-digit number)
15352321148426925611…62069755576004213759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.070 × 10⁹⁴(95-digit number)
30704642296853851223…24139511152008427519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.140 × 10⁹⁴(95-digit number)
61409284593707702446…48279022304016855039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.228 × 10⁹⁵(96-digit number)
12281856918741540489…96558044608033710079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.456 × 10⁹⁵(96-digit number)
24563713837483080978…93116089216067420159
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,902,622 XPM·at block #6,832,309 · 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