Block #2,876,065

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/11/2018, 12:35:45 AM · Difficulty 11.6574 · 3,966,950 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d905b4242dc39f50e82dbfe0075c155d95d88941b77d89c32c562a2e542f3d18

Height

#2,876,065

Difficulty

11.657404

Transactions

3

Size

1.60 KB

Version

2

Bits

0ba84b99

Nonce

576,967,336

Timestamp

10/11/2018, 12:35:45 AM

Confirmations

3,966,950

Merkle Root

241a001099f272ba2c23a245a41b064f48a29664f7df1ebecf1e9381604a6752
Transactions (3)
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.

3.813 × 10⁹⁴(95-digit number)
38131557857995770169…76021254845033943039
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
3.813 × 10⁹⁴(95-digit number)
38131557857995770169…76021254845033943039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.626 × 10⁹⁴(95-digit number)
76263115715991540338…52042509690067886079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.525 × 10⁹⁵(96-digit number)
15252623143198308067…04085019380135772159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.050 × 10⁹⁵(96-digit number)
30505246286396616135…08170038760271544319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.101 × 10⁹⁵(96-digit number)
61010492572793232270…16340077520543088639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.220 × 10⁹⁶(97-digit number)
12202098514558646454…32680155041086177279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.440 × 10⁹⁶(97-digit number)
24404197029117292908…65360310082172354559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.880 × 10⁹⁶(97-digit number)
48808394058234585816…30720620164344709119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.761 × 10⁹⁶(97-digit number)
97616788116469171633…61441240328689418239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.952 × 10⁹⁷(98-digit number)
19523357623293834326…22882480657378836479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.904 × 10⁹⁷(98-digit number)
39046715246587668653…45764961314757672959
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,988,475 XPM·at block #6,843,014 · 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