Block #1,570,743

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/4/2016, 12:40:51 AM · Difficulty 10.7469 · 5,243,559 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
496ced6eab02939969be6a9d6e06c43711f70af41f31bfd6f9654788fc0bd2f6

Height

#1,570,743

Difficulty

10.746911

Transactions

2

Size

1.72 KB

Version

2

Bits

0abf3590

Nonce

135,510,688

Timestamp

5/4/2016, 12:40:51 AM

Confirmations

5,243,559

Merkle Root

6cb7b93dada9d70cea64dd709330d5a955f02b5b29c1c153c26c1513117c93cf
Transactions (2)
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.

5.938 × 10⁹⁶(97-digit number)
59380928830575989786…64775060408720558081
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
5.938 × 10⁹⁶(97-digit number)
59380928830575989786…64775060408720558081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.187 × 10⁹⁷(98-digit number)
11876185766115197957…29550120817441116161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.375 × 10⁹⁷(98-digit number)
23752371532230395914…59100241634882232321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.750 × 10⁹⁷(98-digit number)
47504743064460791828…18200483269764464641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.500 × 10⁹⁷(98-digit number)
95009486128921583657…36400966539528929281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.900 × 10⁹⁸(99-digit number)
19001897225784316731…72801933079057858561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.800 × 10⁹⁸(99-digit number)
38003794451568633463…45603866158115717121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.600 × 10⁹⁸(99-digit number)
76007588903137266926…91207732316231434241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.520 × 10⁹⁹(100-digit number)
15201517780627453385…82415464632462868481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.040 × 10⁹⁹(100-digit number)
30403035561254906770…64830929264925736961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.080 × 10⁹⁹(100-digit number)
60806071122509813541…29661858529851473921
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,758,479 XPM·at block #6,814,301 · 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