Block #355,738

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/12/2014, 8:27:20 AM · Difficulty 10.3638 · 6,455,261 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fd1fa096d3becefedbfc5aa56523b99acd5dfdeb3dd0d0349b0b269d088e90fd

Height

#355,738

Difficulty

10.363796

Transactions

9

Size

2.21 KB

Version

2

Bits

0a5d21be

Nonce

404,861

Timestamp

1/12/2014, 8:27:20 AM

Confirmations

6,455,261

Merkle Root

96a1e0f03a3a94872ac3900672b7917456958f26c7773a178a40052a583b7164
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.

2.299 × 10⁹⁸(99-digit number)
22993374141286839561…04101700818966963201
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
2.299 × 10⁹⁸(99-digit number)
22993374141286839561…04101700818966963201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.598 × 10⁹⁸(99-digit number)
45986748282573679122…08203401637933926401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.197 × 10⁹⁸(99-digit number)
91973496565147358244…16406803275867852801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.839 × 10⁹⁹(100-digit number)
18394699313029471648…32813606551735705601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.678 × 10⁹⁹(100-digit number)
36789398626058943297…65627213103471411201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.357 × 10⁹⁹(100-digit number)
73578797252117886595…31254426206942822401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.471 × 10¹⁰⁰(101-digit number)
14715759450423577319…62508852413885644801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.943 × 10¹⁰⁰(101-digit number)
29431518900847154638…25017704827771289601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.886 × 10¹⁰⁰(101-digit number)
58863037801694309276…50035409655542579201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.177 × 10¹⁰¹(102-digit number)
11772607560338861855…00070819311085158401
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,732,095 XPM·at block #6,810,998 · 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