Block #324,812

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/22/2013, 2:29:14 PM · Difficulty 10.2069 · 6,483,303 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
366b132a198b25c1610f13d9b194d0a504a4850be3e263053eaf5d7ec1ea4565

Height

#324,812

Difficulty

10.206899

Transactions

8

Size

3.60 KB

Version

2

Bits

0a34f74d

Nonce

8,764

Timestamp

12/22/2013, 2:29:14 PM

Confirmations

6,483,303

Merkle Root

7f304c5d8d8107eb1b4a08885cf2232cdde8dab447f52c41fd75422e70683594
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.647 × 10⁹⁷(98-digit number)
96477696166618132261…60609898821117634259
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.647 × 10⁹⁷(98-digit number)
96477696166618132261…60609898821117634259
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.929 × 10⁹⁸(99-digit number)
19295539233323626452…21219797642235268519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.859 × 10⁹⁸(99-digit number)
38591078466647252904…42439595284470537039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.718 × 10⁹⁸(99-digit number)
77182156933294505809…84879190568941074079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.543 × 10⁹⁹(100-digit number)
15436431386658901161…69758381137882148159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.087 × 10⁹⁹(100-digit number)
30872862773317802323…39516762275764296319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.174 × 10⁹⁹(100-digit number)
61745725546635604647…79033524551528592639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.234 × 10¹⁰⁰(101-digit number)
12349145109327120929…58067049103057185279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.469 × 10¹⁰⁰(101-digit number)
24698290218654241858…16134098206114370559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.939 × 10¹⁰⁰(101-digit number)
49396580437308483717…32268196412228741119
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,708,968 XPM·at block #6,808,114 · 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