Block #1,314,086

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/5/2015, 2:51:25 PM · Difficulty 10.8582 · 5,494,477 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
16f6dcc55c9e214731e2fcde745f30d27ae0fec1e76da60e67072b2f044087a0

Height

#1,314,086

Difficulty

10.858158

Transactions

3

Size

8.50 KB

Version

2

Bits

0adbb045

Nonce

1,296,244,211

Timestamp

11/5/2015, 2:51:25 PM

Confirmations

5,494,477

Merkle Root

ddfee23649ec075e233743b27714de155052304140d625f5521947b474485a6d
Transactions (3)
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.

9.753 × 10⁹⁵(96-digit number)
97533523335494163720…40796044044928081919
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
9.753 × 10⁹⁵(96-digit number)
97533523335494163720…40796044044928081919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.950 × 10⁹⁶(97-digit number)
19506704667098832744…81592088089856163839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.901 × 10⁹⁶(97-digit number)
39013409334197665488…63184176179712327679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.802 × 10⁹⁶(97-digit number)
78026818668395330976…26368352359424655359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.560 × 10⁹⁷(98-digit number)
15605363733679066195…52736704718849310719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.121 × 10⁹⁷(98-digit number)
31210727467358132390…05473409437698621439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.242 × 10⁹⁷(98-digit number)
62421454934716264781…10946818875397242879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.248 × 10⁹⁸(99-digit number)
12484290986943252956…21893637750794485759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.496 × 10⁹⁸(99-digit number)
24968581973886505912…43787275501588971519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.993 × 10⁹⁸(99-digit number)
49937163947773011824…87574551003177943039
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,712,562 XPM·at block #6,808,562 · 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.

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