Block #1,705,046

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/6/2016, 8:33:58 AM · Difficulty 10.6628 · 5,102,669 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
770a02bef51a0033a2443347323471cc1ea04764dbd323a1d840d69f1b0e6452

Height

#1,705,046

Difficulty

10.662835

Transactions

14

Size

4.26 KB

Version

2

Bits

0aa9af8a

Nonce

38,303,882

Timestamp

8/6/2016, 8:33:58 AM

Confirmations

5,102,669

Merkle Root

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

9.440 × 10⁹³(94-digit number)
94404318094229011640…91971116165716352001
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
9.440 × 10⁹³(94-digit number)
94404318094229011640…91971116165716352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.888 × 10⁹⁴(95-digit number)
18880863618845802328…83942232331432704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.776 × 10⁹⁴(95-digit number)
37761727237691604656…67884464662865408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.552 × 10⁹⁴(95-digit number)
75523454475383209312…35768929325730816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.510 × 10⁹⁵(96-digit number)
15104690895076641862…71537858651461632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.020 × 10⁹⁵(96-digit number)
30209381790153283725…43075717302923264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.041 × 10⁹⁵(96-digit number)
60418763580306567450…86151434605846528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.208 × 10⁹⁶(97-digit number)
12083752716061313490…72302869211693056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.416 × 10⁹⁶(97-digit number)
24167505432122626980…44605738423386112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.833 × 10⁹⁶(97-digit number)
48335010864245253960…89211476846772224001
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,705,753 XPM·at block #6,807,714 · 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