Block #1,270,144

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/6/2015, 11:33:44 PM · Difficulty 10.8160 · 5,539,682 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3ab0334eaea2927117fcfc96a5452c3f1e05e16d961b4d3a9b5737684671bffc

Height

#1,270,144

Difficulty

10.816008

Transactions

2

Size

58.20 KB

Version

2

Bits

0ad0e5e3

Nonce

2,020,585,251

Timestamp

10/6/2015, 11:33:44 PM

Confirmations

5,539,682

Merkle Root

8b5d113326aa33037883d093111b29d4334769c872f72cd01f8e5cf031c8c175
Transactions (2)
1 in → 1 out9.1600 XPM109 B
401 in → 1 out519.2013 XPM58.00 KB
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.

4.565 × 10⁹⁴(95-digit number)
45654866937690120130…39658739645901369921
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
4.565 × 10⁹⁴(95-digit number)
45654866937690120130…39658739645901369921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.130 × 10⁹⁴(95-digit number)
91309733875380240260…79317479291802739841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.826 × 10⁹⁵(96-digit number)
18261946775076048052…58634958583605479681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.652 × 10⁹⁵(96-digit number)
36523893550152096104…17269917167210959361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.304 × 10⁹⁵(96-digit number)
73047787100304192208…34539834334421918721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.460 × 10⁹⁶(97-digit number)
14609557420060838441…69079668668843837441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.921 × 10⁹⁶(97-digit number)
29219114840121676883…38159337337687674881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.843 × 10⁹⁶(97-digit number)
58438229680243353766…76318674675375349761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.168 × 10⁹⁷(98-digit number)
11687645936048670753…52637349350750699521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.337 × 10⁹⁷(98-digit number)
23375291872097341506…05274698701501399041
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,722,693 XPM·at block #6,809,825 · 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