Block #2,805,715

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/23/2018, 12:30:37 AM · Difficulty 11.6690 · 4,003,020 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5a8fe199ca95ef0faab7dd7ccfbe9c142ebae5f60b6be00b64478f7e440ef6a0

Height

#2,805,715

Difficulty

11.669038

Transactions

6

Size

3.15 KB

Version

2

Bits

0bab460b

Nonce

213,595,281

Timestamp

8/23/2018, 12:30:37 AM

Confirmations

4,003,020

Merkle Root

33683bb0637ae3064a1e1a91ffd7297ca232324e4079d872ffb8f8079d18923b
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.009 × 10⁹⁴(95-digit number)
10090527043976701536…71569129226020169759
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.009 × 10⁹⁴(95-digit number)
10090527043976701536…71569129226020169759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.018 × 10⁹⁴(95-digit number)
20181054087953403072…43138258452040339519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.036 × 10⁹⁴(95-digit number)
40362108175906806145…86276516904080679039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.072 × 10⁹⁴(95-digit number)
80724216351813612291…72553033808161358079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.614 × 10⁹⁵(96-digit number)
16144843270362722458…45106067616322716159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.228 × 10⁹⁵(96-digit number)
32289686540725444916…90212135232645432319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.457 × 10⁹⁵(96-digit number)
64579373081450889833…80424270465290864639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.291 × 10⁹⁶(97-digit number)
12915874616290177966…60848540930581729279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.583 × 10⁹⁶(97-digit number)
25831749232580355933…21697081861163458559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.166 × 10⁹⁶(97-digit number)
51663498465160711866…43394163722326917119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.033 × 10⁹⁷(98-digit number)
10332699693032142373…86788327444653834239
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,713,926 XPM·at block #6,808,734 · 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