Block #1,311,177

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/3/2015, 7:05:56 PM · Difficulty 10.8499 · 5,534,170 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7473641ed8fd35ef391b217240795a12e0d277ab34cc538955726f4c4839f411

Height

#1,311,177

Difficulty

10.849875

Transactions

2

Size

970 B

Version

2

Bits

0ad9916e

Nonce

316,778,740

Timestamp

11/3/2015, 7:05:56 PM

Confirmations

5,534,170

Merkle Root

a46d78d10c564de974824248134d4b0daeec8c9db1413728cab5fbfcdc979fc3
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.233 × 10⁹⁴(95-digit number)
52339236796936533090…68285264618545633601
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.233 × 10⁹⁴(95-digit number)
52339236796936533090…68285264618545633601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.046 × 10⁹⁵(96-digit number)
10467847359387306618…36570529237091267201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.093 × 10⁹⁵(96-digit number)
20935694718774613236…73141058474182534401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.187 × 10⁹⁵(96-digit number)
41871389437549226472…46282116948365068801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.374 × 10⁹⁵(96-digit number)
83742778875098452944…92564233896730137601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.674 × 10⁹⁶(97-digit number)
16748555775019690588…85128467793460275201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.349 × 10⁹⁶(97-digit number)
33497111550039381177…70256935586920550401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.699 × 10⁹⁶(97-digit number)
66994223100078762355…40513871173841100801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.339 × 10⁹⁷(98-digit number)
13398844620015752471…81027742347682201601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.679 × 10⁹⁷(98-digit number)
26797689240031504942…62055484695364403201
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:58,007,218 XPM·at block #6,845,346 · 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