Block #1,388,381

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/28/2015, 5:05:44 AM · Difficulty 10.8143 · 5,438,055 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
de07b82bd408ad518e6af925732db4fb7397ebcac4126a21798f6841a5baa67b

Height

#1,388,381

Difficulty

10.814320

Transactions

2

Size

764 B

Version

2

Bits

0ad07741

Nonce

716,730,543

Timestamp

12/28/2015, 5:05:44 AM

Confirmations

5,438,055

Merkle Root

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

4.161 × 10⁹⁴(95-digit number)
41613560065279234032…42570486078386569599
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
4.161 × 10⁹⁴(95-digit number)
41613560065279234032…42570486078386569599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.322 × 10⁹⁴(95-digit number)
83227120130558468064…85140972156773139199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.664 × 10⁹⁵(96-digit number)
16645424026111693612…70281944313546278399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.329 × 10⁹⁵(96-digit number)
33290848052223387225…40563888627092556799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.658 × 10⁹⁵(96-digit number)
66581696104446774451…81127777254185113599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.331 × 10⁹⁶(97-digit number)
13316339220889354890…62255554508370227199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.663 × 10⁹⁶(97-digit number)
26632678441778709780…24511109016740454399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.326 × 10⁹⁶(97-digit number)
53265356883557419561…49022218033480908799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.065 × 10⁹⁷(98-digit number)
10653071376711483912…98044436066961817599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.130 × 10⁹⁷(98-digit number)
21306142753422967824…96088872133923635199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.261 × 10⁹⁷(98-digit number)
42612285506845935649…92177744267847270399
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,855,625 XPM·at block #6,826,435 · 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