Block #320,777

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/19/2013, 9:21:56 PM · Difficulty 10.1857 · 6,506,453 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
49b5603cce20396f11700e032633096202375f1ef6fed4d649b5a2e8274da6a9

Height

#320,777

Difficulty

10.185719

Transactions

14

Size

3.61 KB

Version

2

Bits

0a2f8b48

Nonce

101,602

Timestamp

12/19/2013, 9:21:56 PM

Confirmations

6,506,453

Merkle Root

69c1cb36066ccbd7b32caf86d860fae4ab89704771fc4d15a78c5e21919f6965
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.

5.359 × 10⁹⁸(99-digit number)
53595111621622745114…53362164588871356719
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
5.359 × 10⁹⁸(99-digit number)
53595111621622745114…53362164588871356719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.071 × 10⁹⁹(100-digit number)
10719022324324549022…06724329177742713439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.143 × 10⁹⁹(100-digit number)
21438044648649098045…13448658355485426879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.287 × 10⁹⁹(100-digit number)
42876089297298196091…26897316710970853759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.575 × 10⁹⁹(100-digit number)
85752178594596392183…53794633421941707519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.715 × 10¹⁰⁰(101-digit number)
17150435718919278436…07589266843883415039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.430 × 10¹⁰⁰(101-digit number)
34300871437838556873…15178533687766830079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.860 × 10¹⁰⁰(101-digit number)
68601742875677113746…30357067375533660159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.372 × 10¹⁰¹(102-digit number)
13720348575135422749…60714134751067320319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.744 × 10¹⁰¹(102-digit number)
27440697150270845498…21428269502134640639
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,861,940 XPM·at block #6,827,229 · 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