Block #1,507,729

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/22/2016, 2:51:15 PM · Difficulty 10.6247 · 5,306,487 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
84af0d756951949bdd88916cab14be32919eba29679ed576e55d4a67bfaf3232

Height

#1,507,729

Difficulty

10.624678

Transactions

3

Size

29.90 KB

Version

2

Bits

0a9feae3

Nonce

877,607,869

Timestamp

3/22/2016, 2:51:15 PM

Confirmations

5,306,487

Merkle Root

05d75efc1f43e37f6d85f7b0f08ddb004766b73b4e1db3776197025135024e46
Transactions (3)
1 in → 1 out9.1600 XPM109 B
203 in → 1 out8.0000 XPM29.38 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.

1.180 × 10⁹⁶(97-digit number)
11800113167148812760…16230277697081082881
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.180 × 10⁹⁶(97-digit number)
11800113167148812760…16230277697081082881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.360 × 10⁹⁶(97-digit number)
23600226334297625520…32460555394162165761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.720 × 10⁹⁶(97-digit number)
47200452668595251040…64921110788324331521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.440 × 10⁹⁶(97-digit number)
94400905337190502081…29842221576648663041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.888 × 10⁹⁷(98-digit number)
18880181067438100416…59684443153297326081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.776 × 10⁹⁷(98-digit number)
37760362134876200832…19368886306594652161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.552 × 10⁹⁷(98-digit number)
75520724269752401665…38737772613189304321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.510 × 10⁹⁸(99-digit number)
15104144853950480333…77475545226378608641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.020 × 10⁹⁸(99-digit number)
30208289707900960666…54951090452757217281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.041 × 10⁹⁸(99-digit number)
60416579415801921332…09902180905514434561
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,757,796 XPM·at block #6,814,215 · 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