Block #1,169,845

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/25/2015, 1:52:07 PM · Difficulty 10.9357 · 5,660,656 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5971a8147e53c19e0ff1519b17b97ab2c3c8f787cf32f7a167306b28d9c6eca4

Height

#1,169,845

Difficulty

10.935686

Transactions

2

Size

50.84 KB

Version

2

Bits

0aef8920

Nonce

830,132,769

Timestamp

7/25/2015, 1:52:07 PM

Confirmations

5,660,656

Merkle Root

f2317ea2c1b44f82d5d6ee6fbc5784c69a9edd053ee8022b13ac71b4571a8966
Transactions (2)
1 in → 1 out8.9300 XPM109 B
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.

3.492 × 10⁹⁴(95-digit number)
34922970516575935476…32342823136048393321
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
3.492 × 10⁹⁴(95-digit number)
34922970516575935476…32342823136048393321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.984 × 10⁹⁴(95-digit number)
69845941033151870952…64685646272096786641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.396 × 10⁹⁵(96-digit number)
13969188206630374190…29371292544193573281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.793 × 10⁹⁵(96-digit number)
27938376413260748381…58742585088387146561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.587 × 10⁹⁵(96-digit number)
55876752826521496762…17485170176774293121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.117 × 10⁹⁶(97-digit number)
11175350565304299352…34970340353548586241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.235 × 10⁹⁶(97-digit number)
22350701130608598704…69940680707097172481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.470 × 10⁹⁶(97-digit number)
44701402261217197409…39881361414194344961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.940 × 10⁹⁶(97-digit number)
89402804522434394819…79762722828388689921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.788 × 10⁹⁷(98-digit number)
17880560904486878963…59525445656777379841
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,888,257 XPM·at block #6,830,500 · 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