Block #1,353,113

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/4/2015, 12:04:19 AM · Difficulty 10.7972 · 5,462,028 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eab3ae966422cbea44beba06788112062a621d756f802ee9807e9b689e37efa3

Height

#1,353,113

Difficulty

10.797205

Transactions

2

Size

935 B

Version

2

Bits

0acc159f

Nonce

781,372,093

Timestamp

12/4/2015, 12:04:19 AM

Confirmations

5,462,028

Merkle Root

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

6.776 × 10⁹⁴(95-digit number)
67763029533411967731…05592782920563552001
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
6.776 × 10⁹⁴(95-digit number)
67763029533411967731…05592782920563552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.355 × 10⁹⁵(96-digit number)
13552605906682393546…11185565841127104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.710 × 10⁹⁵(96-digit number)
27105211813364787092…22371131682254208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.421 × 10⁹⁵(96-digit number)
54210423626729574184…44742263364508416001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.084 × 10⁹⁶(97-digit number)
10842084725345914836…89484526729016832001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.168 × 10⁹⁶(97-digit number)
21684169450691829673…78969053458033664001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.336 × 10⁹⁶(97-digit number)
43368338901383659347…57938106916067328001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.673 × 10⁹⁶(97-digit number)
86736677802767318695…15876213832134656001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.734 × 10⁹⁷(98-digit number)
17347335560553463739…31752427664269312001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.469 × 10⁹⁷(98-digit number)
34694671121106927478…63504855328538624001
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:57,765,222 XPM·at block #6,815,140 · 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