Block #1,317,357

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/7/2015, 7:03:47 PM · Difficulty 10.8621 · 5,496,980 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6472dae484f762b1b9c5a5931610acee8c8636bd3fb7b2af184b9d259826eba0

Height

#1,317,357

Difficulty

10.862128

Transactions

2

Size

937 B

Version

2

Bits

0adcb46a

Nonce

187,030,135

Timestamp

11/7/2015, 7:03:47 PM

Confirmations

5,496,980

Merkle Root

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

5.559 × 10⁹⁶(97-digit number)
55597404813750399194…52899056644537712639
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
5.559 × 10⁹⁶(97-digit number)
55597404813750399194…52899056644537712639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.111 × 10⁹⁷(98-digit number)
11119480962750079838…05798113289075425279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.223 × 10⁹⁷(98-digit number)
22238961925500159677…11596226578150850559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.447 × 10⁹⁷(98-digit number)
44477923851000319355…23192453156301701119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.895 × 10⁹⁷(98-digit number)
88955847702000638711…46384906312603402239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.779 × 10⁹⁸(99-digit number)
17791169540400127742…92769812625206804479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.558 × 10⁹⁸(99-digit number)
35582339080800255484…85539625250413608959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.116 × 10⁹⁸(99-digit number)
71164678161600510968…71079250500827217919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.423 × 10⁹⁹(100-digit number)
14232935632320102193…42158501001654435839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.846 × 10⁹⁹(100-digit number)
28465871264640204387…84317002003308871679
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,758,758 XPM·at block #6,814,336 · 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