Block #2,826,265

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/5/2018, 8:01:57 PM · Difficulty 11.7103 · 4,012,541 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
42f08469abd745b843cc9106a1c26c0a649f6e215c6b7a4ee73e3f3faa444a36

Height

#2,826,265

Difficulty

11.710264

Transactions

2

Size

869 B

Version

2

Bits

0bb5d3e0

Nonce

382,088,562

Timestamp

9/5/2018, 8:01:57 PM

Confirmations

4,012,541

Merkle Root

112655d1dd758faf91328afefdbdf6699936cefd8bcf38c8197997402054833d
Transactions (2)
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.172 × 10⁹⁴(95-digit number)
11727133798252641342…64743239009723538559
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.172 × 10⁹⁴(95-digit number)
11727133798252641342…64743239009723538559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.345 × 10⁹⁴(95-digit number)
23454267596505282684…29486478019447077119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.690 × 10⁹⁴(95-digit number)
46908535193010565369…58972956038894154239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.381 × 10⁹⁴(95-digit number)
93817070386021130738…17945912077788308479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.876 × 10⁹⁵(96-digit number)
18763414077204226147…35891824155576616959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.752 × 10⁹⁵(96-digit number)
37526828154408452295…71783648311153233919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.505 × 10⁹⁵(96-digit number)
75053656308816904590…43567296622306467839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.501 × 10⁹⁶(97-digit number)
15010731261763380918…87134593244612935679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.002 × 10⁹⁶(97-digit number)
30021462523526761836…74269186489225871359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.004 × 10⁹⁶(97-digit number)
60042925047053523672…48538372978451742719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.200 × 10⁹⁷(98-digit number)
12008585009410704734…97076745956903485439
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,954,714 XPM·at block #6,838,805 · 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