Block #348,928

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/8/2014, 2:28:00 AM · Difficulty 10.2680 · 6,477,647 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7860557fbeada1f516f4914dc52c10c15f5c4e38f1c7c6776d0889dbf724636c

Height

#348,928

Difficulty

10.267960

Transactions

14

Size

5.10 KB

Version

2

Bits

0a449903

Nonce

117,490

Timestamp

1/8/2014, 2:28:00 AM

Confirmations

6,477,647

Merkle Root

7383c78bd7c6ac80331c107b080df719551763a58a46cbe71412dd0c006b1a7b
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.468 × 10¹⁰⁰(101-digit number)
14682344281173613092…22076826725039263359
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.468 × 10¹⁰⁰(101-digit number)
14682344281173613092…22076826725039263359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.936 × 10¹⁰⁰(101-digit number)
29364688562347226184…44153653450078526719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.872 × 10¹⁰⁰(101-digit number)
58729377124694452368…88307306900157053439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.174 × 10¹⁰¹(102-digit number)
11745875424938890473…76614613800314106879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.349 × 10¹⁰¹(102-digit number)
23491750849877780947…53229227600628213759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.698 × 10¹⁰¹(102-digit number)
46983501699755561894…06458455201256427519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.396 × 10¹⁰¹(102-digit number)
93967003399511123789…12916910402512855039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.879 × 10¹⁰²(103-digit number)
18793400679902224757…25833820805025710079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.758 × 10¹⁰²(103-digit number)
37586801359804449515…51667641610051420159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.517 × 10¹⁰²(103-digit number)
75173602719608899031…03335283220102840319
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,856,749 XPM·at block #6,826,574 · 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