Block #2,885,330

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/17/2018, 6:30:47 PM · Difficulty 11.6257 · 3,951,646 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
41d60acde09a5f809d2542f9cfbb207937845ec2f7a500544479dc9cd1bea213

Height

#2,885,330

Difficulty

11.625666

Transactions

31

Size

8.46 KB

Version

2

Bits

0ba02ba6

Nonce

106,883,800

Timestamp

10/17/2018, 6:30:47 PM

Confirmations

3,951,646

Merkle Root

6bd4b5f3556bdbb1bfc960feecd0fa56020ce61935f06f67f657f59a334e2dde
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.

5.495 × 10⁹⁴(95-digit number)
54956072292743254396…50079940991087737599
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
5.495 × 10⁹⁴(95-digit number)
54956072292743254396…50079940991087737599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.099 × 10⁹⁵(96-digit number)
10991214458548650879…00159881982175475199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.198 × 10⁹⁵(96-digit number)
21982428917097301758…00319763964350950399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.396 × 10⁹⁵(96-digit number)
43964857834194603516…00639527928701900799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.792 × 10⁹⁵(96-digit number)
87929715668389207033…01279055857403801599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.758 × 10⁹⁶(97-digit number)
17585943133677841406…02558111714807603199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.517 × 10⁹⁶(97-digit number)
35171886267355682813…05116223429615206399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.034 × 10⁹⁶(97-digit number)
70343772534711365627…10232446859230412799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.406 × 10⁹⁷(98-digit number)
14068754506942273125…20464893718460825599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.813 × 10⁹⁷(98-digit number)
28137509013884546250…40929787436921651199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.627 × 10⁹⁷(98-digit number)
56275018027769092501…81859574873843302399
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,940,106 XPM·at block #6,836,975 · 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