Block #2,782,969

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/7/2018, 7:24:07 AM · Difficulty 11.6603 · 4,050,516 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b29b976c3e5471848dacfdfc1596abbfa30a01336c09c0fbefefd738893bfcf1

Height

#2,782,969

Difficulty

11.660259

Transactions

2

Size

2.73 KB

Version

2

Bits

0ba906b8

Nonce

456,408,226

Timestamp

8/7/2018, 7:24:07 AM

Confirmations

4,050,516

Merkle Root

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

2.971 × 10⁹²(93-digit number)
29712579276594538346…18878663350374219999
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
2.971 × 10⁹²(93-digit number)
29712579276594538346…18878663350374219999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.942 × 10⁹²(93-digit number)
59425158553189076693…37757326700748439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.188 × 10⁹³(94-digit number)
11885031710637815338…75514653401496879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.377 × 10⁹³(94-digit number)
23770063421275630677…51029306802993759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.754 × 10⁹³(94-digit number)
47540126842551261354…02058613605987519999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.508 × 10⁹³(94-digit number)
95080253685102522708…04117227211975039999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.901 × 10⁹⁴(95-digit number)
19016050737020504541…08234454423950079999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.803 × 10⁹⁴(95-digit number)
38032101474041009083…16468908847900159999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.606 × 10⁹⁴(95-digit number)
76064202948082018167…32937817695800319999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.521 × 10⁹⁵(96-digit number)
15212840589616403633…65875635391600639999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.042 × 10⁹⁵(96-digit number)
30425681179232807266…31751270783201279999
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,912,085 XPM·at block #6,833,484 · 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