Block #361,547

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/16/2014, 3:44:47 AM · Difficulty 10.4056 · 6,448,443 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8f2b766a470ba4f64e695ad437bbcf2467465c93016ec29adade28c77b6f0742

Height

#361,547

Difficulty

10.405621

Transactions

8

Size

2.59 KB

Version

2

Bits

0a67d6c1

Nonce

697

Timestamp

1/16/2014, 3:44:47 AM

Confirmations

6,448,443

Merkle Root

200e7cd12b31b6e04b162a12da30e201ad604b98e49b42e5c7787424901f486f
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.

1.377 × 10⁹⁵(96-digit number)
13770051135301290853…02255228877788860161
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
1.377 × 10⁹⁵(96-digit number)
13770051135301290853…02255228877788860161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.754 × 10⁹⁵(96-digit number)
27540102270602581707…04510457755577720321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.508 × 10⁹⁵(96-digit number)
55080204541205163414…09020915511155440641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.101 × 10⁹⁶(97-digit number)
11016040908241032682…18041831022310881281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.203 × 10⁹⁶(97-digit number)
22032081816482065365…36083662044621762561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.406 × 10⁹⁶(97-digit number)
44064163632964130731…72167324089243525121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.812 × 10⁹⁶(97-digit number)
88128327265928261463…44334648178487050241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.762 × 10⁹⁷(98-digit number)
17625665453185652292…88669296356974100481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.525 × 10⁹⁷(98-digit number)
35251330906371304585…77338592713948200961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.050 × 10⁹⁷(98-digit number)
70502661812742609170…54677185427896401921
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,723,993 XPM·at block #6,809,989 · 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