Block #1,534,755

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/10/2016, 11:02:20 AM · Difficulty 10.6183 · 5,281,842 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a23d33e547ee7cf8bb521f61eea9177cbb2d2ce8e2c9970d6c0922c9e6243b10

Height

#1,534,755

Difficulty

10.618287

Transactions

3

Size

15.01 KB

Version

2

Bits

0a9e480c

Nonce

899,059,341

Timestamp

4/10/2016, 11:02:20 AM

Confirmations

5,281,842

Merkle Root

36aafe572f6a782179048ebe52aa8acfe1a1bc14f51933f2d9647a07872f8d26
Transactions (3)
1 in → 1 out9.0200 XPM109 B
51 in → 1 out1468.1994 XPM7.40 KB
51 in → 1 out3146.4556 XPM7.41 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.

8.196 × 10⁹⁵(96-digit number)
81962921888353304440…43060093466750251521
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.196 × 10⁹⁵(96-digit number)
81962921888353304440…43060093466750251521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.639 × 10⁹⁶(97-digit number)
16392584377670660888…86120186933500503041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.278 × 10⁹⁶(97-digit number)
32785168755341321776…72240373867001006081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.557 × 10⁹⁶(97-digit number)
65570337510682643552…44480747734002012161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.311 × 10⁹⁷(98-digit number)
13114067502136528710…88961495468004024321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.622 × 10⁹⁷(98-digit number)
26228135004273057421…77922990936008048641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.245 × 10⁹⁷(98-digit number)
52456270008546114842…55845981872016097281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.049 × 10⁹⁸(99-digit number)
10491254001709222968…11691963744032194561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.098 × 10⁹⁸(99-digit number)
20982508003418445936…23383927488064389121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.196 × 10⁹⁸(99-digit number)
41965016006836891873…46767854976128778241
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,776,901 XPM·at block #6,816,596 · 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