Block #2,820,647

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/2/2018, 1:13:09 AM · Difficulty 11.7003 · 4,018,778 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6f6930fe69339e75307abd9c101395b77cb6dca648d68760be165c6d02d98329

Height

#2,820,647

Difficulty

11.700336

Transactions

5

Size

3.26 KB

Version

2

Bits

0bb34933

Nonce

1,186,345,935

Timestamp

9/2/2018, 1:13:09 AM

Confirmations

4,018,778

Merkle Root

18c81d1c390f60f3773828de189d4c751ee9f2ba4adb5f76ae797941f9d7863a
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.473 × 10⁹⁴(95-digit number)
24734333150066873244…77728928952078249999
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.473 × 10⁹⁴(95-digit number)
24734333150066873244…77728928952078249999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.946 × 10⁹⁴(95-digit number)
49468666300133746489…55457857904156499999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.893 × 10⁹⁴(95-digit number)
98937332600267492978…10915715808312999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.978 × 10⁹⁵(96-digit number)
19787466520053498595…21831431616625999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.957 × 10⁹⁵(96-digit number)
39574933040106997191…43662863233251999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.914 × 10⁹⁵(96-digit number)
79149866080213994382…87325726466503999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.582 × 10⁹⁶(97-digit number)
15829973216042798876…74651452933007999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.165 × 10⁹⁶(97-digit number)
31659946432085597753…49302905866015999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.331 × 10⁹⁶(97-digit number)
63319892864171195506…98605811732031999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.266 × 10⁹⁷(98-digit number)
12663978572834239101…97211623464063999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.532 × 10⁹⁷(98-digit number)
25327957145668478202…94423246928127999999
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,959,689 XPM·at block #6,839,424 · 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