Block #2,856,480

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/27/2018, 1:13:24 AM · Difficulty 11.6914 · 3,980,435 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7e394425dd1be35598d7042c68f152d3c22c15231870c29409d5aa00d0e91f24

Height

#2,856,480

Difficulty

11.691401

Transactions

3

Size

814 B

Version

2

Bits

0bb0ffaf

Nonce

1,835,044,172

Timestamp

9/27/2018, 1:13:24 AM

Confirmations

3,980,435

Merkle Root

4949116d5d600bf76affd357c860db2f6ea6e717b771a89111bdbdd4d1486da4
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.

7.982 × 10⁹³(94-digit number)
79822627742879150337…44585783199320813119
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
7.982 × 10⁹³(94-digit number)
79822627742879150337…44585783199320813119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.596 × 10⁹⁴(95-digit number)
15964525548575830067…89171566398641626239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.192 × 10⁹⁴(95-digit number)
31929051097151660134…78343132797283252479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.385 × 10⁹⁴(95-digit number)
63858102194303320269…56686265594566504959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.277 × 10⁹⁵(96-digit number)
12771620438860664053…13372531189133009919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.554 × 10⁹⁵(96-digit number)
25543240877721328107…26745062378266019839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.108 × 10⁹⁵(96-digit number)
51086481755442656215…53490124756532039679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.021 × 10⁹⁶(97-digit number)
10217296351088531243…06980249513064079359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.043 × 10⁹⁶(97-digit number)
20434592702177062486…13960499026128158719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.086 × 10⁹⁶(97-digit number)
40869185404354124972…27920998052256317439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.173 × 10⁹⁶(97-digit number)
81738370808708249945…55841996104512634879
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,939,614 XPM·at block #6,836,914 · 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