Block #352,061

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/10/2014, 2:53:08 AM · Difficulty 10.3008 · 6,465,151 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e61c1ef323eb8f371b9c45d0247c20363f16b70866b13590abadafd76a12d737

Height

#352,061

Difficulty

10.300825

Transactions

16

Size

4.23 KB

Version

2

Bits

0a4d02d9

Nonce

44,178

Timestamp

1/10/2014, 2:53:08 AM

Confirmations

6,465,151

Merkle Root

b2bb4e87a262279ba21cf3387c18ec08dfc1268e9a2fe097d9120c3e16695f0b
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.014 × 10⁹⁶(97-digit number)
10148093328393032352…60135754583935715979
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.014 × 10⁹⁶(97-digit number)
10148093328393032352…60135754583935715979
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.029 × 10⁹⁶(97-digit number)
20296186656786064705…20271509167871431959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.059 × 10⁹⁶(97-digit number)
40592373313572129411…40543018335742863919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.118 × 10⁹⁶(97-digit number)
81184746627144258822…81086036671485727839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.623 × 10⁹⁷(98-digit number)
16236949325428851764…62172073342971455679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.247 × 10⁹⁷(98-digit number)
32473898650857703529…24344146685942911359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.494 × 10⁹⁷(98-digit number)
64947797301715407058…48688293371885822719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.298 × 10⁹⁸(99-digit number)
12989559460343081411…97376586743771645439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.597 × 10⁹⁸(99-digit number)
25979118920686162823…94753173487543290879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.195 × 10⁹⁸(99-digit number)
51958237841372325646…89506346975086581759
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,781,735 XPM·at block #6,817,211 · 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