Block #360,963

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/15/2014, 6:33:05 PM · Difficulty 10.4021 · 6,449,181 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
692bfd4635385328658e21ec1038871023c28a8ce8ff33a3cd1f6881d2cfc116

Height

#360,963

Difficulty

10.402072

Transactions

11

Size

2.63 KB

Version

2

Bits

0a66ee2b

Nonce

23,487

Timestamp

1/15/2014, 6:33:05 PM

Confirmations

6,449,181

Merkle Root

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

2.991 × 10⁹⁹(100-digit number)
29910631881651694358…29936784270783601919
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
2.991 × 10⁹⁹(100-digit number)
29910631881651694358…29936784270783601919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.982 × 10⁹⁹(100-digit number)
59821263763303388717…59873568541567203839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.196 × 10¹⁰⁰(101-digit number)
11964252752660677743…19747137083134407679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.392 × 10¹⁰⁰(101-digit number)
23928505505321355487…39494274166268815359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.785 × 10¹⁰⁰(101-digit number)
47857011010642710974…78988548332537630719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.571 × 10¹⁰⁰(101-digit number)
95714022021285421948…57977096665075261439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.914 × 10¹⁰¹(102-digit number)
19142804404257084389…15954193330150522879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.828 × 10¹⁰¹(102-digit number)
38285608808514168779…31908386660301045759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.657 × 10¹⁰¹(102-digit number)
76571217617028337558…63816773320602091519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.531 × 10¹⁰²(103-digit number)
15314243523405667511…27633546641204183039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.062 × 10¹⁰²(103-digit number)
30628487046811335023…55267093282408366079
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,725,220 XPM·at block #6,810,143 · 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