Block #1,673,138

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/14/2016, 8:12:02 PM · Difficulty 10.6944 · 5,137,461 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
49d2102492e1bffd1e8305510467f7eddd8c4ec2528bcc42d152fff6702ea602

Height

#1,673,138

Difficulty

10.694389

Transactions

3

Size

3.39 KB

Version

2

Bits

0ab1c374

Nonce

152,896,567

Timestamp

7/14/2016, 8:12:02 PM

Confirmations

5,137,461

Merkle Root

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

8.904 × 10⁹⁶(97-digit number)
89043399591507047415…44806679274725939201
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
8.904 × 10⁹⁶(97-digit number)
89043399591507047415…44806679274725939201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.780 × 10⁹⁷(98-digit number)
17808679918301409483…89613358549451878401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.561 × 10⁹⁷(98-digit number)
35617359836602818966…79226717098903756801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.123 × 10⁹⁷(98-digit number)
71234719673205637932…58453434197807513601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.424 × 10⁹⁸(99-digit number)
14246943934641127586…16906868395615027201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.849 × 10⁹⁸(99-digit number)
28493887869282255173…33813736791230054401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.698 × 10⁹⁸(99-digit number)
56987775738564510346…67627473582460108801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.139 × 10⁹⁹(100-digit number)
11397555147712902069…35254947164920217601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.279 × 10⁹⁹(100-digit number)
22795110295425804138…70509894329840435201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.559 × 10⁹⁹(100-digit number)
45590220590851608276…41019788659680870401
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,728,880 XPM·at block #6,810,598 · 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