Block #437,445

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/10/2014, 7:38:05 AM · Difficulty 10.3574 · 6,394,706 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
482fab79717793c4cde7413fc6d592b6768cdac3f5b9cb99eab4a9d3b809ea7b

Height

#437,445

Difficulty

10.357368

Transactions

2

Size

413 B

Version

2

Bits

0a5b7c75

Nonce

80,662

Timestamp

3/10/2014, 7:38:05 AM

Confirmations

6,394,706

Merkle Root

d717badb232869ab4d487cb0150bc08a53bdd887d3f2ee8a973cc21dd885ae6e
Transactions (2)
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.

3.342 × 10⁹⁶(97-digit number)
33423765178214288419…63430406807376242239
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
3.342 × 10⁹⁶(97-digit number)
33423765178214288419…63430406807376242239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.684 × 10⁹⁶(97-digit number)
66847530356428576839…26860813614752484479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.336 × 10⁹⁷(98-digit number)
13369506071285715367…53721627229504968959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.673 × 10⁹⁷(98-digit number)
26739012142571430735…07443254459009937919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.347 × 10⁹⁷(98-digit number)
53478024285142861471…14886508918019875839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.069 × 10⁹⁸(99-digit number)
10695604857028572294…29773017836039751679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.139 × 10⁹⁸(99-digit number)
21391209714057144588…59546035672079503359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.278 × 10⁹⁸(99-digit number)
42782419428114289177…19092071344159006719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.556 × 10⁹⁸(99-digit number)
85564838856228578355…38184142688318013439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.711 × 10⁹⁹(100-digit number)
17112967771245715671…76368285376636026879
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,901,346 XPM·at block #6,832,150 · 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