Block #356,988

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/13/2014, 2:47:37 AM · Difficulty 10.3832 · 6,469,446 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bae8fe5876e78dab397ad788b431ecc39d3cda8ec5ea70e877c73385a5527ee8

Height

#356,988

Difficulty

10.383192

Transactions

16

Size

3.94 KB

Version

2

Bits

0a6218e6

Nonce

757,174

Timestamp

1/13/2014, 2:47:37 AM

Confirmations

6,469,446

Merkle Root

a0a4c5345790e5bedb6588cd49f7ba2a8045f5b8d6a98a6f1de46e87f8e23d7b
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.257 × 10⁹⁵(96-digit number)
12578904601953612602…15300513886889762161
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.257 × 10⁹⁵(96-digit number)
12578904601953612602…15300513886889762161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.515 × 10⁹⁵(96-digit number)
25157809203907225205…30601027773779524321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.031 × 10⁹⁵(96-digit number)
50315618407814450410…61202055547559048641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.006 × 10⁹⁶(97-digit number)
10063123681562890082…22404111095118097281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.012 × 10⁹⁶(97-digit number)
20126247363125780164…44808222190236194561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.025 × 10⁹⁶(97-digit number)
40252494726251560328…89616444380472389121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.050 × 10⁹⁶(97-digit number)
80504989452503120656…79232888760944778241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.610 × 10⁹⁷(98-digit number)
16100997890500624131…58465777521889556481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.220 × 10⁹⁷(98-digit number)
32201995781001248262…16931555043779112961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.440 × 10⁹⁷(98-digit number)
64403991562002496525…33863110087558225921
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,855,608 XPM·at block #6,826,433 · 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