Block #2,729,411

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/1/2018, 10:06:07 AM · Difficulty 11.6272 · 4,109,451 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6382da1d513f881df132427c8003abd810f1641fae80696d4a845cd5de02e752

Height

#2,729,411

Difficulty

11.627215

Transactions

2

Size

723 B

Version

2

Bits

0ba09131

Nonce

448,029,540

Timestamp

7/1/2018, 10:06:07 AM

Confirmations

4,109,451

Merkle Root

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

3.128 × 10⁹⁶(97-digit number)
31286945944063898242…19738880144938598399
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.128 × 10⁹⁶(97-digit number)
31286945944063898242…19738880144938598399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.257 × 10⁹⁶(97-digit number)
62573891888127796484…39477760289877196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.251 × 10⁹⁷(98-digit number)
12514778377625559296…78955520579754393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.502 × 10⁹⁷(98-digit number)
25029556755251118593…57911041159508787199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.005 × 10⁹⁷(98-digit number)
50059113510502237187…15822082319017574399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.001 × 10⁹⁸(99-digit number)
10011822702100447437…31644164638035148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.002 × 10⁹⁸(99-digit number)
20023645404200894875…63288329276070297599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.004 × 10⁹⁸(99-digit number)
40047290808401789750…26576658552140595199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.009 × 10⁹⁸(99-digit number)
80094581616803579500…53153317104281190399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.601 × 10⁹⁹(100-digit number)
16018916323360715900…06306634208562380799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.203 × 10⁹⁹(100-digit number)
32037832646721431800…12613268417124761599
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,955,161 XPM·at block #6,838,861 · 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