Block #1,265,372

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/3/2015, 12:56:31 PM · Difficulty 10.8225 · 5,542,931 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e2f60e3873c774724582fd415e4970e5acc93e3c59d2a78771db351a0338568f

Height

#1,265,372

Difficulty

10.822517

Transactions

3

Size

653 B

Version

2

Bits

0ad29081

Nonce

1,545,765,999

Timestamp

10/3/2015, 12:56:31 PM

Confirmations

5,542,931

Merkle Root

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

1.396 × 10⁹⁴(95-digit number)
13964892819389007690…65820853339487861201
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
1.396 × 10⁹⁴(95-digit number)
13964892819389007690…65820853339487861201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.792 × 10⁹⁴(95-digit number)
27929785638778015380…31641706678975722401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.585 × 10⁹⁴(95-digit number)
55859571277556030760…63283413357951444801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.117 × 10⁹⁵(96-digit number)
11171914255511206152…26566826715902889601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.234 × 10⁹⁵(96-digit number)
22343828511022412304…53133653431805779201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.468 × 10⁹⁵(96-digit number)
44687657022044824608…06267306863611558401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.937 × 10⁹⁵(96-digit number)
89375314044089649217…12534613727223116801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.787 × 10⁹⁶(97-digit number)
17875062808817929843…25069227454446233601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.575 × 10⁹⁶(97-digit number)
35750125617635859686…50138454908892467201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.150 × 10⁹⁶(97-digit number)
71500251235271719373…00276909817784934401
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,710,478 XPM·at block #6,808,302 · 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