Block #329,803

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/26/2013, 5:46:47 AM · Difficulty 10.1682 · 6,478,770 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5767a628167bd4e06cf9ea2f9cbf5828987c1cc02f4a1229f8601b48a36a4cc1

Height

#329,803

Difficulty

10.168159

Transactions

3

Size

1.07 KB

Version

2

Bits

0a2b0c75

Nonce

62,417

Timestamp

12/26/2013, 5:46:47 AM

Confirmations

6,478,770

Merkle Root

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

6.972 × 10⁹⁹(100-digit number)
69728267634364187308…85769692087642818899
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
6.972 × 10⁹⁹(100-digit number)
69728267634364187308…85769692087642818899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.394 × 10¹⁰⁰(101-digit number)
13945653526872837461…71539384175285637799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.789 × 10¹⁰⁰(101-digit number)
27891307053745674923…43078768350571275599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.578 × 10¹⁰⁰(101-digit number)
55782614107491349847…86157536701142551199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.115 × 10¹⁰¹(102-digit number)
11156522821498269969…72315073402285102399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.231 × 10¹⁰¹(102-digit number)
22313045642996539938…44630146804570204799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.462 × 10¹⁰¹(102-digit number)
44626091285993079877…89260293609140409599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.925 × 10¹⁰¹(102-digit number)
89252182571986159755…78520587218280819199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.785 × 10¹⁰²(103-digit number)
17850436514397231951…57041174436561638399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.570 × 10¹⁰²(103-digit number)
35700873028794463902…14082348873123276799
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,712,640 XPM·at block #6,808,572 · 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