Block #2,822,485

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/3/2018, 7:08:09 AM · Difficulty 11.7028 · 4,014,372 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8806b6efd9bc1b79b0145f35600ed6bd27054b427a528418e6d1a9f533e0ba1f

Height

#2,822,485

Difficulty

11.702825

Transactions

17

Size

6.12 KB

Version

2

Bits

0bb3ec58

Nonce

1,455,919

Timestamp

9/3/2018, 7:08:09 AM

Confirmations

4,014,372

Merkle Root

ed398197ce447c8090ed41755bd2739053d836c0b446faed9a764da0cbfe8a35
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.741 × 10⁹⁵(96-digit number)
27411376548749872053…00568882970007654399
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.741 × 10⁹⁵(96-digit number)
27411376548749872053…00568882970007654399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.482 × 10⁹⁵(96-digit number)
54822753097499744107…01137765940015308799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.096 × 10⁹⁶(97-digit number)
10964550619499948821…02275531880030617599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.192 × 10⁹⁶(97-digit number)
21929101238999897643…04551063760061235199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.385 × 10⁹⁶(97-digit number)
43858202477999795286…09102127520122470399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.771 × 10⁹⁶(97-digit number)
87716404955999590572…18204255040244940799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.754 × 10⁹⁷(98-digit number)
17543280991199918114…36408510080489881599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.508 × 10⁹⁷(98-digit number)
35086561982399836228…72817020160979763199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.017 × 10⁹⁷(98-digit number)
70173123964799672457…45634040321959526399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.403 × 10⁹⁸(99-digit number)
14034624792959934491…91268080643919052799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.806 × 10⁹⁸(99-digit number)
28069249585919868983…82536161287838105599
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,145 XPM·at block #6,836,856 · 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