Block #2,574,038

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/19/2018, 12:16:21 PM · Difficulty 10.9952 · 4,269,905 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
92ea81efdaa8d021efbbe1bcf0d10d95677357e46193181b9659a64e7528a588

Height

#2,574,038

Difficulty

10.995218

Transactions

6

Size

1.72 KB

Version

2

Bits

0afec69f

Nonce

361,053,120

Timestamp

3/19/2018, 12:16:21 PM

Confirmations

4,269,905

Merkle Root

c82d1b3ca60ff6e7d064555e5c8f7325a089d4363824ef7124f81ddee52dc77c
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.

8.614 × 10⁹⁴(95-digit number)
86142176431626388987…25996257279327869119
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
8.614 × 10⁹⁴(95-digit number)
86142176431626388987…25996257279327869119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.722 × 10⁹⁵(96-digit number)
17228435286325277797…51992514558655738239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.445 × 10⁹⁵(96-digit number)
34456870572650555594…03985029117311476479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.891 × 10⁹⁵(96-digit number)
68913741145301111189…07970058234622952959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.378 × 10⁹⁶(97-digit number)
13782748229060222237…15940116469245905919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.756 × 10⁹⁶(97-digit number)
27565496458120444475…31880232938491811839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.513 × 10⁹⁶(97-digit number)
55130992916240888951…63760465876983623679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.102 × 10⁹⁷(98-digit number)
11026198583248177790…27520931753967247359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.205 × 10⁹⁷(98-digit number)
22052397166496355580…55041863507934494719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.410 × 10⁹⁷(98-digit number)
44104794332992711161…10083727015868989439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.820 × 10⁹⁷(98-digit number)
88209588665985422322…20167454031737978879
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,995,919 XPM·at block #6,843,942 · 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