Block #358,732

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/14/2014, 7:43:38 AM · Difficulty 10.3842 · 6,467,993 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
12177b9b07f2496afa0b53fa18124cdd13cd98939fc95137be6a39f4d3d4a0cd

Height

#358,732

Difficulty

10.384218

Transactions

5

Size

1.08 KB

Version

2

Bits

0a625c1e

Nonce

97,704

Timestamp

1/14/2014, 7:43:38 AM

Confirmations

6,467,993

Merkle Root

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

9.909 × 10⁹⁵(96-digit number)
99097914570572338481…43010073926306446801
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
9.909 × 10⁹⁵(96-digit number)
99097914570572338481…43010073926306446801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.981 × 10⁹⁶(97-digit number)
19819582914114467696…86020147852612893601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.963 × 10⁹⁶(97-digit number)
39639165828228935392…72040295705225787201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.927 × 10⁹⁶(97-digit number)
79278331656457870785…44080591410451574401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.585 × 10⁹⁷(98-digit number)
15855666331291574157…88161182820903148801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.171 × 10⁹⁷(98-digit number)
31711332662583148314…76322365641806297601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.342 × 10⁹⁷(98-digit number)
63422665325166296628…52644731283612595201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.268 × 10⁹⁸(99-digit number)
12684533065033259325…05289462567225190401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.536 × 10⁹⁸(99-digit number)
25369066130066518651…10578925134450380801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.073 × 10⁹⁸(99-digit number)
50738132260133037302…21157850268900761601
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,857,953 XPM·at block #6,826,724 · 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